Lifetime-Aware Backpressure—A New Delay-Enhanced Backpressure-Based Routing Protocol

Dynamic backpressure is a highly desirable family of routing protocols known for their attractive mathematical properties. However, these protocols suffer from a high end-to-end delay making them inefficient for real-time traffic with strict end-to-end delay requirements. In this paper, we address this issue by proposing a new adjustable and fully distributed backpressure-based scheme with low queue management complexity, named Lifetime-Aware Backpressure (LTA-BP). The novelty in the proposed scheme consists in introducing the urgency level as a new metric for service differentiation among the competing traffic flows in the network. Our scheme not just significantly improves the quality of service provided for real-time traffic with stringent end-to-end delay constraints, but interestingly protects also the flows with softer delay requirements from being totally starved. The proposed scheme has been evaluated and compared against other state-of-the-art routing protocol, using computer simulation, and the obtained results show its superiority in terms of the achieved end-to-end delay and throughput.

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

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

[3]  Ness B. Shroff,et al.  Delay-Based Back-Pressure Scheduling in Multihop Wireless Networks , 2011, IEEE/ACM Transactions on Networking.

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

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

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

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

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

[9]  JongWon Kim,et al.  Backpressure scheduling in IEEE 802.11 wireless mesh networks: Gap between theory and practice , 2012, Comput. Networks.

[10]  Lei Ying,et al.  On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks , 2009, IEEE INFOCOM 2009.

[11]  H. T. Mouftah,et al.  Backpressure-based routing and scheduling protocols for wireless multihop networks: A survey , 2016, IEEE Wireless Communications.

[12]  Eytan Modiano,et al.  Loop-Free Backpressure Routing Using Link-Reversal Algorithms , 2017, IEEE/ACM Transactions on Networking.

[13]  Leandros A. Maglaras,et al.  Delay Efficient Backpressure Routing in Wireless Ad Hoc Networks , 2014, EAI Endorsed Trans. Mob. Commun. Appl..

[14]  Ran Liu,et al.  Enhancing the Delay Performance of Dynamic Backpressure Algorithms , 2016, IEEE/ACM Trans. Netw..

[15]  Josep Mangues-Bafalluy,et al.  Distributed Lyapunov drift-plus-penalty routing for WiFi mesh networks with adaptive penalty weight , 2012, 2012 IEEE International Symposium on a World of Wireless, Mobile and Multimedia Networks (WoWMoM).

[16]  Josep Mangues-Bafalluy,et al.  Anycast Backpressure Routing: Scalable Mobile Backhaul for Dense Small Cell Deployments , 2013, IEEE Communications Letters.