Efficient RPL Tree Construction Using Passive Link Quality Estimation

Hiroto Fujita, Yasuyuki Tanaka, K. Mori, F. Teraoka
{"title":"Efficient RPL Tree Construction Using Passive Link Quality Estimation","authors":"Hiroto Fujita, Yasuyuki Tanaka, K. Mori, F. Teraoka","doi":"10.1109/CANDARW53999.2021.00009","DOIUrl":null,"url":null,"abstract":"For LLNs (Low power and Lossy Networks), RPL (IPv6 Routing Protocol for LLNs) has been standardized by the IETF (Internet Engineering Task Force) as a routing protocol for LLNs. In RPL, each node estimates the link quality to neighboring nodes and selects the parent node by the OF (Objective Function). As a result, a tree structure rooted at the sink is constructed. Existing OFs such as MRHOF (Minimum Rank with Hysteresis OF) adopt active monitoring for link quality estimation, i.e., each node periodically broadcasts control packets, which results in large control overhead. This paper proposes BROF (Broadcast Reception based OF) which employs passive monitoring for link quality estimation, i.e., each node estimates the link quality by the actual number of control packet receptions and the expected number of control packet receptions. This paper also evaluates the basic performance of BROF by comparing with MRHOF implemented in Contiki-NG, which is an OS (Operating System) for IoT devices. As a result, the number of parent node switching in BROF is 20% lower than that in MRHOF and the control overhead in BROF is 65% lower than that in MRHOF although the network construction time in BROF is 15% larger than that in MRHOF. Furthermore, the delay time of UDP packet transmission from each node to the sink in BROF is 1% smaller than that in MRHOF.","PeriodicalId":325028,"journal":{"name":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 Ninth International Symposium on Computing and Networking Workshops (CANDARW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CANDARW53999.2021.00009","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

For LLNs (Low power and Lossy Networks), RPL (IPv6 Routing Protocol for LLNs) has been standardized by the IETF (Internet Engineering Task Force) as a routing protocol for LLNs. In RPL, each node estimates the link quality to neighboring nodes and selects the parent node by the OF (Objective Function). As a result, a tree structure rooted at the sink is constructed. Existing OFs such as MRHOF (Minimum Rank with Hysteresis OF) adopt active monitoring for link quality estimation, i.e., each node periodically broadcasts control packets, which results in large control overhead. This paper proposes BROF (Broadcast Reception based OF) which employs passive monitoring for link quality estimation, i.e., each node estimates the link quality by the actual number of control packet receptions and the expected number of control packet receptions. This paper also evaluates the basic performance of BROF by comparing with MRHOF implemented in Contiki-NG, which is an OS (Operating System) for IoT devices. As a result, the number of parent node switching in BROF is 20% lower than that in MRHOF and the control overhead in BROF is 65% lower than that in MRHOF although the network construction time in BROF is 15% larger than that in MRHOF. Furthermore, the delay time of UDP packet transmission from each node to the sink in BROF is 1% smaller than that in MRHOF.
利用被动链路质量估计高效构建RPL树
对于lln (Low power and Lossy Networks), RPL (IPv6 Routing Protocol For lln)已经被IETF (Internet Engineering Task Force)标准化为lln的路由协议。在RPL中,每个节点对相邻节点的链路质量进行估计,并根据目标函数OF (Objective Function)选择父节点。因此,在水槽处构建了树形结构。现有的OFs如MRHOF (Minimum Rank with Hysteresis OF)采用主动监控的方式进行链路质量估计,即每个节点定期广播控制报文,导致控制开销较大。本文提出了基于广播接收的BROF (Broadcast Reception based OF)算法,该算法采用被动监控来估计链路质量,即每个节点通过实际接收控制包的数量和期望接收控制包的数量来估计链路质量。本文还通过比较contki - ng(物联网设备的操作系统)中实现的MRHOF来评估BROF的基本性能。因此,尽管BROF的网络构建时间比MRHOF大15%,但BROF的父节点交换数量比MRHOF少20%,控制开销比MRHOF低65%。此外,BROF中每个节点到sink的UDP数据包传输延迟时间比MRHOF中要小1%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信