Research On Quick Recoveraging Algorithm For Sensor Networks Based On Partition

Wireless sensor networks have recently emerged as a premier research topic. They have great longterm economic potential, ability to transform our lives, and pose many new system-building challenges. Sensor networks also pose a number of new conceptual and optimization problems. Some, such as location, deployment, and tracking, are fundamental issues, in that many applications rely on them for needed information. Today, there are still many application cases can be designed, and many questions neede to be covered. It calls for the researchers to research deeply.In many monitoring application regions of wireless sensor networks, each sensor of the networks collects the local information around itself, and sends the received data to Sink. Then, Sink gains the global information of the interesting region P, through synthesizing the local data of all nodes. For making sure the integrality of the global information, Sink should find out first whether the interesting region is coveraged by a given group sensor nodes. Therefore, it is signality to research deeply the coverage problem of sensor networks. For instance, the level that some a heaverily hurt region coveraged by the sensor networks may be needed to know in fire monitoring case. So the coverage problem is regarded as one standard for evaluating the Quality of Service some time.The coverage problem is research deeply in this paper. It is one of the basic problems of sensor networks, and it is one of the key guideline for evaluating the sensor networks work performance. The way of improving service quality in sensor networks can be found by researching the coverage problem.Three common questions, which include Two-dimensional k-coverage (k=1), Two-dimensional maximum k-coverage, Three-dimensional k-coverage (k=1) and Three-dimensional maximum k-coverage, are researched orderly in this paper. Firstly, the think is proposed, which devides the intesting region into equilateral triangles, replacing the traditional Voronoi gridding partition. The new think can decrease the complexity. Then, the paper researchs the k-coverage problem morely, an Equilateral Triangle Partition based Rapid k-Coverage Decision Algorithm and the solution algorithm of maximum k-Coverage problem is proposed, and the application of these algorithms in practice are also discussed. Then, the think is expended to Three-dimensional space, and a Cube Diagram based Rapid k-Coverage Decision Algorithm is proposed. In practice application, whether some locations are covered by the sensor network can be estimated more quickly, hence the next operation such as re-dispose the network can be run more quickly, through using these algorithms At last, the design and implement of sensor networks simulation platform is introduced, which provides the condition for simulating the above algorithms.