Abstract
In a satellite Disruption-Tolerant Network (DTN), unpredictable interruptions from node malfunction and link disruption will lead to severe postponements and even failure of bundles delivery mission due to incapability of originally planned paths. In this paper, we propose a space-time graph based multicast routing algorithm for coping with an unpredictable interruption in the network. In particular, the proposed algorithm could find a group of new paths with minimal cost by re-planning the two-dimensional global topology in the updated space-time graph. As a result, the residual volume of target data could be successfully delivered in time even if there is an unexpected interruption in the network. The simulation results show that the proposed interruptions resilient routing algorithm can achieve as short as possible, given a defined data volume to be delivery in a certain time latency.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Lin, B., Li, H., Long, Y.: A buffer-limited maximum throughput routing algorithm for satellite network. In: 22nd International Conference on Telecommunications (ICT 2015) (2015)
Liu, R., Sheng, M., Xu, C., Li, J., Wang, X., Zhou, D.: Antenna slewing time aware mission scheduling in space networks. IEEE Commun. Lett. 21(3), 516–519 (2017)
Yang, L., Sun, J.: Multi-service routing algorithm based on GEO/LEO satellite networks. In: International Conference on Network and Information Systems for Computers (2016)
Jiang, M., Liu, Y., Xu, W., Yang, Y., Kuang, L., Tang, F.: An optimized layered routing algorithm for GEO/LEO hybrid satellite networks. In: IEEE TrustCom-BigDataSE-ISPA. https://doi.org/10.1109/trustcom.2016.186
Juyal, V., Pandey, N.: A heuristic light weight security algorithm for resource constrained DTN routing. In: IEEE International Conference on Computational Intelligence and Computing Research (2016)
Liang, Q., Modiano, E.: Survivability in Time-varying Networks. Laboratory for Information and Decision Systems Massachusetts Institute of Technology, Cambridge (2016)
Huang, M., Chen, S., Zhu, Y., et al.: Topology control for time-evolving and predictable delay-tolerant networks. IEEE Trans. Comput. 62(11), 2308–2321 (2013)
Li, F., Chen, S., Huang, M., et al.: Reliable topology design in time-evolving delay-tolerant networks with unreliable links. IEEE Trans. Mob. Comput. 14(6), 1301–1314 (2015)
Merugu, S., Ammar, M.H., Zegura, E.W.: Routing in space and time in networks with predictable mobility. Georgia Institute of Technology, CC Technical report, GIT-CC-04-07 (2004)
Acknowledgment
The authors would like to express their high appreciations to the supports from the National Natural Science Foundation of China (91538110), Natural Science Foundation of Guangdong Province (2016A030313661), and Basic Research Project of Shenzhen (JCYJ20150625142543458 and JCYJ20150403161923521).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
He, N., Yuan, P., Yang, Z., Guo, Q. (2018). A Space-Time Graph Based Unpredictable Interruptions-Resilient Routing Algorithm in Satellite Disruption-Tolerant Networks. In: Li, C., Mao, S. (eds) Wireless Internet. WiCON 2017. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 230. Springer, Cham. https://doi.org/10.1007/978-3-319-90802-1_22
Download citation
DOI: https://doi.org/10.1007/978-3-319-90802-1_22
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-90801-4
Online ISBN: 978-3-319-90802-1
eBook Packages: Computer ScienceComputer Science (R0)