English
Related papers

Related papers: Capacity Bounds for Two-Hop Interference Networks

200 papers

In covert communication, Alice tries to communicate with Bob without being detected by a warden Willie. When the distance between Alice and Bob becomes large compared to the distance between Alice and Willie(s), the performance of covert…

Networking and Internet Architecture · Computer Science 2018-03-13 Azadeh Sheikholeslami , Majid Ghaderi , Don Towsley , Boulat A. Bash , Saikat Guha , Dennis Goeckel

This paper explores communication over a two-sender, two-receiver classical interference channel, enhanced by the availability of entanglement resources between transmitters. The central contributions are an inner and outer bound on the…

Quantum Physics · Physics 2025-01-24 Jonas Hawellek , Athin Mohan , Hadi Aghaee , Christian Deppe

We investigate how to exploit intermittent feedback for interference management. Focusing on the two-user linear deterministic interference channel, we completely characterize the capacity region. We find that the characterization only…

Information Theory · Computer Science 2016-11-17 Can Karakus , I-Hsiang Wang , Suhas Diggavi

This letter studies distributed opportunistic channel access in a wireless network with decode-and-forward relays. All the sources use channel contention to get transmission opportunity. If a source wins the contention, the channel state…

Information Theory · Computer Science 2015-02-24 Zhou Zhang , Shuai Zhou , Hai Jiang

We address single-user data transmission over a channel where the received signal incurs interference from a finite number of users (interfering users) that use single codebooks for transmitting their own messages. The receiver, however, is…

Information Theory · Computer Science 2007-11-21 Abolfazl S. Motahari , Amir K. Khandani

Consider a Gaussian relay network where a number of sources communicate to a destination with the help of several layers of relays. Recent work has shown that a compress-and-forward based strategy at the relays can achieve the capacity of…

Information Theory · Computer Science 2013-04-30 Ritesh Kolte , Ayfer Özgür

We derive expressions for the achievable rate region of a collaborative coding scheme in a two-transmitter, two-receiver Pairwise Collaborative Network (PCN) where one transmitter and receiver pair, namely relay pair, assists the other…

Information Theory · Computer Science 2008-07-08 Saeed A. Astaneh , Saeed Gazor , Hamid Behroozi

It is known that the capacity of parallel (multi-carrier) Gaussian point-to-point, multiple access and broadcast channels can be achieved by separate encoding for each subchannel (carrier) subject to a power allocation across carriers. In…

Information Theory · Computer Science 2016-11-17 Viveck R. Cadambe , Syed A. Jafar

We study the sum capacity of multiple unicasts in wired and wireless multihop networks. With 2 source nodes and 2 sink nodes, there are a total of 4 independent unicast sessions (messages), one from each source to each sink node (this…

Information Theory · Computer Science 2011-04-07 Chenwei Wang , Tiangao Gou , Syed A. Jafar

We consider two-hop S-R-D Gaussian networks with a source (S), a relay (R) and a destination (D), some of which experience additive interference. This additive interference, which renders the channels state-dependent, is either a)…

Information Theory · Computer Science 2011-02-07 Yiwei Song , Natasha Devroye

Recent work has studied the benefits of caching in the interference channel, particularly by placing caches at the transmitters. In this paper, we study the two-user Gaussian interference channel in which caches are placed at both the…

Information Theory · Computer Science 2016-11-17 Jad Hachem , Urs Niesen , Suhas Diggavi

This paper analyzes the throughput of industrial communication networks under a secrecy constraint. The proposed scenario is composed by sensors that measure some relevant information of the plant that is first processed by aggregator node…

Information Theory · Computer Science 2015-12-18 Pedro H. J. Nardelli , Hirley Alves , Carlos H. M. de Lima , Matti Latva-aho

We consider an energy harvesting two-hop network where a source is communicating to a destination through a relay. During a given communication session time, the source collects measurement updates from a physical phenomenon and sends them…

Information Theory · Computer Science 2017-12-07 Ahmed Arafa , Sennur Ulukus

This paper is motivated by a sensor network on a correlated field where nearby sensors share information, and can thus assist rather than interfere with one another. A special class of two-user Gaussian interference channels (IFCs) is…

Information Theory · Computer Science 2007-07-13 Wei Wu , Sriram Vishwanath , Ari Arapostathis

Cooperative relaying improves the performance of wireless networks by forming a network of multiple independent virtual sources transmitting the same information as the source node. However, interference induced in the network reduces the…

Information Theory · Computer Science 2012-10-22 Bappi Barua , Mehran Abolhasan , Daniel Franklin , Farzad Safaei

Relays in cellular systems are interference limited. The highest end-to-end sum rates are achieved when the relays are jointly optimized with the transmit strategy. Unfortunately, interference couples the links together making joint…

Information Theory · Computer Science 2015-03-20 Kien T. Truong , Robert W. Heath

We study a multi-source Gaussian relay network consisting of $K$ source--destination pairs having $K$ unicast sessions. We assume $M$ layers of relays between the sources and the destinations. We find achievable degrees of freedom of the…

Information Theory · Computer Science 2009-10-20 Sang-Woon Jeon , Sae-Young Chung , Syed A. Jafar

This paper studies the two-user Causal Cognitive Interference Channel (CCIC), where two transmitters aim to communicate independent messages to two different receivers via a common channel. One source, referred to as the cognitive, is…

Information Theory · Computer Science 2016-11-15 Martina Cardone , Daniela Tuninetti , Raymond Knopp

Coordinated Multi-Point (CoMP) transmission is an infrastructural enhancement under consideration for next generation wireless networks. In this work, the capacity gain achieved through CoMP transmission is studied in various models of…

Information Theory · Computer Science 2013-10-10 Aly El Gamal , V. Sreekanth Annapureddy , Venugopal V. Veeravalli

We consider dynamic routing in multi-hop wireless networks with adversarial traffic. The model of wireless communication incorporates interferences caused by packets' arrivals into the same node that overlap in time. We consider two classes…

Distributed, Parallel, and Cluster Computing · Computer Science 2018-08-08 Bogdan S. Chlebus , Vicent Cholvi , Pawel Garncarek , Tomasz Jurdzinski , Dariusz R. Kowalski