基于剩余能量和密度控制的无线传感器网络簇头选举

Meriem Meddah, R. Haddad, T. Ezzedine
{"title":"基于剩余能量和密度控制的无线传感器网络簇头选举","authors":"Meriem Meddah, R. Haddad, T. Ezzedine","doi":"10.1109/WAINA.2018.00077","DOIUrl":null,"url":null,"abstract":"In designing the Wireless Sensor Network, the energy consumption represents one of the most and important factor that recent researches aim to reduce efficiently. Because of the limited energy that sensor nodes are equipped with, and in order to prolong the network lifetime, we introduce a new clustering algorithm for WSN, which consists on choosing a subset of sensor nodes to be elected as Cluster Heads. This choice is based on three parameters; the residual energy, the density and the distances separating the node with its neighbors. Each node enters into a competition and makes its proper decision. Then, the network is divided into clusters and each member is affected to the nearest CH that has the job to gather the data of the members of its cluster. The efficiency of our proposed algorithm is proved comparing with some other clustering approaches. Simulation results show that the energy dissipation of the sensor nodes can be considerably reduced, and the network lifetime efficiently extended.","PeriodicalId":296466,"journal":{"name":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Residual Energy and Density Control Aware Cluster Head Election in Wireless Sensor Network\",\"authors\":\"Meriem Meddah, R. Haddad, T. Ezzedine\",\"doi\":\"10.1109/WAINA.2018.00077\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In designing the Wireless Sensor Network, the energy consumption represents one of the most and important factor that recent researches aim to reduce efficiently. Because of the limited energy that sensor nodes are equipped with, and in order to prolong the network lifetime, we introduce a new clustering algorithm for WSN, which consists on choosing a subset of sensor nodes to be elected as Cluster Heads. This choice is based on three parameters; the residual energy, the density and the distances separating the node with its neighbors. Each node enters into a competition and makes its proper decision. Then, the network is divided into clusters and each member is affected to the nearest CH that has the job to gather the data of the members of its cluster. The efficiency of our proposed algorithm is proved comparing with some other clustering approaches. Simulation results show that the energy dissipation of the sensor nodes can be considerably reduced, and the network lifetime efficiently extended.\",\"PeriodicalId\":296466,\"journal\":{\"name\":\"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WAINA.2018.00077\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 32nd International Conference on Advanced Information Networking and Applications Workshops (WAINA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WAINA.2018.00077","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

在无线传感器网络的设计中,能量消耗是当前研究的重点之一。由于传感器节点的能量有限,为了延长网络的生命周期,提出了一种新的WSN聚类算法,即选择传感器节点的一个子集作为簇头。这种选择基于三个参数;剩余能量,密度和节点与其相邻节点之间的距离。每个节点都参与竞争,并做出适当的决定。然后,将网络划分为集群,每个成员都被影响到最近的CH,该CH负责收集其集群成员的数据。通过与其他聚类方法的比较,证明了本文算法的有效性。仿真结果表明,该方法可以显著降低传感器节点的能量消耗,有效延长网络寿命。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Residual Energy and Density Control Aware Cluster Head Election in Wireless Sensor Network
In designing the Wireless Sensor Network, the energy consumption represents one of the most and important factor that recent researches aim to reduce efficiently. Because of the limited energy that sensor nodes are equipped with, and in order to prolong the network lifetime, we introduce a new clustering algorithm for WSN, which consists on choosing a subset of sensor nodes to be elected as Cluster Heads. This choice is based on three parameters; the residual energy, the density and the distances separating the node with its neighbors. Each node enters into a competition and makes its proper decision. Then, the network is divided into clusters and each member is affected to the nearest CH that has the job to gather the data of the members of its cluster. The efficiency of our proposed algorithm is proved comparing with some other clustering approaches. Simulation results show that the energy dissipation of the sensor nodes can be considerably reduced, and the network lifetime efficiently extended.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Multi-agent Based Simulations of Block-Free Distributed Ledgers Mobility Management Architecture in Different RATs Based Network Slicing Apply Scikit-Learn in Python to Analyze Driver Behavior Based on OBD Data Proposal of Static Body Object Detection Methods with the DTN Routing for Life Safety Information Systems Resource Allocation Scheme in 5G Network Slices
×
引用
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