Computer Networks最新文献_第8页

Collaborative cloud–edge task scheduling scheme in the networked UAV Internet of Battlefield Things (IoBT) territories based on deep reinforcement learning model

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-28 DOI: 10.1016/j.comnet.2025.111156

Mustafa Ibrahim Khaleel

{"title":"Collaborative cloud–edge task scheduling scheme in the networked UAV Internet of Battlefield Things (IoBT) territories based on deep reinforcement learning model","authors":"Mustafa Ibrahim Khaleel","doi":"10.1016/j.comnet.2025.111156","DOIUrl":"10.1016/j.comnet.2025.111156","url":null,"abstract":"<div><div>Multiaccess cloud–edge computing (MCEC) represents a burgeoning technology facilitating the delegation of mobile application tasks, especially those demanding swift processing and substantial computational capabilities, to cloud data centers. The intricate maneuvering of unmanned aerial vehicles (UAVs) in interconnected combat cloud systems poses a noteworthy challenge in determining the optimal distribution of task offloading. Uneven task allocation to specific UAVs could result in heightened latency and diminished reliability. We consider combat cloud networks over various regions, each with numerous edge servers that will be connected to different independent UAVs over high-speed links, to handle latency-sensitive and compute-intensive tasks in three possible offloading alternatives: using the nearest edge server, using neighboring edges, and using far-cloud resources. The contribution of this work is a two-step procedure involving reinforcement learning (RL) technique to handle the challenge of cloud–edge servers’ task allocation and to determine the most effective offloading approach that minimizes latency, maximizing reliability. First, it deals with the issues related to task distribution in combat cloud systems, centered on optimizing the balance between latency and reliability in case of task delegation to UAVs. It involves making strategic decisions on when and where tasks can be migrated by considering the mobility of the unmanned aerial systems. The second contribution is based on performing an RL algorithm in a collaborative UAV cluster. Compared with the other two methods, our algorithm improves the latency by about 20%–40% and enhances reliability by about 13%–28% in terms of non-violation of QoS constraints.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"261 ","pages":"Article 111156"},"PeriodicalIF":4.4,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143529381","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

AUV-aided isolated sub-network prevention for reliable data collection by underwater wireless sensor networks

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-28 DOI: 10.1016/j.comnet.2025.111154

Chandra Sukanya Nandyala, Ho-Shin Cho

{"title":"AUV-aided isolated sub-network prevention for reliable data collection by underwater wireless sensor networks","authors":"Chandra Sukanya Nandyala, Ho-Shin Cho","doi":"10.1016/j.comnet.2025.111154","DOIUrl":"10.1016/j.comnet.2025.111154","url":null,"abstract":"<div><div>The unique characteristics of the underwater environment, such as limited infrastructure, challenging acoustic communication channels, and constrained battery power of underwater sensor nodes, significantly impact the overall network lifetime of underwater wireless sensor networks (UWSNs). In a multi-hop UWSN, the death of a special node — cut-vertex (CV) — divides the network into the main network and an isolated sub-network (ISN). The UWSN may struggle to operate continuously and efficiently owing to the death of underwater sensor nodes, resulting in a shorter network lifetime and reduced data reliability. Consequently, the data generated by the ISN is lost. To address this issue, this paper presents an autonomous underwater vehicle (AUV)-aided ISN prevention protocol for UWSNs. The proposed protocol employs an AUV to explore and identify a CV by utilizing the information collected from the sensor nodes. Subsequently, the AUV predicts the future residual energy of the CV, ensuring its arrival near the CV prior to the energy depletion of the CV and the formation of an ISN. Then, instead of the CV, the AUV directly collects data from the CV-associated sensor nodes while the CV harvests energy. The CV replenishes its energy by harnessing ambient underwater sources and subsequently reintegrates into the network after attaining sufficient energy recharge. In this study, we evaluate the performance of the proposed protocol by comparing it with the Q-learning-based topology-aware routing protocol, a hybrid data-collection scheme, stratification-based data-collection scheme, and Q-learning-based energy-efficient and lifetime-aware routing protocol in terms of the lifetime of the network, lifetime of the CVs, energy consumption, end-to-end delay, and packet delivery ratio.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"262 ","pages":"Article 111154"},"PeriodicalIF":4.4,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143580695","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Design of a provable secure lightweight privacy-preserving authentication protocol for autonomous vehicles in IoT systems

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-28 DOI: 10.1016/j.comnet.2025.111155

Mohd Shariq , Ismail Taha Ahmed , Mehedi Masud , Aymen Dia Eddine Berini , Norziana Jamil

{"title":"Design of a provable secure lightweight privacy-preserving authentication protocol for autonomous vehicles in IoT systems","authors":"Mohd Shariq , Ismail Taha Ahmed , Mehedi Masud , Aymen Dia Eddine Berini , Norziana Jamil","doi":"10.1016/j.comnet.2025.111155","DOIUrl":"10.1016/j.comnet.2025.111155","url":null,"abstract":"<div><div>The rapid advancement of the Internet of Things (IoT) has enabled the adoption of autonomous vehicles (AVs) and drones in intelligent transportation systems (ITS), improving traffic efficiency and safety. However, security and privacy in interconnected ITS environments is a major concern. It is imperative to safeguard sensitive information from various known attacks while enabling secure communication. Keeping in view the security and privacy of autonomous vehicles in IoT systems, this paper puts forward Provable Secure Lightweight Privacy-Preserving Authentication Protocol (PSLAP). The proposed PSLAP protocol achieves high-level security by utilizing cryptographic primitives such as exclusive-OR, secure one-way hash, elliptic curve cryptography (ECC), and concatenation operators. The proposed PSLAP protocol is demonstrated to be resistant to numerous known security assaults through an informal security and privacy assessment. This study presents a formal security analysis using a widely accepted real-or-random (ROR) model which demonstrates the security hardness of the proposed scheme. Additionally, the performance analysis shows that the proposed protocol has minimal computation and communication costs compared to other existing protocols.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"261 ","pages":"Article 111155"},"PeriodicalIF":4.4,"publicationDate":"2025-02-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143529382","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Dynamic pricing and scheduling in LEO satellite networks

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-27 DOI: 10.1016/j.comnet.2025.111152

Xianglong Li , Kaiwei Mo , Zongpeng Li , Hong Xu

{"title":"Dynamic pricing and scheduling in LEO satellite networks","authors":"Xianglong Li , Kaiwei Mo , Zongpeng Li , Hong Xu","doi":"10.1016/j.comnet.2025.111152","DOIUrl":"10.1016/j.comnet.2025.111152","url":null,"abstract":"<div><div>The dynamic nature of Low Earth Orbit (LEO) satellite networks, characterized by high-speed movement, narrow coverage, uneven spatial distribution and multi-satellite coordination, presents unique challenges and opportunities for network resource allocation. Existing literature has not fully addressed all the practical implementation challenges in LEO satellite networks; the predefined LEO pricing system lacks flexibility and does not consider user utility. This work introduces an auction-based framework to dynamically price and schedule Internet services in LEO satellite networks, optimizing resource allocation among users. We model the NP-Hard LEO Internet service scheduling problem into an Integer Linear Programming (ILP), providing both primal and dual forms. Leveraging an auction mechanism design, our online algorithm OSAL efficiently distributes satellite network resources while maximizing social welfare by ensuring resources are allocated to users who value them most. We demonstrate that OSAL effectively addresses the complexities of node mobility and spatial coverage in LEO satellites, improving the availability and efficiency of Internet services in this rapidly evolving field.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"262 ","pages":"Article 111152"},"PeriodicalIF":4.4,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143551385","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Computer network optimization using the power metric for multiple flows: Part I

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-27 DOI: 10.1016/j.comnet.2025.111153

Meng-Jung Chloe Tsai, Leonard Kleinrock

{"title":"Computer network optimization using the power metric for multiple flows: Part I","authors":"Meng-Jung Chloe Tsai, Leonard Kleinrock","doi":"10.1016/j.comnet.2025.111153","DOIUrl":"10.1016/j.comnet.2025.111153","url":null,"abstract":"<div><div>With the rapid expansion of networks and increasing traffic, optimizing network performance has become increasingly important, especially in balancing two competing objectives: increasing throughput and decreasing delay. This paper adopts the Power metric to address this tradeoff, extending the analysis to a general multi-flow model and examining the influence of different queueing disciplines. We introduce three forms of power metrics–<strong>individual power</strong>, <strong>sum of powers</strong>, and <strong>average power</strong>–to capture performance in a multi-flow context. Individual power optimizes each flow’s end-to-end performance, while sum of powers and average power provide a system-wide perspective. These three power metrics are analyzed and optimized under an M/M/1 queueing systems setting, considering two extreme flow discrimination priority disciplines–First-Come, First-Served (FCFS) and Head-of-Line (HOL)–to capture their discriminatory effect on response time while maintaining power optimization. This work is a first step in examining the tradeoff of throughput and delay in queueing systems from various perspectives and across different priority group disciplines. The optimization results aim to provide theoretical insights and guidance for system designers in performance optimization.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"263 ","pages":"Article 111153"},"PeriodicalIF":4.4,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143687200","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A novel Layer 2 framework for breaking the blockchain trilemma problem using MPC-in-the-Head

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-27 DOI: 10.1016/j.comnet.2025.111148

Saeed Banaeian Far , Mohammad Reza Chalak Qazani , Seyed Mojtaba Hosseini Bamakan , Azadeh Imani Rad , Ahad Zareravasan

{"title":"A novel Layer 2 framework for breaking the blockchain trilemma problem using MPC-in-the-Head","authors":"Saeed Banaeian Far , Mohammad Reza Chalak Qazani , Seyed Mojtaba Hosseini Bamakan , Azadeh Imani Rad , Ahad Zareravasan","doi":"10.1016/j.comnet.2025.111148","DOIUrl":"10.1016/j.comnet.2025.111148","url":null,"abstract":"<div><div>The blockchain trilemma, which poses inherent trade-offs among security, scalability, and decentralization, remains a critical challenge in blockchain technology. While numerous Layer 1 (L1) blockchains and Layer 2 (L2) scaling solutions have attempted to address these dimensions, no single approach has successfully optimized all three simultaneously. This study proposes an innovative L2 framework that leverages both classic and advanced cryptographic techniques to break the blockchain trilemma comprehensively. By incorporating the lightweight Knapsack-based encryption scheme, the framework achieves efficient computation and throughput, even for a large volume of transactions. Additionally, the integration of the MPC-in-the-Head (MPCitH) protocol ensures robust confidentiality while maintaining computational efficiency. The proposed framework introduces a novel reference model for evaluating blockchain solutions and demonstrates superiority across all trilemma dimensions. Experimental analysis and rigorous proofs confirm that this framework achieves enhanced scalability, decentralization, and security compared to existing approaches, offering a new benchmark for blockchain innovation.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"261 ","pages":"Article 111148"},"PeriodicalIF":4.4,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143521044","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A lattice-based privacy-preserving decentralized multi-party payment scheme

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-27 DOI: 10.1016/j.comnet.2025.111129

Jisheng Dong , Qingni Shen , Junkai Liang , Cong Li , Xinyu Feng , Yuejian Fang

{"title":"A lattice-based privacy-preserving decentralized multi-party payment scheme","authors":"Jisheng Dong , Qingni Shen , Junkai Liang , Cong Li , Xinyu Feng , Yuejian Fang","doi":"10.1016/j.comnet.2025.111129","DOIUrl":"10.1016/j.comnet.2025.111129","url":null,"abstract":"<div><div>The use of cryptocurrencies has become an emerging and popular way of trading as they gain legitimacy. To address the issue of privacy leakage, some techniques to hide transaction amounts have been proposed such as the MimbleWimble protocol. However, these privacy enhancement schemes basically apply to one-to-one tradings between one payer and one payee, resulting in cryptocurrencies not being used in broader scenarios such as more than one payer or payee (referred to as multi-party transactions in this paper). In this work, we propose a new privacy-preserving decentralized multi-party payment (PDMP) scheme that ensures the transaction amounts in multi-party transactions remain confidential to other parties, and define the ideal functionality for it which captures the privacy and security properties in cryptocurrencies. Then we instantiate a lattice-based PDMP protocol in a hybrid model which can universally composable (UC) securely realize the functionality with a simulation-based security proof. We construct a lattice-based verifiable multi-secret sharing scheme and a lattice-based multi-prover non-interactive zero-knowledge argument to support the protocol, both of which enjoy the security in the future quantum computer era. At last, we have carried out experimental implementation of the scheme to prove its feasibility.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"262 ","pages":"Article 111129"},"PeriodicalIF":4.4,"publicationDate":"2025-02-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143580683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

DDoSBERT: Fine-tuning variant text classification bidirectional encoder representations from transformers for DDoS detection

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-26 DOI: 10.1016/j.comnet.2025.111150

Thi-Thu-Huong Le , Shinwook Heo , Jaehan Cho , Howon Kim

{"title":"DDoSBERT: Fine-tuning variant text classification bidirectional encoder representations from transformers for DDoS detection","authors":"Thi-Thu-Huong Le , Shinwook Heo , Jaehan Cho , Howon Kim","doi":"10.1016/j.comnet.2025.111150","DOIUrl":"10.1016/j.comnet.2025.111150","url":null,"abstract":"<div><div>The imperative for robust detection mechanisms has grown in the face of increasingly sophisticated Distributed Denial of Service (DDoS) attacks. This paper introduces DDoSBERT, an innovative approach harnessing transformer text classification for DDoS detection. The methodology conducts a detailed exploration of feature selection methods, emphasizing the selection of critical techniques, including Correlation, Mutual Information, and Univariate Feature Selection. Motivated by the dynamic landscape of DDoS attacks, DDoSBERT confronts contemporary challenges such as binary and multi-attack classification and imbalance attack classification. The methodology delves into diverse text transformation techniques for feature selection and employs three transformer classification models: distilbert-base-uncased, prunebert-base-uncased-6-finepruned-w-distil-mnli, and distilbert-base-uncased-finetuned-sst-2-english. Additionally, the paper outlines a comprehensive framework for assessing the importance of features in the context of five DDoS datasets, comprised of APA-DDoS, CRCDDoS2022, DDoS Attack SDN, CIC-DDoS-2019, and BCCC-cPacket-Cloud-DDoS-2024 datasets. The experimental results, rigorously evaluated against relevant benchmarks, affirm the efficacy of DDoSBERT, underscoring its significance in enhancing the resilience of systems against text-based transformation DDoS attacks. The discussion section interprets the results, highlights the implications of the findings, and acknowledges limitations while suggesting avenues for future research.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"262 ","pages":"Article 111150"},"PeriodicalIF":4.4,"publicationDate":"2025-02-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143551387","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Network slicing in aerial base station (UAV-BS) towards coexistence of heterogeneous 5G services

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-25 DOI: 10.1016/j.comnet.2025.111146

Debashisha Mishra , Emiliano Traversi , Angelo Trotta , Prasanna Raut , Boris Galkin , Marco Di Felice , Enrico Natalizio

{"title":"Network slicing in aerial base station (UAV-BS) towards coexistence of heterogeneous 5G services","authors":"Debashisha Mishra , Emiliano Traversi , Angelo Trotta , Prasanna Raut , Boris Galkin , Marco Di Felice , Enrico Natalizio","doi":"10.1016/j.comnet.2025.111146","DOIUrl":"10.1016/j.comnet.2025.111146","url":null,"abstract":"<div><div>Unmanned aerial vehicle base stations (UAV-BSs) empowered with network slicing capabilities are presented in this work to support three heterogeneous classes of 5G slice service types, namely enhanced mobile broadband (eMBB), ultra-reliable low-latency communication (uRLLC), massive machine-type communication (mMTC). The coexistence of eMBB, uRLLC and mMTC services multiplexed over common UAV-BS radio resources leads to an incredibly challenging downlink scheduling problem due to the underlying trade-off of end-user requirements in terms of coverage, traffic demand, data rates, latency, reliability, and UAV-specific constraints. To this end, a modular and customizable two-phase resource slicing optimization framework is proposed for UAV-BS known as gEneral rAn Slicing optImizEr fRamework (<em>EASIER</em>) decomposed into: (i) resource optimizer (RO) and (ii) scheduling validator (SV). The reciprocation of RO and SV guided by above split optimization model can generate efficient scheduling decisions that benefit constrained UAV platforms in terms of finite computation and endurance. Furthermore, prioritizing per slice user acceptance rate, our results show that <em>EASIER</em> not only adheres to slice-specific SLAs (service level agreements) specified by the slice owners (<em>i.e.,</em> tenants), but also benefit from efficient UAV-BS positioning to improvise service offering by 15% as compared to a slice-agnostic “default” positioning.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"261 ","pages":"Article 111146"},"PeriodicalIF":4.4,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143508269","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

XAInomaly: Explainable and interpretable Deep Contractive Autoencoder for O-RAN traffic anomaly detection

IF 4.4 2区计算机科学

Computer Networks Pub Date : 2025-02-25 DOI: 10.1016/j.comnet.2025.111145

Osman Tugay Basaran, Falko Dressler

{"title":"XAInomaly: Explainable and interpretable Deep Contractive Autoencoder for O-RAN traffic anomaly detection","authors":"Osman Tugay Basaran, Falko Dressler","doi":"10.1016/j.comnet.2025.111145","DOIUrl":"10.1016/j.comnet.2025.111145","url":null,"abstract":"<div><div>Generative Artificial Intelligence (AI) techniques have become integral part in advancing next generation wireless communication systems by enabling sophisticated data modeling and feature extraction for enhanced network performance. In the realm of open radio access networks (O-RAN), characterized by their disaggregated architecture and heterogeneous components from multiple vendors, the deployment of generative models offers significant advantages for network management such as traffic analysis, traffic forecasting and anomaly detection. However, the complex and dynamic nature of O-RAN introduces challenges that necessitate not only accurate detection mechanisms but also reduced complexity, scalability, and most importantly interpretability to facilitate effective network management. In this study, we introduce the XAInomaly framework, an explainable and interpretable Semi-supervised (SS) Deep Contractive Autoencoder (DeepCAE) design for anomaly detection in O-RAN. Our approach leverages the generative modeling capabilities of our SS-DeepCAE model to learn compressed, robust representations of normal network behavior, which captures essential features, enabling the identification of deviations indicative of anomalies. To address the black-box nature of deep learning models, we propose reactive Explainable AI (XAI) technique called fastshap-C, which is providing transparency into the model’s decision-making process and highlighting the features contributing to anomaly detection.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"261 ","pages":"Article 111145"},"PeriodicalIF":4.4,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143521043","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0