An iterative algorithm for delay-constrained minimum-cost multicasting
IEEE/ACM Transactions on Networking (TON)
VanetMobiSim: generating realistic mobility patterns for VANETs
Proceedings of the 3rd international workshop on Vehicular ad hoc networks
Vehicular Mobility Simulation for VANETs
ANSS '07 Proceedings of the 40th Annual Simulation Symposium
Delay-bounded routing in vehicular ad-hoc networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Routing in Sparse Vehicular Ad Hoc Wireless Networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Vehicular Ad-hoc Networks(VANETs) can facilitate many applications such as road safety, intelligent transportation and advertising. These applications usually call for multi-hop data delivery from access points to moving vehicles with user specified delay requirements. However, most existing routing protocols for VANETs only focus on message forwarding from vehicles to access points or take no account of the delay constraint. In this paper, we focus on the development of a carry-and-forward scheme that delivers data from access points to vehicles. Utilizing the vehicle's trajectory obtained from the navigation system, we propose TaDB, a Trajectory-assisted Delay-Bounded Message Delivery Algorithm. To choose delivery route within delay constraint while minimizing transmission cost, TaDB uses a Cluster-Aware Link Delay Model to estimate link delay for both the Carry and the Forward strategies on each road segment. TaDB also leverages the vehicle's planned trajectory to estimate its future location. Simulation results show that TaDB can achieve a delivery ratio very close to optimal.