Connectivity reliability of large scale random ad hoc networks
Lei Wei · 2004
In this paper we study connectivity reliability of a large scale randomly connected ad hoc network. We first model the networks as random graphs, and then present a way to exam its connectivity reliability. The results show that if each node can randomly connect to 3 nodes, then for 99.5 % of graphs we can trace to all nodes from one node. If each node can just randomly connect to 2 nodes, then the reliable connectivity cannot be established.