Load Balanced Clustering protocol for lifetime enhancement of WSN

Kumkum Dubey, Vijeta Sharma, Amrita Gupta, Ankita Srivastava, Shivendu Mishra, Prince Rajpoot
{"title":"Load Balanced Clustering protocol for lifetime enhancement of WSN","authors":"Kumkum Dubey, Vijeta Sharma, Amrita Gupta, Ankita Srivastava, Shivendu Mishra, Prince Rajpoot","doi":"10.1109/ICCMC.2019.8819854","DOIUrl":null,"url":null,"abstract":"WSN have large numbers of spatially distributed and dedicated sensing devices, which are used for sensing the physical condition of the environment in which they are deployed. Todays time, WSN have lots of areas for research and it plays important role like tracking of area, health-scanning, earthquake-sensing and so on. WSN sets supplementary life as well as nodes time-period in sensor nodes. Network life cycle is dependent on many factors like their topology type, residual energy after some rounds, sensor-node distance to sink node etc. There are already lots of work done on this concept. Clustering is one of the most important approach to make efficient communication. In this paper, we used clustering approach that uses the minimum energy consumption by choosing the Clusters-Heads (CHs) using five parameters: delay, standard deviation of Eres, average distance of CHs, standard deviation of average life time of cluster head and max distance to Base Station (BS). Results verify that our proposed algorithm will prolong the lifetime of network over LEACH and base algorithm.","PeriodicalId":232624,"journal":{"name":"2019 3rd International Conference on Computing Methodologies and Communication (ICCMC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 3rd International Conference on Computing Methodologies and Communication (ICCMC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCMC.2019.8819854","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

WSN have large numbers of spatially distributed and dedicated sensing devices, which are used for sensing the physical condition of the environment in which they are deployed. Todays time, WSN have lots of areas for research and it plays important role like tracking of area, health-scanning, earthquake-sensing and so on. WSN sets supplementary life as well as nodes time-period in sensor nodes. Network life cycle is dependent on many factors like their topology type, residual energy after some rounds, sensor-node distance to sink node etc. There are already lots of work done on this concept. Clustering is one of the most important approach to make efficient communication. In this paper, we used clustering approach that uses the minimum energy consumption by choosing the Clusters-Heads (CHs) using five parameters: delay, standard deviation of Eres, average distance of CHs, standard deviation of average life time of cluster head and max distance to Base Station (BS). Results verify that our proposed algorithm will prolong the lifetime of network over LEACH and base algorithm.
用于WSN生存期增强的负载均衡聚类协议
无线传感器网络具有大量空间分布和专用的传感设备,用于感知其所部署环境的物理状况。目前,无线传感器网络有很多研究领域,在区域跟踪、健康扫描、地震传感等方面发挥着重要的作用。WSN在传感器节点中设置了补充寿命和节点时间段。网络的生命周期取决于网络的拓扑类型、轮询后的剩余能量、传感器节点到汇聚节点的距离等因素。在这个概念上已经做了很多工作。聚类是实现高效通信的重要手段之一。在本文中,我们采用聚类方法,通过使用延迟、Eres的标准差、CHs的平均距离、簇头平均寿命的标准差和到基站的最大距离这五个参数来选择簇头(CHs),从而使用最小的能耗。实验结果表明,与LEACH和基本算法相比,我们提出的算法可以延长网络的生存期。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信