arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2107.09558cs.NIcs.DBcs.DCcs.IRcs.NE
收藏

IoT数据发现路由技术综述

Into Summarization Techniques for IoT Data Discovery Routing

Hieu Tran, Son Nguyen, I-Ling Yen, Farokh Bastani

摘要:

在本文中,我们考虑了非常大且规模不断增长的网络中的物联网数据发现问题。具体来说,我们深入研究了路由表汇总技术,以支持有效和节省空间的物联网数据发现路由。提出了基于字母、基于哈希和基于意义的摘要算法及其相应的编码方案。潜在的误导路由由于总结的问题也进行了调查。随后,我们分析了何时进行总结的策略,以平衡路由表压缩率和引起误导路由的机会之间的权衡。为了进行实验研究,我们从各种物联网数据库中收集了10万个物联网数据流作为输入数据集。实验结果表明,我们的总结解决方案可以减少路由表的大小由20至30倍,增加2-5%的延迟时,与同类的对等发现路由算法相比,没有总结。此外,我们的方法在延迟和流量方面优于基于DHT的方法2到6倍。

英文摘要:

In this paper, we consider the IoT data discovery problem in very large and growing scale networks. Specifically, we investigate in depth the routing table summarization techniques to support effective and space-efficient IoT data discovery routing. Novel summarization algorithms, including alphabetical based, hash based, and meaning based summarization and their corresponding coding schemes are proposed. The issue of potentially misleading routing due to summarization is also investigated. Subsequently, we analyze the strategy of when to summarize in order to balance the tradeoff between the routing table compression rate and the chance of causing misleading routing. For experimental study, we have collected 100K IoT data streams from various IoT databases as the input dataset. Experimental results show that our summarization solution can reduce the routing table size by 20 to 30 folds with 2-5% increase in latency when compared with similar peer-to-peer discovery routing algorithms without summarization. Also, our approach outperforms DHT based approaches by 2 to 6 folds in terms of latency and traffic.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