The Divide-and-Conquer Deployment Algorithm Based on Triangles for Wireless Sensor Networks

In order to monitor environmental conditions, a large quality of static sensors normally are deployed randomly in large monitored area. Obviously, there are coverage holes distributed over the monitored area, and the coverage hole can be polygonal. Each coverage hole is evaluated collaboratively by static sensors surrounding the hole, while all coverage holes are evaluated in parallel. Because a polygon can be divided triangularly, exactly how to deploy sensors on a triangle is a priority. Three static sensors are located individually on the three nodes of triangles following random deployment. This work presents a novel divide-and-conquer deployment algorithm based on the triangular form that is executed on the three static sensors. The triangle can be cut into smaller ones that contain at least one interior angle equal to 60°. The small triangles with a 60° angle can be ensured full coverage, while the remaining area is still a triangle. The cutting is repeated until the triangle is sufficiently small so that the sensors on the three nodes can fully cover the area. Ultimately, the coverage hole of a triangle can be full coverage. Moreover, the x -y coordinates of each deployed sensor can be deduced. The proposed algorithm can conquer the coverage hole of each triangle of the polygon. The number of sensors and x- y coordinates of all sensors deployed in the coverage hole of the polygon can be evaluated as well.