Network coding does not change the multicast throughput order of wireless ad hoc networks

Authors:
Shirish Karande;Zheng Wang;Hamid R. Sadjadpour;J. J. Garcia-Luna-Aceves
Affiliations:
Department of Electrical Engineering, University of California, Santa Cruz, CA;Department of Electrical Engineering, University of California, Santa Cruz, CA;Department of Electrical Engineering, University of California, Santa Cruz, CA;Palo Alto Research Center, Palo Alto, CA
Venue:
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Year:
2009

Citing 13
Cited 1

Randomized algorithms

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
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
Trading structure for randomness in wireless opportunistic routing

Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications
Multicast capacity for large scale wireless ad hoc networks

Proceedings of the 13th annual ACM international conference on Mobile computing and networking
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
Network information flow

IEEE Transactions on Information Theory
A deterministic approach to throughput scaling in wireless networks

IEEE Transactions on Information Theory

Multicast throughput order of network coding in wireless ad-hoc networks

SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

We demonstrate that the gain attained by network coding (NC) on the multicast capacity of random wireless ad hoc networks is bounded by a constant factor. 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, under the protocol model, the persession capacity in the presence of arbitrary NC has a tight bound of Θ (1/√mnlog(n)) when m = O(n/log(n)) and Θ(1/n) when m = Ω(n/log(n). Our result follows from the fact that prior work has shown that the same order bounds are achievable with pure routing based only on traditional store-and-forward methods.