On the channel-sensitive delay behavior of LIFO-backpressure

In this paper, we study the delay performance of backpressure routing algorithms using LIFO schedulers (LIFO-backpressure). We uncover a surprising behavior in which, under certain channel conditions, the average delay of packets decreases as the traffic load in the network increases. We propose and analyze a queueing-theoretic model under which the scheduler can transmit packets only if the queue length (i.e., the number of packets in the queue) meets or exceeds a threshold, and we show that the model analytically bears out the observed phenomenon. Using matrix geometric methods, we derive a numerical solution for the average packet delay in the general case, and, using z-transform techniques, we further provide closed-form solutions for the average delay in special cases. Our analysis indicates that when the threshold is fixed (as may happen under lossless channel conditions), the average delay increases with increasing traffic load, as expected. On the other hand, when the threshold fluctuates (as may happen under changing, lossy channel conditions), the average delay may decrease, sometimes substantially, with the traffic load. We corroborate these findings with TOSSIM simulations using real channel traces and run on different types of networks.

[1]  David E. Culler,et al.  TOSSIM: accurate and scalable simulation of entire TinyOS applications , 2003, SenSys '03.

[2]  Leandros Tassiulas,et al.  Resource Allocation and Cross Layer Control in Wireless Networks (Foundations and Trends in Networking, V. 1, No. 1) , 2006 .

[3]  Longbo Huang,et al.  Delay reduction via Lagrange multipliers in stochastic network optimization , 2011, IEEE Trans. Autom. Control..

[4]  Peter Marbach,et al.  Downlink resource allocation and pricing for wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[5]  E. Gilbert.  Capacity of a burst-noise channel , 1960 .

[6]  Ness B. Shroff,et al.  Delay-based Back-Pressure scheduling in multi-hop wireless networks , 2011, INFOCOM.

[7]  John N. Daigle.  Queueing theory for telecommunications , 1992, Addison-Wesley series in telecommunications.

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

[9]  Philip Levis,et al.  Collection tree protocol , 2009, SenSys '09.

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

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

[12]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[13]  Morteza Hashemi,et al.  Intra-Car Wireless Sensors Data Collection: A Multi-Hop Approach , 2013, 2013 IEEE 77th Vehicular Technology Conference (VTC Spring).

[14]  Lei Ying,et al.  On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

[15]  Marcel F. Neuts,et al.  Matrix-Geometric Solutions in Stochastic Models , 1981 .

[16]  Bhaskar Krishnamachari,et al.  LIFO-Backpressure Achieves Near-Optimal Utility-Delay Tradeoff , 2010, IEEE/ACM Transactions on Networking.

[17]  Longbo Huang,et al.  Delay reduction via Lagrange multipliers in stochastic network optimization , 2009, IEEE Transactions on Automatic Control.

[18]  Bhaskar Krishnamachari,et al.  Backpressure with Adaptive Redundancy (BWAR) , 2012, 2012 Proceedings IEEE INFOCOM.

[19]  HyungJune Lee,et al.  Improving Wireless Simulation Through Noise Modeling , 2007, 2007 6th International Symposium on Information Processing in Sensor Networks.