Nearly Optimal Probabilistic Coverage for Roadside Data Dissemination in Urban VANETs

Data disseminations based on Roadside Access Points (RAPs) in vehicular ad-hoc networks attract lots of attentions and have a promising prospect. In this paper, we focus on a roadside data dissemination, including three basic elements: RAP Service Provider (RSP), mobile vehicles and requesters. The RSP has deployed many RAPs at different locations in a city. A requester wants to rent some RAPs, which can disseminate their data to vehicles with some probabilities. Then, it tries to select the minimal number of RAPs to finish the data dissemination, in order to save the expenses. Meanwhile, the selected RAPs need to ensure that the probability of each vehicle receiving data successfully is no less than a threshold. We prove that this RAP selection problem is NP-hard, since it’s a meaningful extension of the classic Set Cover problem. To solve this problem, we propose a greedy algorithm and give its approximation ratio. Moreover, we conduct extensive simulations on real world data to prove its good performance.

[1]  Songwu Lu,et al.  Secure Incentives for Commercial Ad Dissemination in Vehicular Networks , 2012, IEEE Trans. Veh. Technol..

[2]  Mohsen Sardari,et al.  Infocast: A New Paradigm for Collaborative Content Distribution from Roadside Units to Vehicular Networks , 2009, 2009 6th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[3]  Guohong Cao,et al.  User-centric data dissemination in disruption tolerant networks , 2011, 2011 Proceedings IEEE INFOCOM.

[4]  Victor C. S. Lee,et al.  RSU-based real-time data access in dynamic vehicular networks , 2010, 13th International IEEE Conference on Intelligent Transportation Systems.

[5]  Baber Aslam,et al.  Optimal roadside units placement in urban areas for vehicular networks , 2012, 2012 IEEE Symposium on Computers and Communications (ISCC).

[6]  Jie Wu,et al.  Optimizing Roadside Advertisement Dissemination in Vehicular Cyber-Physical Systems , 2015, 2015 IEEE 35th International Conference on Distributed Computing Systems.

[7]  L. Freeman.  Centrality in social networks conceptual clarification , 1978 .

[8]  Chunxiao Chigan,et al.  On Secure VANET-Based Ad Dissemination With Pragmatic Cost and Effect Control , 2013, IEEE Transactions on Intelligent Transportation Systems.

[9]  Jaehoon Jeong,et al.  TSF: Trajectory-Based Statistical Forwarding for Infrastructure-to-Vehicle Data Delivery in Vehicular Networks , 2010, 2010 IEEE 30th International Conference on Distributed Computing Systems.

[10]  Yuguang Fang,et al.  A privacy-preserving social-assisted mobile content dissemination scheme in DTNs , 2013, 2013 Proceedings IEEE INFOCOM.

[11]  Jun Qin,et al.  POST: Exploiting Dynamic Sociality for Mobile Advertising in Vehicular Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[12]  Zhu Han,et al.  Self-Interest-Driven incentives for ad dissemination in autonomous mobile social networks , 2013, 2013 Proceedings IEEE INFOCOM.

[13]  Panos M. Pardalos,et al.  Greedy approximations for minimum submodular cover with submodular cost , 2010, Comput. Optim. Appl..

[14]  Chung-Ju Chang,et al.  A Cost-Effective Strategy for Road-Side Unit Placement in Vehicular Networks , 2012, IEEE Transactions on Communications.