A Comparative Analysis of Flooding Methods on Random and Real Network Topologies

Asterios Papamichail, Georgios Tsoumanis, Spyros Sioutas, Konstantinos Oikonomou
{"title":"A Comparative Analysis of Flooding Methods on Random and Real Network Topologies","authors":"Asterios Papamichail, Georgios Tsoumanis, Spyros Sioutas, Konstantinos Oikonomou","doi":"10.52953/owap6007","DOIUrl":null,"url":null,"abstract":"The Internet of Things (IoT) is revolutionizing industries by connecting everyday objects, known as smart devices, via the Internet. These devices, embedded with sensors and communication technologies, gather and share data. For the guaranteed gathering of information, the devices share global knowledge with each other, by using dissemination mechanisms in order to broadcast information. This study evaluates four flooding methods for broadcasting information across network nodes, namely: (i) blind flooding; (ii) probabilistic flooding; (iii) m-probabilistic flooding; and (iv) scoped probabilistic flooding, the latter to be introduced here. The evaluation considers random networks that are based on the Burr Type XII distribution and seven real networks. The evaluated flooding methods are studied on three different metrics: (i) coverage achieved; (ii) number of messages exchanged; and (iii) a metric that is based on binomial approximation. The latter is introduced to provide deeper insights into the particulars of the under-evaluation flooding methods. The results show that, under certain conditions, m-probabilistic flooding outperforms probabilistic flooding in terms of coverage, while requiring significantly fewer messages. Additionally, the study revealed that the scoped probabilistic flooding achieves coverage comparable to that of the probabilistic flooding while reducing the number of exchanged messages.","PeriodicalId":274720,"journal":{"name":"ITU Journal on Future and Evolving Technologies","volume":"79 4","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"ITU Journal on Future and Evolving Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.52953/owap6007","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The Internet of Things (IoT) is revolutionizing industries by connecting everyday objects, known as smart devices, via the Internet. These devices, embedded with sensors and communication technologies, gather and share data. For the guaranteed gathering of information, the devices share global knowledge with each other, by using dissemination mechanisms in order to broadcast information. This study evaluates four flooding methods for broadcasting information across network nodes, namely: (i) blind flooding; (ii) probabilistic flooding; (iii) m-probabilistic flooding; and (iv) scoped probabilistic flooding, the latter to be introduced here. The evaluation considers random networks that are based on the Burr Type XII distribution and seven real networks. The evaluated flooding methods are studied on three different metrics: (i) coverage achieved; (ii) number of messages exchanged; and (iii) a metric that is based on binomial approximation. The latter is introduced to provide deeper insights into the particulars of the under-evaluation flooding methods. The results show that, under certain conditions, m-probabilistic flooding outperforms probabilistic flooding in terms of coverage, while requiring significantly fewer messages. Additionally, the study revealed that the scoped probabilistic flooding achieves coverage comparable to that of the probabilistic flooding while reducing the number of exchanged messages.
随机网络拓扑和真实网络拓扑上的泛洪方法比较分析
物联网(IoT)通过互联网将被称为智能设备的日常物品连接起来,正在彻底改变各行各业。这些设备内嵌传感器和通信技术,可收集和共享数据。为了保证信息的收集,这些设备通过使用传播机制来广播信息,从而相互分享全球知识。本研究评估了在网络节点间广播信息的四种泛洪方法,即:(i) 盲泛洪;(ii) 概率泛洪;(iii) m 概率泛洪;(iv) 范围概率泛洪,后者将在此介绍。评估考虑了基于伯尔 XII 型分布的随机网络和七个真实网络。所评估的泛洪方法通过三个不同的指标进行研究:(i) 实现的覆盖率;(ii) 交换的信息数量;(iii) 基于二项式近似的指标。引入后者是为了更深入地了解评估不足的泛洪方法的特殊性。研究结果表明,在某些条件下,m-概率泛洪在覆盖率方面优于概率泛洪,同时所需的信息量也大大减少。此外,研究还发现,有范围的概率泛洪可以达到与概率泛洪相当的覆盖率,同时减少了交换信息的数量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信