Journal of the Institute of Electronics Engineers of Korea TC (대한전자공학회논문지TC)

The Institute of Electronics and Information Engineers (대한전자공학회)
권호 표지

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))
  • 장현희 (한국폴리텍V대학 김제캠퍼스 정보통신시스템과) ;
  • 유석대 (퍼듀대학교 전산학과) ;
  • 박재복 (전북대학교 전자정보공학부(영상정보신기술연구센터)) ;
  • 조기환 (전북대학교 전자정보공학부(영상정보신기술연구센터))
  • Published : 2009.03.25
Download PDF
⟨ Previous Next ⟩

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.

차량으로 구성된 애드 혹 네트워크에는 GPSR과 같은 지리기반 라우팅 프로토콜이 매우 적합하고 유용한 것으로 알려져 있다. 그러나 전송 범위를 벗어난 stale 노드를 이웃노드로 유지할 수 있으며, 탐욕모드의 정책에 의해서 stale 노드가 다음 릴레이 노드로 선정되는 우선순위가 높은 문제점이 있다. 또한 유용한 정보들이 복구모드의 평탄화 과정중에 제거될 수 있다. 본 논문은 적응적 이웃노드 리스트 관리기법(ANM)과 새로운 복구모드를 위한 탐욕 경계우위 라우팅(GBSR) 방안을 제안한다. 각 노드는 임의 이웃의 이전과 현재의 위치를 비교 반영함으로써 이웃노드 리스트상의 stale 노드 문제를 해결한다. 어떤 노드가 로컬최대(local maximum)에 직면하면 경계우위 그래프를 이용하여 복구한다. 따라서 제안된 복구모드는 패킷 전달율을 높이는 반면에 복구에 소요되는 시간을 줄인다. 네트워크 시뮬레이션을 이용하여 성능을 분석한 결과 제안된 프로토콜의 성능이 GPSR보다 우수한 것으로 평가되었다.

Keywords

References

  1. 유석대, 조기환, '차량동위그릅을 이용한 차량간 긴급메시지 전파방법,' 한국정보과학회 논문지, 34 (5), pp. 340-347, 2007. 10
  2. Wireless Access for Vehicular Environment,http://www.standards.its.dot.gov/fact_sheet.asp
  3. Mobile Ad Hoc Network Working Group, http://www.ietf.org/html.charters/manet-charter.html
  4. IETF, 'Ad Hoc On-demand Distance Vector Routing,' RFC 3561, Jul. 2003
  5. IETF, 'Optimized Link State Routing,' RFC 3626, Oct. 2003
  6. IETF, 'The Dynamic Source Routing Protocol for Mobile Ad Hoc Network for IPv4,' RFC 4728, Feb. 2007
  7. 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
  8. 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
  9. 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
  10. Y. J. Kim, R. Govindan, B. Karp and S. Shenker, 'Geographic Routing Made Practical,' in proc. of the 2nd NSDI'05, 2005
  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. 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
  14. C. Lochert, M. Mauve and H. Fubler, 'Geographic Routing in City Scenarios,'Mobile Computing and Communications Review, l.9 (1), 2004, pp.69-72
  15. 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
  16. 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 https://doi.org/10.1109/ICC.2002.997446
  17. 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
  18. 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
  19. G. Toussaint, "The Relative Neighborhood Graph of a Finite Planar Set," in Pattern Recognition, 12 (4), pp.261-268, 1980 https://doi.org/10.1016/0031-3203(80)90066-7
  20. K. R. Gabriel and R. R. Sokal, "A New Statistical Approach to Geographic Variation Analysis," in Systematic Zoology, Vol. 18, pp.259-278, 1969 https://doi.org/10.2307/2412323
  21. The Network Simulator, ns-2, http://www.isi.edu/nsnam/ns/
  22. Generic Mobility Simulation Framework, http://polar9.ethz.ch/gmsf/
  23. P. Sommer, 'Design and Analysis of Realistic Mobility Models for Wireless Mesh Networks,' Master Thesis of ETH, Zurich, Sep. 2007