Design and Analysis of a Breadth First Search based Connectivity Robustness Estimation Approach in Wireless Sensor Networks

摘要: Maintaining the connectivity in wireless sensor networks (WSNs) is one of fundamental tasks that directly affects functionality these networks. WSNs use multi hop ad hoc connections to deliver packets between remote nodes, hence failures some nodes can destroy network connectivity. Tolerating node without loosing important properties reliable WSNs. A k-connected keeps its after any k-1 nodes. So, a WSN has robust connectivity, if k value reasonably high. Detecting an existing may provide information about reliability network. This paper proposes distributed algorithm for finding WSN. The proposed uses breadth first search (BFS) find bottleneck BFS tree defined as level minimum number finds and degree sets values. comprehensive simulation results shows energy consumption up 85% lower estimations are 17.5% more accurate with 16% mean square error than algorithms.