An analysis of scheduling mechanism in wireless network coding
Jun J. Zhang, Shu‐Tao Xia, Ning Gu, Jinyi Zhou · 2014
The network coding system COPE [1] shows us the improvements obtained by COPE-type network coding in wireless networks. In this paper, by introducing 802.11 interference model, we analyze the maximal multi-commodity flow problem in wireless network coding and put forward a new scheduling mechanism 802.11st which has higher throughput for multihop wireless networks with network coding. We use linear programming to compute the maximum multi-commodity flow of multiple unicast flows in which the constraints are rebuilt according to the new scheduling mechanism.