Rotational coding achieves multicast capacity of deterministic wireless networks

Authors:
Mohammad A. Khojastepour;Alireza Keshavarz-Haddad
Affiliations:
NEC Laboratories America, Princeton, NJ;School of Electrical and Computer Engineering, Shiraz University, Shiraz, Iran
Venue:
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Year:
2009

Citing 5
Cited 1

An algebraic approach to network coding

IEEE/ACM Transactions on Networking (TON)
Network coding fundamentals

Foundations and Trends® in Networking
Network coding applications

Foundations and Trends® in Networking
Network information flow

IEEE Transactions on Information Theory
Linear network coding

IEEE Transactions on Information Theory

On capacity of deterministic wireless networks under node half-duplexity constraint

Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we study the maximum throughput of network coding schemes for a single multicast session in wireless networks. We adapt "deterministic channel model" proposed in [1] for modeling wireless interference. We introduce a novel rotational coding scheme that can achieve the well-known minimum cutset bound. This coding scheme has lower encoding complexity in comparison with the existing random linear coding schemes which makes it a good candidate for practical systems. Moreover, we present a fundamental result on the rate of information that can be sent through any cutset. This can be used as criteria for analyzing the maximum throughput of linear network codes.