Optimal random access in networks with two-way traffic
Authors:
- 12 January 2005
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 609-613
Abstract
We consider a random access network in which the nodes need to optimize their channel access rates. The nodes are assumed to be rational and interested in their per- formance seen as a transmitter as well as a receiver. By cast- ing this problem as a non-cooperative game, we derive condi- tions for the Nash equilibrium. We also show the existence of a Nash equilibrium when the nodes are constrained by their battery power (for this case, the constraints on the access rates of the nodes become coupled). For the special case where all nodes are each other's neighbors, we find that the equilibrium is given by the solution of a system of linear equations. An adaptive distributed scheme is then proposed for learning this equilibrium and its convergence is studied numerically. Keywords - Game theory, Stochastic approximation algo- rithm.Keywords
This publication has 5 references indexed in Scilit:
- Stochastic control techniques for throughput optimal wireless multicast2004
- Cooperation in wireless ad hoc networks2003
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- Stochastic Approximation Algorithms and Applications1997
- Existence and Uniqueness of Equilibrium Points for Concave N-Person GamesEconometrica, 1965