377
20180318102525.0
CONF
Connectivity in ad-hoc and hybrid networks
2002
2002
Conference Papers
We consider a large-scale wireless network, but with a low density of nodes per unit area. Interferences are then less critical, contrary to connectivity. This paper studies the latter property for both a purely ad-hoc network and a hybrid network, where fixed base stations can be reached in multiple hops. We assume here that power constraints are modeled by a maximal distance above which two nodes are not (directly) connected. We find 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. We explain the results by percolation theory. We obtain analytical expressions of the probability of connectivity in the 1-dim. case. We also show that at a low spatial density of nodes, bottlenecks are unavoidable. Results obtained on actual population data confirm our findings.
Wireless networks
ad hoc networks
hybrid networks
Poisson Boolean model
percolation theory.
NCCR-MICS
NCCR-MICS/CL1
Dousse, Olivier
Thiran, Patrick
103925
240373
Hasler, Martin
IEEE Infocom 2002
New York
1079-1088
IEEE Infocom 2002
592485
n/a
http://infoscience.epfl.ch/record/377/files/DousseTH02.pdf
oai:infoscience.tind.io:377
IC
conf
LCA
252614
US00024
LCA3
252454
U10431
LCA-CONF-2002-006
544/LCA
EPFL
PUBLISHED
CONF