English
Related papers

Related papers: On the number of active links in random wireless n…

200 papers

A network of n communication links, operating over a shared wireless channel, is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between transmitter and receiver terminals. It is assumed that…

Information Theory · Computer Science 2016-11-17 Masoud Ebrahimi , Mohammad A. Maddah-Ali , Amir K. Khandani

A network of $n$ wireless communication links is considered in a Rayleigh fading environment. It is assumed that each link can be active and transmit with a constant power $P$ or remain silent. The objective is to maximize the number of…

Information Theory · Computer Science 2007-10-30 Masoud Ebrahimi , Amir K. Khandani

This work studies the throughput scaling laws of ad hoc wireless networks in the limit of a large number of nodes. A random connections model is assumed in which the channel connections between the nodes are drawn independently from a…

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

In this paper, we examine the benefits of multiple antenna communication in random wireless networks, the topology of which is modeled by stochastic geometry. The setting is that of the Poisson bipolar model introduced in [1], which is a…

Information Theory · Computer Science 2016-08-23 Junse Lee , Namyoon Lee , Francois Baccelli

The spectral efficiency of a representative uplink of a given length, in interference-limited, spatially-distributed wireless networks with hexagonal cells, simple power control, and multiantenna linear Minimum-Mean-Square-Error receivers…

Information Theory · Computer Science 2015-03-18 Siddhartan Govindasamy , Daniel W. Bliss , David H. Staelin

The downlink of a wireless network where multi-antenna base stations (BSs) communicate with single-antenna mobile stations (MSs) using maximal ratio transmission (MRT) is considered here. The locations of BSs are modeled by a homogeneous…

Information Theory · Computer Science 2015-08-28 George C. Alexandropoulos , Marios Kountouris

We consider the point process of signal strengths from transmitters in a wireless network observed from a fixed position under models with general signal path loss and random propagation effects. We show via coupling arguments that under…

Probability · Mathematics 2014-11-20 Holger Paul Keeler , Nathan Ross , Aihua Xia

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

We study the flow-level performance of random wireless networks. The locations of base stations (BSs) follow a Poisson point process. The number and positions of active users are dynamic. We associate a queue to each BS. The performance and…

Information Theory · Computer Science 2013-08-23 Richard Combes , Eitan Altman

Xue and Kumar have established that the number of neighbors required for connectivity of wireless networks with N uniformly distributed nodes must grow as log(N), and they also established that the actual number required lies between…

Networking and Internet Architecture · Computer Science 2007-07-13 Sanquan Song , Dennis L. Goeckel , Don Towsley

A network of $n$ wireless communication links is considered. Fading is assumed to be the dominant factor affecting the strength of the channels between nodes. The objective is to analyze the achievable throughput of the network when power…

Information Theory · Computer Science 2016-11-17 Masoud Ebrahimi , Mohammad Maddah-Ali , Amir Khandani

The uplink of a wireless network with base stations distributed according to a Poisson Point Process (PPP) is analyzed. The base stations are assumed to have a large number of antennas and use linear minimum-mean-square-error (MMSE) spatial…

Information Theory · Computer Science 2013-11-20 Siddhartan Govindasamy

We consider a cognitive network consisting of n random pairs of cognitive transmitters and receivers communicating simultaneously in the presence of multiple primary users. Of interest is how the maximum throughput achieved by the cognitive…

Information Theory · Computer Science 2016-11-18 Mai Vu , Natasha Devroye , Masoud Sharif , Vahid Tarokh

This paper derives a lower bound to the per-node throughput achievable by a wireless network when n source-destination pairs are randomly distributed throughout a disk of radius $n^\gamma$, $ \gamma \geq 0$, propagation is modeled by…

Information Theory · Computer Science 2007-08-01 Enrique J. Duarte-Melo , Awlok Josan , Mingyan Liu , David L. Neuhoff , Sandeep Pradhan

We present scaling laws that dictate both local and global connectivity properties of bounded wireless networks. These laws are defined with respect to the key system parameters of per-node transmit power and the number of antennas…

Networking and Internet Architecture · Computer Science 2017-06-15 Justin P. Coon , Orestis Georgiou , Carl P. Dettmann

We investigate on the scalability of multihop wireless communications, a major concern in networking, for the case that users access content replicated across the nodes. In contrast to the standard paradigm of randomly selected…

Networking and Internet Architecture · Computer Science 2015-03-20 S. Gitzenis , G. S. Paschos , L. Tassiulas

We consider the distribution of cycle counts in a random regular graph, which is closely linked to the graph's spectral properties. We broaden the asymptotic regime in which the cycle counts are known to be approximately Poisson, and we…

Combinatorics · Mathematics 2023-07-14 Tobias Johnson

In the analysis of large random wireless networks, the underlying node distribution is almost ubiquitously assumed to be the homogeneous Poisson point process. In this paper, the node locations are assumed to form a Poisson clustered…

Information Theory · Computer Science 2010-10-11 RadhaKrishna Ganti , Martin Haenggi

In this letter, we characterize the performance of broadcast approach with continuum of transmission layers in random wireless networks where the channel state information (CSI) is assumed to be known only at the receiver. By modeling the…

Information Theory · Computer Science 2019-04-09 Praful D. Mankar , Harpreet S. Dhillon

Keeler, Ross and Xia (2016) recently derived approximation and convergence results, which imply that the point process formed from the signal strengths received by an observer in a wireless network under a general statistical propagation…

Networking and Internet Architecture · Computer Science 2016-11-09 Paul Keeler , Nathan Ross , Aihua Xia , Bartlomiej Blaszczyszyn
‹ Prev 1 2 3 10 Next ›