English
Related papers

Related papers: Link-State Based Decode-Forward Schemes for Two-wa…

200 papers

Two-way relaying in wireless systems has initiated a large research effort during the past few years. While one-way relay with a single data flow introduces loss in spectral efficiency due to its half-duplex operation, two-way relaying…

Information Theory · Computer Science 2012-09-27 Huaping Liu , Petar Popovski , Elisabeth de Carvalho , Yuping Zhao , Fan Sun , Chan Dai Truyen Thai

In this paper, the diamond relay channel is considered, which consists of one source-destination pair and two relay nodes connected with rate-limited out-of-band conferencing links. In particular, we focus on the half-duplex alternative…

Information Theory · Computer Science 2012-05-08 Chuan Huang , Shuguang Cui

This paper considers an amplify-and-forward relay network with fading states. Amplify-and-forward scheme (along with its variations) is the core mechanism for enabling cooperative communication in wireless networks, and hence understanding…

Information Theory · Computer Science 2009-08-06 Jubin Jose , Lei Ying , Sriram Vishwanath

In this paper, we present a new cooperative communication scheme consisting of two users in half-duplex mode communicating with one destination over a discrete memoryless channel. The users encode messages in independent blocks and divide…

Information Theory · Computer Science 2011-06-03 Ahmad Abu Al Haija , Mai Vu

In this paper we present several strategies for multiple relay networks which are constrained by a half-duplex operation, i. e., each node either transmits or receives on a particular resource. Using the discrete memoryless multiple relay…

Information Theory · Computer Science 2007-12-24 P. Rost , G. Fettweis

In this paper, we propose a new coding scheme for the general relay channel. This coding scheme is in the form of a block Markov code. The transmitter uses a superposition Markov code. The relay compresses the received signal and maps the…

Information Theory · Computer Science 2007-10-05 Wei Kang , Sennur Ulukus

The basic problem of secure bidirectional relaying involves two users who want to exchange messages via an intermediate "honest-but-curious" relay node. There is no direct link between the users, all communication must take place via the…

Information Theory · Computer Science 2015-06-09 Shashank Vatedka , Navin Kashyap

A relay channel is one in which a Source and Destination use an intermediate Relay station in order to improve communication rates. We propose the study of relay channels with classical inputs and quantum outputs and prove that a "partial…

Quantum Physics · Physics 2012-09-04 Ivan Savov , Mark M. Wilde , Mai Vu

This work studies the problem of secure connection in cooperative wireless communication with two relay strategies, decode-and-forward (DF) and randomize-and-forward (RF). The four-node scenario and cellular scenario are considered. For the…

Information Theory · Computer Science 2012-04-10 Jianhua Mo , Meixia Tao , Yuan Liu

..... joint decoding provides more freedom in choosing the compression at the relay. However, the question remains whether this freedom of selecting the compression necessarily improves the achievable rate of the original message. It has…

Information Theory · Computer Science 2011-02-22 Xiugang Wu , Liang-Liang Xie

Molecular Communications via Diffusion (MCvD) is a promising paradigm which enables nano-machines to communicate with each other. However, the reliability of existing systems degrade rapidly as the distance between the transmitters and the…

Signal Processing · Electrical Eng. & Systems 2018-04-05 Ghazaleh Ardeshiri , Ali Jamshidi , Alireza Keshavarz-Haddad

The problem of optimal power allocation among the relays in a two-hop decode-and-forward cooperative relay network with independent Rayleigh fading channels is considered. It is assumed that only the relays that decode the source message…

Information Theory · Computer Science 2015-05-27 Arash Khabbazibasmenj , Sergiy A. Vorobyov

We present the optimal relay-subset selection and transmission-time for a decode-and-forward, half-duplex cooperative network of arbitrary size. The resource allocation is obtained by maximizing over the rates obtained for each possible…

Information Theory · Computer Science 2008-12-22 Elzbieta Beres , Raviraj Adve

The throughput benefits of random linear network codes have been studied extensively for wirelined and wireless erasure networks. It is often assumed that all nodes within a network perform coding operations. In energy-constrained systems,…

Networking and Internet Architecture · Computer Science 2012-06-05 Xiaomeng Shi , Muriel Medard , Daniel E. Lucani

In this paper, we derive the capacity of the deterministic relay networks with relay messages. We consider a network which consists of five nodes, four of which can only communicate via the fifth one. However, the fifth node is not merely a…

Information Theory · Computer Science 2016-11-15 Ahmed A. Zewail , Yahya Mohasseb , Mohammed Nafie , Hesham El Gamal

Two-way relaying can significantly improve performance of next generation wireless networks. However, due to its dependence on multi-node cooperation and transmission coordination, applying this technique to a wireless network in an…

Information Theory · Computer Science 2012-07-27 Wenguang Mao , Xudong Wang

In this paper, we consider joint network and LDPC coding for practically implementing the denosie-and-forward protocol over bi-directional relaying. the closed-form expressions for computing the log-likelihood ratios of the network-coded…

Information Theory · Computer Science 2011-05-13 Xiaofu Wu , Weijun Zeng , Chunming Zhao , Xiaohu You

In this paper, utilizing the relay buffers, we propose an opportunistic decode-wait-and-forward relay scheme for a point-to-point communication system with a half-duplexing relay network to better exploit the time diversity and relay…

Information Theory · Computer Science 2009-08-10 Rui Wang , Vincent K. N. Lau , Kaibin Huang

We consider a relay network with two relays and a feedback link from the receiver to the sender. To obtain the achievability result, we use compress-and-forward and random binning techniques combined with deterministic binning and…

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

A downlink single-input single-output non-orthogonal multiple access setting is considered, in which a base station (BS) is communicating with two legitimate users in two possible scenarios of unsecure environments: existence of an external…

Information Theory · Computer Science 2019-05-13 Ahmed Arafa , Wonjae Shin , Mojtaba Vaezi , H. Vincent Poor
‹ Prev 1 4 5 6 7 8 10 Next ›