Nodes in wireless ad hoc networks may become inactive or unavailable due to, for example, internal breakdown or being in the sleeping state. The inactive nodes cannot take part in routing/relaying and thus may effect the connectivity. A wireless ad hoc network containing inactive nodes is then said to be connected if each inactive node is adjacent to at least one active node and all active nodes form a connected network. This paper is the first installment of our probabilistic study of the connectivity of wireless ad hoc networks containing inactive nodes. We assume that the wireless ad hoc network consists of n nodes, which are distributed independently and uniformly in a unit-area disk and are active (or available) independently with probability p for some constant 0 < p /spl les/ 1. We show that if all nodes have a maximum transmission radius r/sub n/ = /spl radic/(ln n+c//spl pi/pn) for some constant c, then the total number of isolated nodes is asymptotically Poisson with mean e/sup -c/ and the total number of isolated active nodes is also asymptotically Poisson with mean pe/sup -c/.
[1]
P. Erdos,et al.
On the evolution of random graphs
,
1984
.
[2]
N. Henze,et al.
The limit distribution of the largest nearest-neighbour link in the unit d-cube
,
1989,
Journal of Applied Probability.
[3]
Béla Bollobás,et al.
Random Graphs: Notation
,
2001
.
[4]
Noga Alon,et al.
The Probabilistic Method, Second Edition
,
2004
.
[5]
B. Bollobás.
The evolution of random graphs
,
1984
.
[6]
A. Rbnyi.
ON THE EVOLUTION OF RANDOM GRAPHS
,
2001
.
[7]
Noga Alon,et al.
The Probabilistic Method
,
2015,
Fundamentals of Ramsey Theory.
[8]
Piyush Gupta,et al.
Critical Power for Asymptotic Connectivity in Wireless Networks
,
1999
.
[9]
E. N. Gilbert,et al.
Random Plane Networks
,
1961
.
[10]
Béla Bollobás,et al.
Random Graphs
,
1985
.
[11]
M. Penrose.
The longest edge of the random minimal spanning tree
,
1997
.