计算机科学
架空(工程)
路由协议
计算机网络
多协议标签交换
最短路径问题
布线(电子设计自动化)
点对点
路径(计算)
网络拓扑
拓扑(电路)
有损压缩
分布式计算
服务质量
数学
图形
理论计算机科学
操作系统
组合数学
人工智能
作者
Ahmad Shabani Baghani,Majid Khabbazian
出处
期刊:IEEE Internet of Things Journal
[Institute of Electrical and Electronics Engineers]
日期:2022-01-01
卷期号:10 (1): 166-179
标识
DOI:10.1109/jiot.2022.3201177
摘要
Routing protocol for low-power and lossy networks (RPL) is a standard routing protocol for the Internet of Things (IoT). In RPL, point-to-point (P2P) communication is gaining importance as many emerging IoT applications require efficient P2P communications. In this work, we study the quality of the RPL’s P2P paths. In particular, we analyze how much RPL’s P2P paths “stretch” compared to the shortest paths. We prove that the average stretch is a factor of at least two in any RPL network. That is, the RPL’s P2P path between two randomly selected nodes in any network is expected to be at least twice as long as the shortest path between the two nodes. Furthermore, we show that RPL’s stretch factor can be considerably higher than two in some network topology, including linear networks and grid networks. To improve the quality of RPL’s P2P paths, we propose a solution which is simple to implement and fully compatible with RPL. Moreover, our solution does not require nodes to store any routing table; this is important as nodes in LLNs are typically highly resource constrained. We evaluate our proposed solution using the Contiki-NG operating system and show that our proposed solution can significantly improve the quality of RPL’s P2P paths and their end-to-end-delays with a modest overhead. In addition, we evaluate our solution in dynamic networks and show that, when the network’s mobility is moderate, our solution generates nearly the same amount of overhead as RPL yet it achieves lower end-to-end delay and power consumption than RPL.
科研通智能强力驱动
Strongly Powered by AbleSci AI