A Caltech Library Service

Capacity of wireless erasure networks

Dana, Amir F. and Gowaikar, Radhika and Palanki, Ravi and Hassibi, Babak and Effros, Michelle (2006) Capacity of wireless erasure networks. IEEE Transactions on Information Theory, 52 (3). pp. 789-804. ISSN 0018-9448. doi:10.1109/TIT.2005.864424.

PDF - Published Version
See Usage Policy.


Use this Persistent URL to link to this item:


In this paper, a special class of wireless networks, called wireless erasure networks, is considered. In these networks, each node is connected to a set of nodes by possibly correlated erasure channels. The network model incorporates the broadcast nature of the wireless environment by requiring each node to send the same signal on all outgoing channels. However, we assume there is no interference in reception. Such models are therefore appropriate for wireless networks where all information transmission is packetized and where some mechanism for interference avoidance is already built in. This paper looks at multicast problems over these networks. The capacity under the assumption that erasure locations on all the links of the network are provided to the destinations is obtained. It turns out that the capacity region has a nice max-flow min-cut interpretation. The definition of cut-capacity in these networks incorporates the broadcast property of the wireless medium. It is further shown that linear coding at nodes in the network suffices to achieve the capacity region. Finally, the performance of different coding schemes in these networks when no side information is available to the destinations is analyzed.

Item Type:Article
Related URLs:
URLURL TypeDescription
Additional Information:© 2006 IEEE. Reprinted with permission. Manuscript received July 21, 2004; revised February 23, 2005. [Posted online: 2006-03-06] This work was supported in part by the National Science Foundation under Grants CCR-0133818 and CCR-0326554, by the David and Lucille Packard Foundation, and by Caltech’s Lee Center for Advanced Networking. Communicated by M. Médard, Associate Editor for Communications.
Funding AgencyGrant Number
David and Lucile Packard FoundationUNSPECIFIED
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
Subject Keywords:Wireless erasure networks, multicast problems, network information theory, channel capacities
Issue or Number:3
Record Number:CaltechAUTHORS:DANieeetit06a
Persistent URL:
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:4122
Deposited By: Archive Administrator
Deposited On:28 Jul 2006
Last Modified:08 Nov 2021 20:14

Repository Staff Only: item control page