TY - JOUR
T1 - On combining shortest-path and back-pressure routing over multihop wireless networks
AU - Ying, Lei
AU - Shakkottai, Sanjay
AU - Reddy, Aneesh
AU - Liu, Shihuan
N1 - Funding Information:
Manuscript received August 18, 2009; revised April 04, 2010 and September 09, 2010; accepted October 20, 2010; approved by IEEE/ACM TRANSACTIONS ON NETWORKING Editor C. Westphal. Date of publication December 23, 2010; date of current version June 15, 2011. This work was supported in part by NSF Grants CNS-0347400, CNS-0519535, CNS-0721380, and CNS-0953165; the DARPA ITMANET Program; and DTRA Grants HDTRA1-08-1-0016 and HDTRA1-09-1-0055. An earlier version of this paper appeared in the Proceedings of the IEEE International Conference on Computer Communications (IN-FOCOM), Rio de Janeiro, Brazil, April 19–25, 2009.
PY - 2011/6
Y1 - 2011/6
N2 - 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.
AB - 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.
KW - Back-pressure routing
KW - delay reduction
KW - shortest-path routing
KW - throughput-optimal
UR - http://www.scopus.com/inward/record.url?scp=79958842823&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=79958842823&partnerID=8YFLogxK
U2 - 10.1109/TNET.2010.2094204
DO - 10.1109/TNET.2010.2094204
M3 - Article
AN - SCOPUS:79958842823
SN - 1063-6692
VL - 19
SP - 841
EP - 854
JO - IEEE/ACM Transactions on Networking
JF - IEEE/ACM Transactions on Networking
IS - 3
M1 - 5675761
ER -