English
Related papers

Related papers: Wireless networks of bounded capacity

200 papers

In non-coherent wideband fading channels where energy rather than spectrum is the limiting resource, peaky and non-peaky signaling schemes have long been considered species apart, as the first approaches asymptotically the capacity of a…

Information Theory · Computer Science 2017-04-04 Felipe Gomez-Cuba , Jinfeng Du , Muriel Médard , Elza Erkip

We consider the following basic link capacity (a.k.a., one-shot scheduling) problem in wireless networks: Given a set of communication links, find a maximum subset of links that can successfully transmit simultaneously. Good performance…

Information Theory · Computer Science 2017-06-19 Magnus M. Halldorsson , Tigran Tonoyan

In this paper, a lower bound on the capacity of wireless ad hoc erasure networks is derived in closed form in the canonical case where $n$ nodes are uniformly and independently distributed in the unit area square. The bound holds almost…

Information Theory · Computer Science 2009-01-15 Rayyan G. Jaber , Jeffrey G. Andrews

We consider a multiple-input, multiple-output (MIMO) wideband Rayleigh block fading channel where the channel state is unknown to both the transmitter and the receiver and there is only an average power constraint on the input. We compute…

Information Theory · Computer Science 2007-07-13 Siddharth Ray , Muriel Medard , Lizhong Zheng

Many analytic results for the connectivity, coverage, and capacity of wireless networks have been reported for the case where the number of nodes, $n$, tends to infinity (large-scale networks). The majority of these results have not been…

Information Theory · Computer Science 2012-11-12 Ali Eslami , Mohammad Nekoui , Hossein Pishro-Nik , F. Fekri

This paper presents a set of new results directly exploring the special characteristics of the wireless channel capacity process. An appealing finding is that, for typical fading channels, their instantaneous capacity and cumulative…

Information Theory · Computer Science 2017-05-11 Fengyou Sun , Yuming Jiang

A framework is developed for analyzing capacity gains from user cooperation in slow fading wireless networks when the number of nodes (network size) is large. The framework is illustrated for the case of a simple multipath-rich Rayleigh…

Information Theory · Computer Science 2009-09-29 Ashish Khisti , Uri Erez , Gregory Wornell

We consider scaling laws for maximal energy efficiency of communicating a message to all the nodes in a wireless network, as the number of nodes in the network becomes large. Two cases of large wireless networks are studied -- dense random…

Information Theory · Computer Science 2009-05-26 Aman Jain , Sanjeev R. Kulkarni , Sergio Verdu

The capacity of a discrete-time memoryless channel, in which successive symbols fade independently, and where the channel state information (CSI) is neither available at the transmitter nor at the receiver, is considered at low SNR. We…

Information Theory · Computer Science 2008-01-04 Z. Rezki , David Haccoun , François Gagnon

Discrete-time Rayleigh fading single-input single-output (SISO) and multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter or the receiver. The fading is assumed to be stationary…

Information Theory · Computer Science 2016-11-17 Vignesh Sethuraman , Ligong Wang , Bruce Hajek , Amos Lapidoth

The scaling of coherent and non-coherent channel capacity is studied in a single-input multiple-output (SIMO) block Rayleigh fading channel as both the bandwidth and the number of receiver antennas go to infinity jointly with the transmit…

Information Theory · Computer Science 2020-02-21 Felipe Gomez-Cuba , Mainak Chowdhury , Alexandros Manolakos , Elza Erkip , Andrea J. Goldsmith

The noncoherent capacity of stationary discrete-time fading channels is known to be very sensitive to the fine details of the channel model. More specifically, the measure of the set of harmonics where the power spectral density of the…

Information Theory · Computer Science 2016-11-15 Giuseppe Durisi , Veniamin I. Morgenshtern , Helmut Bölcskei

The rate optimization for wireless networks with low SNR is investigated. While the capacity in the limit of disappearing SNR is known to be linear for fading and non-fading channels, we study the problem of operating in low SNR wireless…

Information Theory · Computer Science 2010-08-03 Mohit Thakur , Muriel Médard

This paper investigates the limits of information transfer over a fast Rayleigh fading MIMO channel, where neither the transmitter nor the receiver has the knowledge of the channel state information (CSI) except the fading statistics. We…

Information Theory · Computer Science 2007-07-13 Rasika R Perera , Tony S Pollock , Thushara D Abhayapala

The noncoherent capacity of stationary discrete-time fading channels is known to be very sensitive to the fine details of the channel model. More specifically, the measure of the support of the fading-process power spectral density (PSD)…

Information Theory · Computer Science 2012-06-29 Giuseppe Durisi , Veniamin I. Morgenshtern , Helmut Bölcskei

The capacity of non-coherent stationary Gaussian fading channels with memory under a peak-power constraint is studied in the asymptotic weak-signal regime. It is assumed that the fading law is known to both transmitter and receiver but that…

Information Theory · Computer Science 2007-07-13 Amos Lapidoth , Ligong Wang

In this work, we investigate the capacity of multi-antenna fading channels with 1-bit quantized output per receive antenna. Specifically, leveraging Bayesian statistical tools, we analyze the asymptotic regime with a large number of receive…

Information Theory · Computer Science 2024-07-24 Sheng Yang , Richard Combes

A wireless communication network is considered where any two nodes are connected if the signal-to-interference ratio (SIR) between them is greater than a threshold. We consider the the path-loss plus fading model of wireless signal…

Information Theory · Computer Science 2012-05-23 Rahul Vaze

Discrete-time Rayleigh fading multiple-input multiple-output (MIMO) channels are considered, with no channel state information at the transmitter and receiver. The fading is assumed to be correlated in time and independent from antenna to…

Information Theory · Computer Science 2007-07-13 Vignesh Sethuraman , Ligong Wang , Bruce Hajek , Amos Lapidoth

We consider arbitrary dense wireless networks, in which $n$ nodes are placed in an arbitrary (deterministic) manner on a square region of unit area and communicate with each other over Gaussian fading channels. We provide inner and outer…

Information Theory · Computer Science 2011-08-09 Urs Niesen