A Minimum Connected Dominating Set Based Multicast Routing Algorithm in Hybrid LEO/MEO/GEO Constellation Network | SpringerLink
Skip to main content

A Minimum Connected Dominating Set Based Multicast Routing Algorithm in Hybrid LEO/MEO/GEO Constellation Network

  • Conference paper
  • First Online:
Communications, Signal Processing, and Systems (CSPS 2017)

Part of the book series: Lecture Notes in Electrical Engineering ((LNEE,volume 463))

Abstract

Multicast capability could provide excellent distribution services for globally scattered users in a multi-layer satellite network with global coverage. In this paper, we proposed a distributed routing algorithm for a hybrid LEO/MEO/GEO satellite constellation network based on a time-evolving Minimum Connected Dominating Set (MCDS) algorithm, which is constructed in a serial of slotted topology snapshots. The simulation results show that, the proposed routing algorithm could find an end-to-end route with less costs both in single and multiple time slots than the minimal spanning trees (SMT) algorithm, by making a trade-off between end-to-end hops and total path cost.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 34319
Price includes VAT (Japan)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 42899
Price includes VAT (Japan)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
JPY 42899
Price includes VAT (Japan)
  • Durable hardcover 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

Similar content being viewed by others

References

  1. Ekici, E., Akyildiz, I., Bender, M.: A multicast routing algorithm for LEO satellite IP networks. IEEE/ACM Trans. Netw. 10(2), 183–192 (2002)

    Article  Google Scholar 

  2. Yang, D., Liao, W.: On multicast routing using rectilinear Steiner trees for LEO satellite networks. IEEE Trans. Veh. Technol. 57(4), 2560–2569 (2008)

    Article  Google Scholar 

  3. Ma, Y., Wang, X., Su, J., Wu, C., Yu, W., Zhao, B.: A multicast routing algorithm for datagram service in delta LEO satellite constellation networks. J. Netw. 9(4), 896–907 (2014)

    Google Scholar 

  4. Yin, Z., Zhang, L., Zhou, X.: On-demand QoS multicast routing for triple-layered LEO/HEO/GEO satellite IP networks. J. Commun. 6(6), 495–508 (2011)

    Article  Google Scholar 

  5. Fu, D., Han, L., Yang, Z., Jhang, S.: A Greedy Algorithm on constructing the minimum connected dominating set in wireless network. Int. J. Distrib. Sens. Netw. 12(7), 1703201 (2016)

    Article  Google Scholar 

  6. Zheng, C., Sun, S., Huang, T.: Constructing distributed connected dominating sets in wireless ad hoc and sensor networks. J. Softw. 22(5), 1053–1066 (2011)

    Article  MathSciNet  Google Scholar 

  7. Du, H., Wu, W., Ye, Q., Li, D., Lee, W., Xu, X.: CDS-based virtual backbone construction with guaranteed routing cost in wireless sensor networks. IEEE Trans. Parallel Distrib. Syst. 24(4), 652–661 (2013)

    Article  Google Scholar 

  8. Huang, M., Chen, S., Zhu, Y., Wang, Y.: Topology control for time-evolving and predictable delay-tolerant networks. IEEE Trans. Comput. 62(11), 2308–2321 (2013)

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgments

The authors would like to express their high appreciations to the supports from the National Natural Science Foundation of China (61571156), National Science and Technology Major Project (91538110), and Natural Science Foundation of Guangdong Province (2016A030313661).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Zhihua Yang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Jing, Y., Yang, Z., Liao, X., Qi, X. (2019). A Minimum Connected Dominating Set Based Multicast Routing Algorithm in Hybrid LEO/MEO/GEO Constellation Network. In: Liang, Q., Mu, J., Jia, M., Wang, W., Feng, X., Zhang, B. (eds) Communications, Signal Processing, and Systems. CSPS 2017. Lecture Notes in Electrical Engineering, vol 463. Springer, Singapore. https://doi.org/10.1007/978-981-10-6571-2_12

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-6571-2_12

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-6570-5

  • Online ISBN: 978-981-10-6571-2

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics