Shift coding: Efficient state update in mobile peer-to-peer multiplayer games

Yanmin ZHU; Yunhuai LIU; Hoilun NGAN; Quanbin CHEN; Chen QIAN; Jian MA; Dian ZHANG

doi:10.1109/ICPPW.2007.76

Shift coding: Efficient state update in mobile peer-to-peer multiplayer games

Yanmin ZHU^*
, Yunhuai LIU
, Hoilun NGAN
, Quanbin CHEN
, Chen QIAN
, Jian MA
, Dian ZHANG

^*Corresponding author for this work

Research output: Book Chapters | Papers in Conference Proceedings › Conference paper (refereed) › Referred Conference Paper › peer-review

2 Citations (Scopus)

Abstract

The rapid advancement in wireless communications and mobile computing devices has opened a wide door for developing interesting mobile peer-to-peer multiplayer games (MMGs). In this paper we study an important problem of game state update in MMGs. Based on the network coding theory, we design the shift coding algorithm. Shift coding is running on a finely regulated ring overlay and lets each node exchange coded state information with its two immediate neighbors. After a few rounds of exchange, every node is guaranteed to receive the state information of all the other game members. The results of experimental results have shown that shift coding can significantly reduce network traffic under various network configurations.

Original language	English
Title of host publication	2007 International Conference on Parallel Processing Workshops, ICPPW 2007: Proceedings
Editors	Makoto TAKIZAWA, A. Min TJOA
Publisher	IEEE Computer Society
Pages	135-144
Number of pages	10
ISBN (Print)	9780769529349
DOIs	https://doi.org/10.1109/ICPPW.2007.76
Publication status	Published - 2007
Externally published	Yes
Event	2007 International Conference on Parallel Processing Workshops, ICPPW 2007 - Xian, China Duration: 10 Sept 2007 → 14 Sept 2007

Conference

Conference	2007 International Conference on Parallel Processing Workshops, ICPPW 2007
Country/Territory	China
City	Xian
Period	10/09/07 → 14/09/07

Access to Document

10.1109/ICPPW.2007.76

Cite this

@inproceedings{3a9c1fa1ec3a458aa195a46a039f4e55,

title = "Shift coding: Efficient state update in mobile peer-to-peer multiplayer games",

abstract = "The rapid advancement in wireless communications and mobile computing devices has opened a wide door for developing interesting mobile peer-to-peer multiplayer games (MMGs). In this paper we study an important problem of game state update in MMGs. Based on the network coding theory, we design the shift coding algorithm. Shift coding is running on a finely regulated ring overlay and lets each node exchange coded state information with its two immediate neighbors. After a few rounds of exchange, every node is guaranteed to receive the state information of all the other game members. The results of experimental results have shown that shift coding can significantly reduce network traffic under various network configurations.",

author = "Yanmin ZHU and Yunhuai LIU and Hoilun NGAN and Quanbin CHEN and Chen QIAN and Jian MA and Dian ZHANG",

year = "2007",

doi = "10.1109/ICPPW.2007.76",

language = "English",

isbn = "9780769529349",

pages = "135--144",

editor = "Makoto TAKIZAWA and TJOA, \{A. Min\}",

booktitle = "2007 International Conference on Parallel Processing Workshops, ICPPW 2007: Proceedings",

publisher = "IEEE Computer Society",

address = "United States",

note = "2007 International Conference on Parallel Processing Workshops, ICPPW 2007 ; Conference date: 10-09-2007 Through 14-09-2007",

}

ZHU, Y, LIU, Y, NGAN, H, CHEN, Q, QIAN, C, MA, J & ZHANG, D 2007, Shift coding: Efficient state update in mobile peer-to-peer multiplayer games. in M TAKIZAWA & AM TJOA (eds), 2007 International Conference on Parallel Processing Workshops, ICPPW 2007: Proceedings. IEEE Computer Society, pp. 135-144, 2007 International Conference on Parallel Processing Workshops, ICPPW 2007, Xian, China, 10/09/07. https://doi.org/10.1109/ICPPW.2007.76

Shift coding: Efficient state update in mobile peer-to-peer multiplayer games. / ZHU, Yanmin; LIU, Yunhuai; NGAN, Hoilun et al.
2007 International Conference on Parallel Processing Workshops, ICPPW 2007: Proceedings. ed. / Makoto TAKIZAWA; A. Min TJOA. IEEE Computer Society, 2007. p. 135-144.

Research output: Book Chapters | Papers in Conference Proceedings › Conference paper (refereed) › Referred Conference Paper › peer-review

TY - GEN

T1 - Shift coding: Efficient state update in mobile peer-to-peer multiplayer games

AU - ZHU, Yanmin

AU - LIU, Yunhuai

AU - NGAN, Hoilun

AU - CHEN, Quanbin

AU - QIAN, Chen

AU - MA, Jian

AU - ZHANG, Dian

PY - 2007

Y1 - 2007

N2 - The rapid advancement in wireless communications and mobile computing devices has opened a wide door for developing interesting mobile peer-to-peer multiplayer games (MMGs). In this paper we study an important problem of game state update in MMGs. Based on the network coding theory, we design the shift coding algorithm. Shift coding is running on a finely regulated ring overlay and lets each node exchange coded state information with its two immediate neighbors. After a few rounds of exchange, every node is guaranteed to receive the state information of all the other game members. The results of experimental results have shown that shift coding can significantly reduce network traffic under various network configurations.

AB - The rapid advancement in wireless communications and mobile computing devices has opened a wide door for developing interesting mobile peer-to-peer multiplayer games (MMGs). In this paper we study an important problem of game state update in MMGs. Based on the network coding theory, we design the shift coding algorithm. Shift coding is running on a finely regulated ring overlay and lets each node exchange coded state information with its two immediate neighbors. After a few rounds of exchange, every node is guaranteed to receive the state information of all the other game members. The results of experimental results have shown that shift coding can significantly reduce network traffic under various network configurations.

UR - https://www.scopus.com/pages/publications/47749106075

U2 - 10.1109/ICPPW.2007.76

DO - 10.1109/ICPPW.2007.76

M3 - Conference paper (refereed)

AN - SCOPUS:47749106075

SN - 9780769529349

SP - 135

EP - 144

BT - 2007 International Conference on Parallel Processing Workshops, ICPPW 2007: Proceedings

A2 - TAKIZAWA, Makoto

A2 - TJOA, A. Min

PB - IEEE Computer Society

T2 - 2007 International Conference on Parallel Processing Workshops, ICPPW 2007

Y2 - 10 September 2007 through 14 September 2007

ER -

Shift coding: Efficient state update in mobile peer-to-peer multiplayer games

Abstract

Conference

Access to Document

Other files and links

Fingerprint

Cite this