A Novel Genetic Algorithm with db4 Lifting for Optimal Sensor Node Placements

Ganesan Thangavel, P. Rajarajeswari
{"title":"A Novel Genetic Algorithm with db4 Lifting for Optimal Sensor Node Placements","authors":"Ganesan Thangavel, P. Rajarajeswari","doi":"10.34028/iajit/19/5/12","DOIUrl":null,"url":null,"abstract":"Target coverage algorithms have considerable attention for monitoring the target point by dividing sensor nodes into cover groups, with each sensor cover group containing the target points. When the number of sensors is restricted, optimal sensor node placement becomes a key task. By placing sensors in the ideal position, the quality of maximum target coverage and node connectivity can be increased. In this paper, a novel genetic algorithm based on the 2-D discrete Daubechies 4 (db4) lifting wavelet transform is proposed for determining the optimal sensor position. Initially, the genetic algorithm identifies the population-based sensor location and 2-D 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 demonstrate that the suggested model outperforms the existing method, A series of experiments are carried out using various situations to achieve maximum target point coverage, node interconnectivity, and network lifetime with a limited number of sensor nodes.","PeriodicalId":13624,"journal":{"name":"Int. Arab J. Inf. Technol.","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Int. Arab J. Inf. Technol.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.34028/iajit/19/5/12","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Target coverage algorithms have considerable attention for monitoring the target point by dividing sensor nodes into cover groups, with each sensor cover group containing the target points. When the number of sensors is restricted, optimal sensor node placement becomes a key task. By placing sensors in the ideal position, the quality of maximum target coverage and node connectivity can be increased. In this paper, a novel genetic algorithm based on the 2-D discrete Daubechies 4 (db4) lifting wavelet transform is proposed for determining the optimal sensor position. Initially, the genetic algorithm identifies the population-based sensor location and 2-D 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 demonstrate that the suggested model outperforms the existing method, A series of experiments are carried out using various situations to achieve maximum target point coverage, node interconnectivity, and network lifetime with a limited number of sensor nodes.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于db4提升的传感器节点优化遗传算法
目标覆盖算法非常重视通过将传感器节点划分为覆盖组,每个传感器覆盖组包含目标点来监控目标点。在传感器数量有限的情况下,传感器节点的优化布置成为一个关键问题。通过将传感器放置在理想位置,可以提高最大目标覆盖率和节点连通性的质量。提出了一种基于二维离散Daubechies 4 (db4)提升小波变换的遗传算法来确定传感器的最优位置。最初,遗传算法识别基于种群的传感器位置,二维离散db4提升将传感器位置调整到最佳位置,其中每个传感器可以覆盖连接到另一个传感器的最大数量的目标。为了证明该模型优于现有方法,在有限的传感器节点数量下,在各种情况下进行了一系列实验,以实现最大的目标点覆盖率、节点互联性和网络寿命。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Novel Energy Efficient Harvesting Technique for SDWSN using RF Transmitters with MISO Beamforming Incorporating triple attention and multi-scale pyramid network for underwater image enhancement Generative adversarial networks with data augmentation and multiple penalty areas for image synthesis MAPNEWS: a framework for aggregating and organizing online news articles Deep learning based mobilenet and multi-head attention model for facial expression recognition
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1