Network coding-aware rate control and scheduling in wireless networks

Abstract

In this paper, we study rate control and scheduling over wireless networks with intersession network coding, as a utility maximization problem. We demonstrate that making rate control and scheduling aware of the underlying network coding increases throughput. The key intuition is that network coding introduces new network coded flows and eventually new conflicts between nodes, which should be taken into account both in rate control and in scheduling. We compare the network coding-aware to the network coding-unaware schemes in two cases: (i) optimal control and (ii) practical, suboptimal control. Our main goal is to make the case for network coding-aware rate control and scheduling, via simulation of representative examples. Along the way, we also propose a practical scheme that approximates the optimal control.