English
Related papers

Related papers: Capacity Bounds for Two-Hop Interference Networks

200 papers

In large wireless networks, acquiring full network state information is typically infeasible. Hence, nodes need to flow the information and manage the interference based on partial information about the network. In this paper, we consider…

Information Theory · Computer Science 2015-03-17 Alireza Vahid , Vaneet Aggarwal , Amir Salman Avestimehr , Ashutosh Sabharwal

The study of feedback has been mostly limited to single-hop communication settings. In this paper, we consider Gaussian networks where sources and destinations can communicate with the help of intermediate relays over multiple hops. We…

Information Theory · Computer Science 2014-07-16 Bobbie Chern , Farzan Farnia , Ayfer Özgür

For two-user interference channels, the capacity is known for the case where interference is stronger than the desired signal. Moreover, it is known that if the interference is above a certain level, it does not reduce the capacity at all.…

Information Theory · Computer Science 2012-06-21 Frederic Knabe , Aydin Sezgin

We consider a two-user Gaussian multiple access channel with two independent additive white Gaussian interferences. Each interference is known to exactly one transmitter non-causally. Transmitters are allowed to cooperate through…

Information Theory · Computer Science 2010-09-23 I-Hsiang Wang

When multiple users share the same resource for physical layer cooperation such as relay terminals in their vicinities, this shared resource may not be always available for every user, and it is critical for transmitting terminals to know…

Information Theory · Computer Science 2015-12-02 Shih-Chun Lin , I-Hsiang Wang

We study the interaction between two interfering Gaussian 2-user multiple access channels. The capacity region is characterized under mixed strong--extremely strong interference and individually very strong interference. Furthermore, the…

Information Theory · Computer Science 2011-03-15 Anas Chaaban , Aydin Sezgin , Bernd Bandemer , Arogyaswami Paulraj

Handling interference is one of the main challenges in the design of wireless networks. One of the key approaches to interference management is node cooperation, which can be classified into two main types: relaying and feedback. In this…

Information Theory · Computer Science 2015-03-19 Daniel Zahavi , Ron Dabora

In this paper, a class of relay networks is considered. We assume that, at a node, outgoing channels to its neighbors are orthogonal, while incoming signals from neighbors can interfere with each other. We are interested in the multicast…

Information Theory · Computer Science 2016-11-17 Wooseok Nam , Sae-Young Chung , Yong H. Lee

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

This work considers load-balance control among the relays under the secure transmission protocol via relay cooperation in two-hop wireless networks without the information of both eavesdropper channels and locations. The available two-hop…

Information Theory · Computer Science 2013-01-01 Yulong Shen , Xiaohong Jiang , Jianfeng Ma

The capacity of the two-user Gaussian cognitive interference channel, a variation of the classical interference channel where one of the transmitters has knowledge of both messages, is known in several parameter regimes but remains unknown…

Information Theory · Computer Science 2010-07-12 Stefano Rini , Daniela Tuninetti , Natasha Devroye

In this paper, we study the interference relay-without-delay channel which is an interference channel with a relay helping the communication. We assume the relay's transmit symbol depends not only on its past received symbols but also on…

Information Theory · Computer Science 2011-08-16 Hyunseok Chang , Sae-Young Chung

Relay networks having $n$ source-to-destination pairs and $m$ half-duplex relays, all operating in the same frequency band in the presence of block fading, are analyzed. This setup has attracted significant attention and several relaying…

Information Theory · Computer Science 2016-11-15 Shengshan Cui , Alexander M. Haimovich , Oren Somekh , H. Vincent Poor

A communication network is called a radio network if its nodes exchange messages in the following restricted way. First, a send operation performed by a node delivers copies of the same message to all directly reachable nodes. Secondly, a…

Networking and Internet Architecture · Computer Science 2018-01-03 Bogdan S. Chlebus

We study information-theoretic security for discrete memoryless interference and broadcast channels with independent confidential messages sent to two receivers. Confidential messages are transmitted to their respective receivers with…

Information Theory · Computer Science 2016-11-15 Ruoheng Liu , Ivana Maric , Predrag Spasojevic , Roy D. Yates

This paper investigates the degrees of freedom of the interference channel in the presence of a dedicated MIMO relay. The relay is used to manage the interference at the receivers. It is assumed that all nodes including the relay have…

Information Theory · Computer Science 2011-12-30 Ramy Abdallah Tannious , Aria Nosratinia

In this technical report, we analyze the performance of an interference-aware opportunistic relay selection protocol for multi-hop line networks which is based on the following simple rule: a node always transmits if it has a packet, except…

Networking and Internet Architecture · Computer Science 2012-07-18 Kostas Stamatiou , Davide Chiarotto , Federico Librino , Michele Zorzi

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

In this paper, we study the problem of coordinating two nodes which can only exchange information via a relay at limited rates. The nodes are allowed to do a two-round interactive two-way communication with the relay, after which they…

Information Theory · Computer Science 2012-03-06 Farzin Haddadpour , Mohammad Hossein Yassaee , Amin Gohari , Mohammad Reza Aref

In this paper we examine the value of feedback that comes from overhearing, without dedicated feedback resources. We focus on a simple model for this purpose: a deterministic two-hop interference channel, where feedback comes from…

Information Theory · Computer Science 2014-07-30 Jinyuan Chen , Ayfer Ozgur , Suhas Diggavi