An energy balanced distributed clustering and routing algorithm for Wireless Sensor Networks

P. Kuila, P. K. Jana
{"title":"An energy balanced distributed clustering and routing algorithm for Wireless Sensor Networks","authors":"P. Kuila, P. K. Jana","doi":"10.1109/PDGC.2012.6449821","DOIUrl":null,"url":null,"abstract":"One of the most challenging and critical problem in Wireless Sensor Networks (WSNs) is to reduce energy consumption to prolong network life. Clustering is a popular topology control method for routing data through multi-hop communication. It can improve life time of a WSN as well as its scalability. In this paper, we present a distributed clustering and routing algorithm for WSN called CEBCRA (Cost-based Energy Balanced Clustering and Routing Algorithm). The algorithm comprises of three phases, namely cluster head selection, cluster setup and data routing. The CHs are selected in distributed manner based on residual energy and the neighbour cardinality. In the setup phase, each non-CH sensor node joins a CH within its communication range based on the cost value of the CHs. In data routing phase, CEBCRA first uses single hop communication within each cluster and then perform multi-hop communication between the clusters. For inter-cluster routing, a CH measures the cost of each path from itself towards base station while selecting other CH as a relay node for data forwarding on those paths. The experimental results show the efficiency of the proposed algorithm in terms of energy consumption and number of live sensor nodes. The results are compared with two existing techniques to show the efficacy of the algorithm.","PeriodicalId":166718,"journal":{"name":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"45","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 2nd IEEE International Conference on Parallel, Distributed and Grid Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PDGC.2012.6449821","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 45

Abstract

One of the most challenging and critical problem in Wireless Sensor Networks (WSNs) is to reduce energy consumption to prolong network life. Clustering is a popular topology control method for routing data through multi-hop communication. It can improve life time of a WSN as well as its scalability. In this paper, we present a distributed clustering and routing algorithm for WSN called CEBCRA (Cost-based Energy Balanced Clustering and Routing Algorithm). The algorithm comprises of three phases, namely cluster head selection, cluster setup and data routing. The CHs are selected in distributed manner based on residual energy and the neighbour cardinality. In the setup phase, each non-CH sensor node joins a CH within its communication range based on the cost value of the CHs. In data routing phase, CEBCRA first uses single hop communication within each cluster and then perform multi-hop communication between the clusters. For inter-cluster routing, a CH measures the cost of each path from itself towards base station while selecting other CH as a relay node for data forwarding on those paths. The experimental results show the efficiency of the proposed algorithm in terms of energy consumption and number of live sensor nodes. The results are compared with two existing techniques to show the efficacy of the algorithm.
一种能量均衡的无线传感器网络分布式聚类和路由算法
无线传感器网络(WSNs)中最具挑战性和关键的问题之一是降低能耗以延长网络寿命。聚类是一种流行的拓扑控制方法,用于通过多跳通信路由数据。它可以提高无线传感器网络的寿命和可扩展性。本文提出了一种用于WSN的分布式聚类和路由算法CEBCRA (Cost-based Energy Balanced clustering and routing algorithm)。该算法分为簇头选择、簇建立和数据路由三个阶段。基于剩余能量和邻域基数对CHs进行分布式选择。在设置阶段,每个非CH传感器节点根据CH的成本值加入其通信范围内的CH。在数据路由阶段,CEBCRA首先在每个集群内使用单跳通信,然后在集群之间执行多跳通信。对于集群间路由,一个CH测量从自身到基站的每条路径的成本,同时选择其他CH作为中继节点,在这些路径上转发数据。实验结果表明,该算法在能量消耗和活跃传感器节点数量方面是有效的。结果与现有的两种算法进行了比较,证明了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信