首页 > 最新文献

Peer-To-Peer Networking and Applications最新文献

英文 中文
Are neck pain, disability, and deep neck flexor performance the same for the different types of temporomandibular disorders? 不同类型的颞下颌关节紊乱症的颈部疼痛、残疾和颈深屈肌表现是否相同?
IF 2 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-11-01 Epub Date: 2022-03-18 DOI: 10.1080/08869634.2022.2052582
Luiz Felipe Tavares, Inae Caroline Gadotti, Bruna Guimaraes Carvalho, Ana Paula Mendonça Fernandes, Jade Padilha Silva, Gustavo Augusto Seabra Barbosa, Erika Oliveira Almeida, Karyna Figueiredo Ribeiro

Objective: To evaluate neck pain, disability, and deep neck flexor (DNF) performance of individuals with temporomandibular disorders (TMD).

Methods: Eighty individuals were divided into the following: arthrogenic TMD (n = 40), myogenic TMD (n = 12), and mixed TMD (n = 28). Neck pain intensity, neck disability, and DNF performance were evaluated.

Results: Individuals with arthrogenic TMD reported lower intensity of neck pain when compared to mixed TMD (p = 0.01). Individuals with arthrogenic TMD had less neck disability than individuals with myogenic TMD (p = 0.037) and mixed TMD (p < 0.001). A moderate positive correlation was found between neck pain and neck disability (p < 0.001). No differences were found for DNF performance.

Conclusion: Neck pain and disability differs according to subtype of TMD, but performance of the deep neck flexors does not. Neck pain intensity and neck disability were correlated in patients with TMD.

