Sensing Connectivity Coverage and Robustness of WSN with Random Distribution of Nodes.

In this paper, we aim at the point which the sensing coverage for target monitor tracking and the connectivity coverage for information transmitting of WSN claim to robust, anti-fragility. We firstly present and prove a profound sensing radius of nodes; this radius can make each objective point of monitor area fall under the sensing range of at least one sensor node by the probability of tending to 1 at any time. Secondly, we analyze the problem of connectivity coverage of WSN, also present and prove a probability inequality of active nodes, which can be of the judgment scale and the critical threshold that the connectivity of WSN not to be destroyed. Thirdly, under the premise which the necessity of connectivity of WSN is satisfied, we present an algorithm that provided with robust connectivity of big probability, and doing the simulation analysis. [ABSTRACT FROM AUTHOR]