Bounds on the Network Coding Capacity for Wireless Random Networks

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 expect...

Full description

Saved in:
Bibliographic Details
Published in2007 Information Theory and Applications Workshop pp. 231 - 236
Main Authors Aly, S.A., Kapoor, V., Jie Meng, Klappenecker, A.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.01.2007
Subjects
Computer science
Decoding
Graph theory
Multicast algorithms
Network coding
Predictive models
Routing
Solid modeling
Throughput
Unicast
Online AccessGet full text

Cover

More Information
Summary: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 bounds. Our experiments show that our theoretical predictions are well matched by simulation results.
ISBN:9780615153148
0615153143
DOI:10.1109/ITA.2007.4357585