loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2007 International Conference on Parallel Processing Workshops (ICPPW 2007)
Shift Coding: Efficient State Update in Mobile Peer-to-Peer Multiplayer Games
Xi'an, Chin
September 10-September 14
ISBN: 0-7695-2934-8
Yanmin Zhu, Hong Kong University of Science and Technology, Hong Kong
Yunhuai Liu, Hong Kong University of Science and Technology, Hong Kong
Hoilun Ngan, Hong Kong University of Science and Technology, Hong Kong
Quanbin Chen, Hong Kong University of Science and Technology, Hong Kong
Chen Qian, Hong Kong University of Science and Technology, Hong Kong
Jian Ma, Hong Kong University of Science and Technology, Hong Kong
Dian Zhang, Hong Kong University of Science and Technology, Hong Kong
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.
Citation:
Yanmin Zhu, Yunhuai Liu, Hoilun Ngan, Quanbin Chen, Chen Qian, Jian Ma, Dian Zhang, "Shift Coding: Efficient State Update in Mobile Peer-to-Peer Multiplayer Games," icppw, pp.58, 2007 International Conference on Parallel Processing Workshops (ICPPW 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.