Efficient sensor node connectivity and target coverage using genetic algorithm with Daubechies 4 lifting wavelet transform
by T. Ganesan; Pothuraju Rajarajeswari
International Journal of Communication Networks and Distributed Systems (IJCNDS), Vol. 28, No. 3, 2022

Abstract: Recently, target coverage algorithms are widely used to monitor the target point by dividing sensor nodes into a set of cover groups where each sensor cover group contains the target points. Optimal sensor node placement imposes a critical task when the number of sensors is limited. The quality of maximum target coverage and node connectivity can be improved by deploying sensors in the optimal location. In this paper, a novel genetic algorithm with 2D discrete Daubechies 4 (db4) lifting wavelet transform is proposed for identifying the optimal position of each sensor. Initially, the genetic algorithm identifies the population-based sensor location and 2D discrete db4 lifting adjusts the sensor location into an optimal position where each sensor can cover a maximum number of targets that are connected to another sensor. To further prove that the proposed model is better than the existing algorithm, a set of experiments are carried out with different scenarios by achieving maximum target points covers, node connectivity, and network lifetime with a limited number of sensor nodes.

Online publication date: Mon, 11-Apr-2022

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
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 Communication Networks and Distributed Systems (IJCNDS):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your 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