English
Related papers

Related papers: On the Capacity of Pairwise Collaborative Networks

200 papers

The two user Gaussian interference channel with a full-duplex relay is studied. By using genie aided approaches, two new upper bounds on the achievable sum-rate in this setup are derived. These upper bounds are shown to be tighter than…

Information Theory · Computer Science 2010-08-16 Anas Chaaban , Aydin Sezgin

In a cooperative coding scheme, network nodes work together to achieve higher transmission rates. To obtain a better understanding of cooperation, we consider a model in which two transmitters send rate-limited descriptions of their…

Information Theory · Computer Science 2015-04-20 Parham Noorzad , Michelle Effros , Michael Langberg

We consider a half-duplex diamond relay channel, which consists of one source-destination pair and two relay nodes connected with two-way rate-limited out-of-band conferencing links. Three basic schemes and their achievable rates are…

Information Theory · Computer Science 2015-03-17 Chuan Huang , Jinhua Jiang , Shuguang Cui

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…

Information Theory · Computer Science 2007-07-13 Lifeng Lai , Ke Liu , Hesham El Gamal

In this paper, we investigate transmission techniques for a fundamental cooperative cognitive radio network, i.e., a radio system where a Secondary user may act as relay for messages sent by the Primary user, hence offering performance…

Signal Processing · Electrical Eng. & Systems 2018-08-02 Athanasios Papadopoulos , Nestor D. Chatzidiamantis , Leonidas Georgiadis

In this paper, a distributed turbo-like coding scheme for wireless networks with relays is proposed. We consider a scenario where multiple sources communicate with a single destination with the help of a relay. The proposed scheme can be…

Information Theory · Computer Science 2009-10-13 Roua Youssef , Alexandre Graell i Amat

We consider a relay network with two relays and two feedback links from the relays to the sender. To obtain the achievability results, we use the compress-and-forward and the decode-and-forward strategies to superimpose facility and…

Information Theory · Computer Science 2011-11-11 Mohammad Ali Tebbi , Mahtab Mirmohseni , Mahmoud Ahmadian Attari , Mohammad Reza Aref

In this paper, a two-user discrete memoryless multiple-access channel (DM-MAC) with correlated channel states, each known at one of the encoders is considered, in which each encoder transmits independent messages and tries to cooperate with…

Information Theory · Computer Science 2011-02-08 Mahdi Zamanighomi , Mohammad Javad Emadi , Farhad Shirani Chaharsooghi , Mohammad Reza Aref

In this paper, it is shown that for any given single-hop communication network with two receivers, splitting messages into more than two sub-messages in a random coding scheme is redundant. To this end, the Broadcast Channel with Cognitive…

Information Theory · Computer Science 2013-02-17 Reza K. Farsani

The multicast capacity of the Gaussian two-hop relay network with one source, $N$ relays, and $L$ destinations is studied. It is shown that a careful modification of the partial decode--forward coding scheme, whereby the relays cooperate…

Information Theory · Computer Science 2015-08-04 Jing Li , Young-Han Kim

A two-user discrete memoryless compound multiple access channel with a common message and conferencing decoders is considered. The capacity region is characterized in the special cases of physically degraded channels and unidirectional…

Information Theory · Computer Science 2016-11-18 O. Simeone , D. Gunduz , H. V. Poor , A. Goldsmith , S. Shamai

We analyze the performance of a system composed of two interfering point-to-point links where the transmitters can exploit a common relay to improve their individual transmission rate. When the relay uses the amplify-and-forward protocol we…

Information Theory · Computer Science 2009-04-20 Brice Djeumou , Elena Veronica Belmega , Samson Lasaulce

A simple four node network in which cooperation improves the information-theoretic secrecy is studied. The channel consists of two senders, a receiver, and an eavesdropper. One or both senders transmit confidential messages to the receiver,…

Information Theory · Computer Science 2011-02-18 Ninoslav Marina , Hideki Yagi , H. Vincent Poor

This paper considers the multiple-access relay channel in a setting where two source nodes transmit packets to a destination node, both directly and via a relay node, over packet erasure channels. Intra-session network coding is used at the…

Information Theory · Computer Science 2022-03-08 Amjad Saeed Khan , Ioannis Chatzigeorgiou

In this paper, we consider a parallel relay network where two relays cooperatively help a source transmit to a destination. We assume the source and the destination nodes are equipped with multiple antennas. Three basic schemes and their…

Information Theory · Computer Science 2017-01-27 Muryong Kim , Sae-Young Chung

We consider a two-way relay network, where two source nodes, S1 and S2, exchange information through a cluster of relay nodes. The relay nodes receive the sum signal from S1 and S2 in the first time slot. In the second time slot, each relay…

Information Theory · Computer Science 2015-05-20 Meng Zeng , Rui Zhang , Shuguang Cui

A linear mesh network is considered in which a single user per cell communicates to a local base station via a dedicated relay (two-hop communication). Exploiting the possibly relevant inter-cell channel gains, rate splitting with…

Information Theory · Computer Science 2007-10-16 O. Simeone , O. Somekh , Y. Bar-Ness , H. V. Poor , S. Shamai

The capacity region of multi-pair bidirectional relay networks, in which a relay node facilitates the communication between multiple pairs of users, is studied. This problem is first examined in the context of the linear shift deterministic…

Information Theory · Computer Science 2016-11-17 Aydin Sezgin , A. Salman Avestimehr , M. Amin Khajehnejad , Babak Hassibi

The two-user broadcast channel (BC) with receivers connected by bidirectional cooperation links of finite capacities, known as conferencing decoders, is considered. A novel capacity region outer bound is established based on multiple…

Information Theory · Computer Science 2025-08-12 Reza K. Farsani , Wei Yu

The problem of simultaneous multicasting of multiple messages with the help of a relay terminal is considered. In particular, a model is studied in which a relay station simultaneously assists two transmitters in multicasting their…

Information Theory · Computer Science 2009-02-19 Deniz Gunduz , Osvaldo Simeone , Andrea J. Goldsmith , H. Vincent Poor , Shlomo Shamai