On the capacity of the single source multiple relay single destination mesh network

Authors:
Lawrence Ong;Mehul Motani
Affiliations:
Electrical and Computer Engineering Department, National University of Singapore, Singapore 119260, Singapore;Electrical and Computer Engineering Department, National University of Singapore, Singapore 119260, Singapore
Venue:
Ad Hoc Networks
Year:
2007

Citing 9
Cited 3

Elements of information theory

Elements of information theory
Wireless mesh networks: a survey

Computer Networks and ISDN Systems
Characterizing the capacity region in multi-radio multi-channel wireless mesh networks

Proceedings of the 11th annual international conference on Mobile computing and networking
The nominal capacity of wireless mesh networks

IEEE Wireless Communications
Capacity regions for wireless ad hoc networks

IEEE Transactions on Wireless Communications
The capacity of wireless networks

IEEE Transactions on Information Theory
Capacity theorems for the relay channel

IEEE Transactions on Information Theory
On the capacity of large Gaussian relay networks

IEEE Transactions on Information Theory
An achievable rate for the multiple-level relay channel

IEEE Transactions on Information Theory

On the multicell processing capacity of the cellular MIMO uplink channel in correlated Rayleigh fading environment

IEEE Transactions on Wireless Communications
Wireless relay placement

RWS'09 Proceedings of the 4th international conference on Radio and wireless symposium
An algorithm for wireless relay placement

IEEE Transactions on Wireless Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we derive the information theoretic capacity of a special class of mesh networks. A mesh network is a heterogeneous wireless network in which the transmission among power limited nodes is assisted by powerful relays, which use the same wireless medium. We investigate the mesh network when there is one source, one destination, and multiple relays, which we call the single source multiple relay single destination (SSMRSD) mesh network. We derive the asymptotic capacity of the SSMRSD mesh network when the relay powers grow to infinity. Our approach is as follows. We first look at an upper bound on the information theoretic capacity of these networks in a Gaussian setting. We then show that this bound is achievable asymptotically using the compress-and-forward strategy for the multiple relay channel. We also perform numerical computations for the case when the relays have finite powers. We observe that even when the relay power is only a few times larger than the source power, the compress-and-forward rate gets close to the capacity. The results indicate the value of cooperation in wireless mesh networks. The capacity characterization quantifies how the relays can cooperate, using the compress-and-forward strategy, to either conserve node energy or to increase transmission rate.