Dominating-set-based routing in ad hoc wireless networks
Handbook of wireless networks and mobile computing
Network game traffic modelling
NetGames '02 Proceedings of the 1st workshop on Network and system support for games
Constant-time distributed dominating set approximation
Proceedings of the twenty-second annual symposium on Principles of distributed computing
A zone-based gaming architecture for ad-hoc networks
NetGames '03 Proceedings of the 2nd workshop on Network and system support for games
| Hi-index | 0.00 |
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.