DIR: diagonal-intersection-based routing protocol for vehicular ad hoc networks |
| |
Authors: | Yuh-Shyan Chen Yun-Wei Lin Ci-Yi Pan |
| |
Affiliation: | (1) Institute of Learning Technology, National Hualien University of Education, Hualien, 970, Taiwan;(2) Department of Computer Science and Engineering, National Sun Yat-Sen University, Kaohsiung, 804, Taiwan;(3) Department of Computer Science and Engineering, National Taitung University, Taitung, 950, Taiwan |
| |
Abstract: | In this paper, we present a diagonal-intersection-based routing (DIR) protocol for vehicular ad hoc networks. The DIR protocol
constructs a series of diagonal intersections between the source and destination vehicles. The DIR protocol is a geographic
routing protocol. Based on the geographic routing protocol, source vehicle geographically forwards data packet toward the
first diagonal intersection, second diagonal intersection, and so on, until the last diagonal intersection, and finally geographically
reach to the destination vehicle. For given a pair of neighboring diagonal intersections, two or more disjoint sub-paths exist
between them. The novel property of DIR protocol is the auto-adjustability, while the auto-adjustability is achieved that
one sub-path with low data packet delay, between two neighboring diagonal intersections, is dynamically selected to forward
data packets. To reduce the data packet delay, the route is automatically re-routed by the selected sub-path with lowest delay.
The proposed DIR protocol allows the mobile source and destination vehicles in the urban VANETs. Experimental results show
that the DIR protocol outperforms existing solutions in terms of packet delivery ratio, data packet delay, and throughput. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|