Journal of the Korea Academia-Industrial cooperation Society (한국산학기술학회논문지)

The Korea Academia-Industrial cooperation Society (한국산학기술학회)
권호 표지
DOI QR코드

DOI QR Code

Design of UIGRP(Urban Intersection based Geographic Routing Protocol) considering the moving direction and density of vehicles

차량 이동 방향과 밀집도를 고려한 UIGRP(Urban Intersection based Geographic Routing Protocol) 설계

  • 이병관 (가톨릭관동대학교 컴퓨터학과) ;
  • 정은희 (강원대학교 지역경제학과)
  • Received : 2014.08.08
  • Accepted : 2015.01.08
  • Published : 2015.01.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper proposes the UIGRP, which can tackle the problem of the network disconnection and packet transmission delay caused by turning vehicles frequently in an urban intersection. The UIGRP was designed as follows. First, it calculates the direction of vehicles using the moving direction of vehicles and the location of a destination. Second, it makes the RSU measure the density of an urban intersection. Third, the TGF Algorithm in the UIGRP decides the data transmission paths by setting as an intermediate node, not only the vehicle that is moving in the direction where a destination node is located, but also the node that has the highest density. The TGF algorithm using a moving direction and density minimizes or removes the occurrence of local maximum problems that the existing Greedy Forwarding algorithm has. Therefore, the simulation result shows that UIGRP decreases the occurrence of local maximum problems by 3 and 1 times, and the packet transmission time by 6.12 and 2.04(ms), and increases the success rate of packet transmission by 15 and 3%, compared to the existing GPSR and GPUR.

본 논문에서는 도심 교차로에서 차량들의 빈번한 방향전환으로 인해 발생하는 네트워크 단절과 패킷 전송 지연 문제를 해결할 수 있는 UIGRP을 제안한다. UIGRP는 첫째, 차량의 이동방향과 목적지의 위치를 이용해 Direction을 산출하고, 둘째, RSU가 도심 교차로의 밀집도를 측정하도록 설계한다. 그리고 셋째, 목적지 노드가 위치한 방향으로 이동하는 차량이면서 밀집도가 가장 높은 곳에 위치하는 노드를 중간 노드로 선정하여 데이터 전송 경로를 선정하는 TGF알고리즘을 설계한다. TGF 알고리즘은 이동방향과 밀집도를 이용해 기존의 Greedy Forwarding 알고리즘이 갖는 local maximum 문제들의 발생을 최소화시키거나 제거한다. 시뮬레이션 결과, UIGRP는 기존의 GPSR과 GPUR보다 local maximum 문제 발생 횟수를 평균 3회, 1회 감소하고, 패킷전송시간도 평균 6.12(ms), 2.04(ms) 단축시켰으며, 패킷전송성공률은 15%, 3% 증가하였다.

Keywords

References

  1. Eun-Young Kang, "Node ID-based Service Discovery for Mobile Ad Hoc Ketwork", Journal of The Korea Society of Computer and Information, Vol.14, No.12, pp.109-117, Dec. 2009
  2. Jae Soo Kim and Jeong Hong Kim, "Distance Ratio based Probabilistic Broadcasting Mechanism in Mobile Ad Hoc Network", Journal of The Korea Society of Computer and Information, Vol.15, No.12, pp75-83, Dec. 2010 DOI: http://dx.doi.org/10.9708/jksci.2010.15.12.075
  3. Young-Bae Ko, Nitin H. Faiday, "Location-aided routing (LAR) in mobile ad hoc networks," Wireless netowrks, Vol.6, No.4, pp307-321, 2000 https://doi.org/10.1023/A:1019106118419
  4. B. Karp and H. T. Kung, "GPSR : Greedy Perimeter Stateless Routing for Wireless Network", in proc. of ACM/IEEE MOBICOM 2000, pp.243-254, Aug. 2000. DOI: http://dx.doi.org/10.1145/345910.345953
  5. B. Karp, "Geographic Routing forWireless Networks," Harvard University, 2000
  6. JooSang Youn, "Virtual Location Information based Routing Scheme in Wireless Ad-Hoc Network," Journal of The Korea Society of Computer and Information, Vol.18, No.2, pp.77-85, Feb. 2013 DOI: http://dx.doi.org/10.9708/jksci.2013.18.2.077
  7. Dae-Hee Kim, Sun-Sin An, "Research and Trends about VANET Routing," Korea Information and Communications Society(Information and Communications Magazine), Vol.30, No.5, pp.95-105, April 2013.
  8. Sunghyun cho, Seokwoo Kim, "Routing Algorithm of VANET for an Efficient Path Management in Urban Intersections," Journal of Korea Information and Communications Society, Vol.38A, No.12, pp.1054-1060, Dec. 2013. DOI: http://dx.doi.org/10.7840/kics.2013.38A.12.1054
  9. Min-Woo Ryu, Si-Ho Cha, Kuk-Hyun Cho,, "A Vehicle Communication Routing Algorithm Considering Road Characteristics and 2-Hop Neighbors in Urban Areas", Journal of Korea Information and Communications Society, Vol.36, No.5 pp.464-475, May 2011. DOI: http://dx.doi.org/10.7840/KICS.2011.36B.5.464
  10. Min-Woo Ryu, Si-Ho Cha, Kuk-Hyun Cho, "An Enhanced Greedy Message Forwarding Protocol for Increasing Reliablity of Mobile Inter-Vehicle Communication", Journal of The Institute of Electronics Engineering of Korea, Vol.47-TC, No.4, pp.43-50, April 2010.
  11. Witt, M. and V. Turau., "The Impact of Location Errors on Geographic Routing in Sensor Networks," in Proc. of the International Multi-Conference on Computing in the Global Information Technology, pp.76, 2006.
  12. Chia-Chang Hsu and Chin-Laung Lei, "Firework Search for Location Aided Routing Enhancement in Mobile Ad-Hoc Networks," in Proc. of the 8th ACM International Workshop on Mobility Management and Wireless Access, pp.121-124, 2010. DOI: http://dx.doi.org/10.1145/1868497.1868519
  13. Hexa Software Development Center, "Geographical Distance Calculations", Available From: http://www.zipcodeworld.com (accessed Jun., 30, 2014)