Browse > Article

Forwarding Protocol Along with Angle Priority in Vehicular Networks  

Yu, Suk-Dea (삼성탈레스)
Lee, Dong-Chun (호원대학교 국방과학기술대학)
Publication Information
Convergence Security Journal / v.10, no.1, 2010 , pp. 41-48 More about this Journal
Abstract
Greedy protocols show good performance in Vehicular Ad-hoc Networks (VANETs) environment in general. But they make longer routes causing by surroundings or turn out routing failures in some cases when there are many traffic signals which generate empty streets temporary, or there is no merge roads after a road divide into two roads. When a node selects the next node simply using the distance to the destination node, the longer route is made by traditional greedy protocols in some cases and sometimes the route ends up routing failure. Most of traditional greedy protocols just take into account the distance to the destination to select a next node. Each node needs to consider not only the distance to the destination node but also the direction to the destination while routing a packet because of geographical environment. The proposed routing scheme considers both of the distance and the direction for forwarding packets to make a stable route. And the protocol can configure as the surrounding environment. We evaluate the performance of the protocol using two mobility models and network simulations. Most of network performances are improved rather than in compared with traditional greedy protocols.
Keywords
Greedy Border Superiority Routing; Adaptive Neighbor List Management; Vehicle Ad-hoc Networks;
Citations & Related Records
연도 인용수 순위
  • Reference
1 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
2 The Network Simulator-ns-2, http://www.isi.edu/nsnam/ns/.
3 Generic Mobility Simulation Framework, http://polar9.ethz.ch/gmsf/.
4 P. Sommer, "Design and Analysis of Realistic Mobility Models for Wireless Mesh Networks", Master Thesis of ETH Zurich, Sep. 2007.
5 T. Camp, J. Boleng, and L. Wilcox, "Location Information Services in Mobile Ad Hoc Networks", in proc. of the IEEE International Conference on Communications 2002, pp. 3318-3324, 2002.
6 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 2003, Jul. 2003.
7 E. Kranakis, H. Singh, and J. Urrutia, "Compass Routing on Geometric Networks", in proc. of the 11th Canadian Conference on Computational Geometry, pp. 51-54, 1999.
8 IETF, "Optimized Link State Routing", RFC 3626, http://www.ietf.org/rfc/rfc3626.txt.
9 G. Toussaint, "The Relative Neighborhood Graph of a Finite Planar Set", in Pattern Recognition, Vol. 12, No.4. pp. 261-268, 1980.   DOI   ScienceOn
10 IETF, "Ad Hoc On-demand Distance Vector Routing", RFC 3561, http://www.ietf.org/rfc/rfc3561.txt.
11 IETF, "The Dynamic Source Routing Protocol for Mobile Ad Hoc Network for IPv4", RFC 4728, http://www.ietf.org/rfc/rfc4728.txt.
12 Wireless Access for Vehicular Environment, http://www.standards.its.dot.gov/fact_sheet.asp?f=80.
13 B. Karp and H. T. Kung, "GPSR : Greedy Perimeter Stateless Routing for Wireless Networks", in proc. of ACM/IEEE MOBICOM 2000, pp. 243-254, Aug. 2000.
14 C. Xing, C. Lu, R. Pless et al., "On Greedy Geographic Routing Algorithms in Sensing Covered Networks", in proc. of ACM Mobihoc, 2004, pp. 31-42, May 2004.
15 F. Kuhn and R. Wattenhofer et al., "Asymptotically Optimal Geometric Mobile Ad-hoc Routing", in proc. of the 6th ACM DIALM 2002, pp. 24-33, 2002.
16 Mobile Ad Hoc Network Working Group, http://www.ietf.org/html.charters/manet-charter.html.
17 Vehicle Safety Communication Consortium Official Web-site, http://www-nrd.nhtsa.dot.gov/pdf/nrd-12/CAMP3/pages/VSCC.htm.