An Efficient Deployment Model for Maximizing Coverage of Heterogeneous Wireless Sensor Network Based on Harmony Search Algorithm

Belal Al-Fuhaidi,Abdulqader M Mohsen,Abdulkhabeer Ghazi,Walid M Yousef,Eduard Llobet

doi:10.1155/2020/8818826

Belal Al-Fuhaidi, Abdulqader M Mohsen + Show 3 more

Open Access

https://doi.org/10.1155/2020/8818826

Copy DOI

Abstract

Due to the increase of Wireless Sensor Network (WSN) technologies demand, the optimal sensor node deployment is considered as one of the most important factors that directly affect the network coverage. Most researches in WSNs that solved the problem of coverage in homogeneous and heterogeneous cases are suffering from many drawbacks such as consumed energy and high cost. In this paper, we propose an efficient deployment model based on probabilistic sensing model (PSM) and harmony search algorithm (HSA) to achieve the balance between the network coverage performance and the network cost in a heterogeneous wireless sensor network (HEWSN). The HSA is used for deployment optimization of HEWSN nodes which makes a balance between the coverage and financial cost. The PSM is used to solve the overlapping problem among the sensors. The performance of the proposed model is analyzed in terms of coverage ratio and cost evaluations. The simulation results showed the capability of the proposed heterogeneous deployment model to achieve maximum coverage and a minimum number of sensors compared to homogeneous deployment. Furthermore, a comparative study with a meta-heuristic genetic-based algorithm in HEWSN has also been conducted, and its results confirm the superiority of the proposed model.

Highlights

Over the past decade, wireless sensor networks (WSNs) have become a wealthy research field, providing several new trends of applications
The HS-based solutions were providing optimum solutions to different problems in HOWSN, but were not included in heterogeneous wireless sensor network (HEWSN) coverage problems. Encouraged by these finding, the proposed work requires a more balancer method between maximizing coverage and reducing unnecessary network cost with an overlapping minimization, we propose a solution in HEWSN for finding the optimal number of sensor nodes in a way that the optimal location of these sensors can be reached using probabilistic sensing model (PSM) and HS algorithm. (a) According to the three parameters of harmony search algorithm (HSA), Harmony Memory Considering Rate (HMCR), Pitch Adjusting Rate (PAR), and Bandwidth (BWrange), the HSA can find the suitable number of sensor nodes as well as its positions
We addressed the problem of maximizing the coverage and minimizing the number of deployment of sensors in HEWSN using HSA and PSM

Summary

Introduction

Wireless sensor networks (WSNs) have become a wealthy research field, providing several new trends of applications. Authors in [10] proposed a novel algorithm in planned deployment was called maximal coverage hybrid search algorithm to achieve maximum coverage with a minimum number of deployment sensors This type can be used for the placement of sensor nodes in the small-scale area and is not practical to cover AoI such as hostile environments and large regions. We consider the problem of maximizing coverage area in heterogeneous WSN with an optimized sensor deployment and minimization in sensors overlapping. (1) We propose an efficient deployment model in HEWSN which gives a maximum coverage area with the optimized number of sensor nodes (network cost).

Literature Review

HEWSN Deployment Model and Problem Formulation

Problem Formulation

Experimental Results and Comparative Study

Conclusion