This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Minimizing Recovery State in Geographic Ad Hoc Routing
February 2009 (vol. 8 no. 2)
pp. 203-217
ASCII Text
x 
 
Noa Arad, Yuval Shavitt, "Minimizing Recovery State in Geographic Ad Hoc Routing," IEEE Transactions on Mobile Computing, vol. 8, no. 2, pp. 203-217, February, 2009.
 
 
BibTex
x
 
@article{ 10.1109/TMC.2008.86,
author = {Noa Arad and Yuval Shavitt},
title = {Minimizing Recovery State in Geographic Ad Hoc Routing},
journal ={IEEE Transactions on Mobile Computing},
volume = {8},
number = {2},
issn = {1536-1233},
year = {2009},
pages = {203-217},
doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2008.86},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Mobile Computing
TI - Minimizing Recovery State in Geographic Ad Hoc Routing
IS - 2
SN - 1536-1233
SP203
EP217
EPD - 203-217
A1 - Noa Arad,
A1 - Yuval Shavitt,
PY - 2009
KW - Distributed networks
KW - Algorithm/protocol design and analysis
VL - 8
JA - IEEE Transactions on Mobile Computing
ER -
 
Noa Arad, Tel Aviv University, Tel Aviv
Yuval Shavitt, Tel Aviv University, Tel Aviv
Geographic ad hoc networks use position information for routing. They often utilize stateless greedy forwarding and require the use of recovery algorithms when the greedy approach fails. We propose a novel idea based on virtual repositioning of nodes that allows to increase the efficiency of greedy routing and significantly increase the success of the recovery algorithm based on local information alone. We explain the problem of predicting dead ends which the greedy algorithm may reach and bypassing voids in the network, and introduce NEAR, Node Elevation Ad-hoc Routing, a solution that incorporates both virtual positioning and routing algorithms that improve performance in ad-hoc networks containing voids. We demonstrate by simulations the advantages of our algorithm over other geographic ad-hoc routing solutions.

