Competitive scheduling in wireless collision channels with correlated channel state

• Main Authors: Parrilo, Pablo A. (Contributor), Candogan, Utku Ozan (Contributor), Menache, Ishai (Contributor), Ozdaglar, Asuman E. (Contributor)
• Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Laboratory for Information and Decision Systems (Contributor)
• Format: Article
• Language: English
• Published: Institute of Electrical and Electronics Engineers, 2010-10-07T15:48:55Z.
• Subjects: Article
• Online Access: Get fulltext

 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.