Distributed Link Scheduling Under SINR Model in Multihop Wireless Networks

Link adaptation technologies, such as Adaptive Modulation and Coding (AMC) and Multiple-Input-Multiple-Output (MIMO), are used in advanced wireless communication systems to achieve high spectrum efficiency. Communication performance can be improved significantly by adaptive transmissions based on the quality of received signals, i.e., the signal-to-interference-plus-noise ratio (SINR). However, for multihop wireless communications, most link scheduling schemes have been developed under simplified interference models that do not account for accumulative interference and cannot fully exploit the recent advances in PHY-layer communication theory. This paper focuses on developing link scheduling schemes that can achieve optimal performance under the SINR model. One key idea is to treat an adaptive wireless link as multiple parallel virtual links with different signal quality, building on which we develop throughput-optimal scheduling schemes using a two-stage queueing structure in conjunction with recently developed carrier-sensing techniques. Furthermore, we introduce a novel three-way handshake to ensure, in a distributed manner, that all transmitting links satisfy their SINR requirements. We evaluate the proposed schemes through rigorous analysis and simulations.

[1]  Paolo Santi,et al.  The SCREAM Approach for Efficient Distributed Scheduling with Physical Interference in Wireless Mesh Networks , 2008, 2008 The 28th International Conference on Distributed Computing Systems.

[2]  B ShroffNess,et al.  The impact of imperfect scheduling on cross-layer congestion control in wireless networks , 2006 .

[3]  Jing Deng,et al.  Dual busy tone multiple access (DBTMA)-a multiple access control scheme for ad hoc networks , 2002, IEEE Trans. Commun..

[4]  R. Srikant,et al.  Scheduling Efficiency of Distributed Greedy Scheduling Algorithms in Wireless Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[5]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1992 .

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

[7]  Xiaojun Lin,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[8]  Alexandre Proutière,et al.  Resource Allocation over Network Dynamics without Timescale Separation , 2010, 2010 Proceedings IEEE INFOCOM.

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

[10]  Ness B. Shroff,et al.  CSMA-Based Distributed Scheduling in Multi-hop MIMO Networks under SINR Model , 2010, 2010 Proceedings IEEE INFOCOM.

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

[12]  Jean C. Walrand,et al.  Achieving 100% throughput in an input-queued switch , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

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

[14]  R. Srikant,et al.  A tutorial on cross-layer optimization in wireless networks , 2006, IEEE Journal on Selected Areas in Communications.

[15]  Basil S. Maglaris,et al.  Throughput Analysis in Multihop CSMA Packet Radio Networks , 1987, IEEE Trans. Commun..

[16]  Roger Wattenhofer,et al.  Complexity in geometric SINR , 2007, MobiHoc '07.

[17]  Ness B. Shroff,et al.  Understanding the Capacity Region of the Greedy Maximal Scheduling Algorithm in Multihop Wireless Networks , 2008, IEEE/ACM Transactions on Networking.

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

[19]  Eytan Modiano,et al.  Fairness and Optimal Stochastic Control for Heterogeneous Networks , 2005, IEEE/ACM Transactions on Networking.

[20]  Mung Chiang,et al.  Globally Optimal Distributed Power Control for Nonconcave Utility Maximization , 2010, 2010 IEEE Global Telecommunications Conference GLOBECOM 2010.

[21]  R. Srikant,et al.  On the design of efficient CSMA algorithms for wireless networks , 2010, 49th IEEE Conference on Decision and Control (CDC).

[22]  Eytan Modiano,et al.  Polynomial Complexity Algorithms for Full Utilization of Multi-Hop Wireless Networks , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

[23]  R. Srikant,et al.  Distributed Link Scheduling With Constant Overhead , 2006, IEEE/ACM Transactions on Networking.

[24]  Devavrat Shah,et al.  Network adiabatic theorem: an efficient randomized protocol for contention resolution , 2009, SIGMETRICS '09.

[25]  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.

[26]  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.

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

[28]  Frank Kelly,et al.  Reversibility and Stochastic Networks , 1979 .

[29]  R. Srikant,et al.  Stable scheduling policies for fading wireless channels , 2005, IEEE/ACM Transactions on Networking.

[30]  Jian Ni,et al.  Q-CSMA: Queue-Length-Based CSMA/CA Algorithms for Achieving Maximum Throughput and Low Delay in Wireless Networks , 2009, IEEE/ACM Transactions on Networking.

[31]  Nitin H. Vaidya,et al.  Resource Allocation in Multi-Radio Multi-Channel Multi-Hop Wireless Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[32]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).