Research Article
Constrained Space Information Flow
247 downloads
@INPROCEEDINGS{10.1007/978-3-319-66628-0_45, author={Alfred Uwitonze and Jiaqing Huang and Yuanqing Ye and Wenqing Cheng}, title={Constrained Space Information Flow}, proceedings={Communications and Networking. 11th EAI international Conference, ChinaCom 2016 Chongqing, China, September 24-26, 2016, Proceedings, Part II}, proceedings_a={CHINACOM}, year={2017}, month={10}, keywords={Network Information Flow Delaunay triangulation Network coding in space Space Information Flow}, doi={10.1007/978-3-319-66628-0_45} }- Alfred Uwitonze
Jiaqing Huang
Yuanqing Ye
Wenqing Cheng
Year: 2017
Constrained Space Information Flow
CHINACOM
Springer
DOI: 10.1007/978-3-319-66628-0_45
Abstract
(SIF), also known as Space Network Coding, is a new research paradigm which studies network coding in Euclidean space, and it is different with proposed by Ahlswede . This paper focuses on the problem of (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 -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.Copyright © 2016–2024 ICST
