Abstract

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.

Highlights

  • Vehicles have been proved to be very useful in sensing traffic data, road accidents, and surrounding information with their high mobility and wide coverage

  • 3.1 Objectives The objective of this paper is to develop an efficient multicopy unicast forwarding scheme for large data chunks in vehicular sensor networks

  • 7 Conclusions To solve the contradiction between the limited storage capacity and the large data size in the bulk-data dissemination, we propose the multiple knapsack-based solution which can achieve the local optimal in a distributed manner

Read more

Summary

Introduction

Vehicles have been proved to be very useful in sensing traffic data, road accidents, and surrounding information with their high mobility and wide coverage. We are the first to consider the multiple different data chunks forwarding optimization in the broadcast manner, an algorithm solving the bipartite matching with communication and storage capacity for data chunk, and relay vehicle assignment is proposed. It is not possible to calculate the optimal value of the TTL since it relies on many factors, such as the number of source-destination pairs, the size of the data file, the storage availability in relay vehicles, and encounter interval of vehicles. We consider a joint allocation of data chunks in the buffer of both vehicles to maximize the entire delivery possibility of all data without storage overflow It is like there are two knapsacks and we try to put items in them to achieve maximal value under the constraint of storage. The second step is that all the data chunks are re-arranged according to their delivery possibility in different vehicles as a multiple knapsack problem. In the multi-copy scenario, since the data copy with lower priority can be dropped, the storage allowance is the free space in the buffer and data chunks to be dropped

Multiple knapsack-based problem formulation
1: FOR the two encountering vehicles vi and vj DO 2
14: END FOR
Large data forwarding with capacity constraints in dense case
Method to solve assignment problem with two constraints
Simulation
Findings
Conclusions
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call