Capacity of wireless erasure networks
Top Cited Papers
- 6 March 2006
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 52 (3) , 789-804
- https://doi.org/10.1109/tit.2005.864424
Abstract
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 analyzedKeywords
This publication has 21 references indexed in Scilit:
- On coding for reliable communication over packet networksPhysical Communication, 2008
- Cooperative Strategies and Capacity Theorems for Relay NetworksIEEE Transactions on Information Theory, 2005
- Minimum-energy multicast in mobile ad hoc networks using network codingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- An Achievable Rate for the Multiple-Level Relay ChannelIEEE Transactions on Information Theory, 2005
- LT codesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Linear network codingIEEE Transactions on Information Theory, 2003
- A First Course in Information TheoryPublished by Springer Nature ,2002
- Network information flowIEEE Transactions on Information Theory, 2000
- Capacity theorems for the relay channelIEEE Transactions on Information Theory, 1979
- The rate-distortion function for source coding with side information at the decoderIEEE Transactions on Information Theory, 1976