ZigBee网络中基于节点深度的改进AODVjr路由算法

Leqiang Bai, Yi Liu, Shiguang Qian, Shihong Zhang
{"title":"ZigBee网络中基于节点深度的改进AODVjr路由算法","authors":"Leqiang Bai, Yi Liu, Shiguang Qian, Shihong Zhang","doi":"10.1109/FSKD.2016.7603495","DOIUrl":null,"url":null,"abstract":"To reduce the routing overhead in routing discovery of Ad hoc On-demand Distance Vector junior routing (AODVjr) algorithm and decrease energy consumption of ZigBee network, the improved AODVjr routing algorithm based on node depth in ZigBee network is proposed. Utilizing ZigBee hierarchical structure and the node depth, the proposed algorithm sets the tree routing hops between source node and destination node as maximum transmission hops of the RREQ packets, to control the transmission range of RREQ packets. In order to reduce the number of RREQ packets, the node decides to broadcast or discard RREQ packets according to the tree routing hops between the source and the destination. The experiment results show that the improved algorithm can effectively reduce routing overhead and decrease energy consumption of the network.","PeriodicalId":373155,"journal":{"name":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Improved AODVjr routing algorithm based on node depth in ZigBee network\",\"authors\":\"Leqiang Bai, Yi Liu, Shiguang Qian, Shihong Zhang\",\"doi\":\"10.1109/FSKD.2016.7603495\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To reduce the routing overhead in routing discovery of Ad hoc On-demand Distance Vector junior routing (AODVjr) algorithm and decrease energy consumption of ZigBee network, the improved AODVjr routing algorithm based on node depth in ZigBee network is proposed. Utilizing ZigBee hierarchical structure and the node depth, the proposed algorithm sets the tree routing hops between source node and destination node as maximum transmission hops of the RREQ packets, to control the transmission range of RREQ packets. In order to reduce the number of RREQ packets, the node decides to broadcast or discard RREQ packets according to the tree routing hops between the source and the destination. The experiment results show that the improved algorithm can effectively reduce routing overhead and decrease energy consumption of the network.\",\"PeriodicalId\":373155,\"journal\":{\"name\":\"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)\",\"volume\":\"45 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FSKD.2016.7603495\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 12th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery (ICNC-FSKD)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FSKD.2016.7603495","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

为了减少自组织按需距离矢量初级路由(AODVjr)算法在路由发现中的路由开销,降低ZigBee网络的能耗,提出了一种改进的基于节点深度的AODVjr路由算法。该算法利用ZigBee分层结构和节点深度,将源节点和目的节点之间的树路由跳数设置为RREQ报文的最大传输跳数,控制RREQ报文的传输范围。为了减少RREQ报文的数量,节点根据源和目的之间的树路由跳数决定广播或丢弃RREQ报文。实验结果表明,改进后的算法可以有效地减少路由开销,降低网络能耗。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Improved AODVjr routing algorithm based on node depth in ZigBee network
To reduce the routing overhead in routing discovery of Ad hoc On-demand Distance Vector junior routing (AODVjr) algorithm and decrease energy consumption of ZigBee network, the improved AODVjr routing algorithm based on node depth in ZigBee network is proposed. Utilizing ZigBee hierarchical structure and the node depth, the proposed algorithm sets the tree routing hops between source node and destination node as maximum transmission hops of the RREQ packets, to control the transmission range of RREQ packets. In order to reduce the number of RREQ packets, the node decides to broadcast or discard RREQ packets according to the tree routing hops between the source and the destination. The experiment results show that the improved algorithm can effectively reduce routing overhead and decrease energy consumption of the network.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A novel electrons drifting algorithm for non-linear optimization problems Performance assessment of fault classifier of chemical plant based on support vector machine A theoretical line losses calculation method of distribution system based on boosting algorithm Building vietnamese dependency treebank based on Chinese-Vietnamese bilingual word alignment Optimizing self-adaptive gender ratio of elephant search algorithm by min-max strategy
×
引用
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