Skip to main content
SpringerLink
Log in

Static Replication Strategies for Content Availability in Vehicular Ad-hoc Networks

  • Published:
Mobile Networks and Applications Aims and scope Submit manuscript

Abstract

This study investigates replication strategies for reducing latency to desired content in a vehicular peer-to-peer network. We provide a general constrained optimization formulation for efficient replication and study it via analysis and simulations employing a discrete random walk mobility model for the vehicles. Our solution space comprises of a family of popularity based replication schemes each characterized by an exponent n. We find that the optimal replication exponent depends significantly on factors such as the total system storage, data item size, and vehicle trip duration. With small data items and long client trip durations, n ∼ 0.5 i.e., a square-root replication scheme provides the lowest aggregate latency across all data item requests. However, for short trip durations, n moves toward 1, making a linear replication scheme more favorable. For larger data items and long client trip durations, we find that the optimal replication exponent is below 0.5. Finally, for these larger data items, if the client trip duration is short, the optimal replication exponent is found to be a function of the total storage in the system. Subsequently, the above observations are validated with two real data sets: one based on a city map with freeway traffic information and the other employing encounter traces from a bus network.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5
Figure 6
Figure 7
Figure 8
Figure 9
Figure 10
Figure 11
Figure 12
Figure 13
Figure 14
Figure 15
Figure 16

Similar content being viewed by others

Notes

  1. It is found that Zipf’s law controls many of the features observed with the Internet, primarily because of different user preferences for different files [3].

  2. A detailed technical report of this study is available as [22].

  3. In the analysis, the map is considered to be a torus to avoid border effects [21, 25].

  4. We use the term AutoMata and a vehicle (or car) interchangeably in this study, with the assumption that each vehicle is equipped with a single AutoMata device.

