基于改进蚁群算法的拥塞感知集群 WSN

Q4 Engineering
R. Anto Pravin , X.S. Asha Shiny , V. Baby Vennila , P. Selvaraju , R. Uma Mageswari , S. Satish kumar
{"title":"基于改进蚁群算法的拥塞感知集群 WSN","authors":"R. Anto Pravin ,&nbsp;X.S. Asha Shiny ,&nbsp;V. Baby Vennila ,&nbsp;P. Selvaraju ,&nbsp;R. Uma Mageswari ,&nbsp;S. Satish kumar","doi":"10.1016/j.measen.2024.101280","DOIUrl":null,"url":null,"abstract":"<div><p>Conventional works carried out in Wireless Sensor Networks (WSN) mostly focussed on energy oriented services and very less significant measures given to delay oriented and congestion aware services. Hence the proposed mechanism specially focuses on network structural design by placing rendezvous location for each cluster as well as route segmentation for controlling the congestion occurrence and unwanted delay. Here Congestion Aware Clustering with Improved Ant Colony Algorithm (CAC_IACA) is proposed. This mechanism involves two steps (i) identifying the best route by following the Ant Colony Optimization (ACO) algorithm and (ii) data segmentation using rendezvous mobile nodes. The Rendezvous nodes are present in each cluster to reduce the congestion rate on receiver side during data transmission. This proposed methodology mainly concentrates on reducing coverage cost for 3D environmental monitoring. Simulation results are analysed and the efficiency of the proposed scheme proves 26.54 % better than the conventional method.</p></div>","PeriodicalId":34311,"journal":{"name":"Measurement Sensors","volume":"34 ","pages":"Article 101280"},"PeriodicalIF":0.0000,"publicationDate":"2024-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2665917424002563/pdfft?md5=f48deea33570e814dd4f73c5f2915e50&pid=1-s2.0-S2665917424002563-main.pdf","citationCount":"0","resultStr":"{\"title\":\"Congestion aware clustered WSN based on an improved ant colony algorithm\",\"authors\":\"R. Anto Pravin ,&nbsp;X.S. Asha Shiny ,&nbsp;V. Baby Vennila ,&nbsp;P. Selvaraju ,&nbsp;R. Uma Mageswari ,&nbsp;S. Satish kumar\",\"doi\":\"10.1016/j.measen.2024.101280\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>Conventional works carried out in Wireless Sensor Networks (WSN) mostly focussed on energy oriented services and very less significant measures given to delay oriented and congestion aware services. Hence the proposed mechanism specially focuses on network structural design by placing rendezvous location for each cluster as well as route segmentation for controlling the congestion occurrence and unwanted delay. Here Congestion Aware Clustering with Improved Ant Colony Algorithm (CAC_IACA) is proposed. This mechanism involves two steps (i) identifying the best route by following the Ant Colony Optimization (ACO) algorithm and (ii) data segmentation using rendezvous mobile nodes. The Rendezvous nodes are present in each cluster to reduce the congestion rate on receiver side during data transmission. This proposed methodology mainly concentrates on reducing coverage cost for 3D environmental monitoring. Simulation results are analysed and the efficiency of the proposed scheme proves 26.54 % better than the conventional method.</p></div>\",\"PeriodicalId\":34311,\"journal\":{\"name\":\"Measurement Sensors\",\"volume\":\"34 \",\"pages\":\"Article 101280\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-07-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2665917424002563/pdfft?md5=f48deea33570e814dd4f73c5f2915e50&pid=1-s2.0-S2665917424002563-main.pdf\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Measurement Sensors\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2665917424002563\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Engineering\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Measurement Sensors","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2665917424002563","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

摘要

在无线传感器网络(WSN)中开展的传统工作主要集中在以能量为导向的服务上,而对以延迟为导向和拥塞感知服务所采取的措施却很少。因此,所提出的机制特别关注网络结构设计,通过为每个集群设置交会地点以及路由分割来控制拥塞发生和不必要的延迟。这里提出了改进蚁群算法的拥塞感知聚类(CAC_IACA)。该机制包括两个步骤:(i) 按照蚁群优化(ACO)算法确定最佳路径;(ii) 使用会合移动节点进行数据分割。每个集群中都有会合节点,以降低数据传输过程中接收端的拥塞率。所提出的方法主要集中于降低三维环境监测的覆盖成本。对仿真结果进行了分析,证明所提方案的效率比传统方法高出 26.54%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Congestion aware clustered WSN based on an improved ant colony algorithm

Conventional works carried out in Wireless Sensor Networks (WSN) mostly focussed on energy oriented services and very less significant measures given to delay oriented and congestion aware services. Hence the proposed mechanism specially focuses on network structural design by placing rendezvous location for each cluster as well as route segmentation for controlling the congestion occurrence and unwanted delay. Here Congestion Aware Clustering with Improved Ant Colony Algorithm (CAC_IACA) is proposed. This mechanism involves two steps (i) identifying the best route by following the Ant Colony Optimization (ACO) algorithm and (ii) data segmentation using rendezvous mobile nodes. The Rendezvous nodes are present in each cluster to reduce the congestion rate on receiver side during data transmission. This proposed methodology mainly concentrates on reducing coverage cost for 3D environmental monitoring. Simulation results are analysed and the efficiency of the proposed scheme proves 26.54 % better than the conventional method.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Measurement Sensors
Measurement Sensors Engineering-Industrial and Manufacturing Engineering
CiteScore
3.10
自引率
0.00%
发文量
184
审稿时长
56 days
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信