Gowaikar, Radhika and Dana, Amir F. and Palanki, Ravi and Hassibi, Babak and Effros, Michelle (2004) On the capacity of wireless erasure networks. In: IEEE International Symposium on Information Theory (ISIT '04), Chicago, IL, 27 June-2 July 2004. IEEE , Piscataway, NJ, p. 400. ISBN 0 7803 8280 3 http://resolver.caltech.edu/CaltechAUTHORS:GOWisit04
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_pdf.png)
|
PDF
See Usage Policy. 243Kb |
Use this Persistent URL to link to this item: http://resolver.caltech.edu/CaltechAUTHORS:GOWisit04
Abstract
We determine the capacity of a certain class of wireless erasure relay networks. We first find a suitable definition for the "cut-capacity" of erasure networks with broadcast at transmission and no interference at reception. With this definition, a maxflow mincut capacity result holds for the capacity of these networks.
| Item Type: | Book Section |
|---|---|
| Additional Information: | © Copyright 2004 IEEE. Reprinted with permission. Posted online: 2005-01-10. This work was supported in part by the National Science Foundation under grant no. CCR-0133818, by the office of Naval Research under grant no. N00014-02-1-0578, and by Caltech’s Lee Center for Advanced Networking. |
| Subject Keywords: | broadcast channels, directed graphs, error statistics, radio networks, network information theory, channel capacities |
| Record Number: | CaltechAUTHORS:GOWisit04 |
| Persistent URL: | http://resolver.caltech.edu/CaltechAUTHORS:GOWisit04 |
| Alternative URL: | http://dx.doi.org/10.1109/ISIT.2004.1365437 |
| Usage Policy: | No commercial reproduction, distribution, display or performance rights in this work are provided. |
| ID Code: | 7430 |
| Collection: | CaltechAUTHORS |
| Deposited By: | Lindsay Cleary |
| Deposited On: | 13 Feb 2007 |
| Last Modified: | 26 Dec 2012 09:31 |
Repository Staff Only: item control page
