skip to main content
10.1145/1378191.1378194acmconferencesArticle/Chapter ViewAbstractPublication PagesmmsysConference Proceedingsconference-collections
research-article

Assigning game server roles in mobile ad-hoc networks

Published: 26 May 2006 Publication History

Abstract

Over the last couple of years, multi-player games have become more and more popular. Additionally, new mobile devices now have sufficient resources to play these multi-player games in mobile and wireless networks. As the classic centralised game server design is unsuited for mobile ad-hoc networks, a group of nodes can take the role of a distributed game server. This group of nodes can provide the necessary redundancy which is needed in the dynamic environment of a mobile ad-hoc network.
In this paper we present a modified dominating set algorithm for server selection which uses local information to determine well-suited nodes from the group of players. Our algorithm uses three phases (discovery, determination and marking) to calculate an initial server set and adjusts to network changes during the game. We implemented our server selection algorithm in NS-2 and evaluated its behaviour in two different realistic scenarios for mobile games (schoolyard and train) as well as in an artificial stress scenario.

References

[1]
D. Budke, K. Farkas, O. Wellnitz, B. Plattner, and L. Wolf. Real-Time Multiplayer Game Support Using QoS Mechanisms in Mobile Ad Hoc Networks. In Proceedings of the 3rd Annual Conference on Wireless On demand Network Systems and Services (WONS 2006), Les Ménuires, France, Jan. 2006.
[2]
E. Gutman, C. Perkins, J. Veizades, and M. Day. RFC 2608: SLPv2: A service location protocol, June 1999.
[3]
S. Helal, N. Desai, V. Verma, and C. Lee. Konark - A Service Discovery and Delivery Protocol for Ad-hoc Networks. In Proceedings of the Third IEEE Conference on Wireless Communication Networks (WCNC), New Orleans, Mar. 2003.
[4]
Johannes Faerber. Network Game Traffic Modelling. In Proceedings of the 1st Workshop on Network and System Support for Games, pages 53--57, Apr. 2002.
[5]
F. Kuhn and R. Wattenhofer. Constant-time distributed dominating set approximation. In Proceedings of the 22nd ACM International Symposium on the Principles of Distributed Computing, Boston, Massachusetts, USA, July 2003.
[6]
S. M. Riera, O. Wellnitz, and L. Wolf. A zone-based gaming architecture for ad-hoc networks. In Proceedings of the Workshop on Network and System Support for Games (NetGames2003), Redwood City, USA, May 2003.
[7]
P. Sinha, R. Sivakumar, and V. Bharghavan. CEDAR: a core-extraction distributed ad hoc routing algorithm. In Proc. IEEE INFOCOM 1999, pages 202--209, Mar. 1999.
[8]
J. Wu. Dominating-set-based routing in ad hoc wireless networks. In Handbook of wireless networks and mobile computing, pages 425--450, New York, NY, USA, 2002. John Wiley & Sons, Inc.

Cited By

View all
  • (2009)Self Organization Algorithms for Mobile DevicesEncyclopedia of Information Science and Technology, Second Edition10.4018/978-1-60566-026-4.ch541(3406-3412)Online publication date: 2009
  • (2008)The Mobile Message Receiver SystemInnovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering10.1007/978-1-4020-8735-6_66(350-354)Online publication date: 2008

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
NOSSDAV '06: Proceedings of the 2006 international workshop on Network and operating systems support for digital audio and video
May 2006
168 pages
ISBN:1595932852
DOI:10.1145/1378191
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 May 2006

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Research-article

Conference

NOSSDAV06
Sponsor:

Acceptance Rates

Overall Acceptance Rate 118 of 363 submissions, 33%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2009)Self Organization Algorithms for Mobile DevicesEncyclopedia of Information Science and Technology, Second Edition10.4018/978-1-60566-026-4.ch541(3406-3412)Online publication date: 2009
  • (2008)The Mobile Message Receiver SystemInnovations and Advanced Techniques in Systems, Computing Sciences and Software Engineering10.1007/978-1-4020-8735-6_66(350-354)Online publication date: 2008

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media