异步占空比无线传感器网络的动态机会路由协议

IF 3 3区 计算机科学 Q2 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE
Xingfu Wang;Wenkang Zhou;Ammar Hawbani;Ping Liu;Liang Zhao;Saeed Hamood Alsamhi
{"title":"异步占空比无线传感器网络的动态机会路由协议","authors":"Xingfu Wang;Wenkang Zhou;Ammar Hawbani;Ping Liu;Liang Zhao;Saeed Hamood Alsamhi","doi":"10.1109/TSUSC.2023.3237220","DOIUrl":null,"url":null,"abstract":"Opportunistic routing (OR) is widely adopted in Wireless Sensor Networks (WSNs) running asynchronous duty-cycled MAC protocols. In conventional routing, where packets are forwarded along predetermined routes, the sender may wait for the receiver to wake up for a long time. To reduce the sender waiting time, the OR protocols allow nodes to select multiple neighbors as the forwarders so that the packets could be forwarded by multi-path. Thus, the forwarders selection algorithm affects network performance seriously. However, an excessive number of forwarders increases the probability that more than one forwarders wake up simultaneously. This will consume more energy since each of them will receive the packet. To address the two issues, a Dynamic Opportunistic Routing protocol using Analytical Hierarchy Process (AHP) and Fuzzy Inference System (FIS) called DORAF is proposed in this paper. DORAF is implemented in three steps. First, multiple criteria (i.e., residual energy, distance, and angle) at the network layer are defined to evaluate the nodes where the importance of these criteria is determined by AHP. Second, the pairwise comparison matrices in AHP are generated by using mathematical functions (i.e., Boltzmann function and Logistic function) and FIS. Third, each node uses AHP and FIS to prioritize its neighbors based on the criteria and selects appropriate ones as the forwarders dynamically in a distributed manner. The experimental results demonstrate that our protocol performs better than other state-of-the-art in terms of network lifetime, energy consumption, and average redundant transmissions.","PeriodicalId":13268,"journal":{"name":"IEEE Transactions on Sustainable Computing","volume":"8 3","pages":"314-327"},"PeriodicalIF":3.0000,"publicationDate":"2023-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A Dynamic Opportunistic Routing Protocol for Asynchronous Duty-Cycled WSNs\",\"authors\":\"Xingfu Wang;Wenkang Zhou;Ammar Hawbani;Ping Liu;Liang Zhao;Saeed Hamood Alsamhi\",\"doi\":\"10.1109/TSUSC.2023.3237220\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Opportunistic routing (OR) is widely adopted in Wireless Sensor Networks (WSNs) running asynchronous duty-cycled MAC protocols. In conventional routing, where packets are forwarded along predetermined routes, the sender may wait for the receiver to wake up for a long time. To reduce the sender waiting time, the OR protocols allow nodes to select multiple neighbors as the forwarders so that the packets could be forwarded by multi-path. Thus, the forwarders selection algorithm affects network performance seriously. However, an excessive number of forwarders increases the probability that more than one forwarders wake up simultaneously. This will consume more energy since each of them will receive the packet. To address the two issues, a Dynamic Opportunistic Routing protocol using Analytical Hierarchy Process (AHP) and Fuzzy Inference System (FIS) called DORAF is proposed in this paper. DORAF is implemented in three steps. First, multiple criteria (i.e., residual energy, distance, and angle) at the network layer are defined to evaluate the nodes where the importance of these criteria is determined by AHP. Second, the pairwise comparison matrices in AHP are generated by using mathematical functions (i.e., Boltzmann function and Logistic function) and FIS. Third, each node uses AHP and FIS to prioritize its neighbors based on the criteria and selects appropriate ones as the forwarders dynamically in a distributed manner. The experimental results demonstrate that our protocol performs better than other state-of-the-art in terms of network lifetime, energy consumption, and average redundant transmissions.\",\"PeriodicalId\":13268,\"journal\":{\"name\":\"IEEE Transactions on Sustainable Computing\",\"volume\":\"8 3\",\"pages\":\"314-327\"},\"PeriodicalIF\":3.0000,\"publicationDate\":\"2023-01-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Sustainable Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10018238/\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Sustainable Computing","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10018238/","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 2

摘要

在运行异步占空比MAC协议的无线传感器网络中,机会路由(OR)被广泛采用。在传统的路由中,其中分组沿着预定的路由被转发,发送器可能等待接收器唤醒很长时间。为了减少发送方的等待时间,OR协议允许节点选择多个邻居作为转发器,从而可以通过多路径转发数据包。因此,转发器选择算法严重影响网络性能。然而,转发器数量过多会增加多个转发器同时唤醒的概率。这将消耗更多的能量,因为它们中的每一个都将接收分组。针对这两个问题,本文提出了一种基于层次分析法(AHP)和模糊推理系统(FIS)的动态机会路由协议DORAF。DORAF分三步实施。首先,在网络层定义了多个标准(即剩余能量、距离和角度)来评估节点,其中这些标准的重要性由AHP确定。其次,利用数学函数(即Boltzmann函数和Logistic函数)和FIS生成AHP中的成对比较矩阵。第三,每个节点使用AHP和FIS根据标准对其邻居进行优先级排序,并以分布式方式动态选择合适的邻居作为转发方。实验结果表明,在网络寿命、能耗和平均冗余传输方面,我们的协议比其他最先进的协议表现更好。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Dynamic Opportunistic Routing Protocol for Asynchronous Duty-Cycled WSNs
Opportunistic routing (OR) is widely adopted in Wireless Sensor Networks (WSNs) running asynchronous duty-cycled MAC protocols. In conventional routing, where packets are forwarded along predetermined routes, the sender may wait for the receiver to wake up for a long time. To reduce the sender waiting time, the OR protocols allow nodes to select multiple neighbors as the forwarders so that the packets could be forwarded by multi-path. Thus, the forwarders selection algorithm affects network performance seriously. However, an excessive number of forwarders increases the probability that more than one forwarders wake up simultaneously. This will consume more energy since each of them will receive the packet. To address the two issues, a Dynamic Opportunistic Routing protocol using Analytical Hierarchy Process (AHP) and Fuzzy Inference System (FIS) called DORAF is proposed in this paper. DORAF is implemented in three steps. First, multiple criteria (i.e., residual energy, distance, and angle) at the network layer are defined to evaluate the nodes where the importance of these criteria is determined by AHP. Second, the pairwise comparison matrices in AHP are generated by using mathematical functions (i.e., Boltzmann function and Logistic function) and FIS. Third, each node uses AHP and FIS to prioritize its neighbors based on the criteria and selects appropriate ones as the forwarders dynamically in a distributed manner. The experimental results demonstrate that our protocol performs better than other state-of-the-art in terms of network lifetime, energy consumption, and average redundant transmissions.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Sustainable Computing
IEEE Transactions on Sustainable Computing Mathematics-Control and Optimization
CiteScore
7.70
自引率
2.60%
发文量
54
×
引用
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学术官方微信