Energy Efficient Least Edge Computation LEACH in Wireless sensor network

Najm Us Sama, Kartinah Bt Zen, Atiq Ur Rahman, Baseerat Bibi, A. U. Ur Rahman, Ikra Afzal Chesti
{"title":"Energy Efficient Least Edge Computation LEACH in Wireless sensor network","authors":"Najm Us Sama, Kartinah Bt Zen, Atiq Ur Rahman, Baseerat Bibi, A. U. Ur Rahman, Ikra Afzal Chesti","doi":"10.1109/ICCIS49240.2020.9257649","DOIUrl":null,"url":null,"abstract":"Due to the energy resource restriction, the sensor nodes drain out their power. Therefore the routing mechanism among nodes and sink need to consider the balanced energy utilization. Low-Energy Adaptive Clustering Hierarchy (LEACH) consider direct data communication from source cluster head to sink, which results unbalanced energy consumption of cluster heads CHs and leads to routing holes in the network. For balanced energy consumption and maximum network lifetime an Energy efficient Least Edge Computation routing protocol (ELEC) is proposed in literature. The simulation results show better performance of ELEC as compared to LEACH. Therefore, an energy-efficient least edge computation multi-hop clustering LEACH (ELEC-LEACH) is proposed, where the LEACH routing protocol is modified by merging the ELEC multi-hop routing protocol with it. Simulation results prove that ELEC-LEACH enhance lifetime, residual energy, reduce the percentage of node failure and packet drop as compared to MR-LEACH. The result shows that the ELEC-LEACH routing protocol almost doubles the network lifetime, in addition just 9% of total energy left squander.","PeriodicalId":425637,"journal":{"name":"2020 2nd International Conference on Computer and Information Sciences (ICCIS)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-10-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 2nd International Conference on Computer and Information Sciences (ICCIS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCIS49240.2020.9257649","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

Due to the energy resource restriction, the sensor nodes drain out their power. Therefore the routing mechanism among nodes and sink need to consider the balanced energy utilization. Low-Energy Adaptive Clustering Hierarchy (LEACH) consider direct data communication from source cluster head to sink, which results unbalanced energy consumption of cluster heads CHs and leads to routing holes in the network. For balanced energy consumption and maximum network lifetime an Energy efficient Least Edge Computation routing protocol (ELEC) is proposed in literature. The simulation results show better performance of ELEC as compared to LEACH. Therefore, an energy-efficient least edge computation multi-hop clustering LEACH (ELEC-LEACH) is proposed, where the LEACH routing protocol is modified by merging the ELEC multi-hop routing protocol with it. Simulation results prove that ELEC-LEACH enhance lifetime, residual energy, reduce the percentage of node failure and packet drop as compared to MR-LEACH. The result shows that the ELEC-LEACH routing protocol almost doubles the network lifetime, in addition just 9% of total energy left squander.
无线传感器网络的能量高效最小边缘计算LEACH
由于能量资源的限制,传感器节点会耗尽它们的能量。因此,节点和sink之间的路由机制需要考虑能量的均衡利用。低能量自适应聚类层次(LEACH)考虑从源簇头到汇聚簇头的直接数据通信,导致簇头CHs能量消耗不平衡,导致网络存在路由漏洞。为了平衡能量消耗和最大化网络生命周期,文献中提出了一种节能的最小边缘计算路由协议(ELEC)。仿真结果表明,与LEACH相比,ELEC具有更好的性能。为此,提出了一种节能的最小边缘计算多跳聚类LEACH (e -LEACH)算法,将LEACH路由协议与ELEC多跳路由协议合并,对LEACH路由协议进行修改。仿真结果表明,与MR-LEACH相比,e - leach提高了网络的使用寿命、剩余能量、降低了节点故障率和丢包率。结果表明,e - leach路由协议几乎使网络寿命增加了一倍,并且只剩下9%的总能量浪费。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信