Target Coverage Algorithm Design For Energy-saving And Connectivity Maintaining In WSN

The booming development of the computer networks technology and thewireless communication technology make the wireless sensor network which iscomprised of wireless sensor nodes become a new focus of the research. Thewireless sensor node is capable of sensing a variety of information, such astemperature, humidity, light and smoke, which leads to a widely use of the wirelesssensor network, especially in the fields of military, environmental monitoring,health care, industry and mining. These fie lds are always unreachable and needreal-time sensing.For many sensing applications, the whole working time of the wireless sensornetwork is a very important indicator when evaluating the performance of thenetworks. How to prolong the survival time is always a key and difficult point in theresearch of Wireless Sensor Network. The target coverage is a classical problem inthe WSN. The specific application usually calls for the three performances:complete coverage, continuous coverage and network connectivity. We know thatthe critical target is the bottle of the network surviva l time. This thesis states theexisting algorithms, analyzes both their advantages and defects, then proposes newcoefficient to evaluate the critical degree of the target and explains the meaning fordesigning. We also take it as a factor for the choice of source node. Then wepropose a responsible weight of the overlapped sensors corresponding to theoverlapped target for selecting the responsible node. Thus, we can further decreasethe redundancy of the data, decrease the power and prolong the network survivaltime. At last，making use of the new coefficient, we design the critical target basedenergy-efficient and connective coverage algorithm (ESACM).We simulate the proposed ESACM algorithm and the existing OCCH algorithmwith C++. Under different amount of sensor nodes, different amount of targets anddifferent size of sensing area, we make compares of the performance between ourESACM algorithm and the existing optimized connected coverage heuristicOCCH algorithm. Through the results, we verifies that the new one can producemore time while less number of covers.