On the average pairwise connectivity of wireless multihop networks

A new metric -average pairwise connectivity- is proposed to measure the fault tolerance of wireless multihop networks. Two types of random graphs, Poisson random graph and geometric random graph, are adopted to model wireless multihop networks and are used in experimental studies. By investigating the upper bound and lower bound of the average pairwise connectivity for different types of random graphs and the distribution of the difference between the upper bounds and lower bounds, we conclude that the average pairwise connectivity of wireless multihop networks can be very well approximated by its upper bound, a quantity that is easily computed.