Skip to main content

Theoretical Proving of Optimal Communication Radius Against Traffic Congestion in Simplified

  • Conference paper
  • First Online:
  • 1405 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 10689))

Abstract

Different from the traditional traffic network, the connected vehicles enable information exchange with each other in vicinity, resulting in potentially reshaping the propagation process of traffic congestion from the perspective of a widespread spatial correlation. The communication radius as the determinant in interconnecting vehicles undoubtedly should be optimally adjusted to maximize the utility in a varying context. The communication radius heavily determines the perception range of traffic information, and accordingly affects traffic congestion evolution. Intuitively, the length of communication radius poses positive effects on the mitigation of traffic congestion due to the enlarged range of exchanged traffic information. This paper aims to model the traffic-congestion evolution in a simplified abstraction of connected vehicles, and especially focuses on investigating the effects of communication radius on the traffic congestion. We theoretically formulate the relation between the communication radius and the traffic congestion in a lattice space, and then prove the optimal value of traffic congestion available against the communication radius. Both the numerical analysis and simulation results show that the connected vehicles can effectively improve the traffic congestion, however, the incremental enlargement of the communication radius fails to relieve traffic congestion further as the originally envisioned if already reaching to an optimal value that we theoretically deduce in this work.

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

Buying options

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 EPUB and 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

Learn about institutional subscriptions

References

  1. Sun, G., Liu, Y., Zhang, J., Wang, A., Zhou, X.: Node selection optimization for collaborative beamforming in wireless sensor networks. Ad Hoc Netw. 37, 389–403 (2016)

    Article  Google Scholar 

  2. Brandes, U.: On variants of shortest-path betweenness centrality and their generic computation. Soc. Netw. 30(2), 136–145 (2008)

    Article  Google Scholar 

  3. Sundarapandian, V.: Queueing theory. In: Probability, Statistics and Queueing Theory. PHI Learning, New Delhi (2009)

    Google Scholar 

  4. Lakas, A., Cheqfah, M.: Detection and dissipation of road traffic congestion using vehicular communication. In: 2009 Mediterrannean Microwave Symposium (MMS), pp. 1–6. IEEE, November 2009

    Google Scholar 

  5. Pattara-Atikom, W., Pongpaibool, P., Thajchayapong, S.: Estimating road traffic congestion using vehicle velocity. In: 2006 6th International Conference on ITS Telecommunications Proceedings, pp. 1001–1004. IEEE, June 2006

    Google Scholar 

  6. Verhoef, E.T., Rouwendal, J.: A behavioural model of traffic congestion: endogenizing speed choice, traffic safety and time losses. J. Urban Econ. 56(3), 408–434 (2004)

    Article  Google Scholar 

  7. Rakha, H., Crowther, B.: Comparison of Greenshields, Pipes, and Van Aerde car-following and traffic stream models. Transp. Res. Rec. J. Transp. Res. Board 1802, 248–262 (2002)

    Article  Google Scholar 

  8. Wang, H., Martin Hernandez, J., Van Mieghem, P.: Betweenness centrality in a weighted network. Phys. Rev. E 77(4 pt 2), 046105 (2008)

    Article  Google Scholar 

  9. Pemmaraju, S., Skiena, S.S.: Computational Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Cambridge University Press, New York (2003)

    Book  MATH  Google Scholar 

  10. Liu, Z., Liu, Y., Wang, J., Deng, W.: Modeling and simulating traffic congestion propagation in connected vehicles driven by temporal and spatial preference. Wireless Networks (2015). https://doi.org/10.1007/s11276-015-1021-1

Download references

Acknowledgments

This work was supported by National Nature Science Foundation, Grant/Award Number: 61373123 and 61572229; Scientific Research Foundation for Returned Scholars; International Scholar Exchange Fellowship (ISEF) program of Korea Foundation for Advanced Studies (KFAS); Jilin Provincial Science and Technology Development Foundation, Grant/Award Number: 20170204074GX; Jilin Provincial International Cooperation Foundation, Grant/Award Number: 20150414004GH; Premier-Discipline Enhancement Scheme supported by Zhuhai Government; Premier Key-Discipline Enhancement Scheme supported Guangdong Government Funds.

Competing Interests

The authors declare no conflict of interest.

Author information

Authors and Affiliations

Authors

Contributions

J.W. and Z.L. designed the research, participated in the writing of the manuscript, performed the numerical calculations, and completed the corresponding analytical derivations. Y.L. and S.X. analyzed the empirical data, and gave final approval of the version to be published.

Corresponding author

Correspondence to Jian Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jin, M., Liu, Y., Wang, J., Liu, Z., Xu, S. (2017). Theoretical Proving of Optimal Communication Radius Against Traffic Congestion in Simplified. In: Peng, SL., Lee, GL., Klette, R., Hsu, CH. (eds) Internet of Vehicles. Technologies and Services for Smart Cities. IOV 2017. Lecture Notes in Computer Science(), vol 10689. Springer, Cham. https://doi.org/10.1007/978-3-319-72329-7_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-72329-7_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-72328-0

  • Online ISBN: 978-3-319-72329-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics