Modeling and analysis of bi-connected minimum energypath preserving graphs for wireless multi-hop networks

opology control (TC) algorithms in wireless multi-hop networks create connected communication subgraphs that satisfy some desirable topological properties such as minimum-energy, fault tolerance, minimum interference, and bounded node degree. However, preserving two or more combination of these properties simultaneously is harder to achieve and often overlooked by the research community. In this paper, we describe a connectivity preserving topology control algorithm which combines two important properties, e.g., (a) minimum energy, and (b) fault tolerance. For the topology generated by the algorithm, we provide an analytical model to estimate its structural density. The accuracy of the analytical model is validated with extensive simulation results.