Mesh Simplification in Wireless Sensor Networks Using INRCDTS Algorithm

摘要

The sensor network deployment is a critical issue that affects cost and detection capability, requiring consideration of both coverage and connectivity. A Sensor Node (SN) may perform the dual function of sensing the environment and acting as a relay node (RN), communicating sensed data to a Base Station (BS) for monitoring and analysis. Coverage which is one of the most important performance metrics for sensor networks reflects how well a sensor meld is monitored. The power consumption of the communication in multi-hop WSN is primarily decided by three factors: routing distance, signal interference, and computation cost of routing. A challenging problem in deploying wireless sensor networks is maximizing coverage in irregular shaped polygonal areas while maintaining a high degree of node connectivity. In this system, the mesh simplification is made using Iterative Node Removal with Constrained Delaunay Triangulation and Smoothing (INRCDTS) Algorithm for coverage in any nonintersecting closed polygon. It is also proven that the INRCDTS enhancement increase the uniformity of the mesh in an irregular shaped polygonal area relative to MATLAB partial differential equation algorithms.