By Topic

Network Coding Does Not Change the Multicast throughput Order of Wireless Ad Hoc Networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
S. Karande ; Dept. of Electr. Eng., Univ. of California, Santa Cruz, Santa Cruz, CA, USA ; Z. Wang ; H. R. Sadjadpour ; J. J. Garcia-Luna-Aceves

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 per- session capacity in the presence of arbitrary NC has a tight bound of Theta (1/radic(mnlog(n))) when m = O(n/(log(n))) and Theta(1/n) when m = Omega(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.

Published in:

2009 IEEE International Conference on Communications

Date of Conference:

14-18 June 2009