Browse > Article

Blind Detouring Problem in Geographic Routing for Wireless Ad-hoc Networks  

Na, Jong-Keun (서울대학교 컴퓨터공학과)
Kim, Chong-Kwon (서울대학교 컴퓨터공학과)
Publication Information
Journal of KIISE:Information Networking / v.33, no.6, 2006 , pp. 428-437 More about this Journal
Abstract
Wireless ad-hoc routing has been extensively studied and many clever schemes have been proposed over the last several years. One class of ad-hoc routing is geographic routing where each intermediate node independently selects the next hop using the given location information of destination. Geographic routing, which eliminates the overhead of route request packet flooding, is scalable and suitable for large scale ad hoc networks. However, geographic routing may select the long detour paths when there are voids between a source and a destination. In this paper, we propose a novel geographic routing approach called Geographic Landmark Routing(GLR). GLR recursively discovers the intermediate nodes called landmarks and constructs sub-paths that connect the subsequent landmarks. Simulation results on various network topologies show that GLR significantly improves the performance of geographic routing.
Keywords
Geographic Routing; Geographic Landmark Routing(GLR); Face Routing;
Citations & Related Records
연도 인용수 순위
  • Reference
1 F. Kuhn, R. Wattenhofer, and A. Zollinger, 'Worst-Case Optimal and Average-Case Efficient Geometric Mobile Ad-Hoc Routing,' In Proc. 4th Int. Symposium on Mobile Ad-Hoc Networking and Computing (Mobihoc), 2003   DOI
2 B. Karp and H. Kung, 'GPSR: Greedy Perimeter Stateless Routing for wireless networks,' in Proceedings of the Sixth Annual ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom 2000), 2000   DOI
3 F. Kuhn, R. Wattenhofer, and A. Zollinger, 'Asymptotically Optimal Geometric Mobile Ad-Hoc Routing,' In Proc. 6th Int. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (Dial-M), pages 24-33. ACM Press, 2002   DOI
4 Ananth Rao, Sylvia Ratnasamy, Christos Papadimitriou, Scott Shenker and Ion Stoica, 'Geographic Routing without Location Information,' MOBICOM 2003   DOI
5 P. Bose, P. Morin, I. Stojmenovic, and J. Urrutia, 'Routing with guaranteed delivery in ad hoc wireless networks,' In Proc. Of 3rd ACM Intl. Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications DIAL M99, pages 48-55, 1999   DOI
6 M. Mauve, J. Widmer, and H. Hartenstein, 'A survey on position-based routing in mobile ad hoc networks,' IEEE Network Magazine, 15(6):30--39, November 2001   DOI   ScienceOn
7 J. Li, J. Jannotti, D. DeCouto, D. Karger, and R. Morris, 'A scalable location service for geographic ad-hoc routing,' in Proc. 6th Annu. ACM/IEEE International Conference on Mobile Computing and Networking (Mobicom 2000), 2000   DOI
8 S. Ratnasamy, B. Karp, L. Yin, F. Yu, D. Estrin, R. Govindan, and S. Shenker, 'GHT: A geographic hash table for data-centric storage in sensornets,' in 1st ACM International Workshop on Wireless Sensor Networks and Applications (WSNA), 2002, pages 78-87   DOI
9 ns Notes and Documentation. http://www.isi.edu/vint/nsnam/, 2000
10 Qing Fang, Jie Gao, Leonidas J. Guibas, 'Locating and Bypassing Routing Holes in Sensor Networks', INFOCOM 2004
11 Ljubica Blazevic, Jean-Yves Le Boudec, and Silvia Giordano, 'A Location-Based Routing Method for Mobile Ad Hoc networks,' IEEE Transtions on Mobile Computing, Vol. 4, No. 2, March/April 2005   DOI   ScienceOn