DocumentCode
2626093
Title
Minimum delay routing protocol for DTN-enabled VANETs
Author
Khan, Ajmal ; Kum, Dong-Won ; Nam, Jae-Choong ; Cho, You-Ze
Author_Institution
Sch. of Electr. Eng. & Comput. Scince, Kyungpook Nat. Univ., Daegu, South Korea
fYear
2012
fDate
15-17 Oct. 2012
Firstpage
534
Lastpage
538
Abstract
In vehicular ad hoc networks, the end-to-end path between the source and destination vehicle is not guaranteed due to frequent network partitioning caused by fast moving vehicles. For such sparse networks, Delay Tolerant Networks are proposed where a packet is carried by an intermediate vehicle until it meets with another vehicle or destination. This approach introduces variable amounts of delays in the networks. Therefore, an intelligent decision is required to select the next intermediate vehicle that can deliver a packet to the destination as soon as possible without any further delays. In this paper, we introduce a minimum delay routing protocol that utilizes the neighbor vehicles´ velocity and distance from destination information to calculate the delivery delay for intermediate vehicles. The performance of the proposed scheme is compared with FFRDV. Using an ns-2 simulation, we have verified that our scheme shows better performance and reduces end-to-end delay and average inter-meeting time by 70% as compared to FFRDV.
Keywords
delay tolerant networks; routing protocols; vehicular ad hoc networks; DTN-enabled VANET; delay tolerant networks; delivery delay; destination information; destination vehicle; end-to-end path; fast moving vehicles; frequent network partitioning; intelligent decision; intermediate vehicles; minimum delay routing protocol; neighbor vehicles velocity; ns-2 simulation; source vehicle; sparse networks; vehicular ad hoc networks; Delay; Protocols; Road transportation; Routing; Vehicles; DTN; State report; Store-carry-forward; VANET;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications (APCC), 2012 18th Asia-Pacific Conference on
Conference_Location
Jeju Island
Print_ISBN
978-1-4673-4726-6
Electronic_ISBN
978-1-4673-4727-3
Type
conf
DOI
10.1109/APCC.2012.6388251
Filename
6388251
Link To Document