Area Coverage Redundancy and Node Positioning in Wireless Sensor Networks

Abstract

Wireless sensor networks create the platform of an extensive range of applications linked to national security, surveillance, military, health care, and environmental monitoring. One of the most imperative and elementary problems in Wireless Sensor Networks (WSNs) is the coverage problem. Network coverage of wireless sensor network means how well an area of interest is being supervised by the deployed network. The prominence of coverage in WSNs is so important that, it is one of the assets of service parameters. This paper gives information about area coverage redundancy and placing a certain number of nodes such that a region of interest is completely covered and all the nodes and a base station can communicate. This paper considers VDDA(Voronoi diagram deployment algorithm)algorithm for moving distance in the relocation calculation and energy consumption.