English
Related papers

Related papers: Capacity Bounds for Two-Hop Interference Networks

200 papers

This third part of the paper is related to the study of information flow in networks with strong interference. First, the two-receiver networks are considered. A unified outer bound for the capacity region of these networks is established.…

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

Two-hop security communication with an eavesdropper in wireless environment is a hot research direction. The basic idea is that the destination, simultaneously with the source, sends a jamming signal to interfere the eavesdropper near to or…

Information Theory · Computer Science 2013-10-03 Zhen Qu , Shengli Zhang , Mingjun Dai , Hui Wang

In an M x N interference network, there are M transmitters and N receivers with each transmitter having independent messages for each of the 2^N -1 possible non-empty subsets of the receivers. We consider the 2 x 2 interference network with…

Information Theory · Computer Science 2016-12-26 Murali Sridhar , Srikrishna Bhashyam

In this paper, we investigate achievable rates for data transmission from sources to sinks through multiple relay networks. We consider myopic coding, a constrained communication strategy in which each node has only a local view of the…

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

Although extensively investigated, the capacity of the two-hop half-duplex (HD) relay channel is not fully understood. In particular, a capacity expression which can be easily evaluated is not available and an explicit coding scheme which…

Information Theory · Computer Science 2015-11-18 Nikola Zlatanov , Vahid Jamali , Derrick Wing Kwan Ng , Robert

The capacity of a class of Interference Relay Channels (IRC) -the Injective Semideterministic IRC where the relay can only observe one of the sources- is investigated. We first derive a novel outer bound and two inner bounds which are based…

Information Theory · Computer Science 2016-09-28 Germán Bassi , Pablo Piantanida , Sheng Yang

We consider a source-destination pair that can only communicate through an untrusted intermediate relay node. The intermediate node is willing to employ a designated relaying scheme to facilitate reliable communication between the source…

Information Theory · Computer Science 2009-10-16 Xiang He , Aylin Yener

We study the capacity region of a deterministic 4-node network, where 3 nodes can only communicate via the fourth one. However, the fourth node is not merely a relay since it can exchange private messages with all other nodes. This…

Information Theory · Computer Science 2013-08-09 Ahmed A. Zewail , Y. Mohasseb , M. Nafie , H. EL Gamal

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

This paper considers a random access system where each sender can be in two modes of operation, active or not active, and where the set of active users is available to a common receiver only. Active transmitters encode data into independent…

Information Theory · Computer Science 2016-11-18 Paolo Minero , Massimo Franceschetti , David N. C. Tse

We consider the two-hop interference channel (IC) with constant real channel coefficients, which consists of two source-destination pairs, separated by two relays. We analyze the achievable degrees of freedom (DoF) of such network when…

Information Theory · Computer Science 2013-05-20 Ibrahim Issa , Silas L. Fong , A. Salman Avestimehr

The interference channel models a wireless network where several source-destination pairs compete for the same resources. When nodes transmit simultaneously the destinations experience interference. This paper considers a 4-node network,…

Information Theory · Computer Science 2012-04-16 Daniela Tuninetti

In two-way networks, nodes act as both sources and destinations of messages. This allows for "adaptation" at or "interaction" between the nodes - a node's channel inputs may be functions of its message(s) and previously received signals.…

Information Theory · Computer Science 2016-11-18 Zhiyu Cheng , Natasha Devroye

This paper considers a fully-connected interference network with a relay in which multiple users equipped with a single antenna want to exchange multiple unicast messages with other users in the network by sharing the relay equipped with…

Information Theory · Computer Science 2013-02-05 Namyoon Lee , Robert W. Heath

This paper provides a survey of the state-of-the-art information theoretic analysis for overlay multi-user (more than two pairs) cognitive networks and reports new capacity results. In an overlay scenario, cognitive / secondary users share…

Information Theory · Computer Science 2015-10-26 Diana Maamari , Daniela Tuninetti , Natasha Devroye

Interference is a fundamental feature of the wireless channel. To better understand the role of cooperation in interference management, the two-user Gaussian interference channel where the destination nodes can cooperate by virtue of being…

Information Theory · Computer Science 2011-01-28 Vinod M. Prabhakaran , Pramod Viswanath

We develop a new metric for quantifying end-to-end throughput in multihop wireless networks, which we term random access transport capacity, since the interference model presumes uncoordinated transmissions. The metric quantifies the…

Information Theory · Computer Science 2016-11-18 Jeffrey G. Andrews , Steven Weber , Marios Kountouris , Martin Haenggi

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

This paper investigates the capacity regions of two-receiver broadcast channels where each receiver (i) has both common and private-message requests, and (ii) knows part of the private message requested by the other receiver as side…

Information Theory · Computer Science 2016-11-18 Behzad Asadi , Lawrence Ong , Sarah J. Johnson

The Gaussian parallel relay network, in which two parallel relays assist a source to convey information to a destination, was introduced by Schein and Gallager. An upper bound on the capacity can be obtained by considering broadcast cut…

Information Theory · Computer Science 2016-04-13 Satyajit Thakor , Syed Abbas
‹ Prev 1 3 4 5 6 7 10 Next ›