An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Foundations and Trends® in Networking
Foundations and Trends® in Networking
Bounds on achievable rates for general multi-terminal networks with practical constraints
IPSN'03 Proceedings of the 2nd international conference on Information processing in sensor networks
Rotational coding achieves multicast capacity of deterministic wireless networks
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Hi-index | 0.00 |
In this paper we study the maximum throughput of a single multicast session in wireless networks under a practical constraint that the nodes are half-duplex, i.e. they cannot transmit and receive at the same time. We adapt "deterministic channel model" proposed recently in [1] for modeling wireless channel interference. The problem of finding the throughput capacity of a single multicast session has been studied analytically based on this channel model in [2]-[4]; a cutset bound found and its achievability is proven under the assumption that the wireless nodes are fullduplex. Here, we derive a new cutset bound on the maximum multicast throughput of half-duplex networks and propose a network coding scheme to achieve the cutset bound.