Abstract
Space Information Flow (SIF) is a new promising research field which studies network coding in geometric space, such as Euclidean space. The design of an algorithm that computes the optimal SIF solutions remains one of the key open problems in SIF. This work proposes a new heuristic SIF algorithm that computes the optimal min-cost in multicast networks for any given number of terminal nodes in 2-D Euclidean space. The algorithm has two phases: The first phase computes the optimal SIF topology of the network, while the second phase computes the min-cost of the SIF topology obtained from the first phase, by tuning each relay node to the balanced position that satisfies the necessary properties of optimal SIF. The proposed algorithm is based on Delaunay Triangulation and Linear Programming techniques. The simulation results show that the new algorithm has a low computational complexity and fast converges to the optimal solutions.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
