一种基于位置和剩余能量的改进LEACH无线传感器网络协议

Yongmin Liu, Tingting Shi, Yiming Liu, Hanlin Liu, Zhuonong Xu
{"title":"一种基于位置和剩余能量的改进LEACH无线传感器网络协议","authors":"Yongmin Liu, Tingting Shi, Yiming Liu, Hanlin Liu, Zhuonong Xu","doi":"10.1145/3544109.3544174","DOIUrl":null,"url":null,"abstract":"Normally, in the classical Low Energy Adaptive Clustering Hierarchy protocol (LEACH), the choice of cluster heads does not rely on the location of node and the residual energy of node. Under the circumstances, the cluster head nodes often die prematurely, resulting in a short lifetime of the whole network. Based on traditional LEACH protocols, this paper gave a new rule of cluster formation by K-means clustering method. When ordinary nodes are upgraded to cluster head nodes, the location and residual energy of nodes are comprehensive considered to improve the election method of cluster head. At the same time, the ordinary node closing to the sink node is marked as a special node, and it jumps out of the cluster structure to transmit data directly to the sink node. Thus, the LEACH-CS (Cluster Selection) algorithm was proposed. Then, we derived the formula of total energy consumption, calculated the optimal value of the number of cluster centers in the lowest energy consumption and the selection of special node distance by mathematical deduction. Finally, the effectiveness of the method was verified by simulations. The simulation results demonstrate that compared with the traditional LEACH protocol and LEACH-C protocol, the proposed algorithm LEACH-CS can effectively reduce the total energy consumption of the network and greatly prolong the network lifetime.","PeriodicalId":187064,"journal":{"name":"Proceedings of the 3rd Asia-Pacific Conference on Image Processing, Electronics and Computers","volume":"17 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Improved LEACH Protocol Based on Location and Residual Energy for Wireless Sensor Networks\",\"authors\":\"Yongmin Liu, Tingting Shi, Yiming Liu, Hanlin Liu, Zhuonong Xu\",\"doi\":\"10.1145/3544109.3544174\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Normally, in the classical Low Energy Adaptive Clustering Hierarchy protocol (LEACH), the choice of cluster heads does not rely on the location of node and the residual energy of node. Under the circumstances, the cluster head nodes often die prematurely, resulting in a short lifetime of the whole network. Based on traditional LEACH protocols, this paper gave a new rule of cluster formation by K-means clustering method. When ordinary nodes are upgraded to cluster head nodes, the location and residual energy of nodes are comprehensive considered to improve the election method of cluster head. At the same time, the ordinary node closing to the sink node is marked as a special node, and it jumps out of the cluster structure to transmit data directly to the sink node. Thus, the LEACH-CS (Cluster Selection) algorithm was proposed. Then, we derived the formula of total energy consumption, calculated the optimal value of the number of cluster centers in the lowest energy consumption and the selection of special node distance by mathematical deduction. Finally, the effectiveness of the method was verified by simulations. The simulation results demonstrate that compared with the traditional LEACH protocol and LEACH-C protocol, the proposed algorithm LEACH-CS can effectively reduce the total energy consumption of the network and greatly prolong the network lifetime.\",\"PeriodicalId\":187064,\"journal\":{\"name\":\"Proceedings of the 3rd Asia-Pacific Conference on Image Processing, Electronics and Computers\",\"volume\":\"17 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-14\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 3rd Asia-Pacific Conference on Image Processing, Electronics and Computers\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3544109.3544174\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd Asia-Pacific Conference on Image Processing, Electronics and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3544109.3544174","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

通常,在经典的低能量自适应聚类层次协议(LEACH)中,簇头的选择不依赖于节点的位置和节点的剩余能量。在这种情况下,簇头节点往往过早死亡,导致整个网络的生命周期较短。本文在传统LEACH协议的基础上,提出了一种基于k均值聚类的聚类规则。将普通节点升级为簇头节点时,综合考虑了节点的位置和剩余能量,改进了簇头的选举方法。同时,将靠近汇聚节点的普通节点标记为特殊节点,跳出集群结构,直接向汇聚节点传输数据。为此,提出了LEACH-CS(聚类选择)算法。然后,推导出总能耗公式,通过数学推导计算出最低能耗下簇中心数的最优值以及特殊节点距离的选择。最后,通过仿真验证了该方法的有效性。仿真结果表明,与传统的LEACH协议和LEACH- c协议相比,所提出的LEACH- cs算法可以有效地降低网络的总能耗,大大延长网络的生存期。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
An Improved LEACH Protocol Based on Location and Residual Energy for Wireless Sensor Networks
Normally, in the classical Low Energy Adaptive Clustering Hierarchy protocol (LEACH), the choice of cluster heads does not rely on the location of node and the residual energy of node. Under the circumstances, the cluster head nodes often die prematurely, resulting in a short lifetime of the whole network. Based on traditional LEACH protocols, this paper gave a new rule of cluster formation by K-means clustering method. When ordinary nodes are upgraded to cluster head nodes, the location and residual energy of nodes are comprehensive considered to improve the election method of cluster head. At the same time, the ordinary node closing to the sink node is marked as a special node, and it jumps out of the cluster structure to transmit data directly to the sink node. Thus, the LEACH-CS (Cluster Selection) algorithm was proposed. Then, we derived the formula of total energy consumption, calculated the optimal value of the number of cluster centers in the lowest energy consumption and the selection of special node distance by mathematical deduction. Finally, the effectiveness of the method was verified by simulations. The simulation results demonstrate that compared with the traditional LEACH protocol and LEACH-C protocol, the proposed algorithm LEACH-CS can effectively reduce the total energy consumption of the network and greatly prolong the network lifetime.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信