• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.16 no.1
• /
• pp.703-712
• /
• 2015

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.