Modeling 3D WSN to Maximize Coverage Using Harmony Search Scheme

Abstract

This paper develops a 3D WSN (three-dimensional wireless sensor network) to solve point coverage problem at minimum cost. Coverage in WSN is crucial as it measures the quality of monitoring. This requires finding of optimal number of sensors (cost of the network) at optimal locations to cover the given 3D space. Here, Harmony search scheme has been employed for maximizing coverage and reducing the network cost. The Network coverage ratio, the minimum distance between two sensors and the number of sensors are the parameters that have been incorporated in the objective function. Simulation results have proved the capability of proposed scheme by providing maximum network coverage by placing lesser number of sensor nodes at optimal locations. In addition, incorporation of minimum distance parameter in objective function has reduced overlapping of sensor nodes and reduced the cost of the network by 25%. Furthermore, scalability of the proposed scheme has also been investigated. Also, significant performance enhancement has been observed in terms of network lifetime when the performance of proposed scheme is compared with random-based deployment scheme using Low-Energy Adaptive Clustering Hierarchy (LEACH) protocol.