Article

On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks

Dept. of Electr. & Comput. Eng., Iowa State Univ., Ames, IA, USA
IEEE/ACM Transactions on Networking (Impact Factor: 1.99). 07/2011; DOI: 10.1109/TNET.2010.2094204
Source: IEEE Xplore

ABSTRACT Back-pressure-type algorithms based on the algorithm by Tassiulas and Ephremides have recently received much attention for jointly routing and scheduling over multihop wireless networks. However, this approach has a significant weakness in routing because the traditional back-pressure algorithm explores and exploits all feasible paths between each source and destination. While this extensive exploration is essential in order to maintain stability when the network is heavily loaded, under light or moderate loads, packets may be sent over unnecessarily long routes, and the algorithm could be very inefficient in terms of end-to-end delay and routing convergence times. This paper proposes a new routing/scheduling back-pressure algorithm that not only guarantees network stability (throughput optimality), but also adaptively selects a set of optimal routes based on shortest-path information in order to minimize average path lengths between each source and destination pair. Our results indicate that under the traditional back-pressure algorithm, the end-to-end packet delay first decreases and then increases as a function of the network load (arrival rate). This surprising low-load behavior is explained due to the fact that the traditional back-pressure algorithm exploits all paths (including very long ones) even when the traffic load is light. On the other-hand, the proposed algorithm adaptively selects a set of routes according to the traffic load so that long paths are used only when necessary, thus resulting in much smaller end-to-end packet delays as compared to the traditional back-pressure algorithm .

0 Bookmarks
 · 
153 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: We consider a delay-constrained unicast scenario, where a source node streams perishable information to a destination node over a directed acyclic graph subject to a delay constraint. Transmission along any edge incurs unit delay, and we require that every information bit generated at the source in the beginning of time t to be received and recovered by the destination in the end of time t + D - 1 where D > 0 is the maximum allowed communication delay. We study the corresponding delay-constrained (d-cn) unicast capacity problem. When only routing is allowed, [Ying, et al. 2011] showed that the aforementioned d-cn unicast routing capacity can be characterized and computed efficiently. However, the d-cn capacity problem changes completely when network coding (NC) is allowed. In this work, we construct the first example showing that NC can achieve strictly higher d-cn throughput than routing even for the single unicast setting and the NC gain can be arbitrarily close to 2 in some instances. This is in sharp contrast to the delay-unconstrained (D → ∞) single-unicast case where the classic min-cut/max-flow theorem implies that coding cannot improve throughput over routing. Finally, we propose a new upper bound on the d-cn unicast NC capacity and elaborate its connections to the existing routing-based results [Ying, et al. 2011]. Overall, our results suggest that d-cn communication is fundamentally different from the well-understood delay-unconstrained one and call for investigation participation.
    2014 IEEE International Symposium on Information Theory (ISIT); 06/2014
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: The backpressure algorithm for dynamic network resource allocation achieves throughput optimality by making use of one-hop queue length differences. This elegant algorithm, on the other hand, does not yield good delay performance in general. We introduce a new class of enhanced dynamic backpressure algorithms which make use of a general queue-dependent bias function to exploit queue state information beyond one hop. We prove the throughput optimality of the enhanced algorithms. We further elaborate on two specific algorithms within this class, which have demonstrably improved delay performance while maintaining acceptable implementation complexity.
    2013 Asilomar Conference on Signals, Systems and Computers; 11/2013
  • EURASIP Journal on Wireless Communications and Networking 12/2015; 2015(1). DOI:10.1186/s13638-015-0260-2 · 0.81 Impact Factor

Preview (2 Sources)

Download
1 Download
Available from