Minimum end-to-end transmission delay based routing algorithm for VANETs

• Published in: 2017 9th International Conference on Advanced Infocomm Technology (ICAIT) pp. 176 - 181
• Main Authors: Peng, Shangxin, Chai, Rong, Chen, Qianbin, Qin, Yuanzheng
• Format: Conference Proceeding
• Language: English
• Published: IEEE 01.11.2017
• Subjects: Calculus; Delays; Dijkstra algorithm; Optimization; Relays; Routing; routing algorithm; stochastic network calculus; Stochastic processes; transmission delay; VANET; Vehicular ad hoc networks
• DOI: 10.1109/ICAIT.2017.8388910

Vehicular ad hoc networks (VANETs) are expected to offer both safety-related applications and user applications for vehicular users. In this paper, we consider a VANET scenario where one source vehicle (SV) tends to transmit real-time messages such as security related information to its destination vehicle (DV). We assume that the DV is out of the one hop range of the SV, and study the routing algorithm between the SV and DV. Stressing the importance of transmission delay, we formulate the end-to-end transmission delay between the SV and DV as the total transmission delay experienced at intermediate relay vehicles (RVs) along the transmission route, and design an optimization problem which minimizes the end-to-end transmission delay subject to routing selection constraints. To tackle the difficulties in evaluating the transmission performance of intermediate RVs, we apply stochastic network calculus theory. By modeling the stochastic arrival curve of the SV and the stochastic service curve of the RVs, the transmission delay at each intermediate RV can be examined. We then map the network scenario as a weighted graph and apply Dijkstra algorithm to obtain the optimal route between the SV and DV. Numerical results demonstrate the effectiveness of the proposed algorithm.