Connectivity of wireless multihop networks
Some fundamental topological characteristics of wireless multihop networks are studied in this paper. A necessary condition of that a wireless multihop network is connected is given out. And a new compute method of connectivity is given out. Suppose that the all nodes are distributed in a bounded square Ω according to Homogenous Poisson Process. A lower bound of the probability that G is connected is given out, with well considering the boundary effects. And a lower bound of the probability that G is k-connected and has k mutually vertex-disjoint backbone trees is also given out, with well considering the boundary effects, where k ∈ N, k ≤ |V| − 1.