Cooperative strategies and capacity theorems for relay networks

By Gerhard Kramer, Michael C. Gastpar, Piyush Kumar Gupta. IEEE Transactions on Information Theory, 2005

2,680 citations recorded by the source corpus.

Subfields: Computer Networks and Communications, Electrical and Electronic Engineering

View Paper: https://www.semanticscholar.org/paper/2083a70b6f1cd53b4e95da043f1fb6df80198762

How researchers see this paper

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

In Computer Networks and Communications

In Electrical and Electronic Engineering

Citations in the corpus

A Unified Framework for Optimizing Linear Nonregenerative Multicarrier MIMO Relay Communication Systems (2009, background): “Recently, cooperative communications have seen a renewed interest [3]–[6].”
The Relay–Eavesdropper Channel: Cooperation for Secrecy (2006, methodology): “[3] and the regular coding and backward decoding scheme in the relay channel [7] , [20 .”
Capacity bounds for Cooperative diversity (2006, methodology): “This was used in [35] to find the sum capacity of a two-antenna broadcast channel, and it was recently proved to give the full capacity region of a multiple-antenna broadcast channel [45].”
Hybrid Full-Duplex/Half-Duplex Relaying with Transmit Power Adaptation (2011, background): “∙ In information theory, FD relays provide an idealistic benchmark when deriving capacity results for generic relay channels [1], [2], [20], [21].”
Breaking Spectrum Gridlock With Cognitive Radios: An Information Theoretic Perspective (2009, background): “These strategies can also be applied to the multiple-relay network where a group of intermediate relays helps forward messages between a given source–destination pair [78].”
Cooperative Communication Protocols in Wireless Networks: Performance Analysis and Optimum Power Allocation (2007, background): “ther addressed the information-theoretic aspect of the relay channel, for example [10, 11 ]”
Capacity of wireless erasure networks (2006, neutral): “Table I summarizes our notation.”
Multinode Cooperative Communications in Wireless Networks (2007, background): “This case is of special interest as it was shown in [14] that decode-and-forward relaying can be a capacity achieving scheme when the relays are taken to be closer to the source and it has the best performance compared to amplify-and-forward and compress-and-forward relaying in this case.”
Relay Architectures for 3GPP LTE-Advanced (2009, background): “Other hybrid types of transmission are possible including the information-theoretic compress-andforward [17] and the more practical demodulate-andforward [18].”
Full-Duplex Wireless Communications: Challenges, Solutions, and Future Research Directions (2016, background): “[34] Proves that transmit power optimization is capable of alleviating the effect of SI and exhibiting the advantages of FD protocols.”
Cooperative Communications for Cognitive Radio Networks (2009, background): “... cooperative communications and networking allowsdifferentusersornodesinawirelessnetworktoshare resources and to create collaboration through distributed transmission/processing, in which each user’s information is sent out not only by the user but also by the collaborating users[22].Cooperativec”
Degrees of Freedom Region of the MIMO $X$ Channel (2008, background): “The distributed MIMO perspective is relevant not only for wireless networks where the nodes are equipped with multiple antennas but also for networks of single-antenna nodes which may achieve MIMO behavior through message sharing and collective relaying by clusters of neighboring nodes [1]–[7].”
Wireless diversity through network coding (2006, neutral): “A similar configuration was studied in [3].”
Embracing wireless interference: analog network coding (2007, background): “There is, however, considerable wor k that bounds the capacity or improves the throughput of the 3-node-relay [20, 6, 19] and the Alice-Bob topology [27, 26, 22].”
Achievable Rate Regions for the Two-way Relay Channel (2006, background): “Another scheme where the relay does not decode but sends estimates of its received symbols was developed in [3, Theorem 6] for the one-way relay channel and is nowadays known as compress-and-forward, see also [4], [6].”
Cooperative Communications in Resource-Constrained Wireless Networks (2007, methodology): “Some of these methods are decodeand-forward (DF), amplify-and-forward (AF) [2], coded cooperation [4], and compress-and-forward (CF) [6], most of which adopt either maximal ratio combining or selective combining at the destination.”
Compute-and-Forward: Harnessing Interference Through Structured Codes (2009, background): “For more details on d eco e-and-forward for multiple relays (as well as compress-and-forward and cut-set upper bounds), see [3].”
Wireless Network Information Flow: A Deterministic Approach (2009, background): “[15] also generalized the compress-forward strategy to networks wit h a single layer of relay nodes.”
On Capacity Under Receive and Spatial Spectrum-Sharing Constraints (2007, background): “An analysis of this configuration under transmit power constraints can be found in [30].”