Collaborative Opportunistic Scheduling in Heterogeneous Networks: A Distributed Approach

We consider a collaborative opportunistic scheduling problem in a decentralized network with heterogeneous users. While most related researches focus on solutions for optimizing decentralized systems’ total performance, we proceed in another direction. Two problems are specifically investigated. (1) With heterogenous users having personal demands, is it possible to have it met by designing distributed opportunistic policies? (2) With a decentralized mechanism, how can we prevent selfish behaviors and enforce collaboration? In our research, we first introduce a multiuser network model along with a scheduling problem constrained by individual throughput requirement at each user’s side. An iterative algorithm is then proposed to characterize a solution for the scheduling problem, based on which collaborative opportunistic scheduling scheme is enabled. Properties of the algorithm, including convergence, will be discussed. Furthermore in order to keep the users staying with the collaboration state, an additional punishment strategy is designed. Therefore selfish deviation can be detected and disciplined so that collaboration is enforced. We demonstrate our main findings with both analysis and simulations.

[1]  Jang-Won Lee,et al.  A unified framework for opportunistic fair scheduling in wireless networks: a dual approach , 2010, Wirel. Networks.

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

[3]  Junshan Zhang,et al.  Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access: An Optimal Stopping Approach , 2009, IEEE Transactions on Information Theory.

[4]  Ioannis Lambadaris,et al.  Optimal scheduling in high-speed downlink packet access networks , 2010, TOMC.

[5]  Robert Morris,et al.  Link-level measurements from an 802.11b mesh network , 2004, SIGCOMM 2004.

[6]  Gustavo de Veciana,et al.  Losing Opportunism: Evaluating Service Integration in an Opportunistic Wireless System , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[7]  Andres Garcia-Saavedra,et al.  Distributed Opportunistic Scheduling: A control theoretic approach , 2012, 2012 Proceedings IEEE INFOCOM.

[8]  R. Srikant,et al.  Throughput-Optimal Opportunistic Scheduling in the Presence of Flow-Level Dynamics , 2011, IEEE/ACM Transactions on Networking.

[9]  Amoakoh Gyasi-Agyei,et al.  Multiuser diversity based opportunistic scheduling for wireless data networks , 2005, IEEE Communications Letters.

[10]  James R. Zeidler,et al.  Distributed Opportunistic Scheduling for Ad-Hoc Communications Under Delay Constraints , 2010, 2010 Proceedings IEEE INFOCOM.

[11]  Vincenzo Mancuso,et al.  A Survey on Opportunistic Scheduling in Wireless Communications , 2013, IEEE Communications Surveys & Tutorials.

[12]  Michael J. Neely,et al.  Opportunistic scheduling with worst case delay guarantees in single and multi-hop networks , 2011, 2011 Proceedings IEEE INFOCOM.