Improved genetic algorithm-based sensor nodes deployment for barrier coverage Online publication date: Thu, 16-Nov-2023
by Subash Harizan; Pratyay Kuila; Rajeev Kumar; Akhilendra Khare; Reeta Clonia; Ashwin Perti
International Journal of Sensor Networks (IJSNET), Vol. 43, No. 3, 2023
Abstract: Barrier coverage is widely used for an intruder detection. However, sensor nodes (SNs) are prone to failure. Hence it is very challenging to construct a barrier with an efficient coverage and connectivity with minimum number of SNs. From a given set of potential positions (PPs), finding minimum number of PPs for the placement of SNs to form a barrier is an NP-complete problem. In this paper, we propose an improved genetic algorithm (GA)-based approach to solve the aforesaid problem. For the better performance and fast convergence of the algorithm, a novel mutation operation is introduced. In our proposed approach chromosomes are efficiently represented along with an efficient fitness function to evaluate the quality. An extensive simulation is conducted on the various scenarios of the network. The efficiency of the proposed algorithm is shown by comparing the simulated results with traditional genetic algorithm (GA), differential evolution (DE) and GreedyCSC algorithms.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Sensor Networks (IJSNET):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook