Research On Coverage Problem In Sensor Networks Based On Confident Information Coverage

Coverage is one of the most important performance metrics in wireless sensor networks. Most of the current studies on coverage problem are based on disk coverage, namely coverage field of sensor is a disk. Based on field reconstruction, we propose a new confident information coverage model, which takes into consideration of not only the collaboration of more than one sensors but also the spatial correlation of physical variable. Confident information coverage bands coverage problem and information fusion technology together. In this paper, we study the mathematical characteristics of confident information coverage and its applications in wireless sensor networks.We first introduce the definition of confident information coverage, and then study its mathematical characteristics. Our study includes three aspects. First, we prove the optimal deployment pattern in wireless sensor networks based on confident information coverage. Second, we derive the critical sensor density in wireless sensor networks based on confident information coverage. Third, we first give the mathematical definition of sensor deployment problem in wireless sensor networks based confident information coverage, and then propose two heuristic algorithms to solve this problem.In this paper, we first prove that the regular triangle deployment pattern is the optimal deployment pattern in wireless sensor networks based on confident information coverage, and then derive the upper and lower bound of the critical sensor density in wireless sensor networks based on confident information coverage. Finally, we propose two heuristic algorithms, namely CCF and CFRP-RR, to solve the sensor deployment problem in wireless sensor networks based on confident information coverage.