scispace - formally typeset
Open AccessProceedings ArticleDOI

Trajectory-assisted delay-bounded routing with moving receivers in vehicular ad-hoc networks

Reads0
Chats0
TLDR
This paper proposes TaDB, a Trajectory-assisted Delay-Bounded Message Delivery Algorithm, a carry-and-forward scheme that delivers data from access points to vehicles that leverages the vehicle's planned trajectory to estimate its future location.
Abstract
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.

read more

Citations
More filters
Journal ArticleDOI

TPD: Travel Prediction-based Data Forwarding for light-traffic vehicular networks

TL;DR: This paper proposes Travel Prediction-based Data forwarding (TPD), tailored and optimized for multihop vehicle-to-vehicle communications, and significantly outperforms existing legacy schemes in a variety of road network settings.
Journal ArticleDOI

On Trajectory-Based I2V Group Message Delivery Over Vehicular Ad-Hoc Networks

TL;DR: The trajectory-based I2V group message delivery problem's NP-hardness is proved and the worst-case performance bound and time complexity of eTGMD are theoretically analyzed.
Journal ArticleDOI

An Efficient Traffic Geographic Static-Node-Assisted Routing in VANET

TL;DR: This paper presents an efficient traffic geographic routing (ETGR) with static node assistance, which includes road information collection, road weight information dissemination, the efficient Traffic geographic routing and the duration estimation of the path.
Proceedings ArticleDOI

Reliable Data Delivery in Vehicular Ad Hoc Networks

TL;DR: The proposed Reliable Data Delivery scheme for VANETs operates in the following two phases: identification of forwarding zone and expected zone and establishing the connectivity between source and destination vehicle in the expected zone for the reliable data delivery.
Proceedings ArticleDOI

A minimum delay link scheduling algorithm in vehicular ad-hoc networks

TL;DR: This paper modeled the information transmission delay minimization of the VANETs in which cooperative transmission is allowed, and proposed a gradient projection algorithm based on the model that not only has good convergence, but also can solve the MRTDM in VANets.
References
More filters

Epidemic routing for partially-connected ad hoc networks

TL;DR: This work introduces Epidemic Routing, where random pair-wise exchanges of messages among mobile hosts ensure eventual message delivery and achieves eventual delivery of 100% of messages with reasonable aggregate resource consumption in a number of interesting scenarios.
Journal ArticleDOI

Routing in Sparse Vehicular Ad Hoc Wireless Networks

TL;DR: This paper uses empirical vehicle traffic data measured on 1-80 freeway in California to develop a comprehensive analytical framework to study the disconnected network phenomenon and its network characteristics, and shows that, depending on the sparsity of vehicles or the market penetration rate of cars using Dedicated Short Range Communication technology, the network re-healing time can vary from a few seconds to several minutes.
Proceedings ArticleDOI

VanetMobiSim: generating realistic mobility patterns for VANETs

TL;DR: VanetMobiSim mobility description is validated by illustrating how the interaction between featured macro- and micro-mobility is able to reproduce typical phenomena of vehicular traffic.
Proceedings ArticleDOI

Vehicular Mobility Simulation for VANETs

TL;DR: VanetMobiSim is presented and described, a freely available generator of realistic vehicular movement traces for networks simulators, and validated by illustrating how the interaction between featured macro- and micro-mobility is able to reproduce typical phenomena of vehicular traffic.
Journal ArticleDOI

An iterative algorithm for delay-constrained minimum-cost multicasting

TL;DR: The bounded shortest multicast algorithm (BSMA) is presented for constructing minimum-cost multicast trees with delay constraints and simulation results are provided showing that BSMA can achieve near-optimal cost reduction with fast execution.
Related Papers (5)