The three-node wireless network: achievable rates and Cooperation strategies

DOI10.1109/TIT.2005.864421MaRDI QIDQ3547201zbMATH OpenFDO

Authors Lifeng Lai, Ke Liu, Hesham El Gamal

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0507002

zbMATH Keywords

List source-channel decodingmulticast channelnoisy feedbackrelay channelthree-way channel

Mathematics Subject Classification ID

Communication theory (94A05) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40) Circuits, networks (94C99)

Abstract: We consider a wireless network composed of three nodes and limited by the half-duplex and total power constraints. This formulation encompasses many of the special cases studied in the literature and allows for capturing the common features shared by them. Here, we focus on three special cases, namely 1) Relay Channel, 2) Multicast Channel, and 3) Conference Channel. These special cases are judicially chosen to reflect varying degrees of complexity while highlighting the common ground shared by the different variants of the three node wireless network. For the relay channel, we propose a new cooperation scheme that exploits the wireless feedback gain. This scheme combines the benefits of decode-and-forward and compress-and-forward strategies and avoids the idealistic feedback assumption adopted in earlier works. Our analysis of the achievable rate of this scheme reveals the diminishing feedback gain at both the low and high signal-to-noise ratio regimes. Inspired by the proposed feedback strategy, we identify a greedy cooperation framework applicable to both the multicast and conference channels. Our performance analysis reveals several nice properties of the proposed greedy approach and the central role of cooperative source-channel coding in exploiting the receiver side information in the wireless network setting. Our proofs for the cooperative multicast with side-information rely on novel nested and independent binning encoders along with a list decoder.

Recommendations

• Cooperative Strategies and Capacity Theorems for Relay Networks
• Cooperative Strategies and Achievable Rate for Tree Networks With Optimal Spatial Reuse
• Fundamental Limits and Scaling Behavior of Cooperative Multicasting in Wireless Networks
• Cooperative multi-hop transmission in wireless networks
• scientific article; zbMATH DE number 2135154

Cited in

(5)

• Wireless three-hop networks with stealing. II: Exact solutions through boundary value problems
• Wireless 3-hop Networks with Stealing Revisited: A Kernel Approach
• The road to achieve the capacity of the three-way degraded broadcast channel
• Power and resource allocation for orthogonal multiple access relay systems
• Wireless network design via 3-decompositions

This page was built for publication: The three-node wireless network: achievable rates and Cooperation strategies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3547201)