Bounds on the Network Coding Capacity for Wireless Random Networks

Simple item page
dc.creatorAly, Salah A.
dc.creatorKapoor, Vishal
dc.creatorMeng, Jie
dc.creatorKlappenecker, Andreas
dc.date2007-10-29
dc.date.accessioned2026-07-07T10:16:55Z
dc.date.available2026-07-07T10:16:55Z
dc.descriptionRecently, 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.
dc.descriptionNetcoding07
dc.identifierhttps://arxiv.org/abs/0710.5340
dc.identifierhttp://arxiv.org/abs/0710.5340
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/173681
dc.subjectInformation Theory
dc.subjectNetworking and Internet Architecture
dc.titleBounds on the Network Coding Capacity for Wireless Random Networks
dc.typetext

Files

Collections

arXiv