An Efficient ShortestPath Aided BackPressure Routing over Multihop Wireless Networ

Full Text(PDF, ) PP.17


Author(s) 
T. Antony Thobias, P. Vijayananth, S. Manikandan 

KEYWORDS 
Backpressure, PSO Algorithm, Multihop, Throughput Optimal 

ABSTRACT 
This project proposes a new optimal routing/scheduling backpressure algorithm that not only guarantees network stability (throughput optimality), but also adaptively selects a set of optimal routes based on shortestpath information in order to minimize average path lengths between each source and destination pair. Our results indicate that under the traditional backpressure algorithm, the endtoend packet delay ?rst decreases and then increases as a function of the network load (arrival rate). The proposed particle swarm optimization based back pressure algorithm adaptively selects a set of routes according to the traffic load and energy efficiency so that long paths are used only when necessary, thus resulting in much smaller endtoend packet delays as compared to the traditional backpressure algorithm. 

References 

[1] L. Ying, S. Shakkottai, and A. Reddy, ―On combining shortestpath
and backpressure routing over multihop wireless networks,‖ in
Proc. IEEE INFOCOM, Rio de Janeiro, Brazil, 2009, pp. 1674–1682
[2] L. Tassiulas and A. Ephremides, ―Stability properties of constrained
queueing systems and scheduling policies for maximum
throughput in multihop radio networks,‖ IEEE Trans. Autom.
Control, vol. 37, no. 12, pp. 1936–1948, Dec. 1992.
[3] L. Tassiulas and A. Ephremides, ―Dynamic server allocation to
parallel queues with randomly varying connectivity,‖ IEEE Trans.
Inf. Theory, vol. 39, no. 2, pp. 466–478, Mar. 1993.
[4] X. Lin and N. Shroff, ―Joint rate control and scheduling in multihop
wireless networks,‖ in Proc. IEEE CDC, Paradise Island, Bahamas,
Dec. 2004, vol. 2, pp. 1484–1489.
[5] A. Eryilmaz and R. Srikant, ―Fair resource allocation in wireless
networks using queuelengthbased scheduling and congestion
control,‖ in Proc. IEEE INFOCOM, 2005, vol. 3, pp. 1794–1803.
[6] A. Stolyar, ―Maximizing queueing network utility subject to
stability: Greedy primaldual algorithm,‖ Queue. Syst., vol. 50, no.
4, pp. 401–457, Aug. 2005.
[7] M. Neely, E.Modiano, and C. Li, ―Fairness and optimal stochastic
control for heterogeneous networks,‖ in Proc. IEEE INFOCOM,
Miami, FL, Mar. 2005, vol. 3, pp. 1723–1734.
[8] M. J. Neely, ―Optimal backpressure routing for wireless networks
with multireceiver diversity,‖ in Proc. CISS, 2006, pp. 18–25.
[9] A. Eryilmaz and R. Srikant, ―Joint congestion control, routing and
MAC for stability and fairness in wireless networks,‖ IEEE J. Sel.
Areas Commun., vol. 24, no. 8, pp. 1514–1524, Aug. 2006.
[10] M. Neely, ―Energy optimal control for timevarying wireless
networks,‖ IEEE Trans. Inf. Theory, vol. 52, no. 7, pp. 2915–2934, Jul.
2006.
[11] E. Yeh and R. Berry, ―Throughput optimal control of wireless
networks with twohop cooperative relaying,‖ in Proc. IEEE ISIT,
Jun. 2007, pp. 351–355.
[12] E. Yeh and R. Berry, ―Throughput optimal control of cooperative
relay networks,‖ IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3827–
3833, Oct. 2007.
[13] K. Jung and D. Shah, ―Low delay scheduling in wireless network,‖
in Proc. IEEE ISIT, 2007, pp. 1396–1400.
[14] L. Ying, R. Srikant, and D. Towsley, ―Clusterbased backpressure
routing algorithm,‖ in Proc. IEEE INFOCOM, 2008, pp. 484–492.
[15] X. Lin, N. Shroff, and R. Srikant, ―A tutorial on crosslayer
optimization in wireless networks,‖ IEEE J. Sel. Areas Commun.,
vol. 24, no. 8, pp. 1452–1463, Aug. 2006.


