SkABNet: A Data Structure for Efficient Discovery of Streaming Data for IoT

Philipp Kisters, Heiko Bornholdt, Janick Edinger
{"title":"SkABNet: A Data Structure for Efficient Discovery of Streaming Data for IoT","authors":"Philipp Kisters, Heiko Bornholdt, Janick Edinger","doi":"10.1109/ICCCN58024.2023.10230169","DOIUrl":null,"url":null,"abstract":"Applications in the Internet of Things often make use of large networks of independent sensor nodes that generate streams of volatile data. A major challenge in these decentralized networks is to efficiently discover relevant data providers, which might be characterized by properties such as their data type, location, or ownership. Most existing approaches use distributed data structures, such as distributed hash tables, for the organization of sensor nodes. However, these systems lack the ability to consider contextual properties when identifying relevant data sources. SkipNet a prominent architecture for data storage and retrieval, provides a scalable overlay network composed of doubly-linked rings. While the data structure allows to locate individual nodes in logarithmic complexity, it fails to identify groups of nodes that share similar characteristics. Thus, in this paper, we propose SkABNet, an attribute-based extension for SkipNet which enhances the semantics of the node identifiers in the network. We introduce additional operators that allow SkABNet to accept complex search queries including multi-attribute selections, ranges, and wildcards to find relevant data providers in its decentralized data structure. Further, we define a search algorithm that performs searches with significantly less messages than comparable searches in SkipNet.","PeriodicalId":132030,"journal":{"name":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2023 32nd International Conference on Computer Communications and Networks (ICCCN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCCN58024.2023.10230169","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Applications in the Internet of Things often make use of large networks of independent sensor nodes that generate streams of volatile data. A major challenge in these decentralized networks is to efficiently discover relevant data providers, which might be characterized by properties such as their data type, location, or ownership. Most existing approaches use distributed data structures, such as distributed hash tables, for the organization of sensor nodes. However, these systems lack the ability to consider contextual properties when identifying relevant data sources. SkipNet a prominent architecture for data storage and retrieval, provides a scalable overlay network composed of doubly-linked rings. While the data structure allows to locate individual nodes in logarithmic complexity, it fails to identify groups of nodes that share similar characteristics. Thus, in this paper, we propose SkABNet, an attribute-based extension for SkipNet which enhances the semantics of the node identifiers in the network. We introduce additional operators that allow SkABNet to accept complex search queries including multi-attribute selections, ranges, and wildcards to find relevant data providers in its decentralized data structure. Further, we define a search algorithm that performs searches with significantly less messages than comparable searches in SkipNet.
SkABNet:高效发现物联网流数据的数据结构
物联网中的应用通常使用由独立传感器节点组成的大型网络,这些网络会生成易失数据流。这些去中心化网络的一个主要挑战是有效地发现相关的数据提供者,这些数据提供者可能具有数据类型、位置或所有权等属性。大多数现有方法使用分布式数据结构,如分布式散列表来组织传感器节点。然而,这些系统在识别相关数据源时缺乏考虑上下文属性的能力。SkipNet是一种卓越的数据存储和检索体系结构,它提供了一个由双链环组成的可扩展覆盖网络。虽然数据结构允许以对数复杂度定位单个节点,但它无法识别具有相似特征的节点组。因此,在本文中,我们提出SkABNet,这是SkipNet的一个基于属性的扩展,它增强了网络中节点标识符的语义。我们引入了额外的操作符,这些操作符允许SkABNet接受复杂的搜索查询,包括多属性选择、范围和通配符,以便在其分散的数据结构中找到相关的数据提供者。此外,我们定义了一种搜索算法,该算法使用比SkipNet中可比搜索少得多的消息执行搜索。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信