Scheduling and network coding in wireless multicast networks: A case for unequal time shares

In this paper, we investigate the problem of network coding and media scheduling in wireless multihop networks. Unique characteristics of the wireless media, such as omnidirectional transmissions and destructive interference, as well as having one transceiver per wireless node, imply new code design constraints for wireless networks. Here, we formulate a linear program to solve the joint scheduling and network coding problem. Using our formulation, we demonstrate that for a large percentage of randomly generated wireless networks, the optimal scheduling time shares are unequal. All the existing network code design algorithms are based on equal scheduling time shares or the considered joint optimization problems do not have sufficient information for scheduling flows during unequal time shares. Therefore, we provide these statistics to emphasize the importance of enabling the code design algorithms to include unequal time shares. Our simulations further show that the network throughput can be significantly improved if the network code is properly designed to incorporate unequal time shares.

[1]  M. Gerla,et al.  Performance of Network Coding in Ad Hoc Networks , 2006, MILCOM 2006 - 2006 IEEE Military Communications conference.

[2]  Anthony Ephremides,et al.  Joint Scheduling and Wireless Network Coding , 2005 .

[3]  Prasanna Chaporkar,et al.  Adaptive network coding and scheduling for maximizing throughput in wireless networks , 2007, MobiCom '07.

[4]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2003, MobiCom '03.

[5]  R. Koetter,et al.  Scheduling for Network Coded Multicast: A Conflict Graph Formulation , 2008, 2008 IEEE Globecom Workshops.

[6]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[7]  Christina Fragouli,et al.  Network Coding Applications , 2008, Found. Trends Netw..

[8]  Shuo-Yen Robert Li,et al.  Linear network coding , 2003, IEEE Trans. Inf. Theory.

[9]  Pravin Varaiya,et al.  TDMA scheduling algorithms for wireless sensor networks , 2010, Wirel. Networks.

[10]  W. Marsden.  I and J , 2012 .

[11]  Yunnan Wu,et al.  Network planning in wireless ad hoc networks: a cross-Layer approach , 2005, IEEE Journal on Selected Areas in Communications.

[12]  Tracey Ho,et al.  Network Coding with a Cost Criterion , 2004 .

[13]  Randeep Bhatia,et al.  Characterizing achievable multicast rates in multi-hop wireless networks , 2005, MobiHoc '05.

[14]  Anthony Ephremides,et al.  On Joint MAC and Network Coding in Wireless Ad Hoc Networks , 2007, IEEE Transactions on Information Theory.

[15]  Lili Qiu,et al.  Impact of Interference on Multi-Hop Wireless Network Performance , 2005, Wirel. Networks.

[16]  Muriel Médard,et al.  XORs in the air: practical wireless network coding , 2008, TNET.

[17]  Chun-Hung Liu,et al.  Network Coding for Two-Way Relaying: Rate Region, Sum Rate and Opportunistic Scheduling , 2008, 2008 IEEE International Conference on Communications.

[18]  Ness B. Shroff,et al.  On wireless network scheduling with intersession network coding , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[19]  R. Koetter,et al.  An algebraic approach to network coding , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[20]  Sachin Katti,et al.  The Importance of Being Opportunistic: Practical Network Coding for Wireless Environments , 2005 .

[21]  Martina Zitterbart,et al.  Introducing probabilistic radio propagation models in OMNeT++ mobility framework and cross validation check with NS-2 , 2008, SimuTools.

[22]  Thomas Kunz,et al.  On code design in joint MAC scheduling and wireless network coding , 2010, 2010 25th Biennial Symposium on Communications.