This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Location-Based Routing Method for Mobile Ad Hoc Networks
March/April 2005 (vol. 4 no. 2)
pp. 97-110
Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad hoc networks. However, location-based routing is difficult when there are holes in the network topology and nodes are mobile or frequently disconnected to save battery. Terminode routing, presented here, addresses these issues. It uses a combination of location-based routing (Terminode Remote Routing, TRR), used when the destination is far, and link state routing (Terminode Local Routing, TLR), used when the destination is close. TRR uses anchored paths, a list of geographic points (not nodes) used as loose source routing information. Anchored paths are discovered and managed by sources, using one of two low overhead protocols: Friend Assisted Path Discovery and Geographical Map-based Path Discovery. Our simulation results show that terminode routing performs well in networks of various sizes. In smaller networks, the performance is comparable to MANET routing protocols. In larger networks that are not uniformly populated with nodes, terminode routing outperforms existing location-based or MANET routing protocols.

[1] http://ica1www.epfl.chTNRouting, Simulation Source Code of Terminode Routing (in Glomosim) and Interactive Java applet, 2004.
[2] S. Basagni, I. Chlamtac, V. Syrotiuk, and B. Woodward, “A Distance Routing Effect Algorithm for Mobility (DREAM),” Proc. Fourth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom '98), Aug. 1998.
[3] L. Blazevic, S. Giordano, and J.-Y. Le Boudec, “Anchored Path Discovery in Terminode Routing,” Proc. Second IFIP-TC6 Networking Conf. (Networking 2002), May 2002.
[4] L. Blazevic, S. Giordano, and J.-Y. Le Boudec, “Self Organized Terminode Routing,” Cluster Computing J., Apr. 2002.
[5] L. Blazevic, “Scalable Routing Protocols with Applications to Mobility,” EPFL, PhD thesis no. 2517, 2002.
[6] L. Blazevic, J.-Y. Le Boudec, and Silvia Giordano, “A Location-Based Routing Method for Irregular Mobile Ad Hoc Networks,” Technical Report IC 200330, EPFL-DI-ICA, May 2003.
[7] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Newtorks,” Proc. Third Int'l Workshop Descrete Algorithms and Methods for Mobile Computing Comm. (DIAL M), Aug. 1999.
[8] J. Broch, D.A. Maltz, D.B. Johnson, Y.C Hu, and J. Jetcheva, “A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols,” Proc. Fourth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom '98), Aug. 1998.
[9] S. Capkun, M. Hamdi, and J.-P. Hubaux, “GPS-Free Positioning in Mobile Ad-Hoc Networks,” Proc. 34th Hawaii Int'l Conf. System Sciences, Jan. 2001.
[10] H. Hartenstein, C. Bettstetter, and X. Prez-Costa, “Stochastic Properties of the Random Waypoint Mobility Model,” ACM/Kluwer Wireless Networks, special issue on modeling and analysis of mobile networks, 2004.
[11] IEEE Society LAN MAN Standards Committee, “Wireless LAN Medium Access Protocol (MAC) and Physical Layer (PHY) Specification,” IEEE Std 802. 11-1997, IEEE, New York, 1997.
[12] M. Gerla, G. Pei, and X. Hong, “Lanmar: Landmark Routing for Large Scale Wireless Ad Hoc Networks with Group Mobility,” Proc. First IEEE/ACM Workshop Mobile Ad Hoc Networking and Computing (MobiHOC), Aug. 2000.
[13] S. Giordano and M. Hamdi, “Mobility Management: The Virtual Home Region,” EPFL DSC technical report, http://icwww.epfl.ch/publications/documents IC_TECH_RE PORT_199937.pdf, Mar. 2003.
[14] F. Glover, “Future Paths for Integer Programming and Links to Artificial Intelligence,” Computers and Operational Research, vol. 13, 1986.
[15] P. Gupta and P.R. Kumar, “The Capacity of Wireless Networks,” IEEE Trans. Information Theory, vol. 46, no. 2, Mar. 2000.
[16] P. Hansen, “The Steepest Ascent Mildest Descent Heuristic for Combinatorial Programming,” Proc. Congress Numerical Method in Combinatorial Programming, 1986.
[17] A. Harter and A. Hopper, “A New Location Technique for the Active Office,” IEEE Personal Comm., pp. 42-47, Oct. 1997.
[18] R. Ramanathan, I. Stavrakakis, B. McDonald, and C. Santivanez, “On the Scalability of Ad Hoc Routing Protocols. Part 2: Asymptotic Analysis with Respect to Traffic, Mobility, and Network Size,” ACM/IEEE Trans. Networking, to appear.
[19] R. Ramanathan, I. Stavrakakis, B. McDonald, and C. Santivanez, “On the Scalability of Ad Hoc Routing Protocols. Part 1: Making Link State Routing Scale,” ACM/IEEE Trans. Networking, to appear.
[20] A. Iwata, C.-C. Chiang, G. Pei, M. Gerla, and T.-W. Chen, “Scalable Routing Strategies for Ad-Hoc Wireless Networks,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, Aug. 1999.
[21] P. Jacquet, P. Muhlenthaler, and A. Qayyum, “Optimized Link State Routing Protocol,” Internet Draft, draft-ietf-manet-olsr-*.txt, work in progress.
[22] M. Jiang, J. Li, and Y. -C. Tay, “Cluster Based Routing Protocol Functional Specification,” Internet Draft, draft-ietf-manet-cbrp-spec*.txt, work in progress.
[23] B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom '00), Aug. 2000.
[24] J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris, “A Scalable Location Service for Geographic Ad Hoc Routing,” Proc. Mobicom '00, 2000.
[25] J. Li and P. Mohapatra, “LAKER: Location Aided Knowledge Extraction Routing for Mobile Ad Hoc Networks,” Proc. IEEE Wireless Comm. and Networking Conf. (WCNC '03), 2003.
[26] Mobile Ad-Hoc Networks (MANET) Working Group, http://www.ietf.org/html.chartersmanet-charter.html , 2004.
[27] S. Murthy and J.J. Garcia-Luna-Aveces, “An Efficient Routing Protocol for Wireless Networks,” ACM Mobile Networks and Applications J., special issue on routing in mobile communication networks, Oct. 1996.
[28] V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM '97, Apr. 1997.
[29] C.E. Perkins and E.M. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computer Systems and Applications (WMCSA '99), Feb. 1999.
[30] C.E. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector (dsdv) Routing for Mobile Computers,” Proc. ACM SIGCOMM '94, Aug. 1994.
[31] M.R. Perlman and Z.J. Haas, “Determining the Optimal Configuration for the Zone Routing Protocol,” IEEE J. Selected Areas in Comm., vol. 17, no. 8, Aug. 1999.
[32] N. Priyantha, A. Chakraborty, and H. Balakrishnan, “The Cricket Location-Support System,” Proc. Mobicom '00, 2000.
[33] R. Jain, A. Puri, and R. Sengupta, “Geographical Routing Using Partial Information for Wireless Ad Hoc Networks,” Proc. IEEE INFOCOM, 2001.
[34] S. Das, C. Perkins, and E. Royer, “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks,” Proc. IEEE INFOCOM, 2000.
[35] S. Giordano and M. Hamdi, “Mobility Management: The Virtual Home Region,” Technical report no. ssc/1999/037, EPFL-ICA, 1999.
[36] M. Takai, L. Bajaj, R. Ahuja, R. Bagrodia, and M. Gerla, “GloMoSim:A Scalable Network Simulation Environment,” Technical Report 990027, Univ. of California at Los Angeles, Computer Science Dept., 1999.
[37] Y. Ko and N. Vaidya, “Location-Aided Routing in Mobile Ad-Hoc Networks,” Proc. Fourth Ann. ACM/IEEE Int'l Conf. Mobile Computing and Networking (MobiCom '98), Aug. 1998.

Index Terms:
Restricted random waypoint, mobility model, ad hoc network, scalable routing, location-based routing method, robustness to location inaccuracy.
Citation:
Ljubica Blazevic, Jean-Yves Le Boudec, Silvia Giordano, "A Location-Based Routing Method for Mobile Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 4, no. 2, pp. 97-110, March-April 2005, doi:10.1109/TMC.2005.16
Usage of this product signifies your acceptance of the Terms of Use.