Separation of Routing and Scheduling in Backpressure-Based Wireless Networks

Backpressure routing and scheduling, with its throughput-optimal operation guarantee, is a promising technique to improve throughput in wireless multihop networks. Although backpressure is conceptually viewed as layered, the decisions of routing and scheduling are made jointly, which imposes several challenges in practice. In this work, we present Diff-Max, an approach that separates routing and scheduling and has three strengths: 1) Diff-Max improves throughput significantly; 2) the separation of routing and scheduling makes practical implementation easier by minimizing cross-layer operations; i.e., routing is implemented in the network layer and scheduling is implemented in the link layer; and 3) the separation of routing and scheduling leads to modularity; i.e., routing and scheduling are independent modules in Diff-Max, and one can continue to operate even if the other does not. Our approach is grounded in a network utility maximization (NUM) formulation and its solution. Based on the structure of Diff-Max, we propose two practical schemes: Diff-subMax and wDiff-subMax. We demonstrate the benefits of our schemes through simulation in ns-2.

[1]  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).

[2]  Alexander L. Stolyar,et al.  A Novel Architecture for Reduction of Delay and Queueing Structure Complexity in the Back-Pressure Algorithm , 2011, IEEE/ACM Transactions on Networking.

[3]  ModianoEytan,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2008 .

[4]  Bhaskar Krishnamachari,et al.  Making distributed rate control using Lyapunov drifts a reality in wireless sensor networks , 2008, 2008 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks and Workshops.

[5]  Leandros Tassiulas,et al.  Scheduling and performance limits of networks with constantly changing topology , 1997, IEEE Trans. Inf. Theory.

[6]  Bhaskar Krishnamachari,et al.  Implementing backpressure-based rate control in wireless networks , 2009, 2009 Information Theory and Applications Workshop.

[7]  Bhaskar Krishnamachari,et al.  Routing without routes: the backpressure collection protocol , 2010, IPSN '10.

[8]  H. Vincent Poor,et al.  Queue Back-Pressure Random Access in Multihop Wireless Networks: Optimality and Stability , 2009, IEEE Transactions on Information Theory.

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

[10]  L. Praveen Kumar,et al.  Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks , 2016 .

[11]  Leandros Tassiulas.  Scheduling and performance limits of networks with constantly changing topology , 1997 .

[12]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[13]  Christos Gkantsidis,et al.  Horizon: balancing tcp over multiple paths in wireless mesh network , 2008, MobiCom '08.

[14]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[15]  Rafael P. Laufer,et al.  XPRESS: a cross-layer backpressure architecture for wireless multi-hop networks , 2011, MobiCom '11.

[16]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

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

[18]  A. Warrier,et al.  DiffQ: Practical Differential Backlog Congestion Control for Wireless Networks , 2009, IEEE INFOCOM 2009.

[19]  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).

[20]  P. Radosavljevic,et al.  Performance of IEEE 802.11b wireless LAN in an emulated mobile channel , 2003, The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring..

[21]  Eleftheria Athanasopoulou,et al.  Back-Pressure-Based Packet-by-Packet Adaptive Routing in Communication Networks , 2013, IEEE/ACM Transactions on Networking.

[22]  Alexander L. Stolyar,et al.  Greedy primal-dual algorithm for dynamic resource allocation in complex networks , 2006, Queueing Syst. Theory Appl..

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

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

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

[26]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[27]  Nabil Kahale,et al.  Dynamic global packet routing in wireless networks , 1997, Proceedings of INFOCOM '97.

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

[29]  Alexander L. Stolyar,et al.  Joint Scheduling and Congestion Control in Mobile Ad-Hoc Networks , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[30]  Matthew Andrews,et al.  Providing quality of service over a shared wireless link , 2001, IEEE Commun. Mag..

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