Some game-theoretic problems in wireless ad-hoc networks

  • Authors:
  • E. Altman;Vivek S. Borkar;Arzad A. Kherani;P. Michiardi;R. Molva

  • Affiliations:
  • INRIA, Sophia Antipolis, France;School of Technology and Computer Science, Tata Institute of Fundamental Research, Mumbai, India;INRIA, Sophia Antipolis, France;GET/EURECOM, Sophia-Antipolis, France;GET/EURECOM, Sophia-Antipolis, France

  • Venue:
  • NGI'04 Proceedings of the First international conference on Wireless Systems and Mobility in Next Generation Internet
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.