Impact of interferences on connectivity in ad hoc networks

By Olivier Dousse, François Baccelli, Patrick Thiran. IEEE/ACM Transactions on Networking, 2005

432 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Stochastic geometry and random graphs for the analysis and design of wireless networks (2009, methodology): “These are studied in [36] and [37].”
On the Connectivity of Ad Hoc Networks (2004, background): “Further work could investigate connectivity issues with a more realistic channel model, taking into account shadowing [45] and interference [46].”
Stochastic Geometry and Wireless Networks, Volume 1: Theory (2009, neutral): “In (Dousse, Baccelli, and Thiran 2005) the following asymptotic bound was proved in the case of an OPL function l which is infinite outside some bounded set.”
Closing the Gap in the Capacity of Wireless Networks Via Percolation Theory (2007, positive): “It has been used in the past to study connectivity of wireless networks [1], [3], [6], [8], [16], but to the best of our knowledge our paper is the first attempt to exploit percolation to derive information capacity results.”
Graph-theoretic connectivity control of mobile robot networks (2011, background): “Related is also work on asymptotic bounds on the number of neighbors required to ensure connectivity in randomly deployed networks [29], as well as on the critical interference above which connectivity is lost [ 30 ].”
The Complexity of Connectivity in Wireless Networks (2006, neutral): “[31], [8].”