[1] C. Perkins and P. Bhagwat, “Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for Mobile Computers,” Proc. ACM SIGCOMM '94, pp. 234-244, 1994.
[2] C. Chiang, H. Wu, W. Liu, and M. Gerla, “Routing in Clustered Multihop, Mobile Wireless Networks,” Proc. IEEE Singapore Int'l Conf. Networks (SICON '97), pp. 197-211, Apr. 1997.
[3] C. Perkins and E. Royer, “Ad-Hoc On-Demand Distance Vector Routing,” Proc. Second IEEE Workshop Mobile Computing Systems and Applications (WMCSA '99), pp. 90-100, Feb. 1999.
[4] D. Johnson and D. Maltz, Mobile Computing. Kluwer Academic Publishers, 1996.
[5] M. Mauve, J. Widmer, and H. Hartenstein, “A Survey on Position-Based Routing in Mobile Ad Hoc Networks,” IEEE Networks Magazine, vol. 15, no. 6, pp. 30-39, 2001.
[6] D. Johnson, “Routing in Ad Hoc Networks of Mobile Hosts,” Proc. Workshop Mobile Computing Systems and Applications (WMCSA), 1994.
[7] S. Basagni, I. Chlamatac, V. Syrotiuk, and B. Wood, “A Distance Routing Effect Algorithm for Mobility (DREAM),” Proc. ACM MobiCom '98, pp. 76-84, 1998.
[8] Y. Ko and N.H. Vaidya, “Location-Aided Routing (LAR) in Mobile Ad Hoc Networks,” Mobile Computing and Networking, pp. 66-75, 1998.
[9] X. Lin, M. Lakshdisi, and I. Stojmenovic, “Location Based Localized Alternate, Disjoint, Multipath and Component Routing Schemes for Wireless Networks,” Proc. ACM MobiHoc '01, pp. 287-290, Oct. 2001.
[10] Z. Haas and B. Liang, “Ad Hoc Mobility Management with Uniform Quorum Systems,” IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 228-240, 1999.
[11] I. Stojmenovic, “A Routing Strategy and Quorum Based Location Update Scheme for Ad Hoc Wireless Networks,” Technical Report TR-99-09, Computer Science Dept., Univ. of Ottawa, 1999.
[12] J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris, “A Scalable Location Service for Geographic Ad-Hoc Routing,” Proc. ACM MobiCom '00, pp. 120-130, Aug. 2000.
[13] S. Das, H. Pucha, and Y. Hu, “Performance Comparison of Scalable Location Services for Geographic Ad Hoc Routing,” Proc. IEEE INFOCOM, 2005.
[14] S. Giordano and M. Hami, “Mobility Management: The Virtual Home Region,” Technical Report SSC/037, EPFL, 1999.
[15] I. Stojmenovic, “Position Based Routing in Ad Hoc Networks,” IEEE Comm. Magazine, vol. 40, no. 7, pp. 128-134, 2002.
[16] I. Stojmenovic and X. Lin, “Loop-Free Hybrid Single-Path/Flooding Routing Algorithms with Guaranteed Delivery for Wireless Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 10, pp. 1023-1032, Oct. 2001.
[17] L. Blazevic, L. Buttyan, S. Capkun, S. Giordano, J. Hubaux, and J.L. Boudec, “Self-Organization in Mobile Ad Hoc Networks: The Approach of Terminodes,” IEEE Comm. Magazine, pp. 166-175, 2001.
[18] D.S.J. De Couto and R. Morris, “Location Proxies and Intermediate Node Forwarding for Practical Geographic Forwarding,” Technical Report MIT-LCS-TR824, MIT Laboratory for Computer Science, June 2001.
[19] J. Tian, I. Stepanov, and K. Rothermel, “Spatial Aware Geographic Forwarding for Mobile Ad Hoc Networks,” technical report, Stuttgart Univ., 2002.
[20] P.F. Tsuchiya, “The Landmark Hierarchy: A New Hierarchy for Routing in Very Large Networks,” Proc. Symp. Comm. Architectures and Protocols (SIGCOMM '88), pp. 35-42, 1988.
[21] G. Pei, M. Gerla, and X. Hong, “Lanmar: Landmark Routing for Large Scale Wireless Ad Hoc Networks with Group Mobility,” Proc. MobiHoc '00, pp. 11-18, 2000.
[22] B. Chen and R. Morris, “L+: Scalable Landmark Routing and Address Lookup for Multi-Hop Wireless Networks,” Technical Report 837, MIT Laboratory for Computer Science, 2002.
[23] S. Du, A. Khan, S. PalChaudhuri, A. Post, A.K. Saha, P. Druschel, D.B. Johnson, and R. Riedi, “Safari: A Self-Organizing Hierarchical Architecture for Scalable Ad Hoc Networking,” Ad Hoc Networks J., 2007.
[24] E. Kranakis, H. Singh, and J. Urrutia, “Compass Routing on Geometric Networks,” Proc. 11th Canadian Conf. Computational Geometry (CCCG '99), pp. 51-54, Aug. 1999.
[25] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Asymptotically Optimal Geometric Mobile Ad-Hoc Routing,” Proc. Workshop Discrete Algorithms and Methods for Mobile Computing and Comm. (Dial-M '02), pp. 24-33, 2002.
[26] F. Kuhn, R. Wattenhofer, and A. Zollinger, “Worst-Case Optimal and Average-Case Efficient Geometric Ad-Hoc Routing,” Proc. ACM MobiHoc, 2003.
[27] P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, “Routing with Guaranteed Delivery in Ad Hoc Wireless Networks,” Wireless Networks, vol. 7, no. 6, pp. 609-616, 2001.
[28] B. Karp and H.T. Kung, “Greedy Perimeter Stateless Routing for Wireless Networks,” Proc. ACM MobiCom '00, pp. 243-254, Aug. 2000.
[29] L. Zou, M. Lu, and Z. Xiong, “A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks,” IEEE Trans. Vehicular Technology, vol. 54, no. 4, pp.1509-1522, July 2005.
[30] Q. Fang, J. Gao, and L.J. Guibas, “Locating and Bypassing Holes in Sensor Networks,” Mobile Networks and Applications, vol. 11, no. 2, pp. 187-200, 2006.
[31] C. Lochert, H. Hartenstein, J. Tian, H. Fussler, D. Hermann, and M. Mauve, “A Routing Strategy for Vehicular Ad Hoc Networks in City Environments,” Proc. IEEE Intelligent Vehicles Symp. (IVS'03), June 2003.
[32] V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM '97, pp. 1405-1413, 1997.
[33] N. Arad, “Minimizing Recovery State in Geographic Ad-Hoc Routing,” master's thesis, School of Electrical Eng., Tel Aviv Univ., May 2007.
[34] B. Karp, “Geographic Routing for Wireless Networks,” PhD dissertation, Harvard Univ., Oct. 2000.
[35] P. Santi, “The Critical Transmitting Range for Connectivity in Mobile Ad Hoc Networks,” IEEE Trans. Mobile Computing, vol. 4, no. 3, pp. 310-317, 2005.
[36] 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. ACM MobiCom '98, pp. 85-97, 1998.
[37] E. Royer, P. Melliar-Smith, and L. Moser, “An Analysis of the Optimum Node Density for Ad Hoc Mobile Networks,” Proc. IEEE Int'l Conf. Comm. (ICC), 2001.
[38] Y.J. Kim, R. Govindan, B. Karp, and S. Shenker, “Practical and Robust Geographic Routing in Wireless Networks,” Proc. Second Int'l Conf. Embedded Networked Sensor Systems (SenSys '04), pp.295-296, 2004.
[39] B. Bollobas, Random Graphs. Cambridge Univ. Press, 1985.
[40] K. Xu, Y. Tian, and N. Ansari, “TCP-Jersey for Wireless IP Communications,” IEEE J. Selected Areas in Comm., vol. 22, no. 4, pp. 747-756, 2004.
[41] R. Igarashi, K. Takahata, N. Uchida, and Y. Shibata, “Packet Loss Rate Control for Continuous Media over Heterogeneous Network,” Proc. 18th Int'l Conf. Advanced Information Networking and Application (AINA), 2004.
[42] J. Eriksson, M. Faloutsos, and S. Krishnamurthy, “Scalable Ad Hoc Routing: The Case for Dynamic Addressing,” Proc. IEEE INFOCOM, pp. 1108-1119, 2004.
[43] D. Chen and P.K. Varshney, “A Survey of Void Handling Techniques for Geographic Routing in Wireless Networks,” IEEE Comm. Surveys and Tutorials, vol. 9, no. 1, pp. 50-67, 2007.

Index Terms:
Distributed networks, Algorithm/protocol design and analysis
Citation:
Noa Arad, Yuval Shavitt, "Minimizing Recovery State in Geographic Ad Hoc Routing," IEEE Transactions on Mobile Computing, vol. 8, no. 2, pp. 203-217, Feb. 2009, doi:10.1109/TMC.2008.86
Usage of this product signifies your acceptance of the Terms of Use.