English
Related papers

Related papers: Wireless networks of bounded capacity

200 papers

The capacity of noncoherent fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the…

Information Theory · Computer Science 2012-12-06 Tobias Koch , Gerhard Kramer

This work studies the capacity of multipath fading channels. A noncoherent channel model is considered, where neither the transmitter nor the receiver is cognizant of the realization of the path gains, but both are cognizant of their…

Information Theory · Computer Science 2009-01-06 Tobias Koch , Amos Lapidoth

This paper studies the capacity of massive random-access cellular networks, modeled as a MIMO fading channel with an infinite number of interfering cells. To characterize the symmetric sum rate of the network, a random-coding argument is…

Information Theory · Computer Science 2025-09-26 Grace Villacrés , Tobias Koch , Gonzalo Vazquez-Vilar

This paper, mostly tutorial in nature, deals with the problem of characterizing the capacity of fading channels in the high signal-to-noise ratio (SNR) regime. We focus on the practically relevant noncoherent setting, where neither…

Information Theory · Computer Science 2011-05-09 Giuseppe Durisi , Helmut Bölcskei

We obtain the first term in the high signal-to-noise ratio (SNR) expansion of the capacity of fading networks where the transmitters and receivers--while fully cognizant of the fading \emph{law}--have no access to the fading…

Information Theory · Computer Science 2007-07-13 Amos Lapidoth

The present paper focuses on the problem of broadcasting information in the most efficient manner in a large two-dimensional ad hoc wireless network at low SNR and under line-of-sight propagation. A new communication scheme is proposed,…

Information Theory · Computer Science 2016-11-18 Serj Haddad , Olivier Leveque

We derive bounds on the noncoherent capacity of wide-sense stationary uncorrelated scattering (WSSUS) channels that are selective both in time and frequency, and are underspread, i.e., the product of the channel's delay spread and Doppler…

Information Theory · Computer Science 2016-11-15 Giuseppe Durisi , Ulrich G. Schuster , Helmut Bölcskei , Shlomo Shamai

We consider transmission over a wireless multiple antenna communication system operating in a Rayleigh flat fading environment with no channel state information at the receiver and the transmitter with coherence time T=1. We show that,…

Information Theory · Computer Science 2008-01-15 Jochen Sommerfeld , Igor Bjelakovic , Holger Boche

The covert capacity is characterized for a non-coherent fast Rayleigh-fading wireless channel, in which a legitimate user wishes to communicate reliably with a legitimate receiver while escaping detection from a warden. It is shown that the…

Information Theory · Computer Science 2019-11-12 Mehrdad Tahmasbi , Anne Savard , Matthieu R. Bloch

Communication channels are said to be underspread if their coherence time is greater than their delay spread. In such cases it can be shown that in the infinite bandwidth limit the information capacity tends to that of a channel with…

Information Theory · Computer Science 2014-06-24 Steven Herbert , Ian Wassell , Tian-Hong Loh

We develop bounds on the capacity of wireless networks when the traffic is non-uniform, i.e., not all nodes are required to receive and send similar volumes of traffic. Our results are asymptotic, i.e., they hold with probability going to…

Networking and Internet Architecture · Computer Science 2013-10-24 Stavros Toumpis

The capability of nodes to broadcast their message to the entire wireless network when nodes employ cooperation is considered. We employ an asymptotic analysis using an extended random network setting and show that the broadcast performance…

Information Theory · Computer Science 2015-03-19 Cagatay Capar , Dennis Goeckel , Don Towsley

The capacity of discrete-time, non-coherent, multipath fading channels is considered. It is shown that if the delay spread is large in the sense that the variances of the path gains do not decay faster than geometrically, then capacity is…

Information Theory · Computer Science 2016-11-18 Tobias Koch , Amos Lapidoth

In this paper, the capacity of wireless channels is characterized based on electromagnetic and antenna theories with only minimal assumptions. We assume the transmitter can generate an arbitrary current distribution inside a spherical…

Information Theory · Computer Science 2016-11-17 Wonseok Jeon , Sae-Young Chung

The analysis of the channel capacity in the absence of prior channel knowledge (noncoherent channel) has gained increasing interest in recent years, but it is still unknown for the general case. In this paper we derive bounds on the…

Information Theory · Computer Science 2011-07-05 Itsik Bergel , Sergio Benedetto

The performance of multiple-input multiple-output wireless systems is investigated in the presence of statistical queueing constraints. Queuing constraints are imposed as limitations on buffer violation probabilities. The performance under…

Information Theory · Computer Science 2009-10-13 Mustafa Cenk Gursoy

The capacity of discrete-time, noncoherent, multipath fading channels is considered. It is shown that if the variances of the path gains decay faster than exponentially, then capacity is unbounded in the transmit power.

Information Theory · Computer Science 2008-10-14 Tobias Koch , Amos Lapidoth

Diffuse, multiple-scattered waves can be very efficient for information transfer through disordered media, provided that antenna arrays are used for both transmission and reception of signals. Information capacity C of a communication…

Data Analysis, Statistics and Probability · Physics 2007-05-23 S. E. Skipetrov

We characterize the maximum achievable broadcast rate in a wireless network under various fading assumptions. Our result exhibits a duality between the performance achieved in this context by collaborative beamforming strategies and the…

Information Theory · Computer Science 2016-01-26 Serj Haddad , Olivier Leveque

We characterize the capacity of the general class of noncoherent underspread wide-sense stationary uncorrelated scattering (WSSUS) time-frequency-selective Rayleigh fading channels, under peak constraints in time and frequency and in time…

Information Theory · Computer Science 2016-11-17 Giuseppe Durisi , Helmut Bölcskei , Shlomo Shamai
‹ Prev 1 2 3 10 Next ›