Skip to main content

Connectivity of Vehicular Ad Hoc Networks in Downtown Scenarios

  • Conference paper
Ad Hoc Networks (ADHOCNETS 2011)

Abstract

We study the connectivity in vehicular ad-hoc networks in a downtown scenario, where the mobility of vehicles is constrained on a lattice-shaped road network. We theoretically investigate the connectivity under the Poisson-positioning assumption, where vehicles are positioned according to a Poisson process on each road at any arbitrary instants. We find that the Poisson-positioning assumption allows the existence of the finite critical-vehicle density; that is, if (and only if) the density of vehicles is greater than the finite critical density, then there exists a large (theoretically infinite) cluster of vehicles and an arbitrary pair of vehicles in the cluster is connected in single or multiple hops. Under the Poisson-positioning assumption, we derive two approximation formulas for the critical density, which are given as a function of the transmission range of each vehicle and the distance between intersections. We also consider the connectivity under more realistic movement patterns of vehicles where the Poisson-positioning assumption does not hold. We numerically find that, even in non-Poisson-positioning cases, there exists the critical vehicle density, which is larger than the one under the Poisson-positioning assumption. The effectiveness of deploying roadside-relay stations to provide better connectivity between vehicles is also investigated.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Task 3: Identifying Intelligent Vehicle Safety Applications Enabled by DSRC - Interim Report (2003)

    Google Scholar 

  2. Aycin, M.F., Benekohal, R.F.: Comparison of car-following models for simulations. Transportation Research Record 1678, 116–127 (1999)

    Article  Google Scholar 

  3. Baccelli, F., Blaszczyszyn, B.: On a coverage process ranging from the boolean model to the poisson-voronoi tessellation with applications to wireless communications. Adv. Appl. Prob. 33, 293–323 (2001)

    MathSciNet  MATH  Google Scholar 

  4. Bechler, J., Storz, O., Franz, W., Wolf, L.: Efficient discovery of Internet gateways in vehicular communication systems. In: IEEE VTC 2003-Spring, pp. 965–969 (2003)

    Google Scholar 

  5. Dousse, O., Baccelli, F., Thiran, P.: Impact of interference on connectivity in Ad Hoc networks. IEEE/ACM Trans. Networking 13(2), 425–436 (2005)

    Article  Google Scholar 

  6. Dousse, O., Thiran, P., Hasler, M.: Connectivity in ad-hoc and hybrid networks. In: Proc. of the IEEE INFOCOM (2002)

    Google Scholar 

  7. Grimmett, G.R.: Percolation. Springer (1989)

    Google Scholar 

  8. Hall, P.: Introduction to the Theory of Coverage Processes. John Wiley & Sons (1988)

    Google Scholar 

  9. Harada, J., Shioda, S., Saito, H.: Path coverage properties of randomly deployed sensors with finite data-transmission ranges. Computer Networks 53(7), 1014–1026 (2008)

    Article  MATH  Google Scholar 

  10. Kesten, H.: The critical probability of bond percolation on the square lattice equals \(\frac{1}{2}\). Commun. Math. Phys. 74, 41–59 (1980)

    Article  MathSciNet  MATH  Google Scholar 

  11. Liu, B., Towsley, D.: A study on the coverage of large-scale sensor networks. In: Proc. of the First IEEE International Conference on Mobile Ad-hoc and Sensor Systems (2004)

    Google Scholar 

  12. Meester, R., Roy, R.: Continuum Percolation. Cambridge University Press (2004)

    Google Scholar 

  13. Namboodiri, V., Agarwal, M., Gao, L.: A study on the feasibility of mobile gateways for vehicular ad-hoc networks. In: VANET 2004 (2004)

    Google Scholar 

  14. Resta, G., Santi, P., Simon, J.: Analysis of multi-hop emergency propagation in vehicular ad hoc networks. In: Proc. of the ACM MobiHoc (2007)

    Google Scholar 

  15. Shioda, S., Harada, J., Watanabe, Y., Goi, T., Okada, H., Mase, K.: Fundamental characteristics of connectivity in vehicular ad hoc networks. In: Proc. of the IEEE PIMRC (2008)

    Google Scholar 

  16. Sormani, D., Turconi, G., Costa, P., Frey, D., Migliavacca, M., Mottola, L.: Towards lightweight information dissemination in inter-vehicular networks. In: Proc. of the VANET 2006 (2006)

    Google Scholar 

  17. Sun, Y., Belding-Royer, E.M., Perkins, C.E.: Internet connectivity for Ad-hoc mobile networks. International Journal of Wireless Information Networks 9(2), 75–88 (2002)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

About this paper

Cite this paper

Shioda, S. (2012). Connectivity of Vehicular Ad Hoc Networks in Downtown Scenarios. In: Simplot-Ryl, D., Dias de Amorim, M., Giordano, S., Helmy, A. (eds) Ad Hoc Networks. ADHOCNETS 2011. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 89. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-29096-1_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-29096-1_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-29095-4

  • Online ISBN: 978-3-642-29096-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics