Capacity region of the deterministic multi-pair bi-directional relay network

Abstract

In this paper we study the capacity region of the multi-pair bidirectional (or two-way) wireless relay network, in which a relay node facilitates the communication between multiple pairs of users. This network is a generalization of the well known bidirectional relay channel, where we have only one pair of users. We examine this problem in the context of the deterministic channel interaction model, which eliminates the channel noise and allows us to focus on the interaction between signals. We characterize the capacity region of this network when the relay is operating at either full-duplex mode or half-duplex mode (with non adaptive listen-transmit scheduling). In both cases we show that the cut-set upper bound is tight and, quite interestingly, the capacity region is achieved by a simple equation-forwarding strategy.

Will be presented in the 2009 IEEE Information Theory Workshop on Networking and Information Theory

Cited by in corpus (11)

• Divide-and-conquer: Approaching the capacity of the two-pair bidirectional Gaussian relay network
• Approximate Sum-Capacity of the Y-channel
• Generalized Signal Alignment: On the Achievable DoF for Multi-User MIMO Two-Way Relay Channels
• Optimal DoF Region for the Asymmetric Two-Pair MIMO Two-Way Relay Channel
• The Capacity Region of the Linear Shift Deterministic Y-Channel
• One- and Two-Way Relay Optimization for MIMO Interference Networks
• On the Capacity Regions of Two-Way Diamond Channels
• The Approximate Capacity Region of the Gaussian Y-Channel
• An Overview on Multiway Relay Communications: Fundamental Issues, Recent Advances, and New Challenges
• The Deterministic Capacity of Relay Networks with Relay Private Messages
• Using Network Coding to Achieve the Capacity of Deterministic Relay Networks with Relay Messages