Elements of information theory
Elements of information theory
Randomized algorithms
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
Multicast Scaling Properties in Massively Dense Ad Hoc Networks
ICPADS '05 Proceedings of the 11th International Conference on Parallel and Distributed Systems - Workshops - Volume 02
Edge-Cut Bounds on Network Coding Rates
Journal of Network and Systems Management
On the capacity of information networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
On achieving maximum multicast throughput in undirected networks
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
XORs in the air: practical wireless network coding
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Broadcast capacity in multihop wireless networks
Proceedings of the 12th annual international conference on Mobile computing and networking
Hot topic: physical-layer network coding
Proceedings of the 12th annual international conference on Mobile computing and networking
Trading structure for randomness in wireless opportunistic routing
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Embracing wireless interference: analog network coding
Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Challenges: towards truly scalable ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
Multicast capacity for large scale wireless ad hoc networks
Proceedings of the 13th annual ACM international conference on Mobile computing and networking
The multicast capacity of large multihop wireless networks
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
Capacity of large scale wireless networks under Gaussian channel model
Proceedings of the 14th ACM international conference on Mobile computing and networking
Network coding does not change the multicast throughput order of wireless ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
The throughput order of ad hoc networks employing network coding and broadcasting
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Distributed source coding for satellite communications
IEEE Transactions on Information Theory
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks
IEEE Transactions on Information Theory
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory
IEEE Transactions on Information Theory
Maximal recovery network coding under topology constraint
IEEE Transactions on Information Theory
| Hi-index | 0.06 |
We show that network coding (NC) does not provide any order gain in the multicast capacity of random wireless ad hoc networks. We consider a network with n nodes distributed uniformly in a unit square, with each node acting as a source for independent information to be sent to a multicast group consisting of m randomly chosen destinations. We show that, in the presence of NC, the per-session capacity under the protocol model has a tight bound of Θ(1/√mnlog(n)) when m = O(n/log(n)) and Θ(1/n) when m = Ω(n/log(n)). Furthermore, we show that the per-session capacity under the physical model has a tight bound of Θ(1/√mn) when m = O(n/(log(n))3), and Θ(1/n) when m = Ω(n/log(n)). Prior work has shown that these same order bounds are achievable utilizing only traditional store-and-forward methods.