Skip to main content

Red-Black Spanners for Mixed-Charging Vehicular Networks

  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 2023)

Abstract

Motivated by the recent trend of increasing number of e-cars and hybrid cars, we investigate the problem of building a red-black spanner for a mixed-charging vehicular network. In such a network, we have two kinds of gas/charging stations: electric (black) and the traditional gas (red) stations. Our requirement is that one cannot connect two gas stations directly in the spanner (i.e., no red-red edge), and our goal is to build a linear-size spanner with a bounded stretch factor under this requirement. (In 2-d, it can be shown that a spanner with an optimal stretch factor could have a quadratic size and if one is restricted to build the spanner purely from a given road network then it is impossible to obtain a bounded stretch factor.) Our main results are summarized as follows.

  1. 1.

    In 1-d, we show a linear-size red-black spanner satisfying the ‘no red-red edge’ requirement which achieves the optimal stretch factor.

  2. 2.

    In 2-d and under the \(L_2\) metric, we show a linear-size red-black spanner satisfying the ‘no red-red edge’ requirement which achieves a stretch factor of 1.998.

  3. 3.

    In 2-d and under the \(L_1\) metric, we show a linear-size red-black spanner satisfying the ‘no red-red edge’ requirement which achieves a stretch factor of 3.613.

This work is partially supported by JSPS KAKENHI Grant Number 19H04068.

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 59.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 79.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

References

  1. Biniaz, A., Bose, P., Carufel, J.D., Gavoille, C., Maheshwari, A., Smid, M.H.M.: Towards plane spanners of degree 3. J. Comput. Geom. 8(1), 11–31 (2017)

    MathSciNet  MATH  Google Scholar 

  2. Bonichon, N., Gavoille, C., Hanusse, N., Perković, L.: The stretch factor of L 1- and L\(\infty \)-delaunay triangulations. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 205–216. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-33090-2_19

    Chapter  Google Scholar 

  3. Bose, P., Smid, M.H.M.: On plane geometric spanners: a survey and open problems. Comput. Geom. 46(7), 818–830 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bose, P., Smid, M.H.M., Xu, D.: Delaunay and diamond triangulations contain spanners of bounded degree. Int. J. Comput. Geom. Appl. 19(2), 119–140 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Chew, P.: There is a planar graph almost as good as the complete graph. In: Aggarwal, A. (ed.), Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, Yorktown Heights, NY, USA, 2–4 June 1986, pp. 169–177. ACM (1986)

    Google Scholar 

  6. Dobkin, D.P., Friedman, S.J., Supowit, K.J.: Delaunay graphs are almost as good as complete graphs. In: 28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27–29 October 1987, pp. 20–26. IEEE Computer Society (1987)

    Google Scholar 

  7. Dumitrescu, A., Ghosh, A.: Lower bounds on the dilation of plane spanners. Int. J. Comput. Geom. Appl. 26(2), 89–110 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  8. Eppstein, D.: Spanning trees and spanners. In: Sack, J.-R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 425–461. Elsevier Science Publishers B.V. North-Holland, Amsterdam (2000)

    Google Scholar 

  9. Kazemi, M.A., Sedighizadeh, M., Mirzaei, M.J., Homaee, O.: Optimal siting and sizing of distribution system operator owned EV parking lots. Appl. Energy 179, 1176–1184 (2016)

    Article  Google Scholar 

  10. Keil, M., Gutwin, C.A.: Classes of graphs which approximate the complete Euclidean graph. Discret. Comput. Geom. 7, 13–28 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  11. Liang, Y., Guo, C., Yang, J., Ding, Z.: Optimal planning of charging station based on discrete distribution of charging demand. IET Gener. Trans. Distrib. 14(6), 965–974 (2020)

    Article  Google Scholar 

  12. Narasimhan, G., Smid, M.H.M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)

    Google Scholar 

  13. Sadeghi-Barzani, P., Rajabi-Ghahnavieh, A., Kazemi-Karegar, H.: Optimal fast charging station placing and sizing. Appl. Energy 125, 289–299 (2014)

    Article  Google Scholar 

  14. Sperling, D.: New Transportation Fuels: A Strategic Approach to Technological Change. University of California Press, Berkeley (1990)

    Google Scholar 

  15. Wang, Y., Shi, J., Wang, R., Liu, Z., Wang, L.: Siting and sizing of fast charging stations in highway network with budget constraint. Appl. Energy 228, 1255–1271 (2018)

    Article  Google Scholar 

  16. Xia, G.: The stretch factor of the Delaunay triangulation is less than 1.998. SIAM J. Comput. 42(4), 1620–1659 (2013)

    Google Scholar 

  17. Xia, G., Zhang, L.: Toward the tight bound of the stretch factor of delaunay triangulations. In: Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, Toronto, Ontario, Canada, 10–12 August 2011 (2011)

    Google Scholar 

  18. Zhu, H., Pei, Z.: Data-driven layout design of regional battery swapping stations for electric bicycles. IFAC PapersOnLine 53(5), 13–18 (2020)

    Article  Google Scholar 

Download references

Acknowledgment

Part of this research was done while the first and last author visited University of Hyogo in late 2022.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Binhai Zhu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Bereg, S., Higashikawa, Y., Katoh, N., Teruyama, J., Tokuni, Y., Zhu, B. (2024). Red-Black Spanners for Mixed-Charging Vehicular Networks. In: Wu, W., Tong, G. (eds) Computing and Combinatorics. COCOON 2023. Lecture Notes in Computer Science, vol 14422. Springer, Cham. https://doi.org/10.1007/978-3-031-49190-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-031-49190-0_16

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-031-49189-4

  • Online ISBN: 978-3-031-49190-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics