Scheduling in Mobile Ad Hoc Networks With Topology and Channel-State Uncertainty

We study throughput-optimal scheduling in mobile ad hoc networks with time-varying (fading) channels. Traditional back-pressure algorithms (based on the work by Tassiulas and Ephremides) require instantaneous network state (topology, queues-lengths, and fading channel-state) in order to make scheduling/routing decisions. However, such instantaneous network-wide (global) information is hard to come by in practice, especially when mobility induces a time-varying topology. With information delays and a lack of global network state, different mobile nodes have differing “views” of the network, thus inducing uncertainty and inconsistency across mobile nodes in their topology knowledge and network state information. In such a setting, we first characterize the throughput-optimal rate region and develop a back-pressure-like scheduling algorithm, which we show is throughput-optimal. Then, by randomly partitioning the geographic region spatially into disjoint and interference-free sub-areas, and sharing delayed topology and network state information only among nearby mobile nodes, we develop a localized low-complexity scheduling algorithm. The algorithm uses instantaneous local information (the queue length, channel state and current position at a mobile node) along with delayed network state information from nearby nodes (i.e., from nodes that were within a nearby geographic region as opposed to network-wide information). The proposed algorithm is shown to be near-optimal, where the geographic distance over which delayed network-state information is shared determines the provable lower bound on the achievable throughput.

[1]  S. Shakkottai,et al.  Pathwise optimality of the exponential scheduling rule for wireless channels , 2004, Advances in Applied Probability.

[2]  Lei Ying,et al.  Scheduling in Mobile Ad Hoc Networks With Topology and Channel-State Uncertainty , 2012, IEEE Transactions on Automatic Control.

[3]  Lang Tong,et al.  Exploiting decentralized channel state information for random access , 2005, IEEE Transactions on Information Theory.

[4]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[5]  Eytan Modiano,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2005, INFOCOM.

[6]  Koushik Kar,et al.  Throughput-Optimal Scheduling in Multichannel Access Point Networks Under Infrequent Channel Measurements , 2007, IEEE INFOCOM 2007 - 26th IEEE International Conference on Computer Communications.

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

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

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

[10]  Alexander L. Stolyar,et al.  Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..

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

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

[13]  Yi Yang,et al.  Exploiting medium access diversity in rate adaptive wireless LANs , 2004, MobiCom '04.

[14]  Anthony Ephremides,et al.  Joint Scheduling and Routing for Ad-hoc Networks Under Channel State Uncertainty , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[15]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

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

[17]  R. Srikant,et al.  Fair Resource Allocation in Wireless Networks Using Queue-Length-Based Scheduling and Congestion Control , 2005, IEEE/ACM Transactions on Networking.

[18]  Junshan Zhang,et al.  Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach , 2007, MobiHoc '07.

[19]  Lei Ying,et al.  On Throughput Optimality With Delayed Network-State Information , 2008, IEEE Transactions on Information Theory.

[20]  Ioannis Ch. Paschalidis,et al.  Optimized Scheduled Multiple Access Control for Wireless Sensor Networks , 2009, IEEE Transactions on Automatic Control.

[21]  Abhinav Gupta,et al.  Low-complexity distributed scheduling algorithms for wireless networks , 2009 .

[22]  Aditya Gopalan,et al.  On Wireless Scheduling With Partial Channel-State Information , 2012, IEEE Transactions on Information Theory.

[23]  Mingyan Liu,et al.  Optimal Channel Probing and Transmission Scheduling for Opportunistic Spectrum Access , 2007, IEEE/ACM Transactions on Networking.

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

[25]  Ness B. Shroff,et al.  Understanding the capacity region of the Greedy maximal scheduling algorithm in multihop wireless networks , 2009, TNET.

[26]  Xiaojun Lin,et al.  Constant-Time Distributed Scheduling Policies for Ad Hoc Wireless Networks , 2006, CDC.

[27]  Ashutosh Sabharwal,et al.  Opportunistic spectral usage: bounds and a multi-band CSMA/CA protocol , 2007, TNET.

[28]  Randall Berry,et al.  Opportunistic splitting algorithms for wireless networks , 2004, IEEE INFOCOM 2004.

[29]  L. Tassiulas,et al.  Throughput properties of a queueing network with distributed dynamic routing and flow control , 1996, Advances in Applied Probability.

[30]  A. Stolyar,et al.  LARGEST WEIGHTED DELAY FIRST SCHEDULING: LARGE DEVIATIONS AND OPTIMALITY , 2001 .

[31]  Saikat Ray,et al.  Arbitrary Throughput Versus Complexity Tradeoffs in Wireless Networks Using Graph Partitioning , 2008, IEEE Transactions on Automatic Control.

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