Non-random Wireless Network Coding

摘要

Network coding (NC) has been shown to improve throughput, minimize delay and economize the energy requirements in wireless networks. This paper develops a non-random approach to wireless linear NC problem. The proposed approach works by "time-unwrapping" a wireless node to develop a wired-equivalent model that helps solve for the wireless NC through purely algebraic arguments. It incorporate realistic constraints, including omni directionality of transmissions, half-duplex operation and interference effects. A faster branch and bound based algorithm is also developed that, within some constraints, efficiently finds the optimal wireless NC.