While home users can easily retrieve all kinds of contents onto their laptops or smartphones, vehicular users are constrained by intermittent connectivity to roadside units (RSUs). In this paper, we propose a cooperative downloading mechanism in homogeneous vehicular networks. In this mechanism, RSUs act as traffic managers to fetch proper data from the Internet and then distribute to vehicles in an approximately optimal manner. Specifically, based on vehicular mobility prediction and inter-node throughput estimation, a storage time aggregated graph (STAG) is constructed for planning transmission scheme, then an iterative greedy-driven algorithm is designed for deriving a suboptimal solution. Simulation results show that our approach can reduce 5% ∼ 20% downloading time in an uniform distributed deployment scenario where the spacing between RSUs is not greater than 1500m.
Cooperative Downloading in Vehicular Networks: A Graph-Based Approach
2018-06-01
355258 byte
Conference paper
Electronic Resource
English
TIBKAT | 2025
|