Capacity of Wireless Erasure Networks

DMCA

Capacity of Wireless Erasure Networks (2006)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Amir F. Dana , Radhika Gowaikar , Ravi Palanki , Babak Hassibi , Michelle Effros

Venue:	IEEE TRANSACTIONS ON INFORMATION THEORY
Citations:	148 - 12 self

BibTeX

@ARTICLE{Dana06capacityof,
    author = {Amir F. Dana and Radhika Gowaikar and Ravi Palanki and Babak Hassibi and Michelle Effros},
    title = {Capacity of Wireless Erasure Networks},
    journal = {IEEE TRANSACTIONS ON INFORMATION THEORY},
    year = {2006},
    pages = {789--804}
}

OpenURL

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

Keyphrases

wireless erasure network capacity region wireless network broadcast nature interference avoidance network suffices wireless environment linear coding erasure channel wireless medium multicast problem special class nice max-flow min-cut interpretation broadcast property network model side information erasure location information transmission outgoing channel

DMCA