Backpressure with Adaptive Redundancy (BWAR)
Authors:
- 1 March 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2300-2308
Abstract
Backpressure scheduling and routing, in which packets are preferentially transmitted over links with high queue differentials, offers the promise of throughput-optimal operation for a wide range of communication networks. However, when the traffic load is low, due to the corresponding low queue occupancy, backpressure scheduling/routing experiences long delays. This is particularly of concern in intermittent encounter-based mobile networks which are already delay-limited due to the sparse and highly dynamic network connectivity. While state of the art mechanisms for such networks have proposed the use of redundant transmissions to improve delay, they do not work well when the traffic load is high. We propose in this paper a novel hybrid approach that we refer to as backpressure with adaptive redundancy (BWAR), which provides the best of both worlds. This approach is highly robust and distributed and does not require any prior knowledge of network load conditions. We evaluate BWAR through both mathematical analysis and simulations based on a cell-partitioned model. We prove theoretically that BWAR does not perform worse than traditional backpressure in terms of the maximum throughput, while yielding a better delay bound. The simulations confirm that BWAR outperforms traditional backpressure at low load, while outperforming a state of the art encounter-routing scheme (Spray and Wait) at high load.Keywords
All Related Versions
This publication has 31 references indexed in Scilit:
- SARP - A Novel Multi-Copy Routing Protocol for Intermittently Connected Mobile Networks2009
- Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy CaseIEEE/ACM Transactions on Networking, 2008
- Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy CaseIEEE/ACM Transactions on Networking, 2008
- Dynamic Source Routing in Ad Hoc Wireless Networks2007
- Impact of Mobility on Last Encounter Routing Protocols2007
- Locating mobile nodes with EASE: learning efficient routes from encounter histories aloneIEEE/ACM Transactions on Networking, 2006
- Dynamic power allocation and routing for time-varying wireless networksIEEE Journal on Selected Areas in Communications, 2005
- Spray and wait2005
- Age matters2003
- Ad-hoc on-demand distance vector routing1999