A Greedy Overlap-Based Algorithm for Partial Coverage of Heterogeneous WSNs
Habib Mostafaei, Mohammad S. Obaidat · 2017
Wireless Sensor Networks (WSNs) suffer from many resource constraints such as computational, energy, I/O and memory. They are also widely adopted for many applications such as remote monitoring and security applications. These networks highly relies on the limited available resources, therefore, it is crucial to keep the network alive as long as possible. In this paper, we propose a greedy heuristic algorithm to deal with the coverage problem of heterogeneous WSNs in the case when the complete coverage of the network is not needed and the nodes do not have the same sensing and communication features. This is also known as partial coverage. The greedy- based partial coverage (GPC) algorithm can preserve both coverage and connectivity of the nodes in the network. GPC uses the neighbor nodes of the selected nodes in order to preserve the connectivity of the chosen nodes while it uses the overlap between nodes to reach the required coverage ratio. The simulation results show that greedy based solution outperforms recent state-of- art schemes in terms of energy-efficiency.