Queue-affectance-based scheduling in multi-hop wireless networks under SINR interference constraints

Most distributed wireless scheduling schemes that are provably efficient have been developed under the protocol model, which describes interference constraints in a binary form. However, the oversimplified interference model imposes fundamental limitations on the performance in practice. The signal-to-interference-plus-noise-ratio (SINR) based interference model is more accurate and realistic accounting for the cumulative nature of the interference signals, but its complex structure makes the design of scheduling schemes much more challenging. In this paper, we focus on the scheduling performance under the SINR model and develop random access scheduling schemes that are amenable to implement in a distributed fashion with only local information. We analytically show that they are provably efficient under the SINR model, and through simulations demonstrate that they empirically perform better than the theoretical performance bound.

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

[2]  Eytan Modiano,et al.  Maximizing throughput in wireless networks via gossiping , 2006, SIGMETRICS '06/Performance '06.

[3]  Anil Vullikanti,et al.  Brief Announcement: Distributed Algorithms for Maximum Link Scheduling in the Physical Interference Model , 2012, DISC.

[4]  Xiaodong Wang,et al.  Scheduling under SINR Model in Ad Hoc Networks with Successive Interference Cancellation , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[5]  Ness B. Shroff,et al.  Distributed Link Scheduling Under SINR Model in Multihop Wireless Networks , 2014, IEEE/ACM Transactions on Networking.

[6]  Berthold Vöcking,et al.  Distributed Contention Resolution in Wireless Networks , 2010, DISC.

[7]  Anthony Ephremides,et al.  Wireless Link Scheduling With Power Control and SINR Constraints , 2006, IEEE Transactions on Information Theory.

[8]  R. Srikant,et al.  Low-Complexity Distributed Scheduling Algorithms for Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[9]  Ness B. Shroff,et al.  On the Complexity of Scheduling in Wireless Networks , 2010, EURASIP J. Wirel. Commun. Netw..

[10]  Marius Portmann,et al.  Experimental evaluation of measurement-based SINR interference models , 2012, 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM).

[11]  Jean C. Walrand,et al.  A Distributed CSMA Algorithm for Throughput and Utility Maximization in Wireless Networks , 2010, IEEE/ACM Transactions on Networking.

[12]  Jian Ni,et al.  Q-CSMA: Queue-Length Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2010, INFOCOM 2010.

[13]  Ness B. Shroff,et al.  Distributed Greedy Approximation to Maximum Weighted Independent Set for Scheduling With Fading Channels , 2013, IEEE/ACM Transactions on Networking.

[14]  Roger Wattenhofer,et al.  Wireless Communication Is in APX , 2009, ICALP.

[15]  Ness B. Shroff,et al.  Distributed CSMA Algorithms for Link Scheduling in Multihop MIMO Networks Under SINR Model , 2013, IEEE/ACM Transactions on Networking.

[16]  Xiaojun Lin,et al.  Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[17]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[18]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[19]  J. Dai.  On Positive Harris Recurrence of Multiclass Queueing Networks: A Unified Approach Via Fluid Limit Models , 1995 .

[20]  Andrea Goldsmith,et al.  Wireless Communications , 2005, 2021 15th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS).

[21]  Eytan Modiano,et al.  Longest-queue-first scheduling under SINR interference model , 2010, MobiHoc '10.

[22]  Prasanna Chaporkar,et al.  Optimal distributed scheduling in wireless networks under SINR interference model , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[23]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[24]  Thomas Kesselheim,et al.  A constant-factor approximation for wireless capacity maximization with power control in the SINR model , 2010, SODA '11.

[25]  Ness B. Shroff,et al.  Performance of Random Access Scheduling Schemes in Multi-Hop Wireless Networks , 2006, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[26]  Xiaohua Jia,et al.  Maximum Independent Set of Links under Physical Interference Model , 2009, WASA.

[27]  Magnús M. Halldórsson,et al.  Wireless capacity and admission control in cognitive radio , 2012, 2012 Proceedings IEEE INFOCOM.

[28]  Leandros Tassiulas,et al.  Linear complexity algorithms for maximum throughput in radio networks and input queued switches , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.