Optimal Content Downloading in Vehicular Networks

Malandrino, Francesco; Casetti, Claudio; Chiasserini, Carla-Fabiana; Fiore, Marco

doi:10.1109/tmc.2012.115

Cited by 74 publications

(53 citation statements)

References 26 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Ref. [16] uses dynamic network topology graph to model the content downloading problem in vehicular networks. However, it needs the preemptive knowledge of vehicular trajectories and perfect scheduling of data transmissions, which is impractical in highly dynamical VANET since DNTG will become very complicated.…”

Section: Related Workmentioning

confidence: 99%

On multi-copy forwarding protocols for large data chunk dissemination in vehicular sensor networks

Liu

Ding

et al. 2018

J Wireless Com Network

View full text Add to dashboard Cite

Moving vehicles have been sensing all kinds of data on the road in which multimedia data possesses a large portion. These data is often forwarded to vehicles in a region of interest or the monitoring center in an opportunistic manner. With respect to the large volume content, the storage space of relay vehicles is becoming the bottleneck of achieving higher performance, e.g., a data chunk may be rejected or dropped due to insufficient storage of intermediate vehicles.Thus, previous work that only focuses on the delivery metric without considering the data size is not likely to work efficiently in the proposed scenario. As deploying stationary infrastructures is of very large cost and not feasible everywhere, in this paper, we focus on the inter-vehicle data forwarding problem with storage and communication capacity constraints. First, we considered the situation when the vehicles are distributed sparsely. The multi-copy routing challenge is modeled as a multiple knapsack problem. Then, it is extended to a dense scenario. An optimization to the broadcast data forwarding is investigated. With the real data trace, the experiments show that our scheme achieves better performance than the competitors in terms of delay and delivery ratio. A better balance between duplication and performance is also achieved by the multi-copy algorithm.

show abstract

Section: Related Workmentioning

confidence: 99%

On multi-copy forwarding protocols for large data chunk dissemination in vehicular sensor networks

Liu

Ding

et al. 2018

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

“…They can download contents from the Internet via the edge of the cloud, RoadSide Units (RSUs). A good user experience can be achieved within the coverage of RSUs which is about 300-1300 m. 12 However, in highway scenarios, RSUs are mainly deployed at service areas or gas stations which are [8][9][10][11][12][13][14][15][16] km apart. It is impossible to expect a high number of well-deployed RSUs due to cost restrictions and high maintenance overhead.…”

Section: Introductionmentioning

confidence: 99%

An optimal multiple stopping rule–based cooperative downloading scheme in vehicular cyber-physical systems

Jing

Zeng

Jin

et al. 2017

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

In vehicular cyber-physical systems, vehicular users are the edge nodes which are far away from the network core. Content accessing and downloading for vehicular users are expected to heavily rely on the deployment of RoadSide Units in vehicular cyber-physical systems. Although vehicular users can obtain a good content downloading service in the coverage of RoadSide Units, user experience will get worse in highway scenarios, where RoadSide Units are sparsely deployed at service areas or gas stations. In other words, the download process has a property of intermittent connectivity because many no-signal areas (dark areas) exist on the road. In this article, we try to address such shortcomings by exploiting other edge nodes (vehicles) to download contents for clients in dark areas. Considering the cooperation intention of vehicles, we first propose an incentive mechanism to stimulate vehicles to participate in cooperative downloading. Next, with an objective of maximizing the utilization of benefits, we formulate the cooperative vehicle selection problem as an optimal multiple stopping problem and derive the optimal multiple stopping rule for cooperative downloading. Finally, an extensive simulation study has been performed to investigate the effectiveness of our scheme. The results reveal the impact of different parameters on system requirements and demonstrate that the proposed scheme can maximize the throughput of content downloading in dark areas.

show abstract

“…That is, whenever a node (event source) has some information such as road accidents and traffic congestion, it can use the vehicular network to broadcast the information to all vehicles in a region efficiently. Meanwhile, the proper placement of RSUs is crucial for the new generation ITS applications, such as content downloading [6][7][8] and content distribution [9][10][11]. In a word, the overall performance can be improved by placing additional RSUs in the vehicular networks.…”

Section: Introductionmentioning

confidence: 99%

Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc Networks

Huang

Liu

2015

International Journal of Distributed Sensor Networks

View full text Add to dashboard Cite

The placement of roadside units (RSUs) is a difficult and yet important issue in vehicular networks. If too few RSUs are placed, the system performance would be very poor. However, with too many RSUs, it would incur high installation cost and maintenance cost of these RSUs. In this paper, we study the problem of delay bounded roadside unit placement (DRP) in vehicular networks. For a given delay bound, our objective is to place the minimal number of RSUs in the system such that a message from any of RSUs in the region can be disseminated to all vehicles within the given delay bound. We consider two cases of RSUs, the case that all RSUs are interconnected through wired lines (called DRP-L problem) and the case that RSUs connect to other RSUs through wireless link (called DRP-W problem). We first prove that both DRP-L and DRP-W problems are NP-hard. Then, we propose several heuristic algorithms to solve DRP-L and DRP-W problems, respectively. Extensive simulations have been conducted to show that the performance of our proposed methods is superior to the other methods.

show abstract

Optimal Content Downloading in Vehicular Networks

Cited by 74 publications

References 26 publications

On multi-copy forwarding protocols for large data chunk dissemination in vehicular sensor networks

On multi-copy forwarding protocols for large data chunk dissemination in vehicular sensor networks

An optimal multiple stopping rule–based cooperative downloading scheme in vehicular cyber-physical systems

Delay Bounded Roadside Unit Placement in Vehicular Ad Hoc Networks

Contact Info

Product

Resources

About