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)
Mobility improves coverage of sensor networks
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
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
Growth codes: maximizing sensor network data persistence
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Extending the capacity of ad hoc networks beyond network coding
IWCMC '07 Proceedings of the 2007 international conference on Wireless communications and mobile computing
Challenges: towards truly scalable 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
Network Coding for Efficient Wireless Unicast
IZS '06 Proceedings of the 2006 International Zurich Seminar 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
The capacity of wireless networks
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
A correction to the proof of a lemma in "The capacity of wireless networks"
IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks
IEEE Transactions on Information Theory
On the throughput scaling of wireless relay networks
IEEE Transactions on Information Theory
Hierarchical Cooperation Achieves Optimal Capacity Scaling in Ad Hoc Networks
IEEE Transactions on Information Theory
Buffer-aware network coding for wireless networks
IEEE/ACM Transactions on Networking (TON)
Coding- and interference-aware routing protocol in wireless networks
Computer Communications
Hi-index | 0.00 |
Gupta and Kumar established that the per node throughput of ad hoc networks with multi-pair unicast traffic scales with an increasing number of nodes n as λ(n) = Θ(1/√n log n), thus indicating that performance does not scale well. However, Gupta and Kumar did not consider network coding and wireless broadcasting, which recent works suggest have the potential to significantly improve throughput. Here, we establish bounds on the improvement provided by such techniques. For random networks of any dimension under either the protocol or physical model that were introduced by Gupta and Kumar, we show that network coding and broadcasting lead to at most a constant factor improvement in per node throughput. For the protocol model, we provide bounds on this factor. We also establish bounds on the throughput benefit of network coding and broadcasting for multiple source multicast in random networks. Finally, for an arbitrary network deployment, we show that the coding benefit ratio is at most O(log n) for both the protocol and physical communication models. These results give guidance on the application space of network coding, and, more generally, indicate the difficulty in improving the scaling behavior of wireless networks without modification of the physical layer.