Spatial Unconditional and Conditional Network Connectivity and Fault-Tolerance Measures for k-Covered Wireless Sensor Networks

Abstract

AbstractThis chapter computes the unconditional (or traditional) connectivity and fault-tolerance of spatial (or three-dimensional) homogeneous and heterogeneous k-covered wireless sensor networks. The proposed measures are based on the Reuleaux tetrahedron model, which is used to characterize k-coverage of a spatial field as discussed earlier in Chap. 7. This choice is to make this computation problem more tractable. Moreover, based on the concepts of conditional connectivity and forbidden faulty sensor set, which cannot include all the neighbors of a sensor, this chapter proposes conditional network connectivity and fault-tolerance measures for the above networks. It proves that spatial k-covered wireless sensor networks can sustain a large number of sensor failures. Precisely, it shows that these networks have connectivity higher than their degree of coverage k. Furthermore, some widely used assumptions in coverage and connectivity in wireless sensor networks, such as sensor homogeneity and unit sensing and communication model, are relaxed so as to promote the practicality of the results of this chapter in real-world scenarios.