References

  1. Aldous D, Fill J (2008) Reversible markov chains and random walks on graphs. http://stat.www.berkeley.edu/users/aldous/RWG/book.html.

  2. Bararia S, Ghandeharizadeh S, Kapadia S (2004) Evaluation of 802.11a for streaming data in ad-hoc networks. In: Proc. of the 4th workshop on applications and services in wireless networks (ASWN), Boston, 8–11 August 2004

  3. Breaslau L, Cao P, Fan L, Phillips G, Shenker S (1999) Web Caching and Zipf-like Distributions: Evidence and Implications. In: Proc. of IEEE Infocom, pp 126–134, IEEE, Piscataway

    Google Scholar 

  4. Burgess J, Gallagher B, Jensen D, Levine B (2006) MaxProp: routing for vehicle-based disruption-tolerant networking. In: Proc. of IEEE Infocom, Barcelona, April 2006

  5. Cohen E, Shenker S (2002) Replication strategies in unstructured peer-to-peer networks. In: Proc. of ACM SIGCOMM. ACM, New York, pp 177–190

    Google Scholar 

  6. Dan A, Dias D, Mukherjee R, Sitaram D, Tewari R (1995) Buffering and caching in large-scale video servers. In: Proc. of COMPCON, San Francisco, 5–9 March 1995

  7. Ghandeharizadeh S, Helmi T (2003) An evaluation of alternative continuous media replication techniques in wireless peer-to-peer networks. In: Proc. of the 3rd international ACM workshop on data engineering for wireless and mobile access (MobiDE, in conjunction with MobiCom’03), San Diego, September 2003

  8. Ghandeharizadeh S, Kapadia S, Krishnamachari B (2004) PAVAN: a policy framework for content availabilty in vehicular ad-hoc networks. In: VANET ’04: Proc. of the 1st ACM international workshop on Vehicular ad hoc networks, Philadelphia, PA, USA. ACM, New York, NY, USA, pp 57–65. doi:10.1145/1023875.1023885

    Chapter  Google Scholar 

  9. Ghandeharizadeh S, Kapadia S, Krishnamachari B (2006) An evaluation of availability latency in carrier-based wehicular ad-hoc networks. In: Proc. of the 5th ACM international workshop on Data engineering for wireless and mobile access. ACM, New York, pp 75–82

    Chapter  Google Scholar 

  10. Ghandeharizadeh S, Krishnamachari B (2004) C2P2: a peer-to-peer network for on-demand automobile information services. In: Proc. of the 1st international workshop on grid and peer-to-peer computing impacts on large scale heterogeneous distributed database systems (Globe’04), San Francisco, September 2004

  11. Ghandeharizadeh S, Krishnamachari B, Song S (2004) Placement of continuous media in wireless peer-to-peer networks. IEEE Trans Multimedia 6:335–342

    Article  Google Scholar 

  12. IEEE 802.16 Working Group (2004) Emerging IEEE 802.16 WirelessMAN standards for broadband wireless access. Intel Technol J 8(3)

  13. Hara T (2001) Effective replica allocation in ad hoc networks for improving data accessibility. In: Proc. of IEEE Infocom. IEEE, Piscataway, pp 1568–1576

    Google Scholar 

  14. Hara T (2002) Replica allocation in ad hoc networks with periodic data update. In: Proc. of the 3rd international conference on mobile data management(MDM). IEEE Computer Society, Washington, DC, pp 79–86

    Chapter  Google Scholar 

  15. Hara T (2003) Replica allocation methods in ad hoc networks with data update. ACM/Kluwer J Mob Netw Appl(MONET) 8(4):343–354

    Article  MathSciNet  Google Scholar 

  16. Hara T (2005) Location management of data items in mobile ad hoc networks. In: Proc. of the 2005 ACM symposium on applied computing (SAC). ACM, New York, pp 1174–1175

    Chapter  Google Scholar 

  17. Hara T (2005) Strategies for data location management in mobile ad hoc networks. In: Proc. of IEEE international conference on parallel and distributed systems (ICPADS), Minneapolis, 12–15 July 2006

  18. Hara T, Madria S (2004) Dynamic data replication using aperiodic updates in mobile ad-hoc networks. In: Proc. of international conference on database systems for advanced applications (DASFAA), Jeju Island, 17–19 March 2004, pp 869–881

  19. Hara T, Loh Y-H, Nishio S (2003) Data replication methods based on the stability of radio links in ad hoc networks. In: Proc. of international workshop on mobility in databases and distributed systems (MDDS), pp 969–973

  20. Hayashi H, Hara T, Nishio S (2005) A replica allocation method adapting to topology changes in ad hoc networks. In: Proc. of international conference on database and expert systems applications (DEXA)

  21. Jindal A, Psounis K (2006) Performance analysis of epidemic routing under contention. In: Proc. of international conference on communications and mobile computing. ACM, New York, pp 539–544

    Google Scholar 

  22. Kapadia S, Krishnamachari B, Ghandeharizadeh S (2006) Static replication strategies for content availability in vehicular ad-hoc networks. Technical report, University of Southern California

  23. Lochert C, Hartenstein H, Tian J, Fler H, Hermann D, Mauve M (2003) A routing strategy for vehicular ad hoc networks in city environments. In: Proc. of the IEEE intelligent vehicles symposium, Columbus, June 2003, pp 156–161

  24. California Department of Transportation (2008) Caltrans. http://www.dot.ca.gov/

  25. Spyropoulous A, Psounis K, Raghavendra C (2004) Single-copy routing in intermittently connected mobile networks. In: Proc. of IEEE SECON

  26. Sun W, Yamaguchi H, Kusumoto S (2006) A study on performance evaluation of real-time data transmission on vehicular ad hoc networks. In: Proc. of the 7th international conference on mobile data management (MDM), p 126

  27. Wolf J, Yu P, Shachnai H (1995) DASD dancing: a disk load blanacing optimization scheme for video-on-demand computer. In: Proc. of ACM SIGMETRICS. May pp 157–166

  28. Zipf GK (1935) The psychobiology of language. Houghton-Mifflin, Boston

Download references

Acknowledgements

This research was supported by NSF grants numbered CNS-0347621 (CAREER), CNS-0435505 (NeTS NOSS), National Library of Medicine LM07061-01, IIS-0307908, and an unrestricted cash gift from Microsoft Research.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Southern California, Los Angeles, CA, 90089, USA

    Shyam Kapadia, Bhaskar Krishnamachari & Shahram Ghandeharizadeh

  2. Department of Electrical Engineering, University of Southern California, Los Angeles, CA, 90089, USA

    Bhaskar Krishnamachari

Authors
  1. Shyam Kapadia
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bhaskar Krishnamachari
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shahram Ghandeharizadeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shyam Kapadia.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kapadia, S., Krishnamachari, B. & Ghandeharizadeh, S. Static Replication Strategies for Content Availability in Vehicular Ad-hoc Networks. Mobile Netw Appl 14, 590–610 (2009). https://doi.org/10.1007/s11036-008-0120-y

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11036-008-0120-y

Keywords

Search

Navigation