# Stochastic geometry and random graphs for the analysis and design of wireless networks

@article{Haenggi2009StochasticGA, title={Stochastic geometry and random graphs for the analysis and design of wireless networks}, author={Martin Haenggi and Jeffrey G. Andrews and François Baccelli and Olivier Dousse and Massimo Franceschetti}, journal={IEEE Journal on Selected Areas in Communications}, year={2009}, volume={27} }

Wireless networks are fundamentally limited by the intensity of the received signals and by their interference. Since both of these quantities depend on the spatial location of the nodes, mathematical techniques have been developed in the last decade to provide communication-theoretic results accounting for the networks geometrical configuration. Often, the location of the nodes in the network can be modeled as random, following for example a Poisson point process. In this case, different…

## 1,619 Citations

### Distributional properties of euclidean distances in wireless networks involving road systems

- Computer ScienceIEEE Journal on Selected Areas in Communications
- 2009

Stochastic models for hierarchical telecommunication networks are considered, which can be applied to the analysis and planning of large wireless networks and can be computed by Monte Carlo simulation of the typical serving zone and the typical segment system in it.

### Analysis of the Delay Distribution in Cellular Networks by Using Stochastic Geometry

- Computer ScienceArXiv
- 2021

The proposed analytical and computational frameworks can facilitate the analysis and optimization of cellular networks subject to reliability constraints on the network packet delay that are not restricted to the local (average) delay, e.g., in the context of delay sensitive applications.

### Modeling, Analysis, and Optimization of Random Wireless Networks: Stochastic Geometry Approach

- Computer Science
- 2014

This thesis develops analytical frameworks to characterize the performance of large-scale wireless networks with random topologies and uses stochastic geometry tools to model, analyze, and design ad hoc networks, star-connected sensor networks, and infrastructure-based two-tier cellular networks.

### Modeling Spatial Structure of Wireless Communication Networks

- Computer Science2010 INFOCOM IEEE Conference on Computer Communications Workshops
- 2010

The results indicate that the so-called Geyer saturation model can accurately reproduce the spatial structure of a large variety of wireless network types, arising from both planned or chaotic deployments.

### On the Fundamentals of Stochastic Spatial Modeling and Analysis of Wireless Networks and its Impact to Channel Losses

- Computer Science
- 2012

Generically derived the large-scale fading distributions between a reference base-station and an arbitrary node for uni-cellular (UCN), multi- cellular (MCN), and Gaussian random network models and conceptualized a straightforward and flexible approach for random spatial inhomogeneity by proposing the area-specific deployment (ASD) principle, which takes into account the clustering tendency of users.

### Information theoretic cut-set bounds on the capacity of poisson wireless networks

- Computer Science2013 IEEE International Symposium on Information Theory
- 2013

A new unified multi-parameter cut-set bound is derived on the capacity of networks of arbitrary Poisson node density, size, power and bandwidth, under fast fading in a rich scattering environment, which upper-bound the optimal performance in terms of total communication rate.

### Connectivity of networks with general connection functions

- Computer Science, MathematicsArXiv
- 2014

Here, the full connection probability of a dense network in a convex polygonal or polyhedral domain is expressed in terms of contributions from boundary components, for a very general class of connection functions.

### Random-to-Random Nodal Distance Distributions in Finite Wireless Networks

- Computer ScienceIEEE Transactions on Vehicular Technology
- 2017

This paper shows a systematic, algorithmic approach to Ran2Ran NDDs, which can handle arbitrarily-shaped networks, including convex, concave, disjoint, and tiered networks, and its potentials in handling nonuniform nodal distributions.

### Network connectivity: Stochastic vs. deterministic wireless channels

- Computer Science2014 IEEE International Conference on Communications (ICC)
- 2014

Analysis of local and global network observables presents conclusive evidence suggesting that network behaviour is highly dependent upon whether a stochastic or deterministic connection model is employed, and shows that the network mean degree is lower for Stochastic wireless channels than for deterministic ones, if the path loss exponent is greater than the spatial dimension.

### On Large Cooperative Wireless Network Modeling through a Stochastic Geometry Approach.

- Computer Science
- 2014

A stochastic geometry framework is introduced, in which the user file-caching policy, user pairing strategy, and link quality and scheduling issues are considered, and the effects of cooperation versus interference are studied, when the users use either full-duplex DF, or point-to-point transmissions.

## References

SHOWING 1-10 OF 202 REFERENCES

### Interference and Outage in Clustered Wireless Ad Hoc Networks

- Computer Science, MathematicsIEEE Transactions on Information Theory
- 2009

This paper derives the distributional properties of the interference and provides upper and lower bounds for its distribution, and considers the probability of successful transmission in an interference-limited channel when fading is modeled as Rayleigh.

### Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory

- Computer ScienceIEEE Transactions on Information Theory
- 2007

An achievable bit rate per source-destination pair in a wireless network of n randomly located nodes is determined adopting the scaling limit approach of statistical physics. It is shown that…

### On node density - outage probability tradeoff in wireless networks

- Computer Science2008 IEEE International Symposium on Information Theory
- 2008

The analysis culminates in formulation of an explicit tradeoff relationship between the network density and the outage probability, which is a result of the interplay between random geometry of node locations, the propagation path loss and the distortion effects at the victim receiver.

### Covering Algorithms, Continuum Percolation, and the Geometry of Wireless Networks.

- Mathematics, Computer Science
- 2003

It is shown how a simple scaling operation can change the percolation properties of the model, leading to the almost sure existence of an unbounded connected component for large values of lambda, for any covering algorithm.

### Bounds on the information propagation delay in interference-limited ALOHA networks

- Computer Science2009 7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
- 2009

An ad hoc network with half-duplex radios that uses multihop routing and slotted ALOHA for the network MAC contention and introduces a random dynamic multi-digraph to model its connectivity is considered and the distributional properties of the connection delay are derived.

### On node density - outage probability tradeoff in wireless networks

- Computer ScienceIEEE Journal on Selected Areas in Communications
- 2009

A statistical model of interference in wireless networks is considered, which is based on the traditional propagation channel model and a Poisson model of random spatial distribution of nodes in 1-D, 2-D and 3-D spaces with both uniform and non-uniform densities, resulting in formulation of a tradeoff relationship between the network density and the outage probability.

### Outage, local throughput, and capacity of random wireless networks

- Computer ScienceIEEE Transactions on Wireless Communications
- 2009

It is shown that the spatial contention is sufficient to characterize outage and throughput in large classes of wireless networks, corresponding to different positions on the uncertainty cube.

### Percolation in the signal to interference ratio graph

- Computer ScienceJournal of Applied Probability
- 2006

This paper considers a variation of Poisson percolation models in which a connection between two points depends not only on their Euclidean distance, but also on the positions of all other points of the point process.

### The capacity of random wireless networks

- Computer ScienceIEEE Transactions on Wireless Communications
- 2008

It is found that mobility can increase network capacity, by giving the nodes more chances to be close to each other, and the capacity of the random network under a mobility condition declines in the order of O(1/radicn).

### A Geometric Interpretation of Fading in Wireless Networks: Theory and Applications

- Computer ScienceIEEE Transactions on Information Theory
- 2008

A unified framework is introduced that permits the geometric characterization of fading by incorporating the fading process into the point process model, and the properties of the point processes that describe the path loss with fading are analyzed.