A Global Optimal Approach to Wireless Space Information Flow

In wireless networks, inter-session and intra-session network coding can potentially reduce the energy consumption for information transmission. However, the optimal routing and channel selection render the problem non-convex and NP-hard. Given the coordinates of terminal nodes and the transmission tasks, we formulate the problem as a cost minimization problem, which we refer to as the wireless space information flow (WSIF) problem. We then employ a filled function method to compute the global optimal solution to the WSIF problem. The filled function method enables simultaneous optimization of the routing scheme, as well as the coordinates of the relay nodes.