NGI 2005, 1st Conference on Next Generation Internet Networks, Traffic Engineering, April 18-20 2005, Rome, Italy / Also Published in Lecture Notes in Computer Science, Volume 3427
Wireless Ad-hoc networks are expected to be made up of energy aware entities (nodes) interested in their own perceived performance. We consider a simple random access model for a wireless ad hoc network to address problems of finding an optimal channel access rate and providing incentive for cooperation to forward other nodes traffic. By casting these problems as noncooperative games, we derive conditions for the Nash equilibrium and provide distributed algorithms to learn the Nash equilibrium. Keywords. Game theory, Stochastic approximation algorithm.
Type:
Conférence
City:
Rome
Date:
2005-04-18
Department:
Sécurité numérique
Eurecom Ref:
1525
Copyright:
© Springer. Personal use of this material is permitted. The definitive version of this paper was published in NGI 2005, 1st Conference on Next Generation Internet Networks, Traffic Engineering, April 18-20 2005, Rome, Italy / Also Published in Lecture Notes in Computer Science, Volume 3427 and is available at : http://dx.doi.org/10.1007/b107131
See also:
