On the capacity of large Gaussian relay networks

By Michael C. Gastpar, Martin Vetterli. IEEE Transactions on Information Theory, 2005

354 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Cooperative strategies and capacity theorems for relay networks (2005, background): “Other types of logarithmic scaling laws were obtained in [32] and [51].”
Cooperative Communications with Outage-Optimal Opportunistic Relaying (2007, background): “Basic results for cooperation are presented in [4]–[6] and references therein.”
On Capacity Under Receive and Spatial Spectrum-Sharing Constraints (2007, background): “Proof [Proof of Theorem 7]: For the achievability, we proceed along the lines of [32], [33] by analyzing the following coding scheme: During time slot , sensor transmits”
Source-Channel Communication in Sensor Networks (2003, background): “This can be extended to cases where the total sensor power behaves according to a different law along the lines of the analysis in [8, 9].”
Convex Optimization-Based Beamforming (2010, background): “Information-theoretic analysis of the relay channel [39] and multiple-relay networks [40] has paved the way for more practical network cooperation schemes.”
Wireless Network Information Flow: A Deterministic Approach (2009, background): “Gastpar and Vetterli established the asymptotic capacity of a single sender, single receiver network as the number of relay nodes increases [14].”