Relay Channels With Unreliable Helpers
Pages 8423 - 8431
Abstract
The relay channel with unreliable helper is introduced and studied. The model is that of a classical relay channel where the input from the relay to the channel has an extra primitive link whose presence is not assured a priori. The extra link represents a helper who may decide not to cooperate in transmission. The goal is to devise robust coding schemes that exploit all the relay links when they are present, but can also operate, possibly at reduced rates, when the extra primitive link (helper) is absent. The capacity region of this class of problems is defined, and fully characterized for degraded relay channels. The degraded Gaussian relay channel with unreliable relay link is solved.
References
[1]
E. C. Van Der Meulen, “Three-terminal communication channels,” Adv. Appl. Probabil., vol. 3, no. 1, pp. 120–154, Apr. 1971.
[2]
T. M. Cover and A. A. El Gamal, “Capacity theorems for the relay channel,” IEEE Trans. Inf. Theory, vol. IT-25, no. 5, pp. 572–584, Sep. 1979.
[3]
A. El Gamal and Y. Kim, Network Information Theory. Cambridge, U.K.: Cambridge Univ. Press, 2011.
[4]
F. Willems, “The discrete memoryless multiple access channel with partially cooperating encoders (Corresp.),” IEEE Trans. Inf. Theory, vol. IT-29, no. 3, pp. 441–445, May 1983.
[5]
F. Willems and E. van der Meulen, “The discrete memoryless multiple-access channel with cribbing encoders,” IEEE Trans. Inf. Theory, vol. IT-31, no. 3, pp. 313–327, May 1985.
[6]
R. Dabora and S. D. Servetto, “Broadcast channels with cooperating decoders,” IEEE Trans. Inf. Theory, vol. 52, no. 12, pp. 5438–5454, Dec. 2006.
[7]
Y. Liang, “Multiuser communications with relaying and user cooperation,” Ph.D. dissertation, Dept. Elect. Comput. Eng., Univ. Illinois, Urbana-Champaign, Champaign, IL, USA, 2005.
[8]
Y. Liang and V. V. Veeravalli, “Cooperative relay broadcast channels,” IEEE Trans. Inf. Theory, vol. 53, no. 3, pp. 900–928, Mar. 2007.
[9]
G. Kramer, M. Gastpar, and P. Gupta, “Cooperative strategies and capacity theorems for relay networks,” IEEE Trans. Inf. Theory, vol. 51, no. 9, pp. 3037–3063, Sep. 2005.
[10]
Y. Liang and G. Kramer, “Rate regions for relay broadcast channels,” IEEE Trans. Inf. Theory, vol. 53, no. 10, pp. 3517–3535, Oct. 2007.
[11]
A. Behboodi and P. Piantanida, “Cooperative strategies for simultaneous and broadcast relay channels,” IEEE Trans. Inf. Theory, vol. 59, no. 3, pp. 1417–1443, Mar. 2013.
[12]
B. Hu, K. Wang, Y. Ma, and Y. Wu, “On the capacity regions of degraded relay broadcast channels with and without feedback,” Entropy, vol. 22, no. 7, p. 784, Jul. 2020.
[13]
S. R. Bhaskaran, “Gaussian degraded relay broadcast channel,” IEEE Trans. Inf. Theory, vol. 54, no. 8, pp. 3699–3709, Aug. 2008.
[14]
D. Blackwell, L. Breiman, and A. J. Thomasian, “The capacity of a class of channels,” Ann. Math. Statist., vol. 30, no. 4, pp. 1229–1241, Dec. 1959.
[15]
D. Blackwell, L. Breiman, and A. J. Thomasian, “The capacities of certain channel classes under random coding,” Ann. Math. Statist., vol. 31, no. 3, pp. 558–567, Sep. 1960.
[16]
R. L. Dobrushin, “Optimum information transmission through a channel with unknown parameters,” Radio Eng. Electron., vol. 4, no. 12, pp. 1–8, 1959.
[17]
J. Wolfowitz, “Simultaneous channels,” Arch. Rational Mech. Anal., vol. 4, no. 1, pp. 371–386, Jan. 1959.
[18]
I. Csiszár and J. Körner, Information Theory: Coding Theorems for Discrete Memoryless Systems, 2nd ed. London, U.K.: Cambridge Univ. Press, 2011.
[19]
A. Lapidoth and I. E. Telatar, “The compound channel capacity of a class of finite-state channels,” IEEE Trans. Inf. Theory, vol. 44, no. 3, pp. 973–983, May 1998.
[20]
Y. Steinberg, “Channels with cooperation links that may be absent,” in Proc. IEEE Int. Symp. Inf. Theory, Jun. 2014, pp. 1947–1951.
[21]
W. Huleihel and Y. Steinberg, “Multiple access channel with unreliable cribbing,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Jul. 2016, pp. 1491–1495.
[22]
W. Huleihel and Y. Steinberg, “Channels with cooperation links that may be absent,” IEEE Trans. Inf. Theory, vol. 63, no. 9, pp. 5886–5906, Sep. 2017.
[23]
D. Itzhak and Y. Steinberg, “The broadcast channel with degraded message sets and unreliable conference,” IEEE Trans. Inf. Theory, vol. 67, no. 9, pp. 5623–5650, Sep. 2021.
[24]
U. Pereg, C. Deppe, and H. Boche, “Communication with unreliable entanglement assistance,” IEEE Trans. Inf. Theory, vol. 69, no. 7, pp. 4579–4599, Aug. 2023.
[25]
L. H. Ozarow, S. Shamai (Shitz), and A. D. Wyner, “Information theoretic considerations for cellular mobile radio,” IEEE Trans. Veh. Technol., vol. 43, no. 2, pp. 359–378, May 1994.
[26]
R. Karasik, O. Simeone, and S. S. Shitz, “Robust uplink communications over fading channels with variable backhaul connectivity,” IEEE Trans. Wireless Commun., vol. 12, no. 11, pp. 5788–5799, Nov. 2013.
[27]
A. Steiner and S. Shamai (Shitz), “Multi-layer broadcasting hybrid-ARQ strategies for block fading channels,” IEEE Trans. Wireless Commun., vol. 7, no. 7, pp. 2640–2650, Jul. 2008.
[28]
B. Hayek, Random Processes for Engineers. Cambridge, U.K.: Cambridge Univ. Press, 2015.
Index Terms
- Relay Channels With Unreliable Helpers
Index terms have been assigned to the content through auto-classification.
Recommendations
Fading relay channels: performance limits and space-time signal design
Cooperative diversity is a transmission technique, where multiple terminals pool their resources to form a virtual antenna array that realizes spatial diversity gain in a distributed fashion. In this paper, we examine the basic building block of ...
Distributed Space-Frequency Coding over Broadband Relay Channels
Part 2Designing diversity achieving schemes over the wireless broadband fading relay channels is crucial to achieve higher diversity gains. These gains are achieved by exploiting the multipath (frequency) and cooperative diversities to combat the fading ...
Secrecy in Cooperative Relay Broadcast Channels
We investigate the effects of user cooperation on the secrecy of broadcast channels by considering a cooperative relay broadcast channel. We show that user cooperation can increase the achievable secrecy region. We propose an achievable scheme that ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
0018-9448 © 2024 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.
Publisher
IEEE Press
Publication History
Published: 06 May 2024
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 11 Dec 2024
Other Metrics
Citations
View Options
View options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in