The Algorithm Of Avoiding Coverage-hole To Scheduling In Wireless Sensor Network

In the process of wireless sensor network node scheduling, due to its own characteristics, Sensor nodes to neighbor nodes and the network produce certain effect, Such as those that cause schedule covering loopholes, Coverage-hole will reduce network performance; It is very important to repair coverage-hole in the process of scheduling. This paper mainly on the content of the two aspects of research, content is as follows:1、 The effect factors of network performance are summarized, emphatically introduces the node scheduling the selfish behavior of nodes in the process of its own characteristics. Through simulation and analysis of node selfish behavior affect the performance of neighbor nodes and the entire network. The analysis results show that the node selfish behavior will destroy the node collaboration features, in violation of the target node scheduling, reduce the survival time of the network.2、In the process of the wireless sensor network scheduling coverage hole repair. Node scheduling mechanism in the part of the node energy consumption too fast, causing these nodes failure resulting in the node area covering the hole. According to the state of the node residual energy and coverage requirements for scheduling, scheduling is presented based on the multi-point help cover hole repair and simulated experiment, the result of simulation shows that the scheduling delayed the cover the production of hollow, as much as possible and prolong the network life time.