Bounds on the Network Coding Capacity for Wireless Random Networks
Salah A. Aly (Texas A&M University)
Vishal Kapoor (Texas A&M University)
Jie Meng (Texas A&M University)
Andreas Klappenecker (Texas A&M University)

Email:
{salah, vishal, jmeng, klappi}@cs.tamu.edu

Full Paper (pdf)

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 an upper bound for dependent wireless nodes using martingales. Our experiments show that our theoretical predications are well matched by simulation results.