English
Related papers

Related papers: Interference in Poisson Networks with Isotropicall…

200 papers

Given a wireless network where some pairs of communication links interfere with each other, we study sufficient conditions for determining whether a given set of minimum bandwidth quality-of-service (QoS) requirements can be satisfied. We…

Information Theory · Computer Science 2015-12-11 Ashwin Ganesan

This paper studied the fundamental modeling defect existing in Poisson-distributed cellular networks in which all base stations form a homogeneous Poisson point process (PPP) of intensity $\lambda_B$ and all users form another independent…

Information Theory · Computer Science 2015-02-10 Chun-Hung Liu , Li-Chun Wang

With the increased competition for the electromagnetic spectrum, it is important to characterize the impact of interference in the performance of a wireless network, which is traditionally measured by its throughput. This paper presents a…

Networking and Internet Architecture · Computer Science 2010-07-19 Pedro C. Pinto , Moe Z. Win

This paper investigates the throughput capacity of a flow crossing a multi-hop wireless network, whose geometry is characterized by general randomness laws including Uniform, Poisson, Heavy-Tailed distributions for both the nodes' densities…

Performance · Computer Science 2013-07-30 Florin Ciucu , Jens Schmitt

Spatial Poisson Point Process (PPP) network, whose Base Stations (BS)s are distributed according to a Poisson distribution, is currently used as a accurate model to analyse the performance of a cellular network. Most current work on…

Information Theory · Computer Science 2016-07-13 Sinh Cong Lam , Kumbesan Sandrasegaran

A fine-grained analysis of the cache-enabled networks is crucial for system design. In this paper, we focus on the meta distribution of the signal-to-interference-plus-noise-ratio (SINR) in the mmWave heterogeneous networks where the base…

Information Theory · Computer Science 2020-09-17 Le Yang , Fu-Chun Zheng , Shi Jin

We address the problem of message transfer in a communication network. The network consists of nodes and links, with the nodes lying on a two dimensional lattice. Each node has connections with its nearest neighbours, whereas some special…

Statistical Mechanics · Physics 2007-05-23 Brajendra K. Singh , Neelima M. Gupte

We propose a framework for the derivation and evaluation of distributed iterative algorithms for receiver cooperation in interference-limited wireless systems. Our approach views the processing within and collaboration between receivers as…

Information Theory · Computer Science 2012-04-18 Mihai-Alin Badiu , Carles Navarro Manchón , Vasile Bota , Bernard Henri Fleury

A distributed adaptive algorithm to estimate a time-varying signal, measured by a wireless sensor network, is designed and analyzed. One of the major features of the algorithm is that no central coordination among the nodes needs to be…

Distributed, Parallel, and Cluster Computing · Computer Science 2008-10-22 Carlo Fischione , Alberto Speranzon , Karl H. Johansson , Alberto Sangiovanni-Vincentelli

Convergence of resource allocation algorithms is well covered in the literature as convergence to a steady state is important due to stability and performance. However, research is lacking when it comes to the propagation of change that…

Information Theory · Computer Science 2012-10-19 Brage Ellingsæter , Torleiv Maseng

Count-weighted temporal networks often exhibit unequal dispersion in the edge weights, which cannot be fully explained by modelling observational heterogeneity through latent factors in the conditional mean. Therefore, we propose new…

Methodology · Statistics 2026-04-15 Giulia Carallo , Roberto Casarin , Antonio Peruzzi

A thorough understanding of the temporal dynamics of interference in wireless networks is crucial for the design of communication protocols, scheduling, and interference management. This paper applies stochastic geometry to investigate…

Information Theory · Computer Science 2019-04-26 Udo Schilcher , Jorge F. Schmidt , Christian Bettstetter

In this paper, we analyze a multiple-input multiple-output (MIMO) interference channel where nodes are randomly distributed on a plane as a spatial Poisson cluster point process. Each cluster uses interference alignment (IA) to suppress…

Information Theory · Computer Science 2012-07-20 Behrang Nosrat-Makouei , Radha Krishna Ganti , Jeffrey G. Andrews , Robert W. Heath

This paper studies the throughput of large-scale decentralized wireless networks with physical layer security constraints. In particular, we are interested in the question of how much throughput needs to be sacrificed for achieving a…

Information Theory · Computer Science 2016-11-17 Xiangyun Zhou , Radha Krishna Ganti , Jeffrey G. Andrews , Are Hjørungnes

In this paper, the problem of distributed opportunistic channel access in wireless relaying is investigated. A relay network with multiple source-destination pairs and multiple relays is considered. All the source nodes contend through a…

Information Theory · Computer Science 2015-03-19 Zhou Zhang , Hai Jiang

In recent times, the use of stochastic geometry has become a popular and important tool for performance analysis of next-generation dense small cell wireless networks. Usually, such networks are modeled using 2 dimensional spatial Poisson…

Information Theory · Computer Science 2020-01-01 Aritra Chatterjee , Suvra Sekhar Das

In a circuit-switched network, traffic can be characterized by several factors that define how communication resources are allocated and utilized during a connection. The amount of traffic basically determines how frequently connection…

Networking and Internet Architecture · Computer Science 2025-03-19 Paresh Upadhyay , Yatindra Nath Singh

The interference in wireless networks is temporally correlated, since the node or user locations are correlated over time and the interfering transmitters are a subset of these nodes. For a wireless network where (potential) interferers…

Information Theory · Computer Science 2013-09-12 Martin Haenggi , Roxana Smarandache

We consider a distributed stochastic optimization problem in networks with finite number of nodes. Each node adjusts its action to optimize the global utility of the network, which is defined as the sum of local utilities of all nodes.…

Information Theory · Computer Science 2018-07-31 Wenjie Li , Mohamad Assaad

Lattices are important as models for the node locations in wireless networks for two main reasons: (1) When network designers have control over the placement of the nodes, they often prefer a regular arrangement in a lattice for coverage…

Information Theory · Computer Science 2010-04-02 Martin Haenggi
‹ Prev 1 3 4 5 6 7 10 Next ›