目的评估颞下颌关节紊乱症(TMD)患者的颈部疼痛、残疾和颈深屈肌(DNF)功能:将 80 名患者分为:关节源性 TMD(40 人)、肌源性 TMD(12 人)和混合型 TMD(28 人)。对颈部疼痛强度、颈部残疾和 DNF 表现进行评估:结果:与混合型 TMD 相比,关节源性 TMD 患者的颈部疼痛强度较低(p = 0.01)。关节源性 TMD 患者的颈部残疾程度低于肌源性 TMD 患者(p = 0.037)和混合型 TMD 患者(p p 结论:不同类型的关节源性 TMD 患者颈部疼痛和残疾程度不同:颈部疼痛和颈部残疾因 TMD 亚型而异,但颈部深屈肌的表现却不尽相同。TMD 患者的颈部疼痛强度与颈部残疾程度相关。
{"title":"Are neck pain, disability, and deep neck flexor performance the same for the different types of temporomandibular disorders?","authors":"Luiz Felipe Tavares, Inae Caroline Gadotti, Bruna Guimaraes Carvalho, Ana Paula Mendonça Fernandes, Jade Padilha Silva, Gustavo Augusto Seabra Barbosa, Erika Oliveira Almeida, Karyna Figueiredo Ribeiro","doi":"10.1080/08869634.2022.2052582","DOIUrl":"10.1080/08869634.2022.2052582","url":null,"abstract":"<p><strong>Objective: </strong>To evaluate neck pain, disability, and deep neck flexor (DNF) performance of individuals with temporomandibular disorders (TMD).</p><p><strong>Methods: </strong>Eighty individuals were divided into the following: arthrogenic TMD (n = 40), myogenic TMD (n = 12), and mixed TMD (n = 28). Neck pain intensity, neck disability, and DNF performance were evaluated.</p><p><strong>Results: </strong>Individuals with arthrogenic TMD reported lower intensity of neck pain when compared to mixed TMD (<i>p</i> = 0.01). Individuals with arthrogenic TMD had less neck disability than individuals with myogenic TMD (<i>p</i> = 0.037) and mixed TMD (<i>p</i> < 0.001). A moderate positive correlation was found between neck pain and neck disability (<i>p</i> < 0.001). No differences were found for DNF performance.</p><p><strong>Conclusion: </strong>Neck pain and disability differs according to subtype of TMD, but performance of the deep neck flexors does not. Neck pain intensity and neck disability were correlated in patients with TMD.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"14 1","pages":"770-778"},"PeriodicalIF":2.0,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74446662","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhancing cloud network security with a trust-based service mechanism using k-anonymity and statistical machine learning approach 利用 K-anonymity 和统计机器学习方法,通过基于信任的服务机制增强云网络安全
IF 4.2 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-16 DOI: 10.1007/s12083-024-01759-y
Himani Saini, Gopal Singh, Sandeep Dalal, Umesh Kumar Lilhore, Sarita Simaiya, Surjeet Dalal

This Research work addresses the pressing need within cloud computing for a trust-based service mechanism that effectively manages the burgeoning volume and variety of data while mitigating privacy concerns. The primary aim is to address pressing security challenges within cloud networks through a novel approach tailored to enhance privacy preservation mechanisms. Experiments were done on a variety of datasets using a hybrid privacy-preserving strategy to assess the efficacy of the suggested solution. The datasets were divided into both testing and training sets for the experimental design, using a 70% validation ratio for training. The method's performance was compared with that of existing strategies, including caching and spatial K-anonymity (CSKA) and privacy-preserving incentive and rewarding (PPIR), using precision, recall, and F-measure analysis. The findings show that the suggested strategy performs better than the baseline approaches in a number of assessment measures, indicating its greater capacity to protect privacy in cloud environments. Specifically, the approach achieved an average precision of 0.85, significantly surpassing the precision values of existing techniques by 8-10%. Moreover, the method exhibited an average recall of 0.84, indicating its robustness in recalling values across all test samples. Across various experiments, our method consistently achieved impressive F1 scores ranging from 0.80 to 0.85, underscoring its robustness in maintaining a balance between precision and recall. Furthermore, with an accuracy hovering around 0.85, our approach demonstrated remarkable proficiency in accurately classifying instances while preserving privacy in cloud environments. These promising results underscore the efficacy of the proposed approach in enhancing privacy preservation mechanisms within cloud networks, paving the way for more secure and reliable cloud computing infrastructures. By leveraging a hybrid privacy-preserving method, the paper offers a holistic approach to address the complex problems faced by cloud networks in safeguarding sensitive information. The experimental evaluation demonstrates the efficacy of the proposed approach, highlighting its superior performance compared to existing techniques.

这项研究工作旨在解决云计算领域对基于信任的服务机制的迫切需求,这种机制既能有效管理不断增长的数据量和数据种类,又能减轻对隐私的担忧。其主要目的是通过一种为加强隐私保护机制而量身定制的新方法来应对云网络中紧迫的安全挑战。我们使用混合隐私保护策略在各种数据集上进行了实验,以评估所建议解决方案的功效。在实验设计中,数据集被分为测试集和训练集,训练集的验证率为 70%。利用精确度、召回率和 F-measure 分析,将该方法的性能与现有策略(包括缓存和空间 K-anonymity (CSKA) 以及隐私保护激励和奖励 (PPIR))的性能进行了比较。研究结果表明,建议的策略在多项评估指标上都优于基线方法,这表明它在云环境中保护隐私的能力更强。具体来说,该方法的平均精确度达到了 0.85,比现有技术的精确度值高出 8-10%。此外,该方法的平均召回率为 0.84,表明其在所有测试样本中都能稳健地召回数值。在各种实验中,我们的方法始终能获得令人印象深刻的 F1 分数,范围在 0.80 到 0.85 之间,这突出表明了该方法在保持精确度和召回率之间平衡方面的稳健性。此外,我们的方法准确率徘徊在 0.85 左右,在准确分类实例的同时还能保护云环境中的隐私,表现出了非凡的能力。这些令人鼓舞的结果凸显了所提出的方法在增强云网络中隐私保护机制方面的功效,为建立更加安全可靠的云计算基础设施铺平了道路。通过利用混合隐私保护方法,本文提供了一种整体方法来解决云网络在保护敏感信息方面所面临的复杂问题。实验评估证明了所提方法的有效性,与现有技术相比,它的性能更加优越。
{"title":"Enhancing cloud network security with a trust-based service mechanism using k-anonymity and statistical machine learning approach","authors":"Himani Saini, Gopal Singh, Sandeep Dalal, Umesh Kumar Lilhore, Sarita Simaiya, Surjeet Dalal","doi":"10.1007/s12083-024-01759-y","DOIUrl":"https://doi.org/10.1007/s12083-024-01759-y","url":null,"abstract":"<p>This Research work addresses the pressing need within cloud computing for a trust-based service mechanism that effectively manages the burgeoning volume and variety of data while mitigating privacy concerns. The primary aim is to address pressing security challenges within cloud networks through a novel approach tailored to enhance privacy preservation mechanisms. Experiments were done on a variety of datasets using a hybrid privacy-preserving strategy to assess the efficacy of the suggested solution. The datasets were divided into both testing and training sets for the experimental design, using a 70% validation ratio for training. The method's performance was compared with that of existing strategies, including caching and spatial K-anonymity (CSKA) and privacy-preserving incentive and rewarding (PPIR), using precision, recall, and F-measure analysis. The findings show that the suggested strategy performs better than the baseline approaches in a number of assessment measures, indicating its greater capacity to protect privacy in cloud environments. Specifically, the approach achieved an average precision of 0.85, significantly surpassing the precision values of existing techniques by 8-10%. Moreover, the method exhibited an average recall of 0.84, indicating its robustness in recalling values across all test samples. Across various experiments, our method consistently achieved impressive F1 scores ranging from 0.80 to 0.85, underscoring its robustness in maintaining a balance between precision and recall. Furthermore, with an accuracy hovering around 0.85, our approach demonstrated remarkable proficiency in accurately classifying instances while preserving privacy in cloud environments. These promising results underscore the efficacy of the proposed approach in enhancing privacy preservation mechanisms within cloud networks, paving the way for more secure and reliable cloud computing infrastructures. By leveraging a hybrid privacy-preserving method, the paper offers a holistic approach to address the complex problems faced by cloud networks in safeguarding sensitive information. The experimental evaluation demonstrates the efficacy of the proposed approach, highlighting its superior performance compared to existing techniques.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"2 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142255171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Homomorphic multi-party computation for Internet of Medical Things 医疗物联网的同态多方计算
IF 4.2 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-12 DOI: 10.1007/s12083-024-01805-9
Amin Hosseingholizadeh, Farhad Rahmati, Mohammad Ali, Ximeng Liu

Internet of Medical Things (IoMT) has great potential in delivering medical services. In IoMT, data users (e.g., doctors) may want to process data collected by sensors attached to data owners’ body (e.g., patients). As sensors lack computing resources, confidential outsourcing the data to a server becomes necessary due to its sensitivity. Using homomorphic encryption raises limitations in secure processing. First, as decrypting the processed result requires the data owners’ secret key, they must be online or share it with data users. Second, when processing is performed on the data of multiple data owners, the interaction becomes harder. Finally, if the processed result is sensitive, it lacks confidentiality as data owners may access it. In this paper, we propose a non-interactive homomorphic multi-party computation (HMPC) protocol, addressing the limitations efficiently. In HMPC, data owners encrypt their data with their own key and store it in a cloud server. Then, data users select the required data from the cloud server and outsource their own encrypted data to the server for processing. Afterwards, they decrypt the result regardless of the circuit computed and without interaction with the data owners. Our security and performance analyses demonstrate that HMPC is provably secure and applicable.

医疗物联网(IoMT)在提供医疗服务方面具有巨大潜力。在 IoMT 中,数据用户(如医生)可能希望处理附在数据所有者(如病人)身上的传感器收集的数据。由于传感器缺乏计算资源,因此有必要将数据机密外包给服务器。使用同态加密会带来安全处理方面的限制。首先,解密处理结果需要数据所有者的秘钥,因此他们必须在线或与数据用户共享秘钥。其次,当处理多个数据所有者的数据时,交互变得更加困难。最后,如果处理的结果是敏感的,那么它就缺乏保密性,因为数据所有者可能会访问它。本文提出了一种非交互式同态多方计算(HMPC)协议,有效地解决了上述限制。在 HMPC 中,数据所有者用自己的密钥加密数据并将其存储在云服务器中。然后,数据用户从云服务器中选择所需的数据,并将自己的加密数据外包给服务器进行处理。之后,他们可以解密结果,而无需考虑计算的电路,也无需与数据所有者互动。我们的安全性和性能分析表明,HMPC 具有可证明的安全性和适用性。
{"title":"Homomorphic multi-party computation for Internet of Medical Things","authors":"Amin Hosseingholizadeh, Farhad Rahmati, Mohammad Ali, Ximeng Liu","doi":"10.1007/s12083-024-01805-9","DOIUrl":"https://doi.org/10.1007/s12083-024-01805-9","url":null,"abstract":"<p>Internet of Medical Things (IoMT) has great potential in delivering medical services. In IoMT, data users (e.g., doctors) may want to process data collected by sensors attached to data owners’ body (e.g., patients). As sensors lack computing resources, confidential outsourcing the data to a server becomes necessary due to its sensitivity. Using homomorphic encryption raises limitations in secure processing. First, as decrypting the processed result requires the data owners’ secret key, they must be online or share it with data users. Second, when processing is performed on the data of multiple data owners, the interaction becomes harder. Finally, if the processed result is sensitive, it lacks confidentiality as data owners may access it. In this paper, we propose a non-interactive homomorphic multi-party computation (HMPC) protocol, addressing the limitations efficiently. In HMPC, data owners encrypt their data with their own key and store it in a cloud server. Then, data users select the required data from the cloud server and outsource their own encrypted data to the server for processing. Afterwards, they decrypt the result regardless of the circuit computed and without interaction with the data owners. Our security and performance analyses demonstrate that HMPC is provably secure and applicable.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"404 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142205017","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Towards real-time non-preemptive multicast scheduling in reconfigurable data center networks 在可重构数据中心网络中实现实时非抢占式组播调度
IF 4.2 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-12 DOI: 10.1007/s12083-024-01804-w
Fanlong Zhang, Jianglong Liu, Yuhang Wu, Quan Chen, Yuan Chai, Zhuowei Wang

Multicast has emerged as a primary communication pattern in datacenter networks due to the increasing demand for distributed data-parallel applications. To accelerate multicast traffic, the emerging reconfigurable circuit technology, which can establish circuit connections among switches, has been proposed as a promising paradigm for datacenter networks. This paper investigates how to accelerate the non-preemptive multicast flows in a demand-aware manner in reconfigurable datacenter networks. Firstly, the problem of scheduling circuit switches to minimize the average completion time is formulated and proved to be NP-hard. To address the conflicts between different multicast flows under the bandwidth constraint, a connection based hypergraph is constructed and then a two round matching algorithm is proposed under the bandwidth constraint. Additionally, to further reduce the average completion time, we introduce a method to utilize the remaining capacity of the ToR switches by splitting the unscheduled flows. The proposed algorithm is proved to have an approximation ratio of (2sqrt{2n}), where n represents the number of Top-of-Rack (ToR) switches. Finally, the extensive simulations demonstrate the effectiveness of the proposed algorithm in reducing the average completion time of flows compared to state-of-the-art algorithms.

由于对分布式数据并行应用的需求日益增长,组播已成为数据中心网络的主要通信模式。为了加速组播流量,新兴的可重构电路技术(可在交换机之间建立电路连接)被认为是数据中心网络的一种有前途的模式。本文研究了如何在可重构数据中心网络中以需求感知的方式加速非抢占式组播流量。首先,本文提出了调度电路交换机以最小化平均完成时间的问题,并证明该问题具有 NP 难度。为解决带宽约束下不同组播流间的冲突,构建了基于连接的超图,然后提出了带宽约束下的两轮匹配算法。此外,为了进一步缩短平均完成时间,我们引入了一种方法,通过拆分未计划的流量来利用 ToR 交换机的剩余容量。事实证明,所提算法的近似率为(2sqrt{2n}),其中 n 代表机架顶端(ToR)交换机的数量。最后,大量的仿真证明,与最先进的算法相比,所提出的算法能有效缩短流量的平均完成时间。
{"title":"Towards real-time non-preemptive multicast scheduling in reconfigurable data center networks","authors":"Fanlong Zhang, Jianglong Liu, Yuhang Wu, Quan Chen, Yuan Chai, Zhuowei Wang","doi":"10.1007/s12083-024-01804-w","DOIUrl":"https://doi.org/10.1007/s12083-024-01804-w","url":null,"abstract":"<p>Multicast has emerged as a primary communication pattern in datacenter networks due to the increasing demand for distributed data-parallel applications. To accelerate multicast traffic, the emerging reconfigurable circuit technology, which can establish circuit connections among switches, has been proposed as a promising paradigm for datacenter networks. This paper investigates how to accelerate the non-preemptive multicast flows in a demand-aware manner in reconfigurable datacenter networks. Firstly, the problem of scheduling circuit switches to minimize the average completion time is formulated and proved to be NP-hard. To address the conflicts between different multicast flows under the bandwidth constraint, a connection based hypergraph is constructed and then a two round matching algorithm is proposed under the bandwidth constraint. Additionally, to further reduce the average completion time, we introduce a method to utilize the remaining capacity of the ToR switches by splitting the unscheduled flows. The proposed algorithm is proved to have an approximation ratio of <span>(2sqrt{2n})</span>, where <i>n</i> represents the number of Top-of-Rack (ToR) switches. Finally, the extensive simulations demonstrate the effectiveness of the proposed algorithm in reducing the average completion time of flows compared to state-of-the-art algorithms.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"5 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142205016","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
BPPKS: A blockchain-based privacy preserving and keyword-searchable scheme for medical data sharing BPPKS:基于区块链的医疗数据共享隐私保护和关键字可搜索方案
IF 4.2 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-11 DOI: 10.1007/s12083-024-01795-8
Xiaohui Yang, Liangshun Li

With the rapid development of medical information technology, the widespread adoption and application of electronic medical data have prompted more and more healthcare institutions to choose to store medical data in cloud servers to facilitate easier sharing. Attribute-based encryption is utilized for sharing electronic medical data to achieve fine-grained access control. However, storing access policies in plaintext can easily expose user privacy. Additionally, during the data sharing process, placing data retrieval in the cloud prevents secure and reliable searches. To address these issues, this paper proposes a blockchain-based privacy preserving and keyword-searchable scheme for medical data sharing(BPPKS). Access policies are transformed into vector-matrix form, concealing attributes within access policies to prevent the leakage of authorized user privacy information. Leveraging blockchain’s transparency, tamper-resistance, and integrity verification features, smart contracts are used for retrieval and verification, enabling secure and reliable data searches while ensuring the integrity of medical data. Simultaneously, some complex decryption operations are delegated to the cloud servers, reducing the decryption load for users to a constant level. Finally, security analysis demonstrates that this scheme can withstand adaptive chosen keyword attacks (IND-CKA), and performance evaluations show higher efficiency in computation and storage aspects.

随着医疗信息技术的快速发展,电子医疗数据的广泛采用和应用促使越来越多的医疗机构选择将医疗数据存储在云服务器中,以方便共享。基于属性的加密被用于共享电子医疗数据,以实现细粒度的访问控制。然而,以明文形式存储访问策略很容易暴露用户隐私。此外,在数据共享过程中,将数据检索放在云中无法进行安全可靠的搜索。为了解决这些问题,本文提出了一种基于区块链的医疗数据共享隐私保护和关键字可搜索方案(BPPKS)。访问策略被转化为向量矩阵形式,隐藏了访问策略中的属性,以防止授权用户隐私信息的泄露。利用区块链的透明性、防篡改性和完整性验证功能,使用智能合约进行检索和验证,实现安全可靠的数据搜索,同时确保医疗数据的完整性。同时,一些复杂的解密操作被委托给云服务器,从而将用户的解密负荷降低到恒定水平。最后,安全性分析表明,该方案可抵御自适应选择关键词攻击(IND-CKA),性能评估显示,该方案在计算和存储方面具有更高的效率。
{"title":"BPPKS: A blockchain-based privacy preserving and keyword-searchable scheme for medical data sharing","authors":"Xiaohui Yang, Liangshun Li","doi":"10.1007/s12083-024-01795-8","DOIUrl":"https://doi.org/10.1007/s12083-024-01795-8","url":null,"abstract":"<p>With the rapid development of medical information technology, the widespread adoption and application of electronic medical data have prompted more and more healthcare institutions to choose to store medical data in cloud servers to facilitate easier sharing. Attribute-based encryption is utilized for sharing electronic medical data to achieve fine-grained access control. However, storing access policies in plaintext can easily expose user privacy. Additionally, during the data sharing process, placing data retrieval in the cloud prevents secure and reliable searches. To address these issues, this paper proposes a blockchain-based privacy preserving and keyword-searchable scheme for medical data sharing(BPPKS). Access policies are transformed into vector-matrix form, concealing attributes within access policies to prevent the leakage of authorized user privacy information. Leveraging blockchain’s transparency, tamper-resistance, and integrity verification features, smart contracts are used for retrieval and verification, enabling secure and reliable data searches while ensuring the integrity of medical data. Simultaneously, some complex decryption operations are delegated to the cloud servers, reducing the decryption load for users to a constant level. Finally, security analysis demonstrates that this scheme can withstand adaptive chosen keyword attacks (IND-CKA), and performance evaluations show higher efficiency in computation and storage aspects.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"187 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142205037","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An efficient energy supply policy and optimized self-adaptive data aggregation with deep learning in heterogeneous wireless sensor network 异构无线传感器网络中的高效能源供应策略和深度学习优化自适应数据聚合
IF 4.2 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-10 DOI: 10.1007/s12083-024-01791-y
Rajkumar Tharmalingam, Nandhagopal Nachimuthu, G. Prakash

Heterogeneous wireless sensor networks (HWSNs) are energy-constrained networks. Data aggregation can conserve the energy of HWSN. Clustering protocols and data processing can be used at individual nodes to reduce the amount of transfers and extend the network's lifespan. Considering these advantages, the proposed research introduces an efficient energy supply and data aggregation using effective techniques. Initially, cluster head (CH) election and data transmission are done using an information entropy based-clustering algorithm (IECA). After successful data transmission, an efficient energy supply scheme is enabled between cluster members (CMs) and sink nodes. Then, data aggregation is performed in CH using Planar Flow-Based Variational Auto-Encoder-based data aggregation (PF-VAE-DA). Before performing data aggregation, the useless and redundant data is compressed using a Long-short-term-memory-based auto-encoder (LSTM-based auto-encoder). The compressed data is aggregated in CHs. Before transferring the aggregated data to the sink, efficient data stream collection is performed to equalize the data size utilizing self-adaptive adjustment of sliding window size (SASWS). Finally, the optimal path is selected to transmit the aggregated data from CH to the sink. The performance of the proposed method is evaluated for various performance metrics. The aim of the proposed study is to enhance the accuracy of sensing data by introducing a novel deep learning-based data aggregation approach. This will extract significant features from vast amounts of data and carry out data aggregation. In addition, to improve the dependability of aggregated data transfer, an effective Energy Supply Policy based on data transmission patterns is implemented. The results show that the proposed method outperforms other methods in terms of network energy consumption, packet delivery ratio (PDR), packet dropping ratio, data aggregation rate, transmission delay, and network lifetime. The proposed approach uses 50% less energy than the other methods. The model's transmission delay ranges from 0.1 to 0.4 s as the number of nodes increases. The proposed network contains 282 active nodes at the 400th round, which is much more than the existing networks.

异构无线传感器网络(HWSN)是一种能量受限的网络。数据聚合可以节省 HWSN 的能量。聚类协议和数据处理可用于单个节点,以减少传输量,延长网络寿命。考虑到这些优势,拟议的研究采用有效的技术引入了高效的能源供应和数据聚合。最初,使用基于信息熵的聚类算法(IECA)进行簇头(CH)选举和数据传输。数据传输成功后,在簇成员(CM)和汇节点之间启用有效的能量供应方案。然后,在 CH 中使用基于平面流变自动编码器的数据聚合(PF-VAE-DA)进行数据聚合。在进行数据聚合之前,使用基于长短期记忆的自动编码器(LSTM-based auto-encoder)对无用和冗余数据进行压缩。压缩后的数据在 CH 中聚合。在将聚合数据传输到汇之前,利用滑动窗口大小的自适应调整(SASWS)进行有效的数据流收集,以均衡数据大小。最后,选择最佳路径将聚合数据从 CH 传输到 Sink。针对各种性能指标对所提方法的性能进行了评估。拟议研究的目的是通过引入一种基于深度学习的新型数据聚合方法来提高传感数据的准确性。这将从海量数据中提取重要特征并进行数据聚合。此外,为了提高聚合数据传输的可靠性,还实施了基于数据传输模式的有效能源供应策略。结果表明,在网络能耗、数据包交付率(PDR)、数据包丢弃率、数据聚合率、传输延迟和网络寿命等方面,所提出的方法都优于其他方法。所提出的方法比其他方法少消耗 50%的能量。随着节点数量的增加,模型的传输延迟从 0.1 秒到 0.4 秒不等。提议的网络在第 400 轮时包含 282 个活动节点,远远多于现有网络。
{"title":"An efficient energy supply policy and optimized self-adaptive data aggregation with deep learning in heterogeneous wireless sensor network","authors":"Rajkumar Tharmalingam, Nandhagopal Nachimuthu, G. Prakash","doi":"10.1007/s12083-024-01791-y","DOIUrl":"https://doi.org/10.1007/s12083-024-01791-y","url":null,"abstract":"<p>Heterogeneous wireless sensor networks (HWSNs) are energy-constrained networks. Data aggregation can conserve the energy of HWSN. Clustering protocols and data processing can be used at individual nodes to reduce the amount of transfers and extend the network's lifespan. Considering these advantages, the proposed research introduces an efficient energy supply and data aggregation using effective techniques. Initially, cluster head (CH) election and data transmission are done using an information entropy based-clustering algorithm (IECA). After successful data transmission, an efficient energy supply scheme is enabled between cluster members (CMs) and sink nodes. Then, data aggregation is performed in CH using Planar Flow-Based Variational Auto-Encoder-based data aggregation (PF-VAE-DA). Before performing data aggregation, the useless and redundant data is compressed using a Long-short-term-memory-based auto-encoder (LSTM-based auto-encoder). The compressed data is aggregated in CHs. Before transferring the aggregated data to the sink, efficient data stream collection is performed to equalize the data size utilizing self-adaptive adjustment of sliding window size (SASWS). Finally, the optimal path is selected to transmit the aggregated data from CH to the sink. The performance of the proposed method is evaluated for various performance metrics. The aim of the proposed study is to enhance the accuracy of sensing data by introducing a novel deep learning-based data aggregation approach. This will extract significant features from vast amounts of data and carry out data aggregation. In addition, to improve the dependability of aggregated data transfer, an effective Energy Supply Policy based on data transmission patterns is implemented. The results show that the proposed method outperforms other methods in terms of network energy consumption, packet delivery ratio (PDR), packet dropping ratio, data aggregation rate, transmission delay, and network lifetime. The proposed approach uses 50% less energy than the other methods. The model's transmission delay ranges from 0.1 to 0.4 s as the number of nodes increases. The proposed network contains 282 active nodes at the 400th round, which is much more than the existing networks.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"69 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142205032","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Blockchain-assisted lightweight privacy preserving authentication protocol for peer-to-peer communication in vehicular ad-hoc network 用于车载 ad-hoc 网络点对点通信的区块链辅助轻量级隐私保护认证协议
IF 4.2 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-10 DOI: 10.1007/s12083-024-01784-x
Sharon Justine Payattukalanirappel, Panchami V Vamattathil, Mohammed Ziyad C Cheeramthodika

Vehicular Ad-Hoc Network (VANET), provides considerable real-time traffic information services that enhance safety and traffic effectiveness. However, as most of the VANET systems are centralized in nature prone to single-point failure, and vulnerable to attacks there will be reasonable delay in communication. In this paper, a lightweight privacy-preserving authentication scheme for peer-to-peer communication using blockchain (DLPA) while considering the resource-constrained nature of VANET is proposed. We have designed and deployed smart contracts using public blockchain to resist the vehicle impersonation attack, to identify illegal vehicle’s identity and thereby non-repudiation will be achieved. Vehicle-to-Vehicle (V2V) authentication and peer-to-peer communication are attained without the involvement of a Trusted Authority (TA) and to eliminate the trusted third party who is responsible for generating the key. Furthermore, DLPA has achieved handover authentication of vehicles so that vehicles need not be re-authenticated when they enter into a new Road Side Unit (RSU) limit. The proposed scheme is implemented in different Ethereum-powered test networks using Remix IDE to demonstrate the feasibility and to analyze the performance of the smart contract in terms of transaction cost and execution cost. In addition to that, security proof and analysis are performed to unveil that our proposed scheme preserves the privacy of the communicating parties, semantic security of the session key, and resistance against various known threats and attacks. Finally, the performance analysis of the scheme is done by calculating the communication and computation costs. The computation cost for our DLPA scheme for V2V authentication is 0.27461 ms and for V2RSU authentication is 0.15622 ms. The communication cost for both V2V and V2RSU authentication is 640 bits. While analyzing the result, the proposed protocol has a minimal cost when compared with other blockchain-based authentication schemes in VANET.

车载 Ad-Hoc 网络(VANET)提供了大量实时交通信息服务,提高了安全性和交通效率。然而,由于大多数 VANET 系统都是集中式的,容易出现单点故障,而且容易受到攻击,因此会出现合理的通信延迟。本文提出了一种使用区块链(DLPA)进行点对点通信的轻量级隐私保护认证方案,同时考虑到了 VANET 资源受限的特性。我们设计并部署了使用公共区块链的智能合约,以抵御车辆冒充攻击,识别非法车辆的身份,从而实现不可抵赖性。车对车(V2V)认证和点对点通信无需可信机构(TA)参与,并消除了负责生成密钥的可信第三方。此外,DLPA 还实现了车辆的交接认证,使车辆在进入新的路侧装置(RSU)限制时无需重新认证。我们使用 Remix IDE 在不同的以太坊驱动测试网络中实施了拟议方案,以证明其可行性,并从交易成本和执行成本方面分析智能合约的性能。此外,我们还进行了安全证明和分析,以揭示我们提出的方案能够保护通信各方的隐私、会话密钥的语义安全以及抵御各种已知威胁和攻击。最后,通过计算通信和计算成本对方案进行了性能分析。我们的 DLPA 方案用于 V2V 身份验证的计算成本为 0.27461 毫秒,用于 V2RSU 身份验证的计算成本为 0.15622 毫秒。V2V 和 V2RSU 身份验证的通信成本均为 640 比特。分析结果表明,与 VANET 中其他基于区块链的认证方案相比,所提出的协议成本最低。
{"title":"A Blockchain-assisted lightweight privacy preserving authentication protocol for peer-to-peer communication in vehicular ad-hoc network","authors":"Sharon Justine Payattukalanirappel, Panchami V Vamattathil, Mohammed Ziyad C Cheeramthodika","doi":"10.1007/s12083-024-01784-x","DOIUrl":"https://doi.org/10.1007/s12083-024-01784-x","url":null,"abstract":"<p>Vehicular Ad-Hoc Network (VANET), provides considerable real-time traffic information services that enhance safety and traffic effectiveness. However, as most of the VANET systems are centralized in nature prone to single-point failure, and vulnerable to attacks there will be reasonable delay in communication. In this paper, a lightweight privacy-preserving authentication scheme for peer-to-peer communication using blockchain (DLPA) while considering the resource-constrained nature of VANET is proposed. We have designed and deployed smart contracts using public blockchain to resist the vehicle impersonation attack, to identify illegal vehicle’s identity and thereby non-repudiation will be achieved. Vehicle-to-Vehicle (V2V) authentication and peer-to-peer communication are attained without the involvement of a Trusted Authority (TA) and to eliminate the trusted third party who is responsible for generating the key. Furthermore, DLPA has achieved handover authentication of vehicles so that vehicles need not be re-authenticated when they enter into a new Road Side Unit (RSU) limit. The proposed scheme is implemented in different Ethereum-powered test networks using Remix IDE to demonstrate the feasibility and to analyze the performance of the smart contract in terms of transaction cost and execution cost. In addition to that, security proof and analysis are performed to unveil that our proposed scheme preserves the privacy of the communicating parties, semantic security of the session key, and resistance against various known threats and attacks. Finally, the performance analysis of the scheme is done by calculating the communication and computation costs. The computation cost for our DLPA scheme for V2V authentication is 0.27461 ms and for V2RSU authentication is 0.15622 ms. The communication cost for both V2V and V2RSU authentication is 640 bits. While analyzing the result, the proposed protocol has a minimal cost when compared with other blockchain-based authentication schemes in VANET.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"173 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142205033","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
IoV block secure: blockchain based secure data collection and validation framework for internet of vehicles network IoV 区块安全:基于区块链的车联网网络安全数据收集和验证框架
IF 4.2 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-09 DOI: 10.1007/s12083-024-01802-y
Madhukar G, Chandrashekar Jatoth, Rajesh Doriya

In the expanding field of the Internet of Vehicles (IoV) where network communication meets technology there is a pressing need, for robust data management and security. This study introduces IoVBlockSecure a protocol based on technology that aims to ensure collection and validation of data within the dynamic and decentralized realm of vehicle networks. The primary objective of IoVBlockSecure is to enhance data security, integrity, efficiency, and scalability in IoV. It achieves this through the utilization of smart contracts advanced blockchain technology and consensus protocol. The framework tackles scalability challenges by integrating both off chain and on chain data storage solutions thereby boosting the security and reliability of data from roadside units (RSUs) and vehicles. Additionally IoVBlockSecure incorporates techniques, a unique consensus mechanism, and a sequential numbering system for data points to optimize data processing and validation. Furthermore, the framework demonstrates its adaptability and operational efficiency by implementing Layer 2 solutions for off chain activities. Comprehensive performance evaluations were conducted to assess aspects such as fault tolerance, data integrity, security measures effectiveness, transaction latency, system throughput, consensus efficacy, and block processing time, across node counts and operational loads. The evaluations conducted confirm that the model is robust and effective demonstrating capabilities, in processing blocks and achieving consensus when transaction latencies increase and system throughputs vary. The framework shows resilience and reliability achieving levels of data integrity, security, and fault tolerance. While these findings validate the potential of IoVBlockSecure in meeting the demands of IoV networks they also highlight areas for improvement in optimizing throughput and latency for optimal performance.

在不断扩展的车联网(IoV)领域,网络通信与技术相结合,迫切需要强大的数据管理和安全性。本研究介绍的 IoVBlockSecure 是一种基于技术的协议,旨在确保在动态和分散的车辆网络领域收集和验证数据。IoVBlockSecure 的主要目标是提高 IoV 中数据的安全性、完整性、效率和可扩展性。它通过利用智能合约先进的区块链技术和共识协议来实现这一目标。该框架通过整合链外和链上数据存储解决方案来应对可扩展性挑战,从而提高路边装置(RSU)和车辆数据的安全性和可靠性。此外,IoVBlockSecure 还采用了各种技术、独特的共识机制和数据点顺序编号系统,以优化数据处理和验证。此外,该框架还通过实施针对链外活动的第 2 层解决方案,展示了其适应性和运行效率。我们进行了全面的性能评估,以评估不同节点数量和运行负载下的容错性、数据完整性、安全措施有效性、交易延迟、系统吞吐量、共识效率和区块处理时间等方面。评估结果证实,该模型在交易延迟增加和系统吞吐量变化的情况下,在处理区块和达成共识方面表现出强大而有效的能力。该框架显示出了恢复能力和可靠性,达到了数据完整性、安全性和容错的水平。这些发现验证了 IoVBlockSecure 在满足 IoV 网络需求方面的潜力,同时也强调了在优化吞吐量和延迟以实现最佳性能方面需要改进的地方。
{"title":"IoV block secure: blockchain based secure data collection and validation framework for internet of vehicles network","authors":"Madhukar G, Chandrashekar Jatoth, Rajesh Doriya","doi":"10.1007/s12083-024-01802-y","DOIUrl":"https://doi.org/10.1007/s12083-024-01802-y","url":null,"abstract":"<p>In the expanding field of the Internet of Vehicles (IoV) where network communication meets technology there is a pressing need, for robust data management and security. This study introduces IoVBlockSecure a protocol based on technology that aims to ensure collection and validation of data within the dynamic and decentralized realm of vehicle networks. The primary objective of IoVBlockSecure is to enhance data security, integrity, efficiency, and scalability in IoV. It achieves this through the utilization of smart contracts advanced blockchain technology and consensus protocol. The framework tackles scalability challenges by integrating both off chain and on chain data storage solutions thereby boosting the security and reliability of data from roadside units (RSUs) and vehicles. Additionally IoVBlockSecure incorporates techniques, a unique consensus mechanism, and a sequential numbering system for data points to optimize data processing and validation. Furthermore, the framework demonstrates its adaptability and operational efficiency by implementing Layer 2 solutions for off chain activities. Comprehensive performance evaluations were conducted to assess aspects such as fault tolerance, data integrity, security measures effectiveness, transaction latency, system throughput, consensus efficacy, and block processing time, across node counts and operational loads. The evaluations conducted confirm that the model is robust and effective demonstrating capabilities, in processing blocks and achieving consensus when transaction latencies increase and system throughputs vary. The framework shows resilience and reliability achieving levels of data integrity, security, and fault tolerance. While these findings validate the potential of IoVBlockSecure in meeting the demands of IoV networks they also highlight areas for improvement in optimizing throughput and latency for optimal performance.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"2 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142205034","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Mainstay: A hybrid protocol ensuring ledger temporality and security Mainstay:确保分类账时间性和安全性的混合协议
IF 4.2 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-09 DOI: 10.1007/s12083-024-01797-6
Liangxin Liu, Zhiqiang Du, Yanfang Fu, Muhong Huang, Wendong Zhang

To enhance the scalability of blockchain ledger structure, researchers have abandoned the traditional single-chain structure and used the structure of Directed Acyclic Graph (DAG) to achieve high-concurrency processing of transactions. The DAG-based ledger requires a specific topological structure and block sorting rules to ensure the temporality and security of the ledger structure. This paper proposes a hybrid protocol called Mainstay with a double-layer structure, including the DAG-Ledger layer and the NC-Chain layer. The DAG-Ledger layer uses PHANTOM structure to confirm the transaction block order; the NC-Chain uses dynamic committee elections, voting, and fast verification to form a blockchain similar to the Nakamoto style, and each block of the NC-Chain requires committee members to calculate the Verifiable Delay Function (VDF) to generate a quorum certificate(QC), which can ensure the stability and security of the DAG-Ledger layer ledger sequence. By experimental comparison, we conclude that the Mainstay protocol can effectively reduce the probability of malicious attackers successfully attacking the ledger structure.

为了提高区块链账本结构的可扩展性,研究人员摒弃了传统的单链结构,采用有向无环图(DAG)结构来实现交易的高并发处理。基于 DAG 的账本需要特定的拓扑结构和区块排序规则,以确保账本结构的时间性和安全性。本文提出了一种名为 Mainstay 的混合协议,它具有双层结构,包括 DAG 总账层和 NC 链层。DAG-账本层采用PHANTOM结构确认交易区块顺序;NC-链采用动态委员会选举、投票、快速验证等方式形成类似中本聪风格的区块链,NC-链的每个区块都需要委员会成员计算可验证延迟函数(VDF)生成法定人数证书(QC),可以确保DAG-账本层账本序列的稳定性和安全性。通过实验比较,我们得出结论:Mainstay 协议能有效降低恶意攻击者成功攻击账本结构的概率。
{"title":"Mainstay: A hybrid protocol ensuring ledger temporality and security","authors":"Liangxin Liu, Zhiqiang Du, Yanfang Fu, Muhong Huang, Wendong Zhang","doi":"10.1007/s12083-024-01797-6","DOIUrl":"https://doi.org/10.1007/s12083-024-01797-6","url":null,"abstract":"<p>To enhance the scalability of blockchain ledger structure, researchers have abandoned the traditional single-chain structure and used the structure of Directed Acyclic Graph (DAG) to achieve high-concurrency processing of transactions. The DAG-based ledger requires a specific topological structure and block sorting rules to ensure the temporality and security of the ledger structure. This paper proposes a hybrid protocol called Mainstay with a double-layer structure, including the DAG-Ledger layer and the NC-Chain layer. The DAG-Ledger layer uses PHANTOM structure to confirm the transaction block order; the NC-Chain uses dynamic committee elections, voting, and fast verification to form a blockchain similar to the Nakamoto style, and each block of the NC-Chain requires committee members to calculate the Verifiable Delay Function (VDF) to generate a quorum certificate(QC), which can ensure the stability and security of the DAG-Ledger layer ledger sequence. By experimental comparison, we conclude that the Mainstay protocol can effectively reduce the probability of malicious attackers successfully attacking the ledger structure.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"9 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142205035","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Blockchain abetted energy efficient archerfish hunting and Namib Beetle optimization algorithm espoused clustering protocol for wireless sensor network 区块链辅助无线传感器网络的节能箭鱼狩猎和纳米比亚甲虫优化算法支持的聚类协议
IF 4.2 4区 计算机科学 Q2 COMPUTER SCIENCE, INFORMATION SYSTEMS Pub Date : 2024-09-09 DOI: 10.1007/s12083-024-01787-8
Kiran W. S, Allan J. Wilson, G. Ranganathan

Security and energy efficiency are regarded as the significant problems in the pervasive wireless networks. Since widespread wireless networks rely on battery-operated nodes, it is necessary to progress an energy-efficient scheme to lower energy consumption and increase the networks lifespan. The existing approaches fail to accomplish both objectives at the same time. Therefore, this paper proposes a Blockchain abetted Energy Efficient Archerfish Hunting and Namib Beetle Optimization Algorithm espoused Clustering Protocol for Wireless Sensor Network (BC-EEAHNBOA-CP-WSN). The proposed method operates in two phases: (i) determining the optimal cluster heads, (ii) determining the optimal trust path. The Archerfish Hunting Optimizer and Namib Beetle Optimization Algorithm are used to precisely select the cluster heads, while the optimized trust paths are secured using blockchain technology. This paper combines the development of Energy Efficient Archerfish Hunting and Namib Beetle Optimization Algorithm (EEAHNBOA) with blockchain-enabled secure data transmission, introduces a clustering method based on AFHO-NBOA for efficient cluster head selection using a fitness function that incorporates energy, node density, neighboring nodes' distance, and sink distance, and ensures safe data transfer between cluster members and cluster heads using blockchain. The proposed BC-EEAHNBOA-CP-WSN approach is executed in MATLAB 2018a, its effectiveness is examined using metrics. The results demonstrate that the proposed method achieves a 23.31%, 45.16%, and 18.72% higher packet delivery ratio, and a 15.56%, 47.31%, and 19.96% longer network lifetime compared to existing methods. By fusing blockchain technology with sophisticated optimization algorithms, this research advances the state of the art by improving WSN security and energy efficiency. The implications of this work suggest significant improvements in the lifespan and reliability of wireless sensor networks, which are crucial for a wide range of applications.

安全和能效被认为是普适无线网络中的重要问题。由于普遍无线网络依赖于使用电池的节点,因此有必要改进节能方案,以降低能耗并延长网络寿命。现有的方法无法同时实现这两个目标。因此,本文提出了一种适用于无线传感器网络的区块链辅助高能效箭鱼狩猎和纳米比亚甲虫优化算法集群协议(BC-EEAHNBOA-CP-WSN)。该方法分为两个阶段:(i) 确定最佳簇头;(ii) 确定最佳信任路径。利用Archerfish狩猎优化器和Namib Beetle优化算法精确选择簇头,同时利用区块链技术确保优化信任路径的安全。本文将高能效箭鱼狩猎优化算法(EEAHNBOA)的开发与区块链安全数据传输相结合,介绍了一种基于AFHO-NBOA的聚类方法,该方法使用结合能量、节点密度、邻近节点距离和Sink距离的适配函数进行高效簇头选择,并使用区块链确保簇成员和簇头之间的安全数据传输。在 MATLAB 2018a 中执行了所提出的 BC-EEAHNBOA-CP-WSN 方法,并使用指标对其有效性进行了检验。结果表明,与现有方法相比,拟议方法的数据包交付率分别提高了 23.31%、45.16% 和 18.72%,网络寿命分别延长了 15.56%、47.31% 和 19.96%。通过将区块链技术与复杂的优化算法相结合,这项研究提高了 WSN 的安全性和能效,从而推动了技术发展。这项工作的影响表明,无线传感器网络的寿命和可靠性有了显著提高,这对广泛的应用至关重要。
{"title":"Blockchain abetted energy efficient archerfish hunting and Namib Beetle optimization algorithm espoused clustering protocol for wireless sensor network","authors":"Kiran W. S, Allan J. Wilson, G. Ranganathan","doi":"10.1007/s12083-024-01787-8","DOIUrl":"https://doi.org/10.1007/s12083-024-01787-8","url":null,"abstract":"<p>Security and energy efficiency are regarded as the significant problems in the pervasive wireless networks. Since widespread wireless networks rely on battery-operated nodes, it is necessary to progress an energy-efficient scheme to lower energy consumption and increase the networks lifespan. The existing approaches fail to accomplish both objectives at the same time. Therefore, this paper proposes a Blockchain abetted Energy Efficient Archerfish Hunting and Namib Beetle Optimization Algorithm espoused Clustering Protocol for Wireless Sensor Network (BC-EEAHNBOA-CP-WSN). The proposed method operates in two phases: (i) determining the optimal cluster heads, (ii) determining the optimal trust path. The Archerfish Hunting Optimizer and Namib Beetle Optimization Algorithm are used to precisely select the cluster heads, while the optimized trust paths are secured using blockchain technology. This paper combines the development of Energy Efficient Archerfish Hunting and Namib Beetle Optimization Algorithm (EEAHNBOA) with blockchain-enabled secure data transmission, introduces a clustering method based on AFHO-NBOA for efficient cluster head selection using a fitness function that incorporates energy, node density, neighboring nodes' distance, and sink distance, and ensures safe data transfer between cluster members and cluster heads using blockchain. The proposed BC-EEAHNBOA-CP-WSN approach is executed in MATLAB 2018a, its effectiveness is examined using metrics. The results demonstrate that the proposed method achieves a 23.31%, 45.16%, and 18.72% higher packet delivery ratio, and a 15.56%, 47.31%, and 19.96% longer network lifetime compared to existing methods. By fusing blockchain technology with sophisticated optimization algorithms, this research advances the state of the art by improving WSN security and energy efficiency. The implications of this work suggest significant improvements in the lifespan and reliability of wireless sensor networks, which are crucial for a wide range of applications.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"21 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142205038","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Peer-To-Peer Networking and Applications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1