Cross-layer optimization for wireless multihop networks with pairwise intersession network coding
IEEE Journal on Selected Areas in Communications - Special issue on network coding for wireless communication networks
Wireless network coding with improved opportunistic listening
IEEE Transactions on Wireless Communications
Opportunistic scheduling for wireless network coding
IEEE Transactions on Wireless Communications
Network coded ALOHA for wireless multihop networks
WCNC'09 Proceedings of the 2009 IEEE conference on Wireless Communications & Networking Conference
On broadcast stability of queue-based dynamic network coding over erasure channels
IEEE Transactions on Information Theory
Joint scheduling and instantaneously decodable network coding
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Comparison of analog and digital relay methods with network coding for wireless multicast
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
On the queueing behavior of inter-flow asynchronous network coding
Computer Communications
| Hi-index | 754.90 |
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.