Research On Node-scheduling And Dormancy Algorithm For Sensor Networks

During constructing the wireless sensor networks (WSN), network coverage is one of the basic items. The problem of coverage control can be treated as making the resource in WSN get optimization assignment so as the detecting, sense, monitor and communication in QOS achieve improvement, using deployment of nodes, routing selection or other methods in constrain of the nodes'energy, channel bandwidth and network processing capacity. The primary destination of coverage algorithm design is to sense larger area and get more information of target with certain redundancy. At the same time, power of nodes is limited so that the complexity and validity of algorithm should be considered. In addition, design of coverage algorithm should consider the static and dynamic property of the whole network, including validity and connectivity of network and reducing of nodes.This paper introduces the present reach on coverage algorithm of WSN and same related work at the beginning, such as Delaunay tessellation which widely used in WSN. Conformation of local Delaunay tessellation is introduced as important because it is the fundament of the algorithm.The third part of the paper introduces the node-scheduling in WSN and some issued methods are compared and analyzed. As fundament of this, it improves the potential field algorithm and introduces twos kinds of virtual force: random disturbance force and boundary force, which used to control the diffusion and contraction of network. The experimental result shows that new virtual force can eliminate the center confusion which cause by issued algorithm. Nodes cover the destination evenly and energy consumption is less than other main node-scheduling methods.In the following, this paper introduces the dormancy problem of redundant nodes and proposes a distributed redundant node distinguish algorithm and rotated voting to shutdown algorithm based on local Delaunay tessellation. The experiment result shows that it can determine redundant nodes in the network effectively. At the same time, the rotated voting to shutdown algorithm can shutdown the redundant nodes without reducing the initial coverage area and reduce power consumption.Finally, it's the overall summarization of the paper and research expectation of coverage algorithm in wireless sensor networks.