| 摘要(英) |
Mobile devices, such as laptops, mobile phones, PDAs and portable game consoles, are equipped with radio modules for wireless access, such as WiFi. These devices can be directly connected to each other to form a one-hop wireless ad hoc network for multiplayer game play. However, such a network can support only a limited number of players distributed over a narrow area. In this paper, we propose a synchronous multihop architecture (SYMA) for wireless ad hoc multiplayer games to support more players distributed over a broader area. In SYMA, devices are assumed to have one-hop neighbor device information, as well as timers synchronized with good accuracy. A player, called game initiator, broadcasts an invitation message to invite other players to join a new game. A joining player issues a message along with its neighborhood information, including the expected transmission time (ETT) for each neighbor node, to reply to the invitation so that the initiator can derive the topology of the participating players. The initiator applies Floyd–Warshall shortest path algorithm, taking the topology and ETT values as input to construct the shortest path spanning tree rooted at each player (or node). It then calculates the expected broadcast time (EBT) for each tree, which is useful to estimate the time for the root node of a tree to broadcast a game state to all tree nodes. Finally, the tree with the smallest EBT is selected as the communication tree and its root is designated as the coordinator, which collects timestamped actions of each player, executes the game logic, and then broadcasts the new game state. By exploiting synchronized timers, the game state consistency is guaranteed, and each node can be scheduled to send/receive game messages without causing collisions. The constructions of communication trees and message schedules are simulated for different scenarios. Compared with the one-hop network architecture, SYMA can support a broader area and a larger number of players with the help of synchronous multihop communication.
|
| 參考文獻 |
[1] Yugo Kaneda, Mika Minematsu, Masayo Saito, Hirotp Aida, and Hideyuki Tokuda, “ANGEL: A Hierarchical State Synchronization Middleware for Mobile Ad hoc Group Gaming,” Proceedings of International Workshop on Pervasive Gaming Applications at Pervasive (Pergames), pp. 30-35, 2004.
[2] http://www.jp.playstation.com/psn/adhocparty/index.html
[3] http://www.teamxlink.co.uk/
[4] Hanghang Qi, David Malone, and Dmitri Botvich, “802.11 Wireless LAN Multiplayer Game Capacity and Optimization,” Proceedings of the 8th Annual Workshop on Network and Systems Support for Games (NetGames’09), pp. 1-6, 2009.
[5] Dirk Budke, Károly Farkas, Bernhard Plattner, Oliver Wellnitz, and Lars Wolf, “Real-Time Multiplayer Game Support Using QoS Mechanisms in Mobile Ad Hoc Networks,” Proceedings of 3rd Annual Conference on Wireless on Demand Network Systems and Services (WONS’06), 2006
[6] Arnaud Kaiser, Nadjib Achir, and Khaled Boussetta, “Multiplayer Games over Wireless Ad Hoc Networks: Energy and delay analysis,” Proceedings of International Conference on Ultra Modern Telecommunications & Workshops (ICUMT’09), pp. 1-7, 2009.
[7] Arnaud Kaiser, Nadjib Achir, and Khaled Boussetta, “Improving Energy Efficiency and Gameplay Fairness for Time-Sensitive Multiplayer Games in MANETs,” IEEE International Conference on Communication Workshops, May 2010
[8] Arnaud Kaiser, Nadjib Achir, and Khaled Boussetta, “Improving Quality of Gaming in MANETs using a Multipath Approach,” IFIP Wireless Days conference, October, 2010.
[9] Tom Beigbeder, Rory Coughlan, Corey Lusher, John Plunkett, Emmanuel Agu, and Mark Claypool, “The effects of loss and latency on user performance in Unreal Tournament,” Proceedings of 3rd ACM SIGCOMM workshop on Network and system support for games (NetGames '04), pp. 144-151, 2004.
[10] Álvaro Marco, Roberto Casas, José Luis Sevillano Ramos, Victorián Coarasa, Angel Asensio,and Mohammad S. Obaidat, “Synchronization of Multi-hop Wireless Sensor Networks at the Application layer,” IEEE Wireless Communications, Vol. 18, Issue 1, pp. 82-88, 2011.
[11] Michael Mock, Reiner Frings, Edgar Nett, and Spiro Trikaliotis, “Continuous clock synchronization in wireless real-time applications,” Proceedings of the 19th IEEE Symposium on Reliable Distributed Systems, pp. 125-132, 2000.
[12] Bharath Sundararaman, Ugo Buy , and Ajay D. Kshemkalyani, “Clock Synchronization for Wireless Sensor Networks: A Survey,” Ad Hoc Networks, Vol. 3, Issue 3, pp. 281-323, 2005.
[13] Kay Römer, “Time Synchronization in Ad Hoc Networks,” ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc’01), pp. 173-182, 2001.
[14] Jeremy Elson, Lewis Girod, and Deborah Estrin, “Fine-Grained Network Time Synchronization using Reference Broadcasts,” Proceedings of the 5th symposium on Operating systems design and implementation (OSDI '02), pp.147-163, 2002
[15] Robert W. Floyd, “Algorithm 97: Shortest Path,” Communications of the ACM, Vol. 5, Issue 6, pp. 345, 1997.
[16] Wu-chang Feng, and Francis Chang, “Modeling player session times of on-line games,” Proceedings of the 2nd workshop on Network and system support for games(NetGames’03), pp. 23-26, 2003.
[17] Sachin Garg, and Martin Kappes, “An experimental study of throughput for UDP and VoIP traffic in IEEE 802.11b networks,” Wireless Communications and Networking (WCNC '03), Vol.3, pp. 1748-1753, 2003.
|
[Endnote RIS 格式]
[相關文章]
[文章引用]
[完整記錄]
[館藏目錄]
[檢視]
plurk
funp
live
udn
HD
myshare
netvibes
friend
youpush
delicious
baidu
Google bookmarks
del.icio.us
hemidemi
facebook
twitter
google
reddit