English
Related papers

Related papers: Cognitive Wyner Networks with Clustered Decoding

200 papers

This paper analyzes the multiplexing gains (MG) for simultaneous transmission of delay-sensitive and delay-tolerant data over interference networks. In the considered model, only delay-tolerant data can profit from coordinated multipoint…

Information Theory · Computer Science 2020-12-15 Homa Nikbkaht , Michele Wigger , Shlomo Shamai

We consider collocated primary and secondary networks that have simultaneous access to the same frequency bands. Particularly, we examine three different levels at which primary and secondary networks may coexist: pure interference,…

Information Theory · Computer Science 2016-11-17 Nadia Jamal , Hamidreza Ebrahimzadeh Saffar , Patrick Mitran

We study the high-power asymptotic behavior of the sum-rate capacity of multi-user interference networks with an equal number of transmitters and receivers. We assume that each transmitter is cognizant of the message it wishes to convey to…

Information Theory · Computer Science 2016-11-15 Amos Lapidoth , Shlomo Shamai , Michele A. Wigger

Wyner's soft-handoff network with mixed delay constraints is considered when neighbouring receivers can cooperate over rate-limited links. Each source message is a combination of independent "fast" and "slow" bits, where the former are…

Information Theory · Computer Science 2018-01-18 Homa Nikbakht , Michèle Wigger , Shlomo Shamai

In this work, we derive achievable rate regions for the three-user interference channels with asymmetric transmitter cooperation and various decoding capabilities at the receivers. The three-user channel facilitates different ways of…

Information Theory · Computer Science 2011-02-23 K. G. Nagananda , Chandra R. Murthy

This paper analyses the multiplexing gain (MG) achievable over Wyner's symmetric network with random user activity and random arrival of mixed-delay traffic. The mixed-delay traffic is composed of delay-tolerant traffic and delay-sensitive…

Information Theory · Computer Science 2021-06-03 Homa Nikbakht , Michèle Wigger , Shlomo Shamai , Jean-Marie Gorce

An asymptotic technique is presented to characterize the bits/symbol achievable on a representative wireless link in a spatially distributed network with active interferers at correlated positions, N receive diversity branches, and linear…

Information Theory · Computer Science 2013-12-30 Siddhartan Govindasamy

We consider the problem of source coding with receiver side information for the simple network proposed by R. Gray and A. Wyner in 1974. In this network, a transmitter must reliably transport the output of two correlated information sources…

Information Theory · Computer Science 2008-05-28 R. Timo , A. Grant , T. Chan , G. Kramer

To answer the call for a new theoretical framework to simultaneously accommodate random user activity and heterogeneous delay traffic in Internet of Things (IoT) systems, in this paper we propose coding schemes and information-theoretic…

Information Theory · Computer Science 2023-10-10 Homa Nikbakht , Michèle Wigger , Shlomo Shamai , Jean-Marie Gorce , H. Vincent Poor

This paper considers a two-hop interference network, where two users transmit independent messages to their respective receivers with the help of two relay nodes. The transmitters do not have direct links to the receivers; instead, two…

Information Theory · Computer Science 2009-10-09 Yi Cao , Biao Chen

Interference management in a three-user interference channel with alternating connectivity with only topological knowledge at the transmitters is considered. The network has a Wyner-type channel flavor, i.e., for each connectivity state the…

Information Theory · Computer Science 2013-10-10 Soheyl Gherekhloo , Anas Chaaban , Aydin Sezgin

Certain deterministic interference channels have been shown to accurately model Gaussian interference channels in the asymptotic low-noise regime. Motivated by this correspondence, we investigate a K user-pair, cyclically symmetric,…

Information Theory · Computer Science 2016-11-17 Bernd Bandemer , Gonzalo Vazquez-Vilar , Abbas El Gamal

Our goal is to study the effect of the number of conferencing rounds on the capacity of large interference networks. We do this at hand of the per-user multiplexing gain (MG) of Wyner's soft-handoff model with dedicated conferencing links…

Information Theory · Computer Science 2016-03-18 Michèle Wigger , Roy Timo , Shlomo Shamai

Cooperative cognitive radio networks are investigated by using an information-theoretic approach. This approach consists of interpreting the decision process carried out at the fusion center as a binary (asymmetric) channel, whose input is…

Information Theory · Computer Science 2010-08-02 Giorgio Taricco

Interference is a major issue that limits the performance in wireless networks, and cooperation among receivers can help mitigate interference by forming distributed MIMO systems. The rate at which receivers cooperate, however, is limited…

Information Theory · Computer Science 2009-08-20 I-Hsiang Wang , David N. C. Tse

In the context of cellular networks, users located at the periphery of cells are particularly vulnerable to substantial interference from neighbouring cells, which can be represented as a two-user interference channel. This study introduces…

Information Theory · Computer Science 2024-10-29 Shubham Paul , Sudharsan Senthil , Preethi Seshadri , Nambi Seshadri , R David Koilpillai

We study the following one-way asymmetric transmission problem, also a variant of model-based compressed sensing: a resource-limited encoder has to report a small set $S$ from a universe of $N$ items to a more powerful decoder (server). The…

Data Structures and Algorithms · Computer Science 2018-07-30 Alexandr Andoni , Javad Ghaderi , Daniel Hsu , Dan Rubenstein , Omri Weinstein

A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the \emph{receiver interference}. This is modeled as follows: each sensor node corresponds to a point in $\mathbb{R}^d$ and each…

Computational Geometry · Computer Science 2014-07-01 Yves Brise , Kevin Buchin , Dustin Eversmann , Michael Hoffmann , Wolfgang Mulzer

Wireless networks are fundamentally limited by the intensity of the received signals and by their inherent interference. It is shown here that in finite ad hoc networks where node placement is modelled according to a Poisson point process…

Networking and Internet Architecture · Computer Science 2015-04-09 Orestis Georgiou , Shanshan Wang , Mohammud Z. Bocus , Carl P. Dettmann , Justin P. Coon

Individual links in a wireless network may experience unequal fading coherence times due to differences in mobility or scattering environment, a practical scenario where the fundamental limits of communication have been mostly unknown. This…

Information Theory · Computer Science 2016-07-26 Mohamed Fadel , Aria Nosratinia
‹ Prev 1 2 3 10 Next ›