Coverage And Connectivity Guaranteed Deterministic Deployment Pattern For WSN

摘要

In Wireless Sensor Network, node placement may be random or regular. In deterministic deployment, sensors are placed by hand at selected spots prior to network operation in wireless sensor network. It is more popular today when the deployment area is physically accessible and its success depends on the optimality of the deployment pattern. In this paper, we propose a new ploygon based deployment pattern for optimal placement of sensors in WSN with guaranteed coverage and connectivity. The coverage of the proposed deployment is compared with existing deployments like square, stripe, triangles and shown positive results. The connectivity is measured as the number of active nodes in the dominating set and it is also good when we compare the connectivity with a topology construction algorithms A3 in.