# Impact of interferences on connectivity in ad hoc networks

@article{Dousse2005ImpactOI, title={Impact of interferences on connectivity in ad hoc networks}, author={Olivier Dousse and François Baccelli and Patrick Thiran}, journal={IEEE/ACM Transactions on Networking}, year={2005}, volume={13}, pages={425-436} }

We study the impact of interferences on the connectivity of large-scale ad hoc networks, using percolation theory. We assume that a bi-directional connection can be set up between two nodes if the signal to noise ratio at the receiver is larger than some threshold. The noise is the sum of the contribution of interferences from all other nodes, weighted by a coefficient /spl gamma/, and of a background noise. We find that there is a critical value of /spl gamma/ above which the network is made…

## Figures from this paper

## 414 Citations

Connectivity Probability of Interference-Limited Linear Multi-Hop Ad-Hoc Networks

- Computer Science2016 IEEE Global Communications Conference (GLOBECOM)
- 2016

It is shown through theoretical analysis that the connectivity probability is a quasi-concave function of the node density, and the optimum node density that can maximize the connectivity probabilities is identified.

ASYMPTOTIC PROPERTIES OF WIRELESS MULTI-HOP NETWORK

- Computer Science
- 2005

This dissertation considers wireless multi-hop networks, where the nodes are randomly placed, and shows that asymptotically, alert messages propagate with constant, deterministic speed in such networks.

Percolation and connectivity on the signal to interference ratio graph

- Computer Science2012 Proceedings IEEE INFOCOM
- 2012

Assigning separate frequency bands or time-slots proportional to the logarithm of the number of nodes to different nodes for transmission/reception is shown to be necessary and sufficient for guaranteeing connectivity in the SIR graph.

On the Connectivity of Ad Hoc Networks

- Computer ScienceComput. J.
- 2004

This paper presents a framework for the calculation of stochastic connectivity properties of wireless multihop networks, and compute a tight approximation for the critical (r0 ,n )pairs that are required to keep the network connected with a probability close to one.

On the throughput capacity of random wireless networks

- Computer Science
- 2004

It is shown that randomly scattered nodes can achieve the same 1/ √ n per-node transmission rate of arbitrarily located nodes, which contrasts with previous achievable results suggesting that a 1/√ n log n reduced rate is the price to pay for the additional randomness introduced into the system.

Asymptotic properties of multi-hop wireless networks

- Computer Science
- 2005

This dissertation considers wireless multi-hop networks, where the nodes are randomly placed, and shows that asymptotically, alert messages propagate with constant, deterministic speed in such networks.

On the connectivity of ad hoc networks: The role of the power level distribution

- Computer Science2007 15th International Conference on Software, Telecommunications and Computer Networks
- 2007

This work investigates the connectivity properties of ad hoc networks with stations (also called nodes) transmitting at either a constant or random power and finds that al low node densities connectivity increases when node transmitt at a constant power.

Percolation theory based connectivity and latency analysis of cognitive radio ad hoc networks

- Computer ScienceWirel. Networks
- 2011

It is proven that it is still possible for a SU to transfer its message to any destination with a certain delay with probability one and this delay is shown to be asymptotically linear in the Euclidean distance between the transmitter and receiver.

New Results on the Connectivity in Wireless Ad Hoc Networks

- Mathematics2012 IEEE 75th Vehicular Technology Conference (VTC Spring)
- 2012

This work investigates when it is possible for two nodes in a wireless network to communicate with each other and establishes the conditions for full connectivity in a network graph and extends the results to the case of unreliable transmission.

Connectivity based on shadow fading and interference in wireless ad hoc networks

- Computer Science, Business2013 IEEE Wireless Communications and Networking Conference (WCNC)
- 2013

This paper proposes a mathematical model to depict the impact of interference on the connectivity in a lognormal shadow fading environment and forms the link connection probability, and obtains the probability of network connection with the random graph theory.

## References

SHOWING 1-10 OF 26 REFERENCES

Impact of interferences on connectivity in ad hoc networks

- Computer ScienceIEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428)
- 2003

Since small values of /spl gamma/ cannot be achieved without efficient CDMA codes, the use of a very simple TDMA scheme is investigated, where nodes can emit only every n-th time slot, and it is shown qualitatively that it even achieves a better connectivity than the previous system with a parameter /spl Gamma//n.

Connectivity in ad-hoc and hybrid networks

- Computer ScienceProceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies
- 2002

It is found that the introduction of a sparse network of base stations does significantly help in increasing the connectivity, but only when the node density is much larger in one dimension than in the other.

An evaluation of connectivity in mobile wireless ad hoc networks

- Computer ScienceProceedings International Conference on Dependable Systems and Networks
- 2002

The mobile version of the problem when d=2 is investigated through extensive simulations, which give insight on how mobility affects connectivity and reveal a useful trade-off between communication capability and energy consumption.

On the minimum node degree and connectivity of a wireless multihop network

- Computer ScienceMobiHoc '02
- 2002

This paper derives an analytical expression that enables the determination of the required range r0 that creates, for a given node density ρ, an almost surely k--connected network and investigates two fundamental characteristics of a wireless multi -hop network: its minimum node degree and its k--connectivity.

Critical Power for Asymptotic Connectivity in Wireless Networks

- Computer Science
- 1999

In wireless data networks each transmitter's power needs to be high enough to reach the intended receivers, while generating minimum interference on other receivers sharing the same channel. In…

The Number of Neighbors Needed for Connectivity of Wireless Networks

- Computer ScienceWirel. Networks
- 2004

It is shown that in a network with n randomly placed nodes, each node should be connected to Θ(log n) nearest neighbors, and it appears that the critical constant may be close to one, but that remains an open problem.

Connectivity properties of a packet radio network model

- Computer ScienceIEEE Trans. Inf. Theory
- 1989

A model of a packet radio network in which transmitters with range R are distributed according to a two-dimensional Poisson point process with density D is examined and it is shown that pi R/sup 2/D, the expected number of nearest neighbors of a transmitter, must grow logarithmically with the area of the network.

Critical connectivity phenomena in multihop radio models

- PhysicsIEEE Trans. Commun.
- 1989

The results suggest that in optimizing transmission radius as a function of communication performance measures, the choice of radius may be bounded from below by the need to maintain a desired network connectivity.

Mobility increases the capacity of ad-hoc wireless networks

- Computer Science, BusinessProceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213)
- 2001

The per-session throughput for applications with loose delay constraints, such that the topology changes over the time-scale of packet delivery, can be increased dramatically when the nodes are mobile rather than fixed, by exploiting node mobility as a type of multiuser diversity.

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.