Opportunistic scheduling in cellular systems in the presence of non-cooperative mobiles

A central scheduling problem in wireless communications is that of allocating resources to one of many mobile stations that have a common radio channel. Much attention has been given to the design of efficient and fair scheduling schemes that are centrally controlled by a base station (BS) whose decisions depend on the channel conditions of each mobile. The BS is the only entity taking decisions in this framework based on truthful information from the mobiles on their radio channel. In this paper, we study the scheduling problem from a game-theoretic perspective in which some of the mobiles may be noncooperative. We model this as a signaling game and study its equilibria. We then propose various approaches to enforce truthful signaling of the radio channel conditions: an approach based on some knowledge of the mobiles' policies, and an approach that replaces this knowledge by a stochastic approximations approach that combines estimation and control. We further identify other equilibria that involve non-truthful signaling.

[1]  Y. Narahari,et al.  Foundations of Mechanism Design , 2009 .

[2]  Yu-Kwong Kwok,et al.  On Game Theoretic Rate-Maximizing Packet Scheduling in Non-Cooperative Wireless Networks , 2007, 2007 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks.

[3]  Harold J. Kushner,et al.  Stochastic Approximation Algorithms and Applications , 1997, Applications of Mathematics.

[4]  Matthew S. Grob,et al.  CDMA/HDR: a bandwidth-efficient high-speed wireless data service for nomadic users , 2000, IEEE Commun. Mag..

[5]  Alexander L. Stolyar,et al.  Scheduling algorithms for a mixture of real-time and non-real-time data in HDR , 2001 .

[6]  Richard J. La,et al.  Class and channel condition based weighted proportional fair scheduler , 2001 .

[7]  Ilenia Tinnirello,et al.  Experimental Assessment of the Backoff Behavior of Commercial IEEE 802.11b Network Cards , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[8]  A. Kumar,et al.  Experimental validation of analytical performance models for IEEE 802.11 networks , 2010, 2010 Second International Conference on COMmunication Systems and NETworks (COMSNETS 2010).

[9]  Philip A. Whiting,et al.  Convergence of proportional-fair sharing algorithms under general conditions , 2004, IEEE Transactions on Wireless Communications.

[10]  Joseph Farrell.  Meaning and Credibility in Cheap-Talk Games , 1993 .

[11]  Ness B. Shroff,et al.  A framework for opportunistic scheduling in wireless networks , 2003, Comput. Networks.

[12]  Jennifer Price,et al.  Leveraging Downlink for Efficient Uplink Allocation in a Single-Hop Wireless Network , 2007, IEEE Transactions on Information Theory.

[13]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[14]  Rajesh Sundaresan,et al.  Fair Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles , 2010, INFOCOM 2010.

[15]  A. Ozdaglar,et al.  Algorithmic Game Theory: Incentives and Pricing in Communications Networks , 2007 .

[16]  Pavan Nuggehalli,et al.  A Game-Theoretic Analysis of QoS in Wireless MAC , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[17]  Sem C. Borst,et al.  Dynamic rate control algorithms for HDR throughput optimization , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[18]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[19]  David M. Kreps,et al.  S I G N a L L I N G , 2022 .

[20]  Pierre Priouret,et al.  Adaptive Algorithms and Stochastic Approximations , 1990, Applications of Mathematics.