Popularity-based probabilistic data deployment in vehicular ad-hoc networks

In vehicular ad-hoc networks (VANETs), moving vehicles carry data and exchange it as they pass each other. Storage in a vehicle, in other words, the amount of saved data is limited resource in general. Therefore, attributes of data that should be carried by vehicles is an important factor in order to efficiently disseminate desired data. In this paper, we focus on popularity of data and propose probabilistic data deployment based on its popularity. The proposed method deploys the data to vehicles randomly according to its relative popularity. By this simple operation, data can be deployed inside a vehicular network and as a result, data with high popularity tends to have larger number of copies inside the network than lower-popularity data. Performance evaluation shows that our deployment can work well in limited storage.

[1]  Mimoza Durresi,et al.  Emergency Broadcast Protocol for Inter-Vehicle Communications , 2005, 11th International Conference on Parallel and Distributed Systems (ICPADS'05).

[2]  Martin Mauve,et al.  Decentralized discovery of free parking places , 2006, VANET '06.

[3]  Li Fan,et al.  Web caching and Zipf-like distributions: evidence and implications , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[4]  Hao Wu,et al.  MDDV: a mobility-centric data dissemination algorithm for vehicular networks , 2004, VANET '04.

[5]  Lars Wischhof,et al.  Information dissemination in self-organizing intervehicle networks , 2005, IEEE Transactions on Intelligent Transportation Systems.

[6]  Liviu Iftode,et al.  A Comparative Study of Data Dissemination Models for VANETs , 2006, 2006 3rd Annual International Conference on Mobile and Ubiquitous Systems - Workshops.

[7]  Ashish Agarwal,et al.  An Information Propagation Scheme for VANETs , 2005 .