This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Wardrop Routing in Wireless Networks
May 2009 (vol. 8 no. 5)
pp. 636-652
ASCII Text
x 
 
Vivek Raghunathan, P.R. Kumar, "Wardrop Routing in Wireless Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 5, pp. 636-652, May, 2009.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2008.164,
author = {Vivek Raghunathan and P.R. Kumar},
title = {Wardrop Routing in Wireless Networks},
journal ={IEEE Transactions on Mobile Computing},
volume = {8},
number = {5},
issn = {1536-1233},
year = {2009},
pages = {636-652},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2008.164},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Wardrop Routing in Wireless Networks
IS - 5
SN - 1536-1233
SP636
EP652
EPD - 636-652
A1 - Vivek Raghunathan,
A1 - P.R. Kumar,
PY - 2009
KW - Routing protocols
KW - Wireless communication
KW - C.2.8.a Algorithm/protocol design and analysis
VL - 8
JA - IEEE Transactions on Mobile Computing
ER -
 
Vivek Raghunathan, University of Illinois at Champaign-Urbana, Urbana
P.R. Kumar, University of Illinois at Champaign-Urbana, Urbana
Wireless routing protocols traditionally use shortest-path routing, and ignore traffic load in the choice of routes. In static mesh networks, we formally establish that if the number of sources is not too large, then one can construct a perfect flow-avoiding routing that boosts the throughput provided to each user over that of shortest-path routing by a factor of upto four. So motivated, we design a multi-path, load adaptive routing protocol that is generally applicable even when there are more sources. Our protocol adaptively equalizes the mean delay along all utilized routes from a source to destination, and does not utilize routes with greater mean delay. This is the Wardrop equilibrium property. We also address architectural challenges confronted in software implementation of a multi-path, delay feedback based, probabilistic routing algorithm. Our routing protocol is (i) completely distributed, (ii) automatically load balances flows, (iii) uses multiple paths whenever beneficial, (iv) guarantees loop-free paths at every time instant, and (v) amenable to clean implementation. A simulation study indicates that it is able to automatically route flows to "avoid" each other, consistently out-performing shortest-path protocols. The protocol has been implemented on a modified Linux 2.4.20 kernel. Finally, we discuss a proof-of-concept measurement study on a six node testbed.

