Ad Hoc Networks最新文献_第2页

Growth-adaptive distillation compressed fusion model for network traffic identification based on IoT cloud–edge collaboration 基于物联网云边协作的网络流量识别的增长自适应蒸馏压缩融合模型

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-10-18 DOI: 10.1016/j.adhoc.2024.103676

Yang Yang, Chengwen Fan, Shaoyin Chen, Zhipeng Gao, Lanlan Rui

{"title":"Growth-adaptive distillation compressed fusion model for network traffic identification based on IoT cloud–edge collaboration","authors":"Yang Yang, Chengwen Fan, Shaoyin Chen, Zhipeng Gao, Lanlan Rui","doi":"10.1016/j.adhoc.2024.103676","DOIUrl":"10.1016/j.adhoc.2024.103676","url":null,"abstract":"<div><div>The development of the Internet of Things (IoT) has led to the rapid growth of the types and number of connected devices and has generated large amounts of complex and diverse traffic data. Traffic identification on edge servers solves the real-time and privacy requirements of IoT management and has attracted much attention, but still faces several problems: (1) traditional machine learning (ML) models rely on artificially constructed features, and the existing deep learning (DL) traffic identification models have reached their performance limit; and (2) insufficient computing resources of edge servers limit the possible improvement in the performance of deep learning models by increasing the number of parameters and structural complexity. To address these issues, we propose a lightweight fusion model. First, the Network-in-Network (NiN) model and Random Forest (RF) model are used on the cloud server to construct a traffic identification fusion model. The excellent representation extraction capability of the NiN compensates for the RF’s dependence on manual feature extraction, and its modular structure is suitable for the subsequent model compression operations. Then, the NiN was distilled. We propose Growth-Adaptive Distillation to lightweight the NiN model, which can reduce the operation of manually adjusting the structure of the student model and ensure the efficiency and low power consumption of the fusion model deployment. In addition, both the RF in the cloud and the distilled NiN are deployed on the edge server. Comparisons with multiple algorithms on two network traffic datasets show that the proposed model achieves state-of-the-art performance while ensuring the use of minimal computational resources.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142573350","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Approximation schemes for age of information minimization in UAV grid patrols 无人机网格巡逻中信息年龄最小化的近似方案

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-10-18 DOI: 10.1016/j.adhoc.2024.103686

Weiqi Wang , Jin Xu

{"title":"Approximation schemes for age of information minimization in UAV grid patrols","authors":"Weiqi Wang , Jin Xu","doi":"10.1016/j.adhoc.2024.103686","DOIUrl":"10.1016/j.adhoc.2024.103686","url":null,"abstract":"<div><div>Motivated by the critical need for unmanned aerial vehicles (UAVs) to patrol grid systems in hazardous and dynamically changing environments, this study addresses a routing problem aimed at minimizing the time-average Age of Information (AoI) for edges in general graphs. We establish a lower bound for all feasible patrol policies and demonstrate that this bound is tight when the graph contains an Eulerian cycle. For graphs without Eulerian cycles, it becomes challenging to identify the optimal patrol strategy due to the extensive range of feasible options. Our analysis shows that restricting the strategy to periodic sequences still results in an exponentially large number of possible strategies. To address this complexity, we introduce two polynomial-time approximation schemes, each involving a two-step process: constructing multigraphs first and then embedding Eulerian cycles within these multigraphs. We prove that both schemes achieve an approximation ratio of 2. Further, both analytical and numerical results suggest that evenly and sparsely distributing edge visits within a periodic route significantly reduces the average AoI compared to strategies that merely minimize the route travel distance. Building on this insight, we propose a heuristic method that not only maintains the approximation ratio of 2 but also ensures robust performance across varying random graphs.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533785","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Requester mobility for mobile crowdsensing system: A dynamic alliance-based incentive mechanism 移动人群感应系统的请求者流动性：基于联盟的动态激励机制

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-10-16 DOI: 10.1016/j.adhoc.2024.103680

Zhilin Xu , Hao Sun , Panfei Sun , Qianqian Kong

{"title":"Requester mobility for mobile crowdsensing system: A dynamic alliance-based incentive mechanism","authors":"Zhilin Xu , Hao Sun , Panfei Sun , Qianqian Kong","doi":"10.1016/j.adhoc.2024.103680","DOIUrl":"10.1016/j.adhoc.2024.103680","url":null,"abstract":"<div><div>In the Mobile Crowdsensing (MCS) system, due to the heterogeneity of requesters, they are in mobile which means requesters will join or leave the MCS system at different times and their data demands are time-varying. The uncertainty of requesters caused by requester mobility will generate the instability of the match between requesters and participants which means the established matching algorithm cannot be completed due to the dissatisfaction of requesters and participants caused by the changes in the intensity of competition. For requester mobility, we design a dynamic alliance-based incentive mechanism where requesters can leave, join the MCS system separately, and change their data needs. To the instability, we divide the dynamic mechanism into different stages and will update the matching rules in each stage. A unique algorithm based on the dynamic Stackelberg game and the corresponding updated algorithm is proposed to analyze the matching strategies of requesters and participants to make an optimal match. By proving the stability of the updated rules, we guarantee the stability of the match with requester mobility. Through numerical analysis, alliance formation can significantly reduce weak requesters’ costs by at most 90%. Besides, in our mechanism any requester participates in the game at most twice, the chosen rate can be up to 100%.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533787","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

FLAV: Federated Learning for Autonomous Vehicle privacy protection FLAV：为保护自主车辆隐私而进行的联合学习

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-10-16 DOI: 10.1016/j.adhoc.2024.103685

Yingchun Cui , Jinghua Zhu , Jinbao Li

{"title":"FLAV: Federated Learning for Autonomous Vehicle privacy protection","authors":"Yingchun Cui , Jinghua Zhu , Jinbao Li","doi":"10.1016/j.adhoc.2024.103685","DOIUrl":"10.1016/j.adhoc.2024.103685","url":null,"abstract":"<div><div>Autonomous Vehicle Systems are committed to safer, more efficient and more convenient transportation on the roads of the future. However, concerns about vehicle data privacy and security remain significant. Federated Learning, as a decentralized machine learning approach, allows multiple devices or data sources to collaboratively train models without sharing raw data, providing essential privacy protection. In this paper, we propose a privacy-preserving framework for autonomous vehicles, named FLAV. First, we use a multi-chain parallel aggregation strategy to transmit model parameters and design a model parameter filtering mechanism, which reduces communication overhead by filtering out the local model parameters of certain vehicles, thereby alleviating bandwidth pressure. Second, we introduce a dynamic adjustment mechanism that automatically adjusts regularization strength by comparing each vehicle’s local parameters with the cumulative parameters of preceding vehicles in the chain. This mechanism balances local training with global consistency, ensuring the model’s adaptability to local data while improving coordination between vehicles in the chain. Experimental results demonstrate that our proposed method reduces communication costs while improving model accuracy and privacy protection level, effectively ensuring the security of autonomous driving data.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533687","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

DDQN-based online computation offloading and application caching for dynamic edge computing service management 基于 DDQN 的在线计算卸载和应用缓存，用于动态边缘计算服务管理

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-10-11 DOI: 10.1016/j.adhoc.2024.103681

Shudong Wang, Zhi Lu, Haiyuan Gui, Xiao He, Shengzhe Zhao, Zixuan Fan, Yanxiang Zhang, Shanchen Pang

{"title":"DDQN-based online computation offloading and application caching for dynamic edge computing service management","authors":"Shudong Wang, Zhi Lu, Haiyuan Gui, Xiao He, Shengzhe Zhao, Zixuan Fan, Yanxiang Zhang, Shanchen Pang","doi":"10.1016/j.adhoc.2024.103681","DOIUrl":"10.1016/j.adhoc.2024.103681","url":null,"abstract":"<div><div>Multi-access Edge Computing (MEC) reduces task service latency and energy consumption by offloading computing tasks to MEC servers. However, constrained by the limited bandwidth and computing resources, MEC servers often cannot parallelly process all computing tasks. Simultaneously, the high dynamism of service popularity necessitates MEC servers to dynamically update cached applications, under ensuring compliance with storage resource constraints and the system cache updating cost budget for service providers. In response to the above two issues, this paper firstly formulates computation offloading and application caching as a dual-timescale decision optimization problem, aiming to minimize the average service latency for users by obtaining optimal offloading decision, cache decision, transmission bandwidth, and computing resource. Then, we propose a Deep Reinforcement Learning (DRL)-based two-stage online computation offloading and application caching (DTSO2C) algorithm, effectively stabilizing application cache update costs and enhancing Quality of Service (QoS) for users. Furthermore, we utilize convex optimization algorithms to derive the optimal communication bandwidth and computing resource allocation strategy, further reducing the average service latency for users. Simulation results demonstrate that the DTSO2C algorithm outperforms the compared algorithms, achieving an average reduction in service latency of 66.2%, with an average cache update cost of only 0.15 USD per time frame.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142446670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Generalized stochastic Petri net-based performance analysis of a Wi-Fi network probe in a dynamic QoX management system 基于广义随机 Petri 网的动态 QoX 管理系统中 Wi-Fi 网络探测器性能分析

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-10-11 DOI: 10.1016/j.adhoc.2024.103683

Luis Zabala, Leire Cristobo, Eva Ibarrola, Armando Ferro

{"title":"Generalized stochastic Petri net-based performance analysis of a Wi-Fi network probe in a dynamic QoX management system","authors":"Luis Zabala, Leire Cristobo, Eva Ibarrola, Armando Ferro","doi":"10.1016/j.adhoc.2024.103683","DOIUrl":"10.1016/j.adhoc.2024.103683","url":null,"abstract":"<div><div>Over the years, the concept of Quality of Service (QoS) has evolved from traditional network performance metrics to include Quality of Experience (QoE) considerations. This evolution also encompasses various business-related aspects, such as the impact of service quality on customer satisfaction, the alignment of service offerings with market demands, and the optimization of resource allocation to ensure cost-effectiveness and competitive advantage. This comprehensive approach, considering all the QoS dimensions (QoX), ensures the proper management of QoS across different services, contexts and technologies. Building on this broader QoX framework, it is essential to rely on advanced monitoring tools capable of handling the complexity introduced by these new demands. In this context, this paper describes a Generalized Stochastic Petri Net (GSPN) based model to analyze the performance of a Wi-Fi network probe in terms of computational capacity. The probe node plays a crucial role in a distributed monitoring system designed to implement a machine learning based global QoX management framework. Hence, the model explores the probe's computational resources to handle supplementary machine learning tasks alongside its typical packet capture and data processing responsibilities. Additionally, the model can evaluate the efficiency of the probe node under different scenarios, providing valuable insight into the potential need for additional resources at the node as operational demands continue to evolve.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533784","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

New routing method based on sticky bacteria algorithm and link stability for VANET 基于粘性细菌算法和链路稳定性的新型 VANET 路由方法

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-10-10 DOI: 10.1016/j.adhoc.2024.103682

Jie Zhang , Lei Zhang , De-gan Zhang , Ting Zhang , Shuo Wang , Cheng-hui Zou

{"title":"New routing method based on sticky bacteria algorithm and link stability for VANET","authors":"Jie Zhang , Lei Zhang , De-gan Zhang , Ting Zhang , Shuo Wang , Cheng-hui Zou","doi":"10.1016/j.adhoc.2024.103682","DOIUrl":"10.1016/j.adhoc.2024.103682","url":null,"abstract":"<div><div>With the rapid development of Telematics, the role of edge computing (Mobile Edge Computing, MEC) is becoming more and more significant. Mobile users can obtain massive computing and storage resources in a local way, thus effectively solving the congestion problem of the core network. However, in general urban edge network scenarios of VANET (Vehicular Ad-hoc Network), due to low node density and poor connectivity, there are few chances to encounter suitable forwarding nodes. In order to avoid the above situation and adapt to sparse scenarios, we propose new link-stabilized routing method & protocol based on sticky bacteria algorithm in this paper. The new idea and the significant findings of this proposed algorithm in enhancing the routing protocol is as follows: five factors affecting routing decision are identified: evaluation distance, deflection angle, number of neighboring nodes, rate difference, and the traffic of the road section at which it is located, and then these five factors are comprehensively evaluated by using the our designed Analytic Hierarchy Process (AHP) strategy, so as to determine the score of each node and the candidate routing paths; And the best routing path between two communicating nodes is found through the stronger global exploration capability of the sticky bacteria algorithm. Our experiments (that are based on our developed C++ programs) have proved that the method proposed in this paper has stronger link stability and the highest packet delivery rate. And the experiments and their results has enhanced our new method credibility in the field of ad hoc networks.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142533783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Age of information optimal UAV swarm-assisted sweep coverage in wireless sensor networks 无线传感器网络中最优无人机群辅助清扫覆盖的信息时代

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-10-07 DOI: 10.1016/j.adhoc.2024.103675

Li Li, Hongbin Chen

{"title":"Age of information optimal UAV swarm-assisted sweep coverage in wireless sensor networks","authors":"Li Li, Hongbin Chen","doi":"10.1016/j.adhoc.2024.103675","DOIUrl":"10.1016/j.adhoc.2024.103675","url":null,"abstract":"<div><div>For sweep coverage in wireless sensor networks (WSNs), the freshness of data directly affects the efficiency of task execution, and time is needed to continuously cover points of interest (POIs) to ensure obtaining all the data. However, existing studies ignored both. The outdated data and missing data may lead to decision-making errors, resulting in significant losses. To address this issue, this paper proposes a simultaneous sweep mode and a batch sweep mode of Unmanned Aerial Vehicle (UAV) swarm to achieve sweep coverage in WSNs, considering the freshness of data and the continuous coverage time of POIs, where the age of information (AoI) is adopted to measure the freshness of data. The target is to minimize the average AoI of POIs under the continuous coverage time constraint and the constraints of UAV swarm. Firstly, the POIs are clustered to obtain the best sweep points. Then, the UAV swarm sweep coverage (USSC) algorithm is designed for the two sweep modes. Finally, various simulations are conducted to verify the performance of the USSC algorithm. Simulation results show that the USSC algorithm can effectively minimize the average AoI compared to baseline algorithms. <em>The script of the proposed algorithm can be found from:</em> <span><span>https://github.com/lilibeat/USSC</span><svg><path></path></svg></span><em>.</em></div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142418808","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A cache-aware congestion control mechanism using deep reinforcement learning for wireless sensor networks 使用深度强化学习的无线传感器网络缓存感知拥塞控制机制

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-10-04 DOI: 10.1016/j.adhoc.2024.103678

Melchizedek Alipio , Miroslav Bures

{"title":"A cache-aware congestion control mechanism using deep reinforcement learning for wireless sensor networks","authors":"Melchizedek Alipio , Miroslav Bures","doi":"10.1016/j.adhoc.2024.103678","DOIUrl":"10.1016/j.adhoc.2024.103678","url":null,"abstract":"<div><div>In Wireless Sensor Networks (WSN) communication protocols, rule-based approaches have been traditionally used for managing caching and congestion control. These approaches rely on explicitly defined, unchanging models. Recently, a trend has been toward incorporating adaptive methods that leverage machine learning (ML), including its subset deep learning (DL), during network congestion conditions. However, an adaptive cache-aware congestion control mechanism using Deep Reinforcement Learning (DRL) in WSN has not yet been explored. Therefore, this study developed a DRL-based adaptive cache-aware congestion control mechanism called DRL-CaCC to alleviate WSN during congestion scenarios. The DRL-CaCC uses intermediate caching parameters as its state space and adaptively moves the congestion window as its action space through the Rapid Start and DRL algorithms. The mechanism aims to find the optimal congestion window movement to avoid further network congestion while ensuring maximum cache utilization. Results show that DRL-CaCC achieved an average improvement gain between 20% and 40% compared to its baseline protocol, RT-CaCC. Finally, DRL-CaCC outperformed other caching-based and DRL-based congestion control protocols in terms of cache utilization, throughput, end-to-end delay, and packet loss metrics, with improvement gains between 10% and 30% in various congestion scenarios in WSN.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142418810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

AI-optimized elliptic curve with Certificate-Less Digital Signature for zero trust maritime security 人工智能优化的椭圆曲线与无证书数字签名，实现零信任的海事安全

IF 4.4 3区计算机科学

Ad Hoc Networks Pub Date : 2024-10-03 DOI: 10.1016/j.adhoc.2024.103669

Mohammed Al-Khalidi , Rabab Al-Zaidi , Tarek Ali , Safiullah Khan , Ali Kashif Bashir

{"title":"AI-optimized elliptic curve with Certificate-Less Digital Signature for zero trust maritime security","authors":"Mohammed Al-Khalidi , Rabab Al-Zaidi , Tarek Ali , Safiullah Khan , Ali Kashif Bashir","doi":"10.1016/j.adhoc.2024.103669","DOIUrl":"10.1016/j.adhoc.2024.103669","url":null,"abstract":"<div><div>The proliferation of sensory applications has led to the development of the Internet of Things (IoT), which extends connectivity beyond traditional computing platforms and connects all kinds of everyday objects. Marine Ad Hoc Networks are expected to be an essential part of this connected world, forming the Internet of Marine Things (IoMaT). However, marine IoT systems are often highly distributed, and spread across large sparse areas which makes it challenging to implement and manage centralized security measures. Despite some ongoing efforts to establish network connectivity in such environment, securing these networks remains an unreached goal. The use of Certificate-Less Digital Signatures (CLDS) with Elliptic Curve Cryptography (ECC) shows great promise in providing secure communication in these networks and achieving zero trust IoMaT security. By eliminating the need for certificates and associated key management infrastructure, CLDS simplifies the key management process. ECC also enables secure communication with smaller key sizes and faster processing times, which is crucial for resource-limited IoMaT devices. In this paper, we introduce CLDS using ECC as a means of securing IoT networks in a marine environment, creating a zero trust security framework for Internet of Marine Things (IoMaT). To increase security and robustness of the framework, we optimize the ECC parameters using two vital artificial intelligence algorithms, namely Genetic Algorithm (GA) and Particle Swarm Optimization (PSO). Evaluation results demonstrate a reduction in ECC parameter generation time by over 40% with GA optimization and 20% with PSO optimization. Additionally, the computational cost and memory usage for major ECC attacks increased significantly by up to 40% and 67% for Rho attacks, 34% and 53% for brute-force attacks, and 30% and 67% for improved hybrid attacks, respectively.</div></div>","PeriodicalId":55555,"journal":{"name":"Ad Hoc Networks","volume":null,"pages":null},"PeriodicalIF":4.4,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142418809","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0