Research Of Deployment Algorithm For Wireless Sensor Network With Irregular Sensing Range

WSN node deployment is an important basic theoretical problem, and it is also the most important issue to face when we development practical application. In order to have a satisfactory sensing range, many researchers pay attention to the node deployment algorithm and make it to become a research hotspot.Traditionally, there is a significant basic assumption in the research of node deployment problem; it is that sensor node’s sensing range is circular. And take it as foundation to design corresponding deployment algorithm. However, the theoretical and actual measurements have shown that the sensing range of node is often irregular circular. Those proposed algorithms based on the assumption that sensor node’s sensing range is circular often produce the phenomenon that the area that assume can be covered originally is actually impossible to be covered, that means it produce coverage holes.This paper has studied sensor node’s irregular sensing model and has proposed wireless sensor network randomly deployment algorithm based on Delaunay triangulation and grid. In the deployment algorithm, sensor nodes that have already been started are grouped by Delaunay Triangulation, then calculate the target point TP by the TPM algorithm, and choose the TP as a reference point to start a new node. This algorithm adjust TP in accordance with grid coverage around nodes and distance between nodes, and also had proposed "border reinforcement mechanism" and "obtuse triangle TP-point optimization strategy" to improve coverage effectively.Effectiveness of the proposed algorithm is evaluated through the experiment. Experiment results show that the proposed deployment algorithm can effectively use randomly deployed sensor nodes, it can quickly raise coverage to90%or more and has the feature that makes the redundant cover region to be few, the coverage rate grows fast, and small amount of nodes can achieve high coverage.