Wireless Sensor Networks (WSN) are composed of small sensor nodes that either transmit their sensed data to the sink node directly or transmit it to its respective cluster head, which then transmits it to the sink node. However, this consumes a lot of network bandwidth and energy from the constrained sensor nodes. To address these constraints, Mobile Agents (MA) paradigm can be used in WSNs, which may lead to better energy and bandwidth conservation. When a single mobile agent is insufficient to complete a task, multiple mobile agents can be deployed to perform in parallel and reduce network latency. The set of sensor nodes and their sequence that MAs must migrate to complete a task is called an itinerary. The planning of the itinerary is the most prominent and significant issue related to the MA-based system, including the determination of an appropriate number of MAs to be dispatched, determining the set of sensor nodes and their sequence to be visited by MAs. This paper proposes a fuzzy-based algorithm to partition Wireless Sensor Networks into a set of sensor nodes, called domains, for enhancing the efficiency of the WSN in terms of its prolonged operation. Experimental evaluations are conducted to compare the proposed algorithm with benchmarked algorithms. The paper suggests that the proposed algorithm's integration with MA-based systems can enhance their performance and prolong the WSN's lifetime.
无线传感器网络(WSN)由小型传感器节点组成,这些节点要么直接将感知数据传输到汇节点,要么将数据传输到各自的簇头,再由簇头传输到汇节点。然而,这需要消耗大量的网络带宽和传感器节点的能量。为解决这些限制,可在 WSN 中使用移动代理(MA)模式,从而更好地节约能源和带宽。当单个移动代理不足以完成任务时,可部署多个移动代理并行执行任务,减少网络延迟。移动代理为完成任务而必须迁移的传感器节点集及其顺序称为行程。行程规划是与基于移动代理的系统相关的最突出、最重要的问题,包括确定要派遣的移动代理的适当数量、确定移动代理要访问的传感器节点集及其顺序。本文提出了一种基于模糊的算法,将无线传感器网络划分为一组传感器节点(称为域),以提高 WSN 的长期运行效率。本文进行了实验评估,将提出的算法与基准算法进行了比较。论文认为,将提出的算法与基于 MA 的系统集成,可以提高其性能并延长 WSN 的使用寿命。
{"title":"Assessing the efficacy of a novel adaptive fuzzy c-means (AFCM) based clustering algorithm for mobile agent itinerary planning in wireless sensor networks using validity indices","authors":"Nidhi Kashyap, Shuchita Upadhyaya, Monika Poriye, Sachin Lalar, Shalini Aggarwal","doi":"10.1007/s12083-024-01695-x","DOIUrl":"https://doi.org/10.1007/s12083-024-01695-x","url":null,"abstract":"<p>Wireless Sensor Networks (WSN) are composed of small sensor nodes that either transmit their sensed data to the sink node directly or transmit it to its respective cluster head, which then transmits it to the sink node. However, this consumes a lot of network bandwidth and energy from the constrained sensor nodes. To address these constraints, Mobile Agents (MA) paradigm can be used in WSNs, which may lead to better energy and bandwidth conservation. When a single mobile agent is insufficient to complete a task, multiple mobile agents can be deployed to perform in parallel and reduce network latency. The set of sensor nodes and their sequence that MAs must migrate to complete a task is called an itinerary. The planning of the itinerary is the most prominent and significant issue related to the MA-based system, including the determination of an appropriate number of MAs to be dispatched, determining the set of sensor nodes and their sequence to be visited by MAs. This paper proposes a fuzzy-based algorithm to partition Wireless Sensor Networks into a set of sensor nodes, called domains, for enhancing the efficiency of the WSN in terms of its prolonged operation. Experimental evaluations are conducted to compare the proposed algorithm with benchmarked algorithms. The paper suggests that the proposed algorithm's integration with MA-based systems can enhance their performance and prolong the WSN's lifetime.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"43 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140937981","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}
Pub Date : 2024-05-10DOI: 10.1007/s12083-024-01689-9
Zi-xuan Han, Lei-lei Shi, Lu Liu, Liang Jiang, Wan Tang, Xiao Chen, Jing-yu Yang, Ayodeji O. Ayorinde, Nick Antonopoulos
The rise of online social networks has fundamentally transformed the traditional way of social interaction and information dissemination, leading to a growing interest in precise community detection and in-depth network structure analysis. However, the complexity of network structures and potential issues like singularity and subjectivity in information extraction affect the accuracy of community detection. To overcome these challenges, we propose a new community detection algorithm, known as the Hierarchical Louvain (H-Louvain) algorithm. It enhances the performance of community detection through a multi-level processing and information fusion strategy. Specifically, the algorithm integrates graph compression techniques with the Hyperlink-Induced Topic Search (HITS) algorithm for initial network hierarchical partitioning, simultaneously filtering out low-quality posts and users while retaining critical information. Furthermore, the proposed method enhances semantic representation by automatically determining an appropriate number of attribute vector dimensions and obtaining attribute weight information through the calculation of self-authority values and the "minimum distance" attribute of posts. Lastly, the method creates an initial user training set through network re-partitioning in hierarchical layers and improves the Louvain algorithm for community partitioning by estimating the comprehensive influence of nodes. Extensive experimentation has demonstrated that the H-Louvain algorithm outperforms state-of-the-art comparative algorithms in terms of accuracy and stability in community detection based on real-world Twitter datasets.
{"title":"H-Louvain: Hierarchical Louvain-based community detection in social media data streams","authors":"Zi-xuan Han, Lei-lei Shi, Lu Liu, Liang Jiang, Wan Tang, Xiao Chen, Jing-yu Yang, Ayodeji O. Ayorinde, Nick Antonopoulos","doi":"10.1007/s12083-024-01689-9","DOIUrl":"https://doi.org/10.1007/s12083-024-01689-9","url":null,"abstract":"<p>The rise of online social networks has fundamentally transformed the traditional way of social interaction and information dissemination, leading to a growing interest in precise community detection and in-depth network structure analysis. However, the complexity of network structures and potential issues like singularity and subjectivity in information extraction affect the accuracy of community detection. To overcome these challenges, we propose a new community detection algorithm, known as the Hierarchical Louvain (H-Louvain) algorithm. It enhances the performance of community detection through a multi-level processing and information fusion strategy. Specifically, the algorithm integrates graph compression techniques with the Hyperlink-Induced Topic Search (HITS) algorithm for initial network hierarchical partitioning, simultaneously filtering out low-quality posts and users while retaining critical information. Furthermore, the proposed method enhances semantic representation by automatically determining an appropriate number of attribute vector dimensions and obtaining attribute weight information through the calculation of self-authority values and the \"minimum distance\" attribute of posts. Lastly, the method creates an initial user training set through network re-partitioning in hierarchical layers and improves the Louvain algorithm for community partitioning by estimating the comprehensive influence of nodes. Extensive experimentation has demonstrated that the H-Louvain algorithm outperforms state-of-the-art comparative algorithms in terms of accuracy and stability in community detection based on real-world Twitter datasets.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"21 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140937630","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}
Pub Date : 2024-05-10DOI: 10.1007/s12083-024-01714-x
Majd Latah, Kubra Kalkan
Software defined networking (SDN) is a novel networking paradigm that aims to achieve global management for the underlying forwarding plane based on its centralization concept. Unfortunately, the newly designed paradigm does not consider security issues related to unauthenticated and unauthorized activities across various SDN layers. Recently, blockchain (BC) technology has proven successful in providing a decentralized, immutable, and fault tolerant ledger. In this study, we take advantage of blockchain characteristics to provide mutual host-controller, PacketIn/PacketOut and host-host authentication methods. We also provide secure Address Resolution Protocol (ARP) and Identity Resolution Protocol (IRP) to protect layer 3 and layer 2 of the SDN network. In addition, both SDN hosts and controllers utilize lattice-based signatures based on Dilithium scheme and Key Encapsulation Methods (KEMs) based on Kyber scheme to provide protection against quantum adversaries. We also compare our work with AuthFlow (Mattos and Duarte in Ann Telecommun 71:607–615, 2016). The results show that HostSec is more secure than AuthFlow due to its ability to detect both host-based and switch-based PacketIn attacks and also reduces the load on the SDN controller. Overall, the experimental results suggest a trade-off between improved security and lower latency.
软件定义网络(SDN)是一种新型网络范式,旨在根据其集中化概念实现底层转发平面的全局管理。遗憾的是,这种新设计的范例并未考虑与跨 SDN 各层的未认证和未授权活动有关的安全问题。最近,区块链(BC)技术在提供去中心化、不可变和容错分类账方面被证明是成功的。在本研究中,我们利用区块链的特性提供了主机-控制器、包入/包出和主机-主机相互认证方法。我们还提供了安全的地址解析协议(ARP)和身份解析协议(IRP),以保护 SDN 网络的第 3 层和第 2 层。此外,SDN 主机和控制器都使用基于 Dilithium 方案的网格签名和基于 Kyber 方案的密钥封装方法 (KEM),以提供对量子对手的保护。我们还将我们的工作与 AuthFlow(Mattos 和 Duarte,载于 Ann Telecommun 71:607-615, 2016)进行了比较。结果表明,由于 HostSec 能够检测基于主机和交换机的 PacketIn 攻击,因此比 AuthFlow 更为安全,而且还能降低 SDN 控制器的负载。总体而言,实验结果表明,在提高安全性和降低延迟之间需要权衡利弊。
{"title":"HostSec: A blockchain-based authentication framework for SDN hosts","authors":"Majd Latah, Kubra Kalkan","doi":"10.1007/s12083-024-01714-x","DOIUrl":"https://doi.org/10.1007/s12083-024-01714-x","url":null,"abstract":"<p>Software defined networking (SDN) is a novel networking paradigm that aims to achieve global management for the underlying forwarding plane based on its centralization concept. Unfortunately, the newly designed paradigm does not consider security issues related to unauthenticated and unauthorized activities across various SDN layers. Recently, blockchain (BC) technology has proven successful in providing a decentralized, immutable, and fault tolerant ledger. In this study, we take advantage of blockchain characteristics to provide mutual host-controller, PacketIn/PacketOut and host-host authentication methods. We also provide secure Address Resolution Protocol (ARP) and Identity Resolution Protocol (IRP) to protect layer 3 and layer 2 of the SDN network. In addition, both SDN hosts and controllers utilize lattice-based signatures based on Dilithium scheme and Key Encapsulation Methods (KEMs) based on Kyber scheme to provide protection against quantum adversaries. We also compare our work with AuthFlow (Mattos and Duarte in Ann Telecommun 71:607–615, 2016). The results show that HostSec is more secure than AuthFlow due to its ability to detect both host-based and switch-based PacketIn attacks and also reduces the load on the SDN controller. Overall, the experimental results suggest a trade-off between improved security and lower latency.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"116 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140937632","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}
Pub Date : 2024-05-08DOI: 10.1007/s12083-024-01706-x
Ankita Srivastava, Pramod Kumar Mishra
Efficient Energy Consumption and Network Lifetime are significant concerns in wireless sensor networks and allied disciplines. Clustering is one of the available solutions, but optimized cluster head selection is a prime issue nowadays. Many solutions have been given for solving this issue considering some attributes, but with time, meta-heuristics algorithms have become widely used for real-world applications. The nature-inspired algorithm is seeking researchers' wide attention as it gives the capability to self-learn and perform better. In this paper, we have proposed the Dragon Fly algorithm with multi-attribute decision-making inspired by the dynamic and static behavior of the dragonfly. The Proposed IDA (Innovative Dragonfly Algorithm) is a hybrid approach in which dragonfly and multi-attributes are combined for optimal cluster head selection. The proposed method is a way to compute multi-attributes of sensor nodes for ranking them and selecting optimized cluster heads. The energy consumption of IDA is 0.4896, NBA (Novel Bio-Inspired Algorithm) is 0.4321, FLPSOC (Fuzzy Logic and PSO-based energy efficient clustering) is 0.4421, and ESO-LEACH (PSO-based energy efficiency) is 0.4678 at which means proposed IDA is better than other compared algorithms in energy consumption. The throughput of IDA is 64.99, which is better than existing different compared algorithms. The number of alive nodes in the proposed method is, and that of compared algorithms is; thus, IDA has enhanced network lifetime compared to others. The IDA algorithm is compared with NBA, FLPSOC, and ESO-LEACH, validating that the proposed algorithm performs better than the classical and compared algorithm.
{"title":"IDA: Improved dragonfly algorithm for load balanced cluster heads selection in wireless sensor networks","authors":"Ankita Srivastava, Pramod Kumar Mishra","doi":"10.1007/s12083-024-01706-x","DOIUrl":"https://doi.org/10.1007/s12083-024-01706-x","url":null,"abstract":"<p>Efficient Energy Consumption and Network Lifetime are significant concerns in wireless sensor networks and allied disciplines. Clustering is one of the available solutions, but optimized cluster head selection is a prime issue nowadays. Many solutions have been given for solving this issue considering some attributes, but with time, meta-heuristics algorithms have become widely used for real-world applications. The nature-inspired algorithm is seeking researchers' wide attention as it gives the capability to self-learn and perform better. In this paper, we have proposed the Dragon Fly algorithm with multi-attribute decision-making inspired by the dynamic and static behavior of the dragonfly. The Proposed IDA (Innovative Dragonfly Algorithm) is a hybrid approach in which dragonfly and multi-attributes are combined for optimal cluster head selection. The proposed method is a way to compute multi-attributes of sensor nodes for ranking them and selecting optimized cluster heads. The energy consumption of IDA is 0.4896, NBA (Novel Bio-Inspired Algorithm) is 0.4321, FLPSOC (Fuzzy Logic and PSO-based energy efficient clustering) is 0.4421, and ESO-LEACH (PSO-based energy efficiency) is 0.4678 at which means proposed IDA is better than other compared algorithms in energy consumption. The throughput of IDA is 64.99, which is better than existing different compared algorithms. The number of alive nodes in the proposed method is, and that of compared algorithms is; thus, IDA has enhanced network lifetime compared to others. The IDA algorithm is compared with NBA, FLPSOC, and ESO-LEACH, validating that the proposed algorithm performs better than the classical and compared algorithm.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"16 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888981","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}
Pub Date : 2024-05-04DOI: 10.1007/s12083-024-01687-x
Arian Arabnouri, Alireza Shafieinejad
Nowadays, smart healthcare and Electronic Health Record (EHR) play a significant role in simplifying the experience of medical treatment and cuts down the trivial work of paramedics. However, this poses significant challenges for organizations, including the management, transfer and protection of EHR which is vital for correct detection. To overcome these challenges, cloud computing presented which offers various attractive features for EHR management such as data availability, elasticity, and ubiquitous computation. However, the use of cloud computing introduces confidentiality and privacy concerns which can lead to human health threat. A trivial solution for this problem is encryption which makes searching a desired document infeasible, more specifically in big data scenarios. Although searchable encryption is a candidate solution, it suffers from keyword guessing attacks, malicious service providers, lack of trust, data integrity, and fairness. In this paper, we propose BACASE-SH framework that leverages blockchain technology to EHR integrity and availability insurance, fair payment, and establish trust among the involved parties. Moreover, we present a certificate-less authenticated asymmetric searchable encryption scheme to address challenges such as data owner (patient) and data user (physician) identity and keyword guessing attacks. The scheme is implemented using a smart contract, and the evaluation results show its efficiency.
{"title":"BACASE-SH: Blockchain-based authenticated certificate-less asymmetric searchable encryption for smart healthcare","authors":"Arian Arabnouri, Alireza Shafieinejad","doi":"10.1007/s12083-024-01687-x","DOIUrl":"https://doi.org/10.1007/s12083-024-01687-x","url":null,"abstract":"<p>Nowadays, smart healthcare and Electronic Health Record (EHR) play a significant role in simplifying the experience of medical treatment and cuts down the trivial work of paramedics. However, this poses significant challenges for organizations, including the management, transfer and protection of EHR which is vital for correct detection. To overcome these challenges, cloud computing presented which offers various attractive features for EHR management such as data availability, elasticity, and ubiquitous computation. However, the use of cloud computing introduces confidentiality and privacy concerns which can lead to human health threat. A trivial solution for this problem is encryption which makes searching a desired document infeasible, more specifically in big data scenarios. Although searchable encryption is a candidate solution, it suffers from keyword guessing attacks, malicious service providers, lack of trust, data integrity, and fairness. In this paper, we propose BACASE-SH framework that leverages blockchain technology to EHR integrity and availability insurance, fair payment, and establish trust among the involved parties. Moreover, we present a certificate-less authenticated asymmetric searchable encryption scheme to address challenges such as data owner (patient) and data user (physician) identity and keyword guessing attacks. The scheme is implemented using a smart contract, and the evaluation results show its efficiency.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"21 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-05-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888777","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}
Pub Date : 2024-05-03DOI: 10.1007/s12083-024-01712-z
Tripti Sharma, Sanjeev Kumar Prasad
Internet of Things (IoT) security refers to different aspects of security, including methods, tactics, and technologies used to protect these devices from unauthorized access. However, it is connected with multiple physical devices to perform huge tasks simultaneously and secure the data transmitted through the IoT network. Furthermore, the IoT is used to transmit sensitive data and validate security performance. Mostly Machine Learning (ML) algorithms are widely utilized for the process of anomaly detection. However the application of the ML model fails to detect attacks in IoT, to overcome this, a novel Stacked Long Short Term Memory based Willow Catkin Optimization (SLSTM-WCO) algorithm is proposed to detect intrusion anomalies in IoT networks. The complex patterns and abnormalities are predicted by determining the regularization method. Also, the deep learning (DL) model such as stacked LSTM detects the anomaly accurately and improves the effectiveness. The detection performance is validated by using benchmark datasets such as BoT-IoT, IoT network Intrusion, IoT-23, MQTT, and MQTTset which enhanced the efficiency. The outcome of the SLSTM-WCO method improved accuracy by 99.49% and improved anomaly detection in IoT networks compared to existing methods.
{"title":"Enhancing cybersecurity in IoT networks: SLSTM-WCO algorithm for anomaly detection","authors":"Tripti Sharma, Sanjeev Kumar Prasad","doi":"10.1007/s12083-024-01712-z","DOIUrl":"https://doi.org/10.1007/s12083-024-01712-z","url":null,"abstract":"<p>Internet of Things (IoT) security refers to different aspects of security, including methods, tactics, and technologies used to protect these devices from unauthorized access. However, it is connected with multiple physical devices to perform huge tasks simultaneously and secure the data transmitted through the IoT network. Furthermore, the IoT is used to transmit sensitive data and validate security performance. Mostly Machine Learning (ML) algorithms are widely utilized for the process of anomaly detection. However the application of the ML model fails to detect attacks in IoT, to overcome this, a novel Stacked Long Short Term Memory based Willow Catkin Optimization (SLSTM-WCO) algorithm is proposed to detect intrusion anomalies in IoT networks. The complex patterns and abnormalities are predicted by determining the regularization method. Also, the deep learning (DL) model such as stacked LSTM detects the anomaly accurately and improves the effectiveness. The detection performance is validated by using benchmark datasets such as BoT-IoT, IoT network Intrusion, IoT-23, MQTT, and MQTTset which enhanced the efficiency. The outcome of the SLSTM-WCO method improved accuracy by 99.49% and improved anomaly detection in IoT networks compared to existing methods.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"20 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140889896","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}
Pub Date : 2024-05-03DOI: 10.1007/s12083-024-01702-1
S. Saravanan, V. Surya, V. Valarmathi, E. Nalina
The requirement and the purpose of the IoT approach have developed substantially over the most recent few years. Here, IoT collects information from actual things, stores it, and then moves it to various organizations. Here, we use a Mobile Ad-Hoc Network (MANET) using IoT. MANET is highly delicate to malware which includes passive and active for the organization. Additionally, this paper shows the security angle-based IoT model utilizing AI. The black hole attack is one among these attacks which drops the entire information traffic and corrupts the organization's execution. In this way, it requires the designing of the novel Adaptive Defense Reinforcement Mountaineering Team Search (ADR-MTS) algorithm that distinguishes and safeguards the organization from the blackhole attack node. The role of ADR-MTS calculation recognizes the source directing and the sum of nodes that are been accomplished by the routing mechanism. This routing method assists with upgrading the course between the both objective node and the source node. The simulation analysis that performs MATLAB shows the improvement with regards to Packet Delivery Ratio (PDR). To improve the system efficiency a similar examination is performed against the current methodologies and from the study, the ADR-MTS calculation gives gainful outcomes concerning the location of black holes in the MANET-based IoT organizations The ADR-MTS method achieved a PDR of 98.7% and scalability of 98.5% and these results demonstrate the efficiency of the ADR-MTS method in comparison to existing methods.
{"title":"Enhancing IoT security in MANETs: A novel adaptive defense reinforcement approach","authors":"S. Saravanan, V. Surya, V. Valarmathi, E. Nalina","doi":"10.1007/s12083-024-01702-1","DOIUrl":"https://doi.org/10.1007/s12083-024-01702-1","url":null,"abstract":"<p>The requirement and the purpose of the IoT approach have developed substantially over the most recent few years. Here, IoT collects information from actual things, stores it, and then moves it to various organizations. Here, we use a Mobile Ad-Hoc Network (MANET) using IoT. MANET is highly delicate to malware which includes passive and active for the organization. Additionally, this paper shows the security angle-based IoT model utilizing AI. The black hole attack is one among these attacks which drops the entire information traffic and corrupts the organization's execution. In this way, it requires the designing of the novel Adaptive Defense Reinforcement Mountaineering Team Search (ADR-MTS) algorithm that distinguishes and safeguards the organization from the blackhole attack node. The role of ADR-MTS calculation recognizes the source directing and the sum of nodes that are been accomplished by the routing mechanism. This routing method assists with upgrading the course between the both objective node and the source node. The simulation analysis that performs MATLAB shows the improvement with regards to Packet Delivery Ratio (PDR). To improve the system efficiency a similar examination is performed against the current methodologies and from the study, the ADR-MTS calculation gives gainful outcomes concerning the location of black holes in the MANET-based IoT organizations The ADR-MTS method achieved a PDR of 98.7% and scalability of 98.5% and these results demonstrate the efficiency of the ADR-MTS method in comparison to existing methods.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"12 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888984","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}
Pub Date : 2024-05-03DOI: 10.1007/s12083-024-01692-0
Badiea Abdulkarem Mohammed, Mahmood A. Al-Shareeda, Abeer Abdullah Alsadhan, Zeyad Ghaleb Al-Mekhlafi, Amer A. Sallam, Bassam Ali Al-Qatab, Mohammad T. Alshammari, Abdulaziz M. Alayba
The state-of-the-art framework for VANETs, Vehicles in Network Simulation (VEINS), is primarily sparse and fragmented. The combination of VANETs and VEINS can improve road safety, efficiency, and user experience for connected and autonomous vehicles. This research examined existing trends and knowledge gaps to provide actionable insights for technical contexts and researchers. Therefore, this systematic literature evaluation was conducted to create a full classification of the article ecosystem. The literature applies the VEINS framework to simulate and evaluate in-vehicle personalized entertainment recommendations based on real-time traffic data and user preferences. We examine service metrics for VANET-integrated vehicle content exchange. Three databases were consulted throughout this study: Scopus, ScienceDirect, and IEEE Xplore. The databases had extensive VANET-related research built on the VEINS framework. Then, screening was completed based on the services considerations. The topic is thoroughly covered in this categorization. Taxonomy proposes categories and subcategories. The initial group includes papers discussing different aspects of VANET-based VEINS framework applications (35/9878 total). The second group consists of pieces that focus on the answer (15/98 total). Network-related articles (48/98 total) make up the final section. This work concludes with a discussion of the VEINS framework’s design and bidirectional connectivity. This study could be helpful for researchers working on VANETs and the VEINS framework by highlighting areas where further development is necessary.
{"title":"Service based VEINS framework for vehicular Ad-hoc network (VANET): A systematic review of state-of-the-art","authors":"Badiea Abdulkarem Mohammed, Mahmood A. Al-Shareeda, Abeer Abdullah Alsadhan, Zeyad Ghaleb Al-Mekhlafi, Amer A. Sallam, Bassam Ali Al-Qatab, Mohammad T. Alshammari, Abdulaziz M. Alayba","doi":"10.1007/s12083-024-01692-0","DOIUrl":"https://doi.org/10.1007/s12083-024-01692-0","url":null,"abstract":"<p>The state-of-the-art framework for VANETs, Vehicles in Network Simulation (VEINS), is primarily sparse and fragmented. The combination of VANETs and VEINS can improve road safety, efficiency, and user experience for connected and autonomous vehicles. This research examined existing trends and knowledge gaps to provide actionable insights for technical contexts and researchers. Therefore, this systematic literature evaluation was conducted to create a full classification of the article ecosystem. The literature applies the VEINS framework to simulate and evaluate in-vehicle personalized entertainment recommendations based on real-time traffic data and user preferences. We examine service metrics for VANET-integrated vehicle content exchange. Three databases were consulted throughout this study: Scopus, ScienceDirect, and IEEE Xplore. The databases had extensive VANET-related research built on the VEINS framework. Then, screening was completed based on the services considerations. The topic is thoroughly covered in this categorization. Taxonomy proposes categories and subcategories. The initial group includes papers discussing different aspects of VANET-based VEINS framework applications (35/9878 total). The second group consists of pieces that focus on the answer (15/98 total). Network-related articles (48/98 total) make up the final section. This work concludes with a discussion of the VEINS framework’s design and bidirectional connectivity. This study could be helpful for researchers working on VANETs and the VEINS framework by highlighting areas where further development is necessary.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"5 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-05-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888774","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}
Green edge-assisted unmanned aerial vehicle (eUAV) network is an emerging network architecture enhanced with the energy efficiency technology that provides an ubiquitous communication for air and ground. It is considered a promising technology that can maintain a balance between a clean environment and a rich human life to build a sustainable world. However, the security issues exposed by UAVs have raised concerns about the trust and security for adopting eUAV network for communication. To this end, a trust assessment as a service (TaaS) scheme for secure communication of green eUAV network is proposed. The TaaS can effectively collect the valid data of UAVs about diverse and dynamic quality of service (QoS) attributes related to energy efficiency. To predict the actual data of UAVs about QoS attributes in the real green eUAV environment, an service level object calibration method is presented in TaaS. In addition, to accurately obtain the trust level of UAVs in the eUAV network, TaaS presents a trust level assessment method integrated the interval multi-attribute decision-making method and the objective weight assignment method based on deviation maximization. A case study with open source dataset and a performance analysis experiment are conducted to show that the proposed TaaS scheme can accurately and effectively assess the trust level of UAVs while outperforming other traditional trust assessment methods.
绿色边缘辅助无人飞行器(eUAV)网络是一种新兴的网络架构,采用节能技术,为空中和地面提供无处不在的通信。它被认为是一种前景广阔的技术,可以在清洁环境和丰富人类生活之间保持平衡,从而建设一个可持续发展的世界。然而,无人机暴露出的安全问题引发了人们对采用电子无人机网络进行通信的信任和安全性的担忧。为此,我们提出了一种用于绿色无人机网络安全通信的信任评估即服务(TaaS)方案。TaaS 可有效收集无人机与能效相关的各种动态服务质量(QoS)属性的有效数据。为了预测真实绿色无人机环境中无人机有关 QoS 属性的实际数据,在 TaaS 中提出了一种服务级对象校准方法。此外,为准确获取无人机在无人机网络中的信任度,TaaS 提出了一种信任度评估方法,该方法集成了区间多属性决策方法和基于偏差最大化的目标权重分配方法。通过开源数据集的案例研究和性能分析实验表明,所提出的 TaaS 方案能够准确有效地评估无人机的信任度,同时优于其他传统的信任度评估方法。
{"title":"Taas: Trust assessment as a service for secure communication of green edge-assisted UAV network","authors":"Qixu Wang, Peng Xiao, Xiang Li, Yunxiang Qiu, Tao Zheng, Zhiguang Qin","doi":"10.1007/s12083-024-01701-2","DOIUrl":"https://doi.org/10.1007/s12083-024-01701-2","url":null,"abstract":"<p>Green edge-assisted unmanned aerial vehicle (eUAV) network is an emerging network architecture enhanced with the energy efficiency technology that provides an ubiquitous communication for air and ground. It is considered a promising technology that can maintain a balance between a clean environment and a rich human life to build a sustainable world. However, the security issues exposed by UAVs have raised concerns about the trust and security for adopting eUAV network for communication. To this end, a trust assessment as a service (TaaS) scheme for secure communication of green eUAV network is proposed. The TaaS can effectively collect the valid data of UAVs about diverse and dynamic quality of service (QoS) attributes related to energy efficiency. To predict the actual data of UAVs about QoS attributes in the real green eUAV environment, an service level object calibration method is presented in TaaS. In addition, to accurately obtain the trust level of UAVs in the eUAV network, TaaS presents a trust level assessment method integrated the interval multi-attribute decision-making method and the objective weight assignment method based on deviation maximization. A case study with open source dataset and a performance analysis experiment are conducted to show that the proposed TaaS scheme can accurately and effectively assess the trust level of UAVs while outperforming other traditional trust assessment methods.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"7 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-04-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140809413","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}
Pub Date : 2024-04-27DOI: 10.1007/s12083-024-01654-6
Rafiq Ullah, Amjad Mehmood, Muhammad Altaf Khan, Carsten Maple, Jaime Lloret
Certificateless Proxy Signature (CLPS) offers a comprehensive authentication mechanism to ensure the optimal solutions from modern forgery attacks in Industrial Internet of Things (IIoTs) environment. CLPS is part of certificateless public key cryptography (CL-PKC) and has the benefits of eradicating many issues like key distribution problem. Although costly computational processing capabilities are consumed by smart devices during authentication process. This article proposed an authentication scheme for CLPS by using the mathematical cryptographic curve concepts of Hyper Elliptic Curve (HEC) to provide a secure and optimized communication approach in IIoTs environment. The arises key distribution problem in CLPS is also fixed. The scrutinized security analysis of proxy signature and delegation signature were performed to tackle different attacks like Machine-in-the-middle Attack (MiTM), Replay Attack, Key Replacement Attack, Impersonation Attack, and Chosen Message Attack. Due to HEC-DLP the forgery attack cannot succeeded. Finally, the proposed work is formally verified through the AVISPA tool. The comprehensive performance evaluation shows that the total computational cost is reduced to 49.48% and the communication overhead size is reduced to 49.57% with a comparative analysis of existing schemes. Thus, the proposed approach eradicates key distribution problems with an equal security level of RSA and ECC.
{"title":"An optimal secure and reliable certificateless proxy signature for industrial internet of things","authors":"Rafiq Ullah, Amjad Mehmood, Muhammad Altaf Khan, Carsten Maple, Jaime Lloret","doi":"10.1007/s12083-024-01654-6","DOIUrl":"https://doi.org/10.1007/s12083-024-01654-6","url":null,"abstract":"<p>Certificateless Proxy Signature (CLPS) offers a comprehensive authentication mechanism to ensure the optimal solutions from modern forgery attacks in Industrial Internet of Things (IIoTs) environment. CLPS is part of certificateless public key cryptography (CL-PKC) and has the benefits of eradicating many issues like key distribution problem. Although costly computational processing capabilities are consumed by smart devices during authentication process. This article proposed an authentication scheme for CLPS by using the mathematical cryptographic curve concepts of Hyper Elliptic Curve (HEC) to provide a secure and optimized communication approach in IIoTs environment. The arises key distribution problem in CLPS is also fixed. The scrutinized security analysis of proxy signature and delegation signature were performed to tackle different attacks like Machine-in-the-middle Attack (MiTM), Replay Attack, Key Replacement Attack, Impersonation Attack, and Chosen Message Attack. Due to HEC-DLP the forgery attack cannot succeeded. Finally, the proposed work is formally verified through the AVISPA tool. The comprehensive performance evaluation shows that the total computational cost is reduced to 49.48% and the communication overhead size is reduced to 49.57% with a comparative analysis of existing schemes. Thus, the proposed approach eradicates key distribution problems with an equal security level of RSA and ECC.</p>","PeriodicalId":49313,"journal":{"name":"Peer-To-Peer Networking and Applications","volume":"36 1","pages":""},"PeriodicalIF":4.2,"publicationDate":"2024-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140799521","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}