Critical Transmitting Range for Biconnectivity of One-Dimensional Wireless Ad Hoc Networks

Biconnectivity is the baseline graph theoretic metric of fault tolerance to node failures which can keep network connectivity while allowing unexpected node failures. In this paper we analyze this property for one-dimensional wireless Ad Hoc networks with finite nodes, which finds many applications in the real world, such as bus networks built along freeways and sensor networks deployed along frontiers. With common adopted assumption of uniform node distribution for static networks, the formula for the critical transmitting range that realizes network biconnectivity with certain probability is derived. Simulation results validate the accuracy of our conclusion and confirm its efficiency in practical network design.