Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19] [ 20] [ 21] [ 22] [ 23] [ 24] [ 25]

@

Journal of Information Science and Engineering, Vol. 26 No. 3, pp. 817-832 (May 2010)

HarpiaGrid: A Geography-Aware Grid-based Routing Protocol for Vehicular Ad Hoc Networks*

KUONG-HO CHEN, CHYI-REN DOW, SHENG-CHANG CHEN, YI-SHIOU LEE AND SHIOW-FEN HWANG
Department of Information Engineering and Computer Science
Feng Chia University
Taichung, 407 Taiwan

Vehicular Ad Hoc Network (VANET) is a research field attracting growing attention. Current routing protocols in VANETs usually use route discovery to forward data packets to the destination. In addition, if vehicle density is low in the network, there might not be vehicles available to deliver the packet. This paper proposes HarpiaGrid, a geography-aware grid-based routing protocol for VANETs. The protocol uses map data to generate a shortest transmission grid route, effectively trades route discovery communication overhead with insignificant computation time. By restricting packets in grid sequences rather than blindly greedy search and making use of route cache approach, HarpiaGrid reduces many unnecessary transmissions, thus greatly improving routing efficiency. Moreover, in the route maintenance, this work proposes a local recovery scheme and uses backtracking techniques to generate a new grid forwarding route, providing superior fault-tolerance capability. Experiments were conducted, and the results demonstrated that the proposed scheme is indeed more efficient than other protocols.

Keywords: vehicular ad hoc networks, route discovery, grid sequences, fault-tolerance, route cache

Full Text () Retrieve PDF document (201005_06.pdf)

Received March 31, 2009; accepted September 30, 2009.
Communicated by Chih-Yung Chang, Chien-Chung Shen, Xuemin (Sherman) Shen, and Yu-Chee Tseng.
* This paper was partially supported by the National Science Council of R.O.C. under Contract No. NSC 96- 2221-E-035-036.