English
Related papers

Related papers: Relay Channels with Unreliable Helpers

200 papers

The capacity regions are investigated for two relay broadcast channels (RBCs), where relay links are incorporated into standard two-user broadcast channels to support user cooperation. In the first channel, the Partially Cooperative Relay…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , Venugopal V. Veeravalli

As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, for which lower and upper bounds on the capacity are derived. For the parallel relay channel with degraded subchannels, the…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , Venugopal V. Veeravalli , H. Vincent Poor

We consider the communication scenario where a source-destination pair wishes to keep the information secret from a relay node despite wanting to enlist its help. For this scenario, an interesting question is whether the relay node should…

Information Theory · Computer Science 2016-11-15 Xiang He , Aylin Yener

We investigate the problem of secure communication over parallel relay channel in the presence of a passive eavesdropper. We consider a four terminal relay-eavesdropper channel which consists of multiple relay-eavesdropper channels as…

Information Theory · Computer Science 2016-11-15 Zohaib Hassan Awan , Abdellatif Zaidi , Luc Vandendorpe

A partially cooperative relay broadcast channel (RBC) is a three-node network with one source node and two destination nodes (destinations 1 and 2) where destination 1 can act as a relay to assist destination 2. Inner and outer bounds on…

Information Theory · Computer Science 2007-07-13 Yingbin Liang , Gerhard Kramer

This paper studies the noncausal relay channel, also known as the relay channel with unlimited lookahead, introduced by El Gamal, Hassanpour, and Mammen. Unlike the standard relay channel model, where the relay encodes its signal based on…

Information Theory · Computer Science 2017-04-20 Lele Wang , Mohammad Naghshvar

Reliable transmission of a discrete memoryless source over a multiple-relay relay-broadcast network is considered. Motivated by sensor network applications, it is assumed that the relays and the destinations all have access to side…

Information Theory · Computer Science 2012-02-28 Deniz Gunduz , Elza Erkip , Andrea Goldsmith , H. Vincent Poor

A relay channel with orthogonal components that is affected by an interference signal that is noncausally available only at the source is studied. The interference signal has structure in that it is produced by another transmitter…

Information Theory · Computer Science 2016-11-15 Kagan Bakanoglu , Elza Erkip , Osvaldo Simeone , Sholomo Shamai

In this paper, communication over imperfectly-known fading channels with different degrees of cooperation is studied. The three-node relay channel is considered. It is assumed that communication starts with the network training phase in…

Information Theory · Computer Science 2008-12-09 Junwei Zhang , Mustafa Cenk Gursoy

It is well known that cooperation between users in a communication network can lead to significant performance gains. A common assumption in past works is that all the users are aware of the resources available for cooperation, and know…

Information Theory · Computer Science 2017-06-20 Wasim Huleihel , Yossef Steinberg

In this paper, we first present an outer bound for a general interference channel with a cognitive relay, i.e., a relay that has non-causal knowledge of both independent messages transmitted in the interference channel. This outer bound…

Information Theory · Computer Science 2015-03-17 Stefano Rini , Daniela Tuninetti , Natasha Devroye

We consider a state-dependent full-duplex relay channel with the state of the channel non-causally available at only the relay. In the framework of cooperative wireless networks, some specific terminals can be equipped with cognition…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Shivaprasad Kotagiri , J. Nicholas Laneman , Luc Vandendorpe

Although the rate region for the lossless many-help-one problem with independently degraded helpers is already "solved", its solution is given in terms of a convex closure over a set of auxiliary random variables. Thus, for any such a…

We consider a three-terminal state-dependent relay channel with the channel state available non-causally at only the source. Such a model may be of interest for node cooperation in the framework of cognition, i.e., collaborative signal…

Information Theory · Computer Science 2016-11-17 Abdellatif Zaidi , Shlomo Shamai , Pablo Piantanida , Luc Vandendorpe

Communication over a fully quantum relay channel is considered. We establish three bounds based on different coding strategies, i.e., partial decode-forward, measure-forward, and assist-forward. Using the partial-decode forward strategy,…

Quantum Physics · Physics 2025-05-22 Uzi Pereg

This paper considers a system where one transmitter broadcasts a single common message to two receivers linked by a bidirectional cooperation channel, which is assumed to be orthogonal to the downlink channel. Assuming a simplified setup…

Information Theory · Computer Science 2010-11-23 E. V. Belmega , B. Djeumou , S. Lasaulce

We investigate the effects of an additional relay node on the secrecy of broadcast channels by considering the model of relay broadcast channels with confidential messages. We show that this additional relay node can increase the achievable…

Information Theory · Computer Science 2015-12-09 Bin Dai , Linman Yu , Zheng Ma

We obtain a new upper bound on the capacity of a class of discrete memoryless relay channels. For this class of relay channels, the relay observes an i.i.d. sequence $T$, which is independent of the channel input $X$. The channel is…

Information Theory · Computer Science 2008-10-07 Ravi Tandon , Sennur Ulukus

The broadcast phase (downlink transmission) of the two-way relay network is studied in the source coding and joint source-channel coding settings. The rates needed for reliable communication are characterised for a number of special cases…

Information Theory · Computer Science 2010-11-23 Roy Timo , Alex Grant , Gerhard Kramer

We study the capacity of the full-duplex bidirectional (or two-way) relay channel with two nodes and one relay. The channels in the forward direction are assumed to be different (in general) than the channels in the backward direction, i.e.…

Information Theory · Computer Science 2008-08-26 Amir Salman Avestimehr , Aydin Sezgin , David N. C. Tse