SMGSAF:一种针对机会网络的安全多地理广播方案

IF 0.5 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
Jagdeep Singh, Sanjay Kumar Dhurandher
{"title":"SMGSAF:一种针对机会网络的安全多地理广播方案","authors":"Jagdeep Singh, Sanjay Kumar Dhurandher","doi":"10.1504/ijguc.2023.133452","DOIUrl":null,"url":null,"abstract":"This paper proposes a novel Secure Multi-Geocasting Scheme for IoT-based Opportunistic Networks called 'SMGSAF', which uses secret sharing and disjoint path routing to secure the privacy of messages. Encryption is a proven way to ensure this but classical encryption techniques are not well suited for the opportunistic paradigm. Therefore we have used secret sharing and disjoint path routing to protect the privacy of messages. The mathematical analysis of the proposed SMGSAF protocol provides the intended security but at the expense of performance, which is within acceptable limits. Simulations are conducted using the ONE Simulator, showing that when time-to-live is varied, (1) the proposed SMGSAF scheme outperforms MGSAF by 14.05%, 9.4%, 5.81% respectively in terms of delivery probability, overhead ratio, and average latency; (2) it also outperforms GSAF by 16.17%, 9.2%, 6.85%, respectively in terms of delivery probability, overhead ratio, and average latency.","PeriodicalId":44878,"journal":{"name":"International Journal of Grid and Utility Computing","volume":"38 1","pages":"0"},"PeriodicalIF":0.5000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SMGSAF: a secure multi-geocasting scheme for opportunistic networks\",\"authors\":\"Jagdeep Singh, Sanjay Kumar Dhurandher\",\"doi\":\"10.1504/ijguc.2023.133452\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper proposes a novel Secure Multi-Geocasting Scheme for IoT-based Opportunistic Networks called 'SMGSAF', which uses secret sharing and disjoint path routing to secure the privacy of messages. Encryption is a proven way to ensure this but classical encryption techniques are not well suited for the opportunistic paradigm. Therefore we have used secret sharing and disjoint path routing to protect the privacy of messages. The mathematical analysis of the proposed SMGSAF protocol provides the intended security but at the expense of performance, which is within acceptable limits. Simulations are conducted using the ONE Simulator, showing that when time-to-live is varied, (1) the proposed SMGSAF scheme outperforms MGSAF by 14.05%, 9.4%, 5.81% respectively in terms of delivery probability, overhead ratio, and average latency; (2) it also outperforms GSAF by 16.17%, 9.2%, 6.85%, respectively in terms of delivery probability, overhead ratio, and average latency.\",\"PeriodicalId\":44878,\"journal\":{\"name\":\"International Journal of Grid and Utility Computing\",\"volume\":\"38 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.5000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Journal of Grid and Utility Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1504/ijguc.2023.133452\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Grid and Utility Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/ijguc.2023.133452","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

本文提出了一种新的基于物联网机会网络的安全多地理广播方案,称为“SMGSAF”,该方案使用秘密共享和不连接路径路由来保护消息的隐私。加密是一种经过验证的方法来确保这一点,但传统的加密技术并不适合机会主义范式。因此,我们采用秘密共享和不相交路径路由来保护消息的隐私。提出的SMGSAF协议的数学分析提供了预期的安全性,但以牺牲性能为代价,这是在可接受的范围内。在ONE模拟器上进行了仿真,结果表明:(1)SMGSAF方案在传递概率、开销比和平均延迟方面分别比MGSAF方案高出14.05%、9.4%和5.81%;(2)在传递概率、开销比和平均延迟方面,其性能分别优于GSAF 16.17%、9.2%和6.85%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
SMGSAF: a secure multi-geocasting scheme for opportunistic networks
This paper proposes a novel Secure Multi-Geocasting Scheme for IoT-based Opportunistic Networks called 'SMGSAF', which uses secret sharing and disjoint path routing to secure the privacy of messages. Encryption is a proven way to ensure this but classical encryption techniques are not well suited for the opportunistic paradigm. Therefore we have used secret sharing and disjoint path routing to protect the privacy of messages. The mathematical analysis of the proposed SMGSAF protocol provides the intended security but at the expense of performance, which is within acceptable limits. Simulations are conducted using the ONE Simulator, showing that when time-to-live is varied, (1) the proposed SMGSAF scheme outperforms MGSAF by 14.05%, 9.4%, 5.81% respectively in terms of delivery probability, overhead ratio, and average latency; (2) it also outperforms GSAF by 16.17%, 9.2%, 6.85%, respectively in terms of delivery probability, overhead ratio, and average latency.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
International Journal of Grid and Utility Computing
International Journal of Grid and Utility Computing COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
1.30
自引率
0.00%
发文量
79
×
引用
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学术官方微信