Solving K-Coverage Problem in Wireless Sensor Networks Using Improved Harmony Search

Coverage and energy efficiency metrics are two fundamental issues for distribution of wireless sensor nodes. Coverage reflects how well an area is monitored by sensor nodes and in energy efficient networks less energy is consumed to provide the same level of services. These twin specifics are presented to evaluate the performance of a wireless sensor network. On the other hand, connectivity and k-coverage are prerequisites for a k-covered Wireless Sensor Network. Connectivity shows how nodes in a sensor network can effectively communicate and k-coverage means hotspot regions are covered by at least k sensors. In this article, we propose an Improved Harmony Search algorithm in a k-covered and connected wireless sensor network to achieve a sensor node deployment such that the covered area is optimal and data transfer has low energy consumption. Through computer simulations, experimental results verified that the proposed method improved the coverage of area in compare to some related methods.