Abstract
Investigating the energy efficient multicast problem in space-ground integrated network (SGIN) is of vital importance for saving satellites transmission resources. However, the time-varying feature of network topology and resources poses great challenges to energy efficient multicast in SGIN. In this paper, we propose an approximation algorithm based on the modified time-expanded graph to minimize energy consumption while completing multicast transmission. At first, the SGIN is depicted by traditional time-expanded graph to capture the correlations between time-varying network resources. Then, to characterize the energy efficient multicast problem for temporal networks, we extend such graph to the Time Expanded Graph for Multicast (TEGM) by adding auxiliary aggregated destination vertices and aggregating edges. Finally, according to TEGM, an approximation algorithm for energy efficient multicast problem is proposed on the basis of the approach presented by Watel to solve the corresponding Directed Steiner Tree problem (DST). Besides, simulation results are conducted to illustrate the superiority of proposed algorithm over that based on dynamic trees.
Supported by organization x.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Caini, C., Cruickshank, H., Farrell, S., Marchese, M.: Delay- and disruption-tolerant networking (DTN): an alternative solution for future satellite networking applications. Proc. IEEE 99(11), 1980–1997 (2011)
Chiti, F., Fantacci, R., Tassi, A.: An efficient harq scheme for applications in multicast communication systems. Wirel. Commun. Mob. Comput. 15(7), 1131–1141 (2015)
Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)
Ruiz, P.M., Gomez-Skarmeta, A.F.: Approximating optimal multicast trees in wireless multihop networks. In: 2005 IEEE Symposium on Computers and Communications, ISCC 2005, Proceedings, pp. 686–691 (2005)
Seok, Y.: Device and method for multicast in wireless local access network (2009)
Watel, D., Weisser, M.A.: A practical greedy approximation for the directed steiner tree problem. J. Comb. Optim. 32(4), 1327–1370 (2016)
Zhao, W., Ammar, M., Zegura, E.: Multicasting in delay tolerant networks: semantic models and routing algorithms. In: ACM SIGCOMM Workshop on Delay-Tolerant Networking, pp. 268–275 (2006)
Acknowledgments
This work is supported by the National Natural Science Foundation of China (61871456, 91638202, 61401326, 61571351), the National Key Research and Development Program of China (2016YFB0501004), the National S&T Major Project (2015ZX03002006), the 111 Project (B08038), Natural Science Basic Research Plan in Shaanxi Province of China (2016JQ6054).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Shi, K., Li, H., Wang, P., Zhang, T. (2019). An Energy Efficient Multicast Algorithm for Temporal Networks. In: Jia, M., Guo, Q., Meng, W. (eds) Wireless and Satellite Systems. WiSATS 2019. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 280. Springer, Cham. https://doi.org/10.1007/978-3-030-19153-5_36
Download citation
DOI: https://doi.org/10.1007/978-3-030-19153-5_36
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-19152-8
Online ISBN: 978-3-030-19153-5
eBook Packages: Computer ScienceComputer Science (R0)