English
Related papers

Related papers: A Delay-Constrained Protocol with Adaptive Mode Se…

200 papers

In this paper, we consider a simple network consisting of a source, a half-duplex decode-and-forward relay, and a destination. We propose a new relaying protocol employing adaptive link selection, i.e., in any given time slot, based on the…

Information Theory · Computer Science 2015-03-20 Nikola Zlatanov , Robert Schober , Petar Popovski

In this paper, we consider the problem of sum throughput maximization for bidirectional relay networks with block fading. Thereby, user 1 and user 2 exchange information only via a relay node, i.e., a direct link between both users is not…

Information Theory · Computer Science 2016-11-15 Vahid Jamali , Nikola Zlatanov , Robert Schober

We consider a simple network consisting of a source, a half-duplex DF relay with a buffer, and a destination. We assume that the direct source-destination link is not available and all links undergo fading. We propose two new buffer-aided…

Information Theory · Computer Science 2013-02-19 Nikola Zlatanov , Robert Schober

In this paper, we consider the problem of sum rate maximization in a bidirectional relay network with fading. Hereby, user 1 and user 2 communicate with each other only through a relay, i.e., a direct link between user 1 and user 2 is not…

Information Theory · Computer Science 2013-06-12 Vahid Jamali , Nikola Zlatanov , Aissa Ikhlef , Robert Schober

The bidirectional relay channel, in which two users communicate with each other through a relay node, is a simple but fundamental and practical network architecture. In this paper, we consider the block fading bidirectional relay channel…

Information Theory · Computer Science 2016-11-17 Vahid Jamali , Nikola Zlatanov , Aissa Ikhlef , Robert Schober

We consider a bidirectional network in which two users exchange information with the help of a buffer-aided relay. In such a network without direct link between user 1 and user 2, there exist six possible transmission modes, i.e., four…

Information Theory · Computer Science 2013-06-13 Vahid Jamali , Nikola Zlatanov , Aissa Ikhlef , Robert Schober

In the half-duplex single relay selection network, comprised of a source, $M$ half-duplex relays, and a destination, only one relay is active at any given time, i.e., only one relay receives or transmits, and the other relays are inactive,…

Information Theory · Computer Science 2015-04-10 Nikola Zlatanov , Vahid Jamali , Robert Schober

In a bi-directional relay channel, a pair of nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of relays. Recent work has mostly considered information theoretic limits of the…

Information Theory · Computer Science 2010-02-02 Sang Joon Kim , Besma Smida , Natasha Devroye

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

In coded bi-directional cooperation, two nodes wish to exchange messages over a shared half-duplex channel with the help of a relay. In this paper, we derive performance bounds for this problem for each of three protocols. The first…

Information Theory · Computer Science 2008-06-05 Sang Joon Kim , Patrick Mitran , Vahid Tarokh

In this paper, protocols for the half-duplex relay channel are introduced and performance limits are analyzed. Relay nodes underly an orthogonality constraint, which prohibits simultaneous receiving and transmitting on the same…

Information Theory · Computer Science 2010-02-02 Peter Rost , Gerhard Fettweis

In a bi-directional relay channel, two nodes wish to exchange independent messages over a shared wireless half-duplex channel with the help of a relay. In this paper, we derive achievable rate regions for four new half-duplex protocols and…

Information Theory · Computer Science 2009-05-16 Sang Joon Kim , Natasha Devroye , Patrick Mitran , Vahid Tarokh

In this work, the achievable rate of three-node relay systems with selection relaying under statistical delay constraints, imposed on the limitations of the maximum end-to-end delay violation probabilities, is investigated. It is assumed…

Information Theory · Computer Science 2015-10-14 Deli Qiao

A restricted two-way communication problem in a small fully-connected network is investigated. The network consists of three nodes, all having access to a common channel with half-duplex constraint. Two nodes want to establish a dialog…

Information Theory · Computer Science 2014-09-05 Manuel Stein

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 study Two-way relaying networks well-known for its throughput merits. In particular, we study the fundamental throughput delay trade-off in two-way relaying networks using opportunistic network coding. We characterize the…

Information Theory · Computer Science 2015-02-11 Maha Zohdy , Tamer ElBatt , Mohamed Nafie

This paper analyzes the impact of statistical delay constraints on the achievable rate of a two-hop wireless communication link, in which the communication between a source and a destination is accomplished via a buffer-aided relay node. It…

Information Theory · Computer Science 2016-03-24 Deli Qiao , M. Cenk Gursoy

In this paper, we consider a three node, two-way relay system with digital network coding over static channels where all link gains are assumed to be constant during transmission. The aim is to minimize total energy consumption while…

Information Theory · Computer Science 2012-10-29 Zhi Chen , Teng Joon Lim , Mehul Motani

In this paper, link selection for half-duplex buffer-aided relay systems is revisited. A new fixed scheduling policy referred as alternate distributed beamforming (ADB) is proposed, in which the relays are divided into two groups, with one…

Information Theory · Computer Science 2019-10-10 Jiayu Zhou , Deli Qiao

This paper investigates the reinforcement learning for the relay selection in the delay-constrained buffer-aided networks. The buffer-aided relay selection significantly improves the outage performance but often at the price of higher…

Signal Processing · Electrical Eng. & Systems 2020-11-23 Chong Huang , Gaojie Chen , Yu Gong
‹ Prev 1 2 3 10 Next ›