Noa Arad
ABSTRACT
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 he 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.
- C. Perkins and P. Bhagwat, "Highly dynamic destination-sequenced distance-vector routing (DSDV)for mobile computers," in ACM SIGCOMM'94 Conference on Communications Architectures, Protocols and Applications 1994, pp.234--244. Google Scholar
Digital Library
- C. Chiang, H. Wu, W. Liu, and M. Gerla, "Routing in clustered multihop, mobile wireless networks," in IEEE SICON'97 Apr. 1997, pp.197--211.Google Scholar
- C. Perkins and E. Royer, "Ad-hoc on-demand distance vector routing," in the 2nd IEEE Workshop on Mobile Computing Systems and Applications Feb.1999 ,pp.90--100. Google ScholarDigital Library
- D. Johnson and D. Maltz, Mobile Computing Kluwer Academic Publishers, 1996.Google Scholar
- M. Mauve, J. Widmer, and H. Hartenstein, "A survey on position-based routing in mobile ad hoc networks," IEEE Networks Mag., vol.15, no.6, pp.30--39,2001. Google ScholarDigital Library
- D. Johnson, "Routing in ad hoc networks of mobile hosts," in Workshop on Mobile Computing Systems and Applications Santa Cruz, CA, USA, 1994.Google Scholar
- S. Basagni, I. Chlamatac, V. Syrotiuk, and B. Wood, "A distance routing effect algorithm for mobility (DREAM)," in the 4th Annual ACM/IEEE Int. Conf. on Mobile Computing and Networking (MOBICOM) '98 Dallas, TX, USA, 1998, pp.76--84. Google ScholarDigital Library
- Y. Ko and N. H. Vaidya , "Location-aided routing (LAR)in mobile ad hoc networks," in Mobile Computing and Networking 1998, app.66--75. Google ScholarDigital Library
- I. Stojmenovic, "Position based routing in ad hoc networks," IEEE Commun. Mag., vol.40, no.7, pp.128--134, 2002. Google ScholarDigital Library
- I. Stojmenovic and X. Lin, "Loop-free hybrid single-path/flooding routing algorithms with guaranteed delivery for wireless networks," IEEE Trans. Parallel Dist. Sys., vol.12, no.10, pp.1023--32, 2001. Google ScholarDigital Library
- 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 Commun. Mag., pp.166--175, 2001. Google ScholarDigital Library
- E. Kranakis, H. Singh, and J. Urrutia, "Compass routing on geometric networks," in 11th Canadian Conference on Computational Geometry Vancouver, Canada, Aug.1999, pp. 51--54.Google Scholar
- F. Kuhn, R. Wattenhofer, and A. Zollinger, "Asymptotically optimal geometric mobile ad-hoc routing," in Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M), 2002, pp.24--33. Google ScholarDigital Library
- ---, "Worst-case optimal and average-case efficient geometric ad-hoc routing," in Proc. 4th ACM Int. Symposium on Mobile Ad-Hoc Networking and Computing (MobiHoc), 2003. Google ScholarDigital Library
- B. Karp and H. T. Kung, "Greedy perimeter stateless routing for wireless networks," in the 6th Annual ACM/IEEE Int. conf. on Mobile Computing and Networking (MobiCom 2000), Columbus, OH, USA, Aug. 2000, pp.243--254. Google ScholarDigital Library
- C. Lochert, H. Hartenstein, J. Tian, H. Fussler, D. Hermann, and M. Mauve, "A routing strategy for vehicular ad hoc networks in city environments," in IEEE Intelligent Vehicles Symposium 2003 Boston, MA, USA, June 2003.Google Scholar
- V. D. Park and M. S. Corson, "A highly adaptive distributed routing algorithm for mobile wireless networks," in INFOCOM 1997, pp.1405--1413. Google ScholarDigital Library
- J. Li, J. Jannotti, D. De Couto, D. Karger, and R. Morris,"A scalable loc tion service for geographic d-hoc routing," in Proceedings of the 6th ACM International Conference on Mobile Computing and Networking (MobiCom '00), Aug. 2000, pp.120--130. Google ScholarDigital Library
- D. S. J. De Couto and R. Morris, "Location proxies and intermediate node forw rding for practical geographic forwarding," MIT Laboratory for Computer Science, Tech. Rep. MIT-LCS-TR824, June 2001.Google Scholar
- Z. Haas and B. Liang, "Ad hoc mobility management with uniform quorum systems,"IEEE/ACM Trans. on Networking vol.7, no.2, pp. 228--240, 1999. Google ScholarDigital Library
- I. Stojmenovic, "A routing strategy and quorum based loc tion update scheme for d hoc wireless networks," Computer science, University of Ottawa, Tech.Rep.TR-99-09,1999.Google Scholar
- H. S.M. Das and Y. Hu, "Performance comparison of scalable loc tion services for geographic ad hoc routing."Google Scholar
- S. Giordano and M. Hami, "Mobility management: The virtual home region, EPFL, Tech. Rep.SSC/037,1999.Google Scholar
- 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. Google ScholarDigital Library
- B.Karp, "Geographic routing for wireless networks,"Ph.D. dissertation, Harvard University, Cambridge, MA, USA, Oct. 2000. Google ScholarDigital Library
- 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," in the 4th Annual ACM/IEEE Int. Conf. on Mobile Computing and Networking (MOBICOM) '98 Dallas, TX, USA, 1998, pp.85--97. Google ScholarDigital Library
- E. Royer, P. Melliar-Smith, and L. Moser, "An analysis of the optimum node density for ad hoc mobile networks," in IEEE Int. Conf. on Communications Helsinki, Finland, 2001.Google Scholar
- L. Zou, M. Lu,nd Z. Xiong, "A distributed algorithm for the dead end problem of location based routing in sensor networks," IEEE Transactions On Vehicular Technology vol.54, no.4, pp.1509--1522, July 2005.Google ScholarCross Ref
- J.Tian, I. Stepanov, and K. Rothermel, "Spatial aware geographic forwarding for mobile ad hoc networks," Stuttgart University, Tech. Rep., 2002.Google Scholar
Index Terms
- Minimizing recovery state In geographic ad-hoc routing
Recommendations
Geographic routing without location information
MobiCom '03: Proceedings of the 9th annual international conference on Mobile computing and networkingFor many years, scalable routing for wireless communication systems was a compelling but elusive goal. Recently, several routing algorithms that exploit geographic information (e.g. GPSR) have been proposed to achieve this goal. These algorithms refer ...
Minimizing Recovery State in Geographic Ad Hoc Routing
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 ...
A Survey of Secure Wireless Ad Hoc Routing
Ad hoc networks use mobile nodes to enable communication outside wireless transmission range. Attacks on ad hoc network routing protocols disrupt network performance and reliability. The authors survey the state of research and its challenges in this ...
Comments