Graph Modelling of Social Internet of Things (S-IoT) centered home automation using medium domination approach

IF 0.4 Q4 MATHEMATICS
Aaysha Khan, Jana Shafi
{"title":"Graph Modelling of Social Internet of Things (S-IoT) centered home automation using medium domination approach","authors":"Aaysha Khan, Jana Shafi","doi":"10.5269/bspm.51446","DOIUrl":null,"url":null,"abstract":"Preceding years predict IoT to be trend in technology domain as it possesses superior intelligence and methods to access data as well able to construct networks anywhere which we are witnessing today. Today IoT devices are well implemented and are a topic and product of interest for many. In midst of this S-IoT emerged which is understood as the added ingredient in IoT networks enables improvement in accessing data, its procession, real-time decisions, and many more new functions and all of this with an ideal price [1]. S-IoT led to the interesting development of enabling the Internet of things to be socially connected in a network with each other which permits them to socially interact with each other and have their respective profiles for their identification all similar to humans. This magical innovation-led internet networks to be more complicated. In this paper, we are modeling objects of S-Iot centered homes as network graphs with a medium domination number approach. The key notion here is to inspect the total number of objects connected that dominate every pair of objects in a network graph and the average value of this is defined as “the medium domination number”. We evaluated new results and relations along with further vulnerability methods and developed an algorithm of complexity O(n 2).","PeriodicalId":44941,"journal":{"name":"Boletim Sociedade Paranaense de Matematica","volume":null,"pages":null},"PeriodicalIF":0.4000,"publicationDate":"2022-12-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Boletim Sociedade Paranaense de Matematica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5269/bspm.51446","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Preceding years predict IoT to be trend in technology domain as it possesses superior intelligence and methods to access data as well able to construct networks anywhere which we are witnessing today. Today IoT devices are well implemented and are a topic and product of interest for many. In midst of this S-IoT emerged which is understood as the added ingredient in IoT networks enables improvement in accessing data, its procession, real-time decisions, and many more new functions and all of this with an ideal price [1]. S-IoT led to the interesting development of enabling the Internet of things to be socially connected in a network with each other which permits them to socially interact with each other and have their respective profiles for their identification all similar to humans. This magical innovation-led internet networks to be more complicated. In this paper, we are modeling objects of S-Iot centered homes as network graphs with a medium domination number approach. The key notion here is to inspect the total number of objects connected that dominate every pair of objects in a network graph and the average value of this is defined as “the medium domination number”. We evaluated new results and relations along with further vulnerability methods and developed an algorithm of complexity O(n 2).
基于媒介支配方法的以社交物联网(S-IoT)为中心的家庭自动化图形建模
前几年预测物联网将成为技术领域的趋势,因为它拥有卓越的智能和访问数据的方法,并且能够在我们今天看到的任何地方构建网络。如今,物联网设备得到了很好的实施,是许多人感兴趣的主题和产品。在此过程中,S-IoT出现了,它被理解为物联网网络中的附加成分,能够以理想的价格改善数据访问、处理、实时决策和更多新功能[1]。S-IoT带来了一个有趣的发展,使物联网能够在一个网络中相互进行社会连接,这使它们能够相互进行社会互动,并拥有各自的个人资料来进行识别,所有这些都与人类相似。这种神奇的创新使互联网变得更加复杂。在本文中,我们使用媒介支配数方法将以S-Iot为中心的家庭的对象建模为网络图。这里的关键概念是检查网络图中支配每对对象的连接对象的总数,其平均值被定义为“介质支配数”。我们评估了新的结果和关系,以及进一步的脆弱性方法,并开发了一个复杂度为O(n2)的算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
1.40
自引率
0.00%
发文量
140
审稿时长
25 weeks
×
引用
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学术官方微信