Bounds on the Network Coding Capacity for Wireless Random Networks

Abstract

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.

Netcoding07

Cited by in corpus (5)

• Network Protection Codes: Providing Self-healing in Autonomic Networks Using Network Coding
• Network Coding Capacity of Random Wireless Networks under a Signal-to-Interference-and-Noise Model
• Network Coding Capacity of Random Wireless Networks under a SINR Model
• On the Delay of Network Coding over Line Networks
• On the Capacity Improvement of Multicast Traffic with Network Coding