Please use this identifier to cite or link to this item:
|Title:||On the capacity of the single source multiple relay single destination mesh network|
Multiple relay channel
|Citation:||Ong, L., Motani, M. (2007-08). On the capacity of the single source multiple relay single destination mesh network. Ad Hoc Networks 5 (6) : 786-800. ScholarBank@NUS Repository. https://doi.org/10.1016/j.adhoc.2006.12.006|
|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. © 2007 Elsevier B.V. All rights reserved.|
|Source Title:||Ad Hoc Networks|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 20, 2018
WEB OF SCIENCETM
checked on Sep 10, 2018
checked on Jul 27, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.