On Joint MAC and Network Coding in Wireless Ad Hoc Networks

This paper addresses network coding in wireless networks in conjunction with medium access control (MAC). It is known that coding over wired networks enables connections with rates that cannot be achieved by routing. However, the properties of wireless networks (e.g., omnidirectional transmissions, destructive interference, single transceiver per node, finite energy) modify the formulation of time-varying network coding in a way that reflects strong interactions with underlying MAC protocols and deviates from the classical approach used in wired network coding. To perform network coding over conflict-free transmission schedules, predetermined network realizations are separately activated by a time-division mechanism and the content of network flows is derived through network coding to optimize performance measures such as achievable throughput and energy costs. A systematic method is presented to construct linear wireless network codes and interactions with MAC schedules are discussed under wireless assumptions. Network coding is also extended to operate with arbitrary (random or scheduled access based) MAC protocols. Alternatively, conflict-free transmission schedules are jointly constructed with network codes by decomposing wireless networks into subtrees and employing graph coloring on simplified subtree graphs. Finally, network coding and plain routing are compared in terms of throughput, energy and delay performance under different MAC solutions.

[1]  Christina Fragouli,et al.  Information flow decomposition for network coding , 2006, IEEE Transactions on Information Theory.

[2]  Babak Hassibi,et al.  Capacity of wireless erasure networks , 2006, IEEE Transactions on Information Theory.

[3]  Yunnan Wu,et al.  Minimum-energy multicast in mobile ad hoc networks using network coding , 2004, Information Theory Workshop.

[4]  Richard D. Wesel,et al.  On the capacity of network coding for random networks , 2005, IEEE Transactions on Information Theory.

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

[6]  Christina Fragouli,et al.  Network Coding as a Coloring Problem , 2004 .

[7]  Tracey Ho,et al.  A Random Linear Network Coding Approach to Multicast , 2006, IEEE Transactions on Information Theory.

[8]  Anthony Ephremides,et al.  Multiple access and time division: a new look , 2004, International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings..

[9]  Muriel Médard,et al.  On coding for reliable communication over packet networks , 2005, Phys. Commun..

[10]  Christina Fragouli,et al.  Decentralized network coding , 2004, Information Theory Workshop.

[11]  Anthony Ephremides,et al.  The problem of medium access control in wireless sensor networks , 2004, IEEE Wireless Communications.

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

[13]  Anthony Ephremides,et al.  Scheduling broadcasts in multihop radio networks , 1990, IEEE Trans. Commun..

[14]  Muriel Médard,et al.  Achieving minimum-cost multicast: a decentralized approach based on network coding , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[15]  Fang Zhao,et al.  Minimum-cost multicast over coded packet networks , 2005, IEEE Transactions on Information Theory.

[16]  Muriel Médard,et al.  An algebraic approach to network coding , 2003, TNET.

[17]  Daniel Brélaz,et al.  New methods to color the vertices of a graph , 1979, CACM.

[18]  Subramanian Ramanathan,et al.  Scheduling algorithms for multihop radio networks , 1993, TNET.

[19]  Yu-Han Chang,et al.  On the utility of network coding in dynamic environments , 2004, International Workshop on Wireless Ad-Hoc Networks, 2004..

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

[21]  Anindya Iqbal,et al.  Energy efficient broadcasting in wireless Ad hoc networks , 2009 .

[22]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[23]  Peter Sanders,et al.  Polynomial time algorithms for multicast network code construction , 2005, IEEE Transactions on Information Theory.