The Study On Dynamic Coverage Algorithm For Wireless Sensor Networks

Entered the information age, people can use IT to achieve the information of mass storage, high-speed transmission, and expedited processing of access to information has yet to achieve the desired level of automation. As the developing and integrating of networks, sensors, wireless communications, micro-electromechanical technologies and sensors, people got more mechanisms to understand and change the world.The Wireless Sensor Network is one of the most closely watched technologies. As a new information retrieval and processing technology, the wireless sensor network has a plant of applications, such as national defense, health care and emergency rescue, and will change the interaction between the human and the nature in the future.In practical applications, we usually deploy sensor nodes in the target area in large-scale and high-density way. Thus the network coverage areas among nodes have overlap, which leads to data acquisition redundancy, transmission redundancy, and unnecessary energy loss. In order to use the energy efficiently and improve the life cycle of the wireless sensor networks, we should take effective coverage controls. Take scheduling node activities to make redundant nodes to work alternatively, to effectively improve energy efficiency and to extend the purpose of the lifetime of wireless sensor networks, this problem is called dynamic coverage problem.In this paper, the wireless sensor network coverage problem on the basis of analysis of proposed based on the virtual grid coverage model the MVG (Model based on virtual grids), the MVG model through the detection region is divided into a regular virtual grid willarea coverage problem evolved into a set covering problem.Wireless sensor network nodes have limited energy, and not to add features, can be used to control the rotation of the redundant nodes sleep scheduling strategies to improve node energy efficiency, extend the network life cycle.This paper presents a Coverage Algorithm Based on the Response Mechanism (CBRM), which decides the nodes active status according to the left energy of the redundant nodes. CBRM algorithm also introduces a "lock" mechanism, to avoid deadlock and infinite iteration of the phenomenon of distributed algorithms.Finally,we use OMNET++simulation tool CBRM algorithm simulation. Through the analysis of experimental results shows that the CBRM algorithm proposed in this paper can achieve the network coverage quality requirements, and requires fewer network nodes to complete the formation of the topology. As a result, the algorithm running in the network, more nodes can "survive" or to work longer hours, thus making the network overall survival time was significantly prolonged.