[1] T. Clausen, P. Jacquet, C. Adjih, A. Laouiti, P. Minet, and P. Muhlethaler, “Optimized Link State Routing Protocol (OLSR),” IETF RFC 3626.
[2] D.B. Johnson and D.A. Maltz, “Dynamic Source Routing in AdHoc Wireless Networks,” Mobile Computing, Kluwer Academic Publishers, 1996.
[3] C.E. Perkins, E.M. Royer, and S. Das, “Ad Hoc on Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications (WMCSA '99), 1999.
[4] V. Park and S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM, 1997.
[5] M.P. Zygmunt Haas and P. Samar, “The Zone Routing Protocol for Ad Hoc Networks,” IETF Internet draft, work in progress, 1999.
[6] P. Gupta and P.R. Kumar, “A System and Traffic Independent Adaptive Routing Algorithm for Ad Hoc Networks,” Proc. IEEE Conf. Decision and Control (CDC '97), 1997.
[7] V.S. Borkar and P.R. Kumar, “Dynamic Cesaro-Wardrop Equilibration in Networks,” IEEE Trans. Automatic Control, vol. 48, pp.382-396, 2003.
[8] V. Raghunathan and P.R. Kumar, “On Delay Adaptive Routing in Wireless Networks,” Proc. IEEE Conf. Decision and Control (CDC '04), pp. 4661-4666, 2004.
[9] V. Raghunathan and P.R. Kumar, “Issues in Wardrop Routing in Wireless Networks,” Proc. First Int'l Conf. Wireless Internet (WICON '05), pp. 34-41, 2005.
[10] C.E. Perkins and P.R. Bhagwat, “Highly Dynamic Destination-Sequenced Distance Vector Routing for Mobile Computers,” Proc. ACM SIGCOMM, 1994.
[11] E. Royer and C.-K. Toh, “A Review of Routing Protocols for AdHoc Mobile Wireless Networks,” IEEE Personal Comm., vol. 6, pp. 46-55, 1999.
[12] W.S. Alvin Valera and S. Rao, “Cooperative Packet Caching and Shortest Multipath Routing in Mobile Ad-Hoc Networks,” Proc. IEEE INFOCOM, 2003.
[13] M. Marina and S.R. Das, “On-Demand Multipath Distance Vector Routing in Ad-Hoc Networks,” Proc. IEEE Int'l Conf. Network Protocols (ICNP '01), 2001.
[14] A. Nasipuri and S.R. Das, “On-Demand Multipath Routing for Mobile Ad Hoc Networks,” Proc. IEEE Int'l Conf. Computer Comm. and Networks (ICCN '99), 1999.
[15] S.J. Lee and M. Gerla, “AODV-BR: Backup Routing in Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '03), 2003.
[16] S.-B. Lee and A.T. Campbell, “HMP: Hotspot Mitigation Protocol for Mobile Ad-Hoc Networks,” Proc. Int'l Workshop Quality of Service (IWQoS '03), 2003.
[17] S.-J. Lee and M. Gerla, “Dynamic Load-Aware Routing in Ad-Hoc Networks,” Proc. IEEE Int'l Conf. Comm. (ICC '01), 2001.
[18] D. Bertsekas and R.G. Gallager, Data Networks. Prentice Hall, 1992.
[19] R. Gallager, “A Minimum Delay Routing Algorithm Using Distributed Computation,” IEEE Trans. Comm., vol. 25, pp. 73-85, 1977.
[20] S. Vutukury and J.J. Garcia-Luna-Aceves, “A Simple Approximation to Minimum-Delay Routing,” Proc. ACM SIGCOMM, 1999.
[21] A. Khanna and J. Zinky, “The Revised Arpanet Routing Metric,” SIGCOMM Computer Comm. Rev., vol. 19, no. 4, pp. 45-56, 1989.
[22] K. Fall and K. Varadhan, NS Manual, http://www.isi.edu/nsnamns/, Sept. 2003.
[23] J. Broch, D. Maltz, D. Johnson, Y. Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. ACM MobiCom, pp. 85-97, 1998.
[24] R.E. Azouzi, E. Altman, and O. Pourtallier, “Properties of Equilibrium in Routing Problems in Networks with Several Types,” Proc. IEEE Conf. Decision and Control (CDC '02), 2002.
[25] T. Roughgarden, “Designing Networks for Selfish Users is Hard,” Proc. 42nd IEEE Symp. Foundations of Computer Science (FOCS '01), p. 472, 2001.
[26] J.G. Wardrop, “Some Theoretical Aspects of Road Traffic Research,” Proc. Inst. Civil Eng., vol. 2, pp. 325-378, 1952.
[27] P.R. Kumar and P. Varaiya, Stochastic Systems: Estimation, Identification and Adaptive Control. Prentice Hall, 1986.
[28] V. Raghunathan, “Wardrop Routing in Wireless Networks,” master's thesis, Univ. of Illinois at Urbana-Champaign, 2004.
[29] B. Gupta, “Design, Implementation and Testing of Routing Protocol for Mobile Ad-Hoc Networks,” master's thesis, Univ. Illinois at Urbana-Champaign, 2002.
[30] R. Russell and H. Welte, Linux NetFilter HOWTO, http:/www. netfilter.org/, 2008.
[31] V. Kawadia, “Protocols and Architecture for Wireless Ad-Hoc Networks,” PhD dissertation, Univ. of Illinois at Urbana-Champaign, 2004.
[32] C. Hedrick, “Routing Information Protocol,” IETF RFC 1058, http://www.ietf.org/rfcrfc1058.txt, 1988.

Index Terms:
Routing protocols, Wireless communication, C.2.8.a Algorithm/protocol design and analysis
Citation:
Vivek Raghunathan, P.R. Kumar, "Wardrop Routing in Wireless Networks," IEEE Transactions on Mobile Computing, vol. 8, no. 5, pp. 636-652, May 2009, doi:10.1109/TMC.2008.164
Usage of this product signifies your acceptance of the Terms of Use.