A Self-Configurable Event Coverage Approach for Wireless Sensor Networks

Abstract

Sensing and data aggregation capabilities of wireless sensor networks (WSNs) depends on efficient deployment of sensor nodes (SNs) in an area. In a large surveillance space, there is a need for more SNs to cover important crucial events despite of the optimum coverage. The authors propose an event-based efficient deployment algorithm (EEDA) for relocation of redundant sensors to the event location to achieve full coverage. They divide the deployment region into small square cells that allows individual cells to be efficiently monitored, instead of considering the whole scenario as one unit. EEDA ensures efficient coverage of the entire deployment region and senses the occurrence of any static or dynamic event with an optimum number of sensors. EEDA with square cells performs better than existing hexagon cell algorithm by 39%. EEDA is validated by simulation as well as by experimental results.