{"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}
引用次数: 0
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.