Abstract
Space Information Flow (SIF), also known as Space Network Coding, is a new research paradigm which studies network coding in Euclidean space, and it is different with Network Information Flow proposed by Ahlswede et al. This paper focuses on the problem of Constrained Space Information Flow (CSIF), which aims to find a min-cost multicast network in 2-D Euclidean space under the constraint on the number of relay nodes to be used. We propose a new polynomial-time heuristic algorithm that combines Delaunay triangulation and linear programming techniques to solve the problem. Delaunay triangulation is used to generate several candidate relay nodes, after which linear programming is applied to choose the optimal relay nodes and to compute their connection links with the terminal nodes. The simulation results shows the effectiveness of the proposed algorithm.
This is a preview of subscription content, log in via an institution to check access.
References
Ahlswede, R., Cai, N., Li, S.Y.R., Yeung, R.W.: Network information flow. IEEE Trans. Inf. Theory 46(4), 1204–1216 (2000)
Li, Z., Wu, C.: Space information flow. Technical report, Department of Computer Science, University of Calgary (2011)
Li, Z., Wu, C.: Space information flow: multiple unicast. In: Proceedings of IEEE International Symposium on Information Theory (ISIT), pp. 1897–1901 (2012)
Gilbert, E.N., Pollak, H.O.: Steiner minimal trees. SIAM J. Appl. Math. 16(1), 1–29 (1968)
Prim, R.C.: Shortest connection networks and some generalizations. Bell Syst. Tech. J. 36(6), 1389–1401 (1957)
Huang, J., Yin, X., Zhang, X., Du, X., Li, Z.: On space information flow: single multicast. In: IEEE NetCod, pp. 1–6 (2013)
Maheshwar, S., Li, Z., Li, B.: Bounding the coding advantage of combination network coding in undirected networks. IEEE Trans. Inf. Theory 58(2), 570–584 (2012)
Winter, P., Zachariasen, M.: Euclidean steiner minimum trees: an improved exact algorithm. Networks 30(3), 149–166 (1997)
Huang, J., Li, Z.: A recursive partitioning algorithm for space information flow. In: IEEE GLOBECOM, pp. 1460–1465 (2014)
Yin, X., Wang, Y., Wang, X., Xue, X., Li, Z.: Min-cost multicast networks in euclidean space. In: IEEE ISIT, pp. 1316–1320 (2012)
Xiahou, T., Li, Z., Wu, C., Huang, J.: A geometric perspective to multiple-unicast network coding. IEEE Trans. Inf. Theory 60(5), 2884–2895 (2014)
Hu, Y., Niu, D., Li, Z.: Internet video multicast via constrained space information flow. IEEE MMTC E-letter 9(2), 17–19 (2014)
Uwitonze, A., Ye, Y., Huang, J., Cheng, W.: A heuristic algorithm on space information flow. In: 2015 International Conference on Computer Science and Applications, pp. 20–24 (2015)
Smith, J.M., Lee, D.T., Liebman, J.S.: An O (n log n) heuristic for steiner minimal tree problems on the euclidean metric. Networks 11(1), 23–39 (1981)
Yue, M.: Minimum Network: The Steiner Tree Problem. Shanghai Scientific and Technical Publishers, Shanghai (2006)
Leach, G.: Improving worst-case optimal Delaunay triangulation algorithms. In: 4th Canadian Conference on Computational Geometry, pp. 340–346 (1992)
Beasley, J.E.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069–1072 (1990)
Waxman, B.M.: Routing of multipoint connections. IEEE J. Sel. Areas Commun. 6(9), 1617–1622 (1988)
Acknowledgments
This research was supported by National Natural Science Foundation of China (No. 61271227).
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
Uwitonze, A., Huang, J., Ye, Y., Cheng, W. (2018). Constrained Space Information Flow. In: Chen, Q., Meng, W., Zhao, L. (eds) Communications and Networking. ChinaCom 2016. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 210. Springer, Cham. https://doi.org/10.1007/978-3-319-66628-0_45
Download citation
DOI: https://doi.org/10.1007/978-3-319-66628-0_45
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66627-3
Online ISBN: 978-3-319-66628-0
eBook Packages: Computer ScienceComputer Science (R0)