Sensor scheduling for confident information coverage in wireless sensor networks

Abstract

Many applications in wireless sensor networks have strict coverage accuracy requirements and need to operate as long as possible. In this paper, based on the new confident information coverage model proposed in our previous study (Wang et al., 2012), we design a novel sensor scheduling algorithm to prolong the network lifetime. This algorithm organizes the sensors into a maximal number of set covers, each capable of providing required coverage. The task of reconstructing the physical phenomena will be accomplished only by the sensors from one working set cover, while all the other sensors are in sleep mode. And we rotate the working set cover to prolong the network lifetime. Our simulation results show that the proposed algorithm outperforms two typical peer algorithms in terms of longer network lifetime.