Bounds on the Network Coding Capacity for Wireless Random Networks

Computer Science – Information Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Netcoding07

Scientific paper

Recently, it has been shown that the max flow capacity can be achieved in a multicast network using network coding. In this paper, we propose and analyze a more realistic model for wireless random networks. We prove that the capacity of network coding for this model is concentrated around the expected value of its minimum cut. Furthermore, we establish upper and lower bounds for wireless nodes using Chernoff bound. Our experiments show that our theoretical predictions are well matched by simulation results.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Bounds on the Network Coding Capacity for Wireless Random Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Bounds on the Network Coding Capacity for Wireless Random Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Bounds on the Network Coding Capacity for Wireless Random Networks will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-18717

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.