skip to main content
research-article

Roadcast: a popularity aware content sharing scheme in VANETs

Published: 12 March 2010 Publication History

Abstract

Content sharing through vehicle-to-vehicle communication can help people find their interested content on the road. In VANETs, due to limited contact duration time and the unreliable wireless connection, a vehicle can only get the useful data when it meets the vehicle which has the exactly matching data. However, the probability of such cases is very low. To improve the performance of content sharing in intermittently connected VANETs, we propose a novel P2P content sharing scheme called Roadcast. Roadcast relaxes user's query requirement a little bit so that each user can have more chances to get the requested content quickly. Furthermore, Roadcast ensures popular data is more likely to be shared with other vehicles so that the performance of overall query delay can be improved. Roadcast consists of two components called popularity aware content retrieval and popularity aware data replacement. The popularity aware content retrieval scheme makes use of Information Retrieval (IR) techniques to find the most relevant data towards user's query, but significantly different from IR techniques by taking the data popularity factor into consideration. The popularity aware data replacement algorithm ensures that the density of different data is proportional to the square-root of their popularity in the system steady state, which firmly obeys the optimal "square-root" replication rule [6]. Results based on real city map and real traffic model show that Roadcast outperforms other content sharing schemes in VANETs.

References

[1]
Groovenet (hybrid-network simulator for vehicular networks). http://www.seas.upenn.edu/ rahulm/research/groovenet/.
[2]
Ns2 (the network simulator). http://www.isi.edu/nsnam/ns.
[3]
U.S. Census Bureau. Tiger, tiger/line and tiger-related products, http://www.census.gov/geo/www/tiger/.
[4]
J. Burgess, B. Gallagher, D. Jensen, and B.N. Levine. Maxprop: routing for vehicle-based disruption-tolerant networks. IEEE INFOCOM, pages 1--11, April 2006.
[5]
P. Cao and S. Irani. Cost-aware www proxy caching algorithms. USENIX Symposium on Internet Technology and Systems, pages 193--206, 1997.
[6]
E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. SIGCOMMComput. Commun. Rev., 32(4):177--190, 2002.
[7]
T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein. Introduction to Algorithms. The MIT Press, Cambridge, Massachusetts London, England, the second edition edition, 2001.
[8]
S. Das, A. Nandan, G. Pau, M. Sanadidi, and M. Gerla. SPAWN: A Swarming Protocol For Vehicular Ad-Hoc Wireless Networks. In ACM VANET, 2004.
[9]
D. Gerlough and M. Huber. Traffic flow theory - a monograph. Special Report 165, Transporation Reseaerch Board, 1975.
[10]
S. Ghandeharizade, S. Kapadia, and B. Krishnamachari. Pavan: a policy framework for content availabilty in vehicular ad-hoc networks. In ACM VANET, pages 57--65, 2004.
[11]
M. Guo, M. Ammar, and E. Zegura. V3: A vehicle-to-vehicle live video streaming architecture. In IEEE PerCom, 2005.
[12]
S. Helal, N. Desai, and V. Verma. Konark: a service discovery and delivery protocol for adhoc networks. In IEEE WCNC, 2003.
[13]
RDF Core Working Group http://www.w3.org/RDF/.
[14]
Web Services Description Language (WSDL) Version 2.0 http://www.w3.org/TR/wsdl20.
[15]
B. Hull, V. Bychkovsky, Y. Zhang, K. Chen, M. Goraczko, A. Miu, E. Shih, H. Balakrishnan, and S. Madden. Cartel: a distributed mobile sensor computing system. In ACM SenSys, 2006.
[16]
J. Jeong, S. Guo, Y. Gu, T. He, and D. Du. Tbd: trajectory-based data forwarding for light-traffic vehicular networks. In IEEE ICDCS, pages 215--222, 2009.
[17]
S. Jin and A. Bestavros. Popularity-aware greedydual-size web proxy caching algorithms. In IEEE ICDCS, 2000.
[18]
M. Johnson, L. De Nardis, and K. Ramchandran. Collaborative content distribution for vehicular ad hoc networks. In Allerton Conference Communication, Control, and Computing, September 2006.
[19]
D. Lee, H. Chuang, and K.Seamons. Document ranking and the vector-space model. IEEE Software, 14(2):67--75, 1997.
[20]
U. Lee, E. Magistretti, M. Gerla, P. Bellavista, and A. Corradi. Dissemination and harvesting of urban data using vehicular sensing platforms. IEEE Transactions on Vehicular Technology, 2009.
[21]
U. Lee, J. Park, J. Yeh, G. Pau, and M. Gerla. Code torrent: content distribution using network coding in VANET. In ACM MobiShare, 2006.
[22]
U. Lee, J.-S. Park, E. Amir, and M. Gerla. Fleanet: a virtual market place on vehicular networks. IEEE Transactions on Vehicular Technology, September.
[23]
Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-topeer networks. In International Conference on Supercomputing, pages 84--95, 2002.
[24]
A. Nandan, S. Dasand, G. Pau, M. Gerla, and M. Sanadidi. Co-operative downloading in vehicular ad-hoc wireless networks. In IEEE/IFIP WONS, pages 19--21, 2005.
[25]
A. Nandan, S. Tewari, S. Das, M. Gerla, and L. Kleinrock. AdTorrent: delivering location cognizant advertisements to car networks. In IEEE/IFIP WONS, January 2006.
[26]
P. Raghavan. Information retrieval algorithms: a survey. In ACM-SIAM symposium on Discrete algorithms (SODA), pages 11--18, 1997.
[27]
H. Shen, Z. Li, T. Li, and Y. Zhu. Pird: P2pbased intelligent resource discovery in internetbased distributed systems. In IEEE ICDCS, pages 858--865, 2008.
[28]
N. Wisitpongphan, F. Bai, P. Mudalige, V. Sadekar, and O. Tonguz. Routing in sparse vehicular ad hoc wireless networks. IEEE Journal on Selected Areas in Communications (JSAC), Oct. 2007.
[29]
H. Wu, R. Fujimoto, R. Guensler, and M. Hunter. Mddv: a mobility-centric data dissemination algorithm for vehicular networks. In ACM VANET, pages 47--56, 2004.
[30]
W.H. Yuen, R.D. Yates, and S.-C. Mau. Exploiting data diversity and multiuser diversity in noncooperative mobile infostation networks. IEEE INFOCOM, pages 2218--2228, 2003.
[31]
Y. Zhang, J. Zhao, and G. Cao. On scheduling vehicle-roadside data access. In ACM VANET, pages 9--18, 2007.
[32]
Y. Zhang, J. Zhao, and G. Cao. Roadcast: a popularity aware content sharing scheme in vanets. In IEEE ICDCS, pages 223--230, 2009.
[33]
J. Zhao and G. Cao. VADD: vehicle-assisted data delivery in vehicular ad hoc networks. IEEE Transactions on Vehicular Technology, 57(3):1910--1922, May 2008.
[34]
J. Zhao, Y. Zhang, and G. Cao. Data pouring and buffering on the road: a new data dissemination paradigm for vehicular ad hoc networks. IEEE Transactions on Vehicular Technology, 56(6):3266--3277, Nov. 2007.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMOBILE Mobile Computing and Communications Review
ACM SIGMOBILE Mobile Computing and Communications Review  Volume 13, Issue 4
October 2009
58 pages
ISSN:1559-1662
EISSN:1931-1222
DOI:10.1145/1740437
Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 12 March 2010
Published in SIGMOBILE Volume 13, Issue 4

Check for updates

Qualifiers

  • Research-article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 09 Feb 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media