Topology connectivity of wireless Ad Hoc networks is an essential prerequisite to end-to-end data communication

and biconnectivity is the basic condition to maintain topology connectivity in the case of unexpected node failure.Based on the analysis of the probability of cut-vertexes whose failure will partition a network

this paper derives a practicable formula for one-dimensional networks with nodes distributed randomly and uniformly.It formulates the relationship between biconnectivity probability and three basic network parameters

such as the size of network area

the number of network nodes and the transmission range of each node.According to this formula

we can optimize network topology efficiently.Simulation results validate the accuracy of our conclusion and confirm its efficiency in practical network design.