On two-pair two-way relay channel with an intermittently available relay

When multiple users share the same resource for physical layer cooperation such as relay terminals in their vicinities, this shared resource may not be always available for every user, and it is critical for transmitting terminals to know whether other users have access to that common resource in order to better utilize it. Failing to learn this critical piece of information may cause severe issues in the design of such cooperative systems. In this paper, we address this problem by investigating a two-pair two-way relay channel with an intermittently available relay. In the model, each pair of users need to exchange their messages within their own pair via the shared relay. The shared relay, however, is only intermittently available for the users to access. The accessing activities of different pairs of users are governed by independent Bernoulli random processes. Our main contribution is the characterization of the capacity region to within a bounded gap in a symmetric setting, for both delayed and instantaneous state information at transmitters. An interesting observation is that the bottleneck for information flow is the quality of state information (delayed or instantaneous) available at the relay, not those at the end users. To the best of our knowledge, our work is the first result regarding how the shared intermittent relay should cooperate with multiple pairs of users in such a two-way cooperative network.

[1]  Shlomo Shamai,et al.  Nested linear/Lattice codes for structured multiterminal binning , 2002, IEEE Trans. Inf. Theory.

[2]  Suhas N. Diggavi,et al.  Wireless Network Information Flow: A Deterministic Approach , 2009, IEEE Transactions on Information Theory.

[3]  Hua Sun,et al.  Topological interference management with alternating connectivity , 2013, 2013 IEEE International Symposium on Information Theory.

[4]  Sae-Young Chung,et al.  Capacity of the Gaussian Two-Way Relay Channel to Within ${1\over 2}$ Bit , 2009, IEEE Transactions on Information Theory.

[5]  Suhas N. Diggavi,et al.  Bursty interference channel with feedback , 2013, 2013 IEEE International Symposium on Information Theory.

[6]  Massimo Franceschetti,et al.  Random Access: An Information-Theoretic Perspective , 2012, IEEE Transactions on Information Theory.

[7]  Sae-Young Chung,et al.  Capacity of the Gaussian Two-way Relay Channel to within 1/2 Bit , 2009, ArXiv.

[8]  Michael Gastpar,et al.  Compute-and-Forward: Harnessing Interference Through Structured Codes , 2009, IEEE Transactions on Information Theory.

[9]  Abbas El Gamal,et al.  Network Information Theory , 2021, 2021 IEEE 3rd International Conference on Advanced Trends in Information Theory (ATIT).

[10]  Taoka Hidekazu,et al.  Scenarios for 5G mobile and wireless communications: the vision of the METIS project , 2014, IEEE Communications Magazine.

[11]  H. Vincent Poor,et al.  Multiuser Lattice Coding for the Multiple-Access Relay Channel , 2014, IEEE Transactions on Wireless Communications.

[12]  Zixiang Xiong,et al.  Successive refinement for the Wyner-Ziv problem and layered code design , 2005, IEEE Trans. Signal Process..

[13]  Aydin Sezgin,et al.  Divide-and-Conquer: Approaching the Capacity of the Two-Pair Bidirectional Gaussian Relay Network , 2012, IEEE Transactions on Information Theory.

[14]  Martin E. Hellman,et al.  The Gaussian wire-tap channel , 1978, IEEE Trans. Inf. Theory.

[15]  Amir Salman Avestimehr,et al.  Capacity Results for Binary Fading Interference Channels With Delayed CSIT , 2013, IEEE Transactions on Information Theory.

[16]  Leandros Tassiulas,et al.  Broadcast erasure channel with feedback - Capacity and algorithms , 2009, 2009 Workshop on Network Coding, Theory, and Applications.