A Novel ZigBee Routing Algorithm Based on Shortcut Routing and Energy Cost Function

Xiaofeng Yao, Huipu Xu, L. Yang, Xu Xue
{"title":"A Novel ZigBee Routing Algorithm Based on Shortcut Routing and Energy Cost Function","authors":"Xiaofeng Yao, Huipu Xu, L. Yang, Xu Xue","doi":"10.1109/CCAI57533.2023.10201309","DOIUrl":null,"url":null,"abstract":"ZigBee routing protocol adopted hybrid routing approach which combined AODVjr and cluster-tree algorithm to better adapt to different network topology. However, the simple combination of two algorithms cannot play a very good role in reduce energy consumption. In this paper, a novel ZigBee routing algorithm based on shortcut routing and energy cost function was introduced after exhaustive research on ZigBee cluster-tree algorithm and routing discovery process of AODVjr algorithm, the new algorithm applied shortcut routing concept based on the cluster-tree neighbor table, find out the nodes among neighbor nodes which can reach to destination nodes with the least hops. Then energy costs of various paths were work out through applying the energy cost function, and then a high reliable path which consumed the minimum energy was selected, which can reduce energy consumption efficiently and prolong the network lifetime. Performance simulation and results analysis were implemented by using the NS-2 network simulation platform, and the simulation results indicated that the improved algorithm has better advantage on average delay and average route cost rate.","PeriodicalId":285760,"journal":{"name":"2023 IEEE 3rd International Conference on Computer Communication and Artificial Intelligence (CCAI)","volume":"256 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 IEEE 3rd International Conference on Computer Communication and Artificial Intelligence (CCAI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCAI57533.2023.10201309","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

ZigBee routing protocol adopted hybrid routing approach which combined AODVjr and cluster-tree algorithm to better adapt to different network topology. However, the simple combination of two algorithms cannot play a very good role in reduce energy consumption. In this paper, a novel ZigBee routing algorithm based on shortcut routing and energy cost function was introduced after exhaustive research on ZigBee cluster-tree algorithm and routing discovery process of AODVjr algorithm, the new algorithm applied shortcut routing concept based on the cluster-tree neighbor table, find out the nodes among neighbor nodes which can reach to destination nodes with the least hops. Then energy costs of various paths were work out through applying the energy cost function, and then a high reliable path which consumed the minimum energy was selected, which can reduce energy consumption efficiently and prolong the network lifetime. Performance simulation and results analysis were implemented by using the NS-2 network simulation platform, and the simulation results indicated that the improved algorithm has better advantage on average delay and average route cost rate.
一种基于快捷路由和能量代价函数的ZigBee路由算法
ZigBee路由协议采用AODVjr和聚类树算法相结合的混合路由方式,能够更好地适应不同的网络拓扑结构。然而,两种算法的简单结合并不能起到很好的降低能耗的作用。本文在详细研究了ZigBee簇树算法和AODVjr算法的路由发现过程的基础上,提出了一种新的基于快捷路由和能量代价函数的ZigBee路由算法,该算法应用了基于簇树邻居表的快捷路由概念,在邻居节点中找出跳数最少到达目的节点的节点。然后利用能量代价函数计算出各路径的能量代价,选择能量消耗最小的高可靠路径,从而有效地降低能量消耗,延长网络寿命。利用NS-2网络仿真平台进行了性能仿真和结果分析,仿真结果表明,改进算法在平均时延和平均路由成本率方面具有更好的优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信