MASON: A Multiagent Simulation Environment
Simulation
Topology control in wireless ad hoc and sensor networks
ACM Computing Surveys (CSUR)
Equilibria in topology control games for ad hoc networks
Mobile Networks and Applications
Auction-based spectrum sharing
Mobile Networks and Applications
Game Theory for Wireless Engineers (Synthesis Lectures on Communications)
Game Theory for Wireless Engineers (Synthesis Lectures on Communications)
Effect of Selfish Node Behavior on Efficient Topology Design
IEEE Transactions on Mobile Computing
Using game theory to analyze wireless ad hoc networks
IEEE Communications Surveys & Tutorials
Self spreading nodes using potential games and genetic algorithms
Sarnoff'10 Proceedings of the 33rd IEEE conference on Sarnoff
Efficient node distribution techniques in mobile ad hoc networks using game theory
MILCOM'09 Proceedings of the 28th IEEE conference on Military communications
| Hi-index | 0.00 |
Sustaining a complete and accurate information about MANET nodes is often impractical due to dynamic topology, lack of centralized authority, decentralized architecture and heterogeneous nodes in MANETs. Main concerns for MANET performance are power consumption, topology control, spectrum sharing, and localization, all of which are intensified by node mobility. Another inherent characteristic of mobile nodes in MANETs is that they have limited or no cooperation among themselves, and their motivations are often selfish with conflicting individual interests. We present a distributed game for obtaining a uniform node distribution among the MANET nodes over a given geographical territory. We show that our potential game can be an effective mechanism for distributed tasks such as uniform node distribution.