A recursive partitioning algorithm for space information flow

Abstract

Space Information Flow (SIF) is a new research paradigm that studies network coding in a geometric space, which is different with Network Information Flow (NIF) that studies network coding in a graph. One of the key open problems at the core of SIF is to design an algorithm that computes optimal SIF solutions. A new heuristic SIF algorithm based on non-uniform recursive space partitioning is proposed in this work, for computing SIF for any density distribution of given terminal nodes in 2-D Euclidean space. Simulation results show that the new algorithm has low computational complexity and converges to optimal solutions promptly.