On the connectivity in finite ad hoc networks
- 10 December 2002
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 6 (10), 437-439
- https://doi.org/10.1109/lcomm.2002.804241
Abstract
Connectivity and capacity analysis of ad hoc networks has usually focused on asymptotic results in the number of nodes in the network. In this letter we analyze finite ad hoc networks. With the standard assumption of uniform distribution of nodes in [0, z], z > 0, for a one-dimensional network, we obtain the exact formula for the probability that the network is connected. We then extend this result to find bounds for the connectivity in a two-dimensional network in [0, z]/sup 2/.Keywords
This publication has 7 references indexed in Scilit:
- Mobility increases the capacity of ad-hoc wireless networksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- The capacity of wireless networksIEEE Transactions on Information Theory, 2000
- Onk-connectivity for a geometric random graphRandom Structures & Algorithms, 1999
- One-dimensional loss networks and conditioned M/G/∞ queuesJournal of Applied Probability, 1998
- Critical connectivity phenomena in multihop radio modelsIEEE Transactions on Communications, 1989
- Quasi-stationary distributions and one-dimensional circuit-switched networksJournal of Applied Probability, 1987
- One-Dimensional Circuit-Switched NetworksThe Annals of Probability, 1987