An Adaptive Mechanism for Full Coverage inWireless Sensor Networks

Abstract

The coverage issue in wireless sensor networks has already attracted numerous researchers. In order to lift the utility rate of sensors, it is important to lessen the number of active sensors that perform tasks. This paper describes a decentralized and selfconfigured mechanism for determining active nodes for the complete coverage in various system environments. The adaptive mechanism examines the existence of blind/overlapped area and activates/deactivates appropriate sensor nodes. The mechanism can further be extended to locationfree environment. Three other approaches, OTTAWA, PEAS, and OGDC, were also implemented for performance comparisons. The simulations measured the metrics in Tx/Rx control overhead, energy consumption, size of the active node set, and sensing coverage of the active node set. The results show that the adaptive mechanism aids profits in network scalability, energy efficiency, and number of active sensor nodes.