English
Related papers

Related papers: Approximate capacity of the two-way relay channel:…

200 papers

Full-duplex communication has the potential to substantially increase the throughput in wireless networks. However, the benefits of full-duplex are still not well understood. In this paper, we characterize the full-duplex rate gains in both…

Information Theory · Computer Science 2016-06-10 Jelena Marašević , Jin Zhou , Harish Krishnaswamy , Yuan Zhong , Gil Zussman

We study the problem of power allocation over two identical Gilbert-Elliot communication channels. Our goal is to maximize the expected discounted number of bits transmitted over an infinite time horizon. This is achieved by choosing among…

Information Theory · Computer Science 2012-09-27 Junhua Tang , Parisa Mansourifard , Bhaskar Krishnamachari

In this paper, we study a routing problem on the Gaussian multiple relay channel, in which nodes employ a decode-and-forward coding strategy. We are interested in routes for the information flow through the relays that achieve the highest…

Information Theory · Computer Science 2010-04-15 Lawrence Ong , Mehul Motani

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

Recent research developments show that the concept of bidirectional relaying significantly improves the performance in wireless networks. This applies to three-node networks, where a half-duplex relay node establishes a bidirectional…

Information Theory · Computer Science 2011-04-19 Rafael F. Wyrembelski , Holger Boche

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

Communication nodes with the ability to harvest energy from the environment have the potential to operate beyond the timeframe limited by the finite capacity of their batteries; and accordingly, to extend the overall network lifetime.…

Information Theory · Computer Science 2011-09-27 Deniz Gunduz , Bertrand Devillers

The capacity of a relay channel with inter-symbol interference (ISI) and additive colored Gaussian noise is examined under an input power constraint. Prior results are used to show that the capacity of this channel can be computed by…

Information Theory · Computer Science 2011-03-02 Chiranjib Choudhuri , Urbashi Mitra

The transmission capacity of an ad-hoc network is the maximum density of active transmitters per unit area, given an outage constraint at each receiver for a fixed rate of transmission. Most prior work on finding the transmission capacity…

Information Theory · Computer Science 2010-09-09 Rahul Vaze , Kien T. Truong , Steven Weber , Robert W. Heath

A general class of wireless relay networks with a single source-destination pair is considered. Intermediate nodes in the network employ an amplify-and-forward scheme to relay their input signals. In this case the overall input-output…

Information Theory · Computer Science 2011-06-02 Samar Agnihotri , Sidharth Jaggi , Minghua Chen

We find the capacity region of linear finite-field deterministic networks with many sources and one destination. Nodes in the network are subject to interference and broadcast constraints, specified by the linear finite-field deterministic…

Information Theory · Computer Science 2016-09-08 M. Majid Butt , Giuseppe Caire , Ralf R. Müller

In this paper, a two-hop network in which information is transmitted from a source via a relay to a destination is considered. It is assumed that the channels are static fading with additive white Gaussian noise. All nodes are equipped with…

Information Theory · Computer Science 2009-05-18 Vahid Pourahmadi , Alireza Bayesteh , Amir K. Khandani

We present an achievable rate for general deterministic relay networks, with broadcasting at the transmitters and interference at the receivers. In particular we show that if the optimizing distribution for the information-theoretic cut-set…

Information Theory · Computer Science 2007-10-24 A. S. Avestimehr , S. N. Diggavi , D. N. C. Tse

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

This paper presents a distributed resource allocation algorithm to jointly optimize the power allocation, channel allocation and relay selection for decode-and-forward (DF) relay networks with a large number of sources, relays, and…

Information Theory · Computer Science 2015-03-19 Yin Sun , Zhoujia Mao , Xiaofeng Zhong , Yuanzhang Xiao , Shidong Zhou , Ness B. Shroff

Full-duplex multi-way relaying is a potential solution for supporting high data rates in future Internet-of-Things (IoT) and 5G networks. Thus, in this paper the full-duplex MIMO multi-way channel consisting of 3 users (Y-channel) with $M$…

Information Theory · Computer Science 2014-12-03 Anas Chaaban , Aydin Sezgin

This paper considers a variation of the classical two-user interference channel where the communication of two interfering source-destination pairs is aided by an additional node that has a priori knowledge of the messages to be…

Information Theory · Computer Science 2014-09-09 Alex Dytso , Stefano Rini , Natasha Devroye , Daniela Tuninetti

We consider two-source two-destination (i.e., two-unicast) multi-hop wireless networks that have a layered structure with arbitrary connectivity. We show that, if the channel gains are chosen independently according to continuous…

Information Theory · Computer Science 2015-03-18 Ilan Shomorony , A. Salman Avestimehr

In this paper we study a Gaussian relay-interference network, in which relay (helper) nodes are to facilitate competing information flows over a wireless network. We focus on a two-stage relay-interference network where there are weak…

Information Theory · Computer Science 2010-05-05 Soheil Mohajer , Suhas N. Diggavi , Christina Fragouli , David N. C. Tse

The L-user additive white Gaussian noise multi-way relay channel is considered, where multiple users exchange information through a single relay at a common rate. Existing coding strategies, i.e., complete-decode-forward and…

Information Theory · Computer Science 2015-03-14 Lawrence Ong , Christopher M. Kellett , Sarah J. Johnson
‹ Prev 1 8 9 10 Next ›