scholarly journals Delivery Delay Analysis for Roadside Unit Deployment in Vehicular Ad Hoc Networks With Intermittent Connectivity

2016 ◽  
Vol 65 (10) ◽  
pp. 8591-8602 ◽  
Author(s):  
Yu Wang ◽  
Jun Zheng ◽  
Nathalie Mitton
2019 ◽  
Vol 47 (6) ◽  
pp. 20180494 ◽  
Author(s):  
D. Saravanan ◽  
S. Janakiraman ◽  
K. Chandraprabha ◽  
T. Kalaipriyan ◽  
R. S. Raghav ◽  
...  

2017 ◽  
Vol 2017 ◽  
pp. 1-9 ◽  
Author(s):  
Haigang Gong ◽  
Lingfei Yu

Plenty of multimedia contents such as traffic images, music, and movies pose great challenges for content downloading due to the high mobility of vehicles and intermittent connectivity for vehicular ad hoc networks. Roadside units or APs can improve the efficiency of content downloading but with the cost of large investments. In this paper, an efficient content downloading scheme is proposed with the assistance of parking clusters, which are formed by roadside parked cars. After receiving the downloading request, the parking clusters, which the downloader will travel through according to the estimated trajectory, will make a download scheduling for the downloader. Then the downloader acquires the content chunks while it drives through the parking clusters. Simulation results show that the proposed scheme achieves better performance than intervehicle approach and RSU based approach.


2018 ◽  
Vol 7 (3.12) ◽  
pp. 57
Author(s):  
Asha K S ◽  
Rajeshwari Hegde

Some Inherent Vehicular Ad Hoc Networks (VANETs) characteristics such as intermittent connectivity, highly dynamic topology, and hard delay constraints, make data communication a challenging task in these networks. Due to such peculiarities, in this paper we study the impact of using vehicles predicted locations as a metric for data communication in VANETs. This paper deals with PBERR (Parameter Based Efficient Reliable Routing) for VANETs, which is a multilevel routing algorithm. The focus of this algorithm is 100% data transmission from end to end with no loss or drop of data packets by selecting the reliable path. The proposed algorithm will use the data of the digital maps to limit the scope of message exchanges in the shortest path for vehicles between source and destination. Our results clearly demonstrate the efficiency of the proposed solution in different scenarios, especially in terms of Network throughput, Energy consumption and Average delay. 


Sign in / Sign up

Export Citation Format

Share Document