Research Article
Competitive scheduling in wireless collision channels with correlated channel state
@INPROCEEDINGS{10.1109/GAMENETS.2009.5137452, author={Utku Ozan Candogan and Ishai Menache and Asuman Ozdaglar and Pablo A. Parrilo}, title={Competitive scheduling in wireless collision channels with correlated channel state}, proceedings={1st International Conference on Game Theory for Networks}, publisher={IEEE}, proceedings_a={GAMENETS}, year={2009}, month={6}, keywords={}, doi={10.1109/GAMENETS.2009.5137452} }- Utku Ozan Candogan
Ishai Menache
Asuman Ozdaglar
Pablo A. Parrilo
Year: 2009
Competitive scheduling in wireless collision channels with correlated channel state
GAMENETS
IEEE
DOI: 10.1109/GAMENETS.2009.5137452
Abstract
We consider a wireless collision channel, shared by a finite number of mobile users who transmit to a common base station. Each user wishes to optimize its individual network utility that incorporates a natural tradeoff between throughput and power. The channel quality of every user is affected by global and time-varying conditions at the base station, which are manifested to all users in the form of a common channel state. Assuming that all users employ stationary, state-dependent transmission strategies, we investigate the properties of the Nash equilibrium of the resulting game between users. While the equilibrium performance can be arbitrarily bad (in terms of aggregate utility), we bound the efficiency loss at the best equilibrium as a function of a technology-related parameter. Under further assumptions, we show that sequential best-response dynamics converge to an equilibrium point in finite time, and discuss how to exploit this property for better network usage.