Browse > Article

An Enhanced Greedy Message Forwarding Protocol for High Mobile Inter-vehicular Communications  

Jang, Hyun-Hee (Gimje of Korea PolytechnicV College)
Yu, Suk-Dae (Dept. of Computer Science, Purdue University)
Park, Jae-Bok (Division of EIE, Chonbuk National University, (CAIIT))
Cho, Gi-Hwan (Division of EIE, Chonbuk National University, (CAIIT))
Publication Information
Abstract
Geo-graphical routing protocols as GPSR are known to be very suitable and useful for vehicular ad-hoc networks. However, a corresponding node can include some stale neighbor nodes being out of a transmission range, and the stale nodes are pone to get a high priority to be a next relay node in the greedy mode. In addition, some useful redundant information can be eliminated during planarization in the recovery mode. This paper deals with a new recovery mode, the Greedy Border Superiority Routing(GBSR), along with an Adaptive Neighbor list Management(ANM) scheme. Each node can easily treat stale nodes on its neighbor list by means of comparing previous and current Position of a neighbor. When a node meets the local maximum, it makes use of a border superior graph to recover from it. This approach improve the packet delivery ratio while it decreases the time to recover from the local maximum. We evaluate the performance of the proposed methods using a network simulator. The results shown that the proposed protocol reveals much better performance than GPSR protocol. Please Put the of paper here.
Keywords
Greedy Border Superiority Routing; Greedy Forwarding; Adaptive Neighbor List Management; Vehicle Ad-hoc Networks;
Citations & Related Records
연도 인용수 순위
  • Reference
1 유석대, 조기환, '차량동위그릅을 이용한 차량간 긴급메시지 전파방법,' 한국정보과학회 논문지, 34 (5), pp. 340-347, 2007. 10
2 Mobile Ad Hoc Network Working Group, http://www.ietf.org/html.charters/manet-charter.html
3 B. Karp and H. T. Kung, 'GPSR : Greedy Perimeter Stateless Routing for Wireless Networks,' in proc. of ACM/IEEE MOBICOM'00, Aug. 2000, pp.243-254
4 F. Kuhn, R. Wattenhofer, et al., 'Asymptotically Optimal Geometric Mobile Ad-hoc Routing,' in proc. of the 6th ACM DIALM'02, 2002, pp.24-33
5 Y. J. Kim, R. Govindan, B. Karp and S. Shenker, 'Geographic Routing Made Practical,' in proc. of the 2nd NSDI'05, 2005
6 B. Leong, B. Liskov and R. Morris, 'Geographic Routing without Planarization,' in proc. of the 3rd Symposium on Networked Systems Design & Implementation, 2006, pp. 339-352
7 C. Lochert, M. Mauve and H. Fubler, 'Geographic Routing in City Scenarios,'Mobile Computing and Communications Review, l.9 (1), 2004, pp.69-72
8 E. Kranakis, H. Singh and J. Urrutia, 'Compass Routing on Geometric Networks,' in proc. of the 11th Canadian Conference on Computational Geometry, 1999, pp.51-54
9 Generic Mobility Simulation Framework, http://polar9.ethz.ch/gmsf/
10 P. Sommer, 'Design and Analysis of Realistic Mobility Models for Wireless Mesh Networks,' Master Thesis of ETH, Zurich, Sep. 2007
11 Y. J. Kim, R. Govindan, B. Karp and S. Shenker, 'On the Pitfalls of Geographic Routing,' in proc. of the 3rd DIALM-POMC, Sep. 2005, pp.34-43
12 Y. J. Kim, R. Govindan, B. Karp and S. Shenker, 'Lazy Cross-Link Removal for Geographic Routing,' in proc. of the 4th International Conference on Embedded Networked Sensor Systems'06, Oct. 2006
13 The Network Simulator, ns-2, http://www.isi.edu/nsnam/ns/
14 Wireless Access for Vehicular Environment,http://www.standards.its.dot.gov/fact_sheet.asp
15 IETF, 'Optimized Link State Routing,' RFC 3626, Oct. 2003
16 C. Xing, C. Lu, R. Pless et al, 'On Greedy Geographic Routing Algorithms in Sensing Covered Networks,' in proc. of ACM Mobihoc'04, May. 2004, pp.31-42
17 K. C. Lee, J. Haerri, U. Lee and M. Gerla, 'Enhanced Perimeter Routing for Geographic Forwarding Protocols in Urban Vehicular Scenarios,' in proc. of Globecom Workshop'07. Nov. 2007, pp.1-10
18 G. Toussaint, "The Relative Neighborhood Graph of a Finite Planar Set," in Pattern Recognition, 12 (4), pp.261-268, 1980   DOI   ScienceOn
19 K. R. Gabriel and R. R. Sokal, "A New Statistical Approach to Geographic Variation Analysis," in Systematic Zoology, Vol. 18, pp.259-278, 1969   DOI   ScienceOn
20 IETF, 'Ad Hoc On-demand Distance Vector Routing,' RFC 3561, Jul. 2003
21 T. Camp, J. Boleng and L. Wilcox, 'Location Information Services in Mobile Ad Hoc Networks,' in proc. of the IEEE ICC'02, 2002, pp. 3318-3324   DOI
22 F. Kuhn, R. Wattenbofer, Y. Zhong and A. Zollinger, 'Geometric Ad-hoc Routing: of Theory and Practice,' in proc. of the 23rd ACM Symposium on Principles of Distributed Computing'03, Jul. 2003
23 IETF, 'The Dynamic Source Routing Protocol for Mobile Ad Hoc Network for IPv4,' RFC 4728, Feb. 2007