首页 > 最新文献

Computer Networks最新文献

英文 中文
C2Detector: Interaction-enhanced semantic-aware detection method for C2 channels C2检测器:用于C2通道的交互增强的语义感知检测方法
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-04 DOI: 10.1016/j.comnet.2026.111992
Youqiang Luo, Ruijie Cai, Xiaokang Yin, Jingman Zhou, Fangfang Zhao, Zhenjie Xie, Shengli Liu
With the continuous evolution of cyberattack techniques, Advanced Persistent Threats (APTs) establish covert Command and Control (C2) channels for long-term infiltration, posing severe security risks. Existing C2 detection methods heavily depend on metadata from the encryption handshake stage, rendering them vulnerable to evasion techniques such as mimicking legitimate TLS fingerprints or randomizing handshake parameters. Additionally, these methods are susceptible to network noise and lack of cross-protocol generalization. To address these challenges, we propose C2Detector, an interaction-enhanced and semantic-aware detection method. By shifting the focus from potentially unreliable handshake metadata to the semantics of the data transmission stage, C2Detector reconstructs network sessions into protocol-independent interaction-state transition sequences. This approach eliminates underlying noise and captures high-level interaction semantics. A spatio-temporal neural network is then employed to learn complex behavioral patterns from these sequences. In complex mixed-traffic environments, C2Detector achieves an F1-score of 0.989. Importantly, in a zero-shot generalization test, the model trained exclusively on TCP traffic successfully identified unseen DNS and ICMP C2 channels, achieving F1-scores of 0.931 and 0.826, respectively. These results suggest the method’s potential advantages in both accuracy and generalization.
随着网络攻击技术的不断发展,高级持续性威胁(Advanced Persistent Threats, apt)建立了隐蔽的C2 (Command and Control)通道进行长期渗透,带来了严重的安全风险。现有的C2检测方法严重依赖于加密握手阶段的元数据,这使得它们很容易受到诸如模仿合法TLS指纹或随机握手参数等逃避技术的攻击。此外,这些方法容易受到网络噪声的影响,缺乏跨协议泛化。为了解决这些挑战,我们提出了C2Detector,一种交互增强和语义感知的检测方法。通过将焦点从可能不可靠的握手元数据转移到数据传输阶段的语义,C2Detector将网络会话重构为与协议无关的交互状态转换序列。这种方法消除了底层噪声,并捕获了高级交互语义。然后使用时空神经网络从这些序列中学习复杂的行为模式。在复杂的混合交通环境下,C2Detector的f1得分为0.989。重要的是,在零次泛化测试中,仅对TCP流量进行训练的模型成功识别了未见过的DNS和ICMP C2通道,f1得分分别为0.931和0.826。这些结果表明该方法在准确性和泛化方面具有潜在的优势。
{"title":"C2Detector: Interaction-enhanced semantic-aware detection method for C2 channels","authors":"Youqiang Luo,&nbsp;Ruijie Cai,&nbsp;Xiaokang Yin,&nbsp;Jingman Zhou,&nbsp;Fangfang Zhao,&nbsp;Zhenjie Xie,&nbsp;Shengli Liu","doi":"10.1016/j.comnet.2026.111992","DOIUrl":"10.1016/j.comnet.2026.111992","url":null,"abstract":"<div><div>With the continuous evolution of cyberattack techniques, Advanced Persistent Threats (APTs) establish covert Command and Control (C2) channels for long-term infiltration, posing severe security risks. Existing C2 detection methods heavily depend on metadata from the encryption handshake stage, rendering them vulnerable to evasion techniques such as mimicking legitimate TLS fingerprints or randomizing handshake parameters. Additionally, these methods are susceptible to network noise and lack of cross-protocol generalization. To address these challenges, we propose C2Detector, an interaction-enhanced and semantic-aware detection method. By shifting the focus from potentially unreliable handshake metadata to the semantics of the data transmission stage, C2Detector reconstructs network sessions into protocol-independent interaction-state transition sequences. This approach eliminates underlying noise and captures high-level interaction semantics. A spatio-temporal neural network is then employed to learn complex behavioral patterns from these sequences. In complex mixed-traffic environments, C2Detector achieves an F1-score of 0.989. Importantly, in a zero-shot generalization test, the model trained exclusively on TCP traffic successfully identified unseen DNS and ICMP C2 channels, achieving F1-scores of 0.931 and 0.826, respectively. These results suggest the method’s potential advantages in both accuracy and generalization.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"276 ","pages":"Article 111992"},"PeriodicalIF":4.6,"publicationDate":"2026-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927476","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
Revocable -noise federated learning: A quantum-audited and dynamically coordinated framework for zero-loss privacy 可撤销噪声联合学习:零损失隐私的量子审计和动态协调框架
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-04 DOI: 10.1016/j.comnet.2025.111980
Weibai Zhou , Changlong Li , Rong Li
This paper addresses model performance degradation in differential privacy federated learning (DP-FL) that arises from noise accumulation and information distortion due to gradient clipping. We propose a noise-revocable mechanism. Clients generate isomorphic Gaussian noise using securely shared random seeds, injecting privacy-compliant perturbations before transmitting local models. After aggregation, clients use the same seed information to cancel out noise in the global model. This achieves zero-utility-loss recovery of the original model. We also introduce a quantum-auditable protocol, combining zero-knowledge proofs (zk-STARKs) with quantum random walk-generated unclonable tags, to construct a quantum-resistant verification framework. Additionally, we develop a dynamic, coordinated optimization module. This module adaptively adjusts cryptographic parameters based on model sensitivity and employs federated clustering and reinforcement learning to balance noise and bandwidth in real time. Theoretical analysis shows our approach converges as quickly as non-private baselines under FedGD and FedAvg. Experiments on California Housing, CIFAR-10, and LibriSpeech datasets demonstrate that our framework preserves convergence efficiency and accuracy of standard federated learning. At the same time, it provides strong defense against membership inference, gradient inversion, and backdoor attacks. Our solution is rigorously verifiable, lossless, and suitable for high-sensitivity data applications.
本文解决了差分隐私联邦学习(DP-FL)中由于梯度裁剪引起的噪声积累和信息失真而导致的模型性能下降问题。我们提出了一种噪声可撤销机制。客户端使用安全共享的随机种子生成同构高斯噪声,在传输局部模型之前注入符合隐私的扰动。聚合后,客户端使用相同的种子信息来消除全局模型中的噪声。这实现了原模型的零效用损失恢复。我们还引入了一种量子可审计协议,将零知识证明(zk-STARKs)与量子随机游动生成的不可克隆标签相结合,构建了一个抗量子验证框架。此外,我们还开发了一个动态的、协调的优化模块。该模块基于模型灵敏度自适应调整密码参数,并采用联合聚类和强化学习实时平衡噪声和带宽。理论分析表明,在FedGD和fedag下,我们的方法收敛速度与非私有基线一样快。在California Housing、CIFAR-10和librisspeech数据集上的实验表明,我们的框架保持了标准联邦学习的收敛效率和准确性。同时,它对隶属推理、梯度反转和后门攻击提供了强大的防御。我们的解决方案是严格可验证的,无损的,适合高灵敏度的数据应用。
{"title":"Revocable -noise federated learning: A quantum-audited and dynamically coordinated framework for zero-loss privacy","authors":"Weibai Zhou ,&nbsp;Changlong Li ,&nbsp;Rong Li","doi":"10.1016/j.comnet.2025.111980","DOIUrl":"10.1016/j.comnet.2025.111980","url":null,"abstract":"<div><div>This paper addresses model performance degradation in differential privacy federated learning (DP-FL) that arises from noise accumulation and information distortion due to gradient clipping. We propose a noise-revocable mechanism. Clients generate isomorphic Gaussian noise using securely shared random seeds, injecting privacy-compliant perturbations before transmitting local models. After aggregation, clients use the same seed information to cancel out noise in the global model. This achieves zero-utility-loss recovery of the original model. We also introduce a quantum-auditable protocol, combining zero-knowledge proofs (zk-STARKs) with quantum random walk-generated unclonable tags, to construct a quantum-resistant verification framework. Additionally, we develop a dynamic, coordinated optimization module. This module adaptively adjusts cryptographic parameters based on model sensitivity and employs federated clustering and reinforcement learning to balance noise and bandwidth in real time. Theoretical analysis shows our approach converges as quickly as non-private baselines under FedGD and FedAvg. Experiments on California Housing, CIFAR-10, and LibriSpeech datasets demonstrate that our framework preserves convergence efficiency and accuracy of standard federated learning. At the same time, it provides strong defense against membership inference, gradient inversion, and backdoor attacks. Our solution is rigorously verifiable, lossless, and suitable for high-sensitivity data applications.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"276 ","pages":"Article 111980"},"PeriodicalIF":4.6,"publicationDate":"2026-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927423","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
Multi-objective hierarchical edge infrastructure design for service chain workloads: A MOEA/D-driven joint planning and operation approach 服务链工作负载的多目标分层边缘基础设施设计:一种MOEA/ d驱动的联合规划和运营方法
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-03 DOI: 10.1016/j.comnet.2025.111988
Georgios Kontos , Polyzois Soumplis , Prodromos Makris , Emmanouel Varvarigos
Edge computing is poised to become a cornerstone of the emerging 6G landscape, where an ever-growing class of ultra-low-latency applications must be served close to the user. Despite its promise, real-world deployments remain nascent, with large-scale implementations anticipated by both Communication and Digital Service Providers (CSPs/DSPs) within the following years. Consequently, strategic edge network design is essential not only to maximize performance, but also to avoid redundant investments that can lead to an increased sum of Capital and Operational Expenditures (CAPEX/OPEX). In this work, we address a tri-fold problem: (i) the selection of deployment locations, (ii) the configuration of devices at the chosen location sites, and (iii) the assignment of the projected workload. Our objective is formulated as a weighted combination of the edge infrastructure’s establishment cost, the expected cumulative workload latency and the total expected energy consumption in the operational phase. To capture the spatial and temporal variability of demand, we solve the assignment subproblem over distinct snapshots, each representing a unique workload projection. We first present a Mixed Integer Linear Programming (MILP) formulation that yields the optimal solution; however, due to its computational intractability, we propose a novel adaptation of the Multi-Objective Evolutionary Algorithm by Decomposition (MOEA/D), with an embedded heuristic algorithm to assist in the chromosome fitness calculation. This method leverages the similarity among neighboring subproblems in a multi-objective framework to efficiently approximate the underlying Pareto frontier. In the experiments, the proposed method is contrasted with a sophisticated single-objective Rollout approach. Our results demonstrate the benefits of adopting a multi-objective algorithm in terms of performance, stability and interpretability across different scalarized subproblems. The proposed framework offers a practical intent-based decision support tool for edge infrastructure providers, weighing CAPEX against operating objectives ahead of initial deployment.
边缘计算将成为新兴6G格局的基石,在6G格局中,越来越多的超低延迟应用程序必须在用户附近提供服务。尽管其前景光明,但实际部署仍处于起步阶段,通信和数字服务提供商(csp / dsp)预计将在未来几年内大规模实施。因此,战略性边缘网络设计不仅对实现性能最大化至关重要,而且还可以避免可能导致资本和运营支出(CAPEX/OPEX)增加的冗余投资。在这项工作中,我们解决了一个三重问题:(i)部署地点的选择,(ii)在所选地点的设备配置,以及(iii)预计工作量的分配。我们的目标是将边缘基础设施的建立成本、预期的累积工作负载延迟和运营阶段的预期总能耗加权组合。为了捕获需求的空间和时间变化,我们在不同的快照上解决分配子问题,每个快照代表一个唯一的工作负载投影。我们首先提出了一个混合整数线性规划(MILP)公式,得出最优解;然而,由于其计算的复杂性,我们提出了一种新的多目标分解进化算法(MOEA/D),通过嵌入启发式算法来辅助染色体适应度计算。该方法利用多目标框架中相邻子问题之间的相似性来有效地逼近底层Pareto边界。在实验中,该方法与复杂的单目标Rollout方法进行了对比。我们的结果证明了采用多目标算法在性能、稳定性和跨不同标度子问题的可解释性方面的好处。拟议的框架为边缘基础设施提供商提供了一个实用的基于意图的决策支持工具,在初始部署之前权衡资本支出和运营目标。
{"title":"Multi-objective hierarchical edge infrastructure design for service chain workloads: A MOEA/D-driven joint planning and operation approach","authors":"Georgios Kontos ,&nbsp;Polyzois Soumplis ,&nbsp;Prodromos Makris ,&nbsp;Emmanouel Varvarigos","doi":"10.1016/j.comnet.2025.111988","DOIUrl":"10.1016/j.comnet.2025.111988","url":null,"abstract":"<div><div>Edge computing is poised to become a cornerstone of the emerging 6G landscape, where an ever-growing class of ultra-low-latency applications must be served close to the user. Despite its promise, real-world deployments remain nascent, with large-scale implementations anticipated by both Communication and Digital Service Providers (CSPs/DSPs) within the following years. Consequently, strategic edge network design is essential not only to maximize performance, but also to avoid redundant investments that can lead to an increased sum of Capital and Operational Expenditures (CAPEX/OPEX). In this work, we address a tri-fold problem: (i) the selection of deployment locations, (ii) the configuration of devices at the chosen location sites, and (iii) the assignment of the projected workload. Our objective is formulated as a weighted combination of the edge infrastructure’s establishment cost, the expected cumulative workload latency and the total expected energy consumption in the operational phase. To capture the spatial and temporal variability of demand, we solve the assignment subproblem over distinct snapshots, each representing a unique workload projection. We first present a Mixed Integer Linear Programming (MILP) formulation that yields the optimal solution; however, due to its computational intractability, we propose a novel adaptation of the Multi-Objective Evolutionary Algorithm by Decomposition (MOEA/D), with an embedded heuristic algorithm to assist in the chromosome fitness calculation. This method leverages the similarity among neighboring subproblems in a multi-objective framework to efficiently approximate the underlying Pareto frontier. In the experiments, the proposed method is contrasted with a sophisticated single-objective Rollout approach. Our results demonstrate the benefits of adopting a multi-objective algorithm in terms of performance, stability and interpretability across different scalarized subproblems. The proposed framework offers a practical intent-based decision support tool for edge infrastructure providers, weighing CAPEX against operating objectives ahead of initial deployment.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"276 ","pages":"Article 111988"},"PeriodicalIF":4.6,"publicationDate":"2026-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927414","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
Reliability-Aware Placement of Bidirectional Service Function Chains for Efficient Mobile Edge Computing 面向高效移动边缘计算的双向业务功能链的可靠性感知布局
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-03 DOI: 10.1016/j.comnet.2026.111991
Dongliang Zhang , Xiaoli Li , Qiang Zhu
The growing demand for latency-sensitive services in Mobile Edge Computing (MEC) calls for flexible and reliable resource management strategies to enable efficient deployment of Service Function Chains (SFCs) within the Network Function Virtualization (NFV) paradigm. Network Function Parallelism (NFP) has emerged as an effective approach to mitigate the high latency caused by the increasing number of Virtual Network Functions (VNFs) during SFC construction. However, achieving efficient SFC deployment through NFP remains challenging due to dynamic traffic conditions, limited edge resources, and the inherent complexity of optimal VNF placement. Meanwhile, bidirectional SFCs have become a crucial component of emerging applications, enabling low-latency services by facilitating bidirectional data routing and flexible VNF placement across distributed edge nodes. A common reliability-enhancing approach in bidirectional SFCs involves deploying backup VNF instances to ensure redundancy for primary VNFs. Although such redundancy helps reduce service interruption and latency, simultaneous provisioning of additional VNF instances increases operational cost and leads to inefficient resource utilization. Motivated by these challenges, this study proposes a Reliability-Aware Placement of Bidirectional SFC framework (RAPBS) that can provide users with reliable, low-cost services while ensuring low latency. To ensure service reliability, RAPBS incorporates an estimation technique to determine the optimal number of backup VNF instances. The framework aims to minimize operational and resource consumption costs associated with deploying backup instances while guaranteeing successful and reliable SFC composition. RAPBS integrates an NFP module that decomposes each SFC into multiple sub-SFCs, enabling VNFs to be placed in parallel according to their dependency structure. In addition, RAPBS employs a reinforcement learning–based placement strategy to efficiently deploy sub-SFCs across NFV-enabled MEC environments. The proposed framework significantly enhances service reliability while outperforming the state-of-the-art, achieving improvements of 4.6% in deployment cost, 6.6% in bandwidth consumption, and 4.3% in average latency.
移动边缘计算(MEC)对延迟敏感服务的需求不断增长,需要灵活可靠的资源管理策略,以实现网络功能虚拟化(NFV)范式下业务功能链(sfc)的高效部署。网络功能并行(Network Function Parallelism, NFP)作为一种有效的方法,缓解了在SFC构建过程中由于虚拟网络功能(Virtual Network Functions, vnf)数量增加而导致的高延迟。然而,由于动态的流量条件、有限的边缘资源以及最佳VNF放置的固有复杂性,通过NFP实现高效的SFC部署仍然具有挑战性。同时,双向sfc已经成为新兴应用的关键组成部分,通过促进双向数据路由和跨分布式边缘节点灵活的VNF放置来实现低延迟服务。在双向sfc中,一种常见的可靠性增强方法是部署备份VNF实例,以确保主VNF的冗余。尽管这种冗余有助于减少服务中断和延迟,但同时提供额外的VNF实例会增加运营成本,并导致资源利用效率低下。在这些挑战的激励下,本研究提出了一种双向SFC框架(RAPBS)的可靠性感知放置,该框架可以为用户提供可靠、低成本的服务,同时确保低延迟。为了保证业务的可靠性,RAPBS采用了一种估计技术来确定备份VNF实例的最优数量。该框架旨在最大限度地减少与部署备份实例相关的操作和资源消耗成本,同时保证成功和可靠的SFC组合。RAPBS集成了一个NFP模块,该模块将每个SFC分解为多个子SFC,使vnf能够根据其依赖结构并行放置。此外,RAPBS采用基于强化学习的布局策略,在支持nfv的MEC环境中有效地部署子sfc。该框架显著提高了业务可靠性,同时性能优于现有框架,部署成本降低4.6%,带宽消耗降低6.6%,平均延迟降低4.3%。
{"title":"Reliability-Aware Placement of Bidirectional Service Function Chains for Efficient Mobile Edge Computing","authors":"Dongliang Zhang ,&nbsp;Xiaoli Li ,&nbsp;Qiang Zhu","doi":"10.1016/j.comnet.2026.111991","DOIUrl":"10.1016/j.comnet.2026.111991","url":null,"abstract":"<div><div>The growing demand for latency-sensitive services in Mobile Edge Computing (MEC) calls for flexible and reliable resource management strategies to enable efficient deployment of Service Function Chains (SFCs) within the Network Function Virtualization (NFV) paradigm. Network Function Parallelism (NFP) has emerged as an effective approach to mitigate the high latency caused by the increasing number of Virtual Network Functions (VNFs) during SFC construction. However, achieving efficient SFC deployment through NFP remains challenging due to dynamic traffic conditions, limited edge resources, and the inherent complexity of optimal VNF placement. Meanwhile, bidirectional SFCs have become a crucial component of emerging applications, enabling low-latency services by facilitating bidirectional data routing and flexible VNF placement across distributed edge nodes. A common reliability-enhancing approach in bidirectional SFCs involves deploying backup VNF instances to ensure redundancy for primary VNFs. Although such redundancy helps reduce service interruption and latency, simultaneous provisioning of additional VNF instances increases operational cost and leads to inefficient resource utilization. Motivated by these challenges, this study proposes a Reliability-Aware Placement of Bidirectional SFC framework (RAPBS) that can provide users with reliable, low-cost services while ensuring low latency. To ensure service reliability, RAPBS incorporates an estimation technique to determine the optimal number of backup VNF instances. The framework aims to minimize operational and resource consumption costs associated with deploying backup instances while guaranteeing successful and reliable SFC composition. RAPBS integrates an NFP module that decomposes each SFC into multiple sub-SFCs, enabling VNFs to be placed in parallel according to their dependency structure. In addition, RAPBS employs a reinforcement learning–based placement strategy to efficiently deploy sub-SFCs across NFV-enabled MEC environments. The proposed framework significantly enhances service reliability while outperforming the state-of-the-art, achieving improvements of 4.6% in deployment cost, 6.6% in bandwidth consumption, and 4.3% in average latency.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"276 ","pages":"Article 111991"},"PeriodicalIF":4.6,"publicationDate":"2026-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927479","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
Fair radio channel assignment in WLANs via graph subcoloring 无线局域网中通过图形亚着色的公平无线电信道分配
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-03 DOI: 10.1016/j.comnet.2026.111990
Malory Marin, Joachim Cendrier, Loïc Chassin de Kergommeaux, Rémi Watrigant, Thomas Begin, Anthony Busson
In IEEE 802.11-based wireless local area networks (WLANs), each access point (AP) must operate on one of several independent radio channels. In densely populated areas with many APs or when wide bandwidth radio channels are used, the limited number of independent channels may prevent every AP from having exclusive access to a channel. The performance of an individual AP is then closely related to its property on the graph induced by the set of APs sharing the same radio channel. Existing channel assignment methods may lead to significant unfairness among the APs depending on the particular graph topology. In this paper, we present a polynomial-time algorithm to assign the available radio channels to APs such that the graph induced by each radio channel forms a disjoint union of cliques. This structure guarantees that no AP experiences starvation even in saturated WLANs. We further establish that for highly dense, realistic WLAN topologies, the number of channels available in recent amendments of IEEE 802.11 is always sufficient for our algorithm to prevent AP starvation. Finally, we compare our algorithm with state-of-the-art radio channel assignment methods across several performance metrics. The results highlight the superiority of our algorithm in ensuring fairness among the APs, particularly in dense WLAN deployments.
在基于IEEE 802.11的无线局域网(wlan)中,每个接入点(AP)必须在几个独立的无线电信道中的一个上运行。在具有许多AP的人口密集地区或使用宽带宽无线信道时,有限数量的独立信道可能会阻止每个AP独占访问一个信道。因此,单个AP的性能与其在图上的属性密切相关,图上的属性是由共享同一无线电信道的AP集合所引起的。根据特定的图拓扑结构,现有的信道分配方法可能导致ap之间存在明显的不公平。在本文中,我们提出了一种多项式时间算法,将可用的无线电信道分配给ap,使每个无线电信道引起的图形成一个不相交的团并。这种结构保证即使在饱和的wlan中也不会出现AP饥饿的情况。我们进一步证明,对于高密度、真实的WLAN拓扑,IEEE 802.11最新修订中可用的信道数量总是足以让我们的算法防止AP饥饿。最后,我们通过几个性能指标将我们的算法与最先进的无线电信道分配方法进行比较。结果突出了我们的算法在确保ap之间的公平性方面的优越性,特别是在密集的WLAN部署中。
{"title":"Fair radio channel assignment in WLANs via graph subcoloring","authors":"Malory Marin,&nbsp;Joachim Cendrier,&nbsp;Loïc Chassin de Kergommeaux,&nbsp;Rémi Watrigant,&nbsp;Thomas Begin,&nbsp;Anthony Busson","doi":"10.1016/j.comnet.2026.111990","DOIUrl":"10.1016/j.comnet.2026.111990","url":null,"abstract":"<div><div>In IEEE 802.11-based wireless local area networks (WLANs), each access point (AP) must operate on one of several independent radio channels. In densely populated areas with many APs or when wide bandwidth radio channels are used, the limited number of independent channels may prevent every AP from having exclusive access to a channel. The performance of an individual AP is then closely related to its property on the graph induced by the set of APs sharing the same radio channel. Existing channel assignment methods may lead to significant unfairness among the APs depending on the particular graph topology. In this paper, we present a polynomial-time algorithm to assign the available radio channels to APs such that the graph induced by each radio channel forms a disjoint union of cliques. This structure guarantees that no AP experiences starvation even in saturated WLANs. We further establish that for highly dense, realistic WLAN topologies, the number of channels available in recent amendments of IEEE 802.11 is always sufficient for our algorithm to prevent AP starvation. Finally, we compare our algorithm with state-of-the-art radio channel assignment methods across several performance metrics. The results highlight the superiority of our algorithm in ensuring fairness among the APs, particularly in dense WLAN deployments.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"276 ","pages":"Article 111990"},"PeriodicalIF":4.6,"publicationDate":"2026-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927477","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
KG-AsyncFed:Knowledge-sensitivity and generative replay synergized asynchronous federated continual learning framework 知识敏感和生成重播协同异步联邦持续学习框架
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-03 DOI: 10.1016/j.comnet.2025.111964
Shaohua Cao , Ge Shen , Xuyang Yuan , Baoyu Zhang , Danyang Zheng , Zhu Han , Zijun Zhan , Weishan Zhang
The deep integration of the Internet of Things (IoT) and federated learning establishes a privacy-preserving distributed learning paradigm for edge intelligence. However, dynamic task flows introduce challenges including asynchronous updates, catastrophic forgetting, and privacy constraints that limit traditional methods. This paper proposes KG-AsyncFed, a Knowledge-Sensitivity and Generative Replay Synergized Asynchronous Federated Continual Learning framework. Key innovations include: 1) A knowledge sensitivity driven generation mechanism computing parameter sensitivity matrices through gradient inversion while quantifying cross-task parameter importance differences with mixed-norm fusion; 2) Staleness-aware asynchronous aggregation implementing an exponential decay weight allocation strategy to prioritize integration of resource-sufficient and low-latency client updates; 3) Privacy-preserving generative replay synthesizing historical task features via a dual-model collaborative distillation generator with Gaussian noise injection for differential privacy constraints. Extensive experiments on Non-IID CIFAR-100 and Tiny-ImageNet demonstrate KG-AsyncFed’s significant improvements in average accuracy and forgetting suppression. Ablation studies confirm the synergistic effectiveness of knowledge sensitivity guided generative replay and asynchronous aggregation. The framework provides an efficient and secure continual learning solution for dynamic edge scenarios including industrial predictive maintenance and smart healthcare.
物联网(IoT)和联邦学习的深度融合为边缘智能建立了一种保护隐私的分布式学习范式。然而,动态任务流带来了挑战,包括异步更新、灾难性遗忘和限制传统方法的隐私约束。提出了一种知识敏感与生成重播协同的异步联邦持续学习框架KG-AsyncFed。关键创新包括:1)知识敏感性驱动的生成机制通过梯度反演计算参数敏感性矩阵,同时利用混合范数融合量化跨任务参数重要度差异;2)延迟感知异步聚合,实现指数衰减权重分配策略,优先集成资源充足和低延迟的客户端更新;3)基于差分隐私约束的高斯噪声注入双模型协同蒸馏发生器的隐私保护生成重播历史任务特征合成。在非iid CIFAR-100和Tiny-ImageNet上的大量实验表明,KG-AsyncFed在平均准确率和遗忘抑制方面有显著提高。消融研究证实了知识敏感性引导的生成重播和异步聚合的协同效应。该框架为包括工业预测性维护和智能医疗保健在内的动态边缘场景提供了高效、安全的持续学习解决方案。
{"title":"KG-AsyncFed:Knowledge-sensitivity and generative replay synergized asynchronous federated continual learning framework","authors":"Shaohua Cao ,&nbsp;Ge Shen ,&nbsp;Xuyang Yuan ,&nbsp;Baoyu Zhang ,&nbsp;Danyang Zheng ,&nbsp;Zhu Han ,&nbsp;Zijun Zhan ,&nbsp;Weishan Zhang","doi":"10.1016/j.comnet.2025.111964","DOIUrl":"10.1016/j.comnet.2025.111964","url":null,"abstract":"<div><div>The deep integration of the Internet of Things (IoT) and federated learning establishes a privacy-preserving distributed learning paradigm for edge intelligence. However, dynamic task flows introduce challenges including asynchronous updates, catastrophic forgetting, and privacy constraints that limit traditional methods. This paper proposes KG-AsyncFed, a Knowledge-Sensitivity and Generative Replay Synergized Asynchronous Federated Continual Learning framework. Key innovations include: 1) A knowledge sensitivity driven generation mechanism computing parameter sensitivity matrices through gradient inversion while quantifying cross-task parameter importance differences with mixed-norm fusion; 2) Staleness-aware asynchronous aggregation implementing an exponential decay weight allocation strategy to prioritize integration of resource-sufficient and low-latency client updates; 3) Privacy-preserving generative replay synthesizing historical task features via a dual-model collaborative distillation generator with Gaussian noise injection for differential privacy constraints. Extensive experiments on Non-IID CIFAR-100 and Tiny-ImageNet demonstrate KG-AsyncFed’s significant improvements in average accuracy and forgetting suppression. Ablation studies confirm the synergistic effectiveness of knowledge sensitivity guided generative replay and asynchronous aggregation. The framework provides an efficient and secure continual learning solution for dynamic edge scenarios including industrial predictive maintenance and smart healthcare.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"276 ","pages":"Article 111964"},"PeriodicalIF":4.6,"publicationDate":"2026-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145978833","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
DADM2D-SFL: Decentralised Aggregation framework based on DBSCAN Malicious Model Detection for Secure Federated Learning DADM2D-SFL:基于DBSCAN恶意模型检测的安全联邦学习分散聚合框架
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-03 DOI: 10.1016/j.comnet.2025.111987
Amira Ailane , Samir Bourekkache , Okba Ben Atia , Mustafa Al Samara , Nadia Hamani , Laid Kahloul , Pascal Lorenz
Federated Learning (FL) is susceptible to adversarial attacks, such as Label Flipping (LF) and Backdoor, where malicious clients manipulate the updates of their local model to reduce the global model’s performance. Traditional FL relies on a centralised aggregator, which must be trusted, creating a single point of failure. This centralization not only increases computational cost but also introduces scalability challenges. To address these issues, we propose a Blockchain (BC) based FL framework that decentralises the aggregation process and incorporates an enhanced Density-Based Spatial Clustering of Applications with Noise (DBSCAN) method to identify and remove malicious updates without ignoring minor groups. Our approach eliminates the need for a centralised aggregator by leveraging BC’s smart contracts to aggregate the global model. Simultaneously, Enhanced DBSCAN identifies malicious updates in the parameter space, effectively mitigating adversarial influence while preserving privacy. We evaluate both of our framework and the traditional FL under LF redand Backdoor attacks, experimental results demonstrate that our approach outperforms the traditional FL according to multiple metrics, including accuracy, loss, precision, recall, and F1-score. These findings emphasise the effectiveness of our BC-based decentralised aggregation combined with enhanced DBSCAN technique in improving the robustness and security of FL systems.
联邦学习(FL)容易受到对抗性攻击,例如Label flip (LF)和Backdoor,其中恶意客户端操纵其本地模型的更新以降低全局模型的性能。传统的FL依赖于一个必须被信任的集中式聚合器,这造成了单点故障。这种集中化不仅增加了计算成本,还带来了可伸缩性方面的挑战。为了解决这些问题,我们提出了一个基于区块链(BC)的FL框架,该框架分散了聚合过程,并结合了一种增强的基于密度的带噪声应用空间聚类(DBSCAN)方法,以识别和删除恶意更新而不忽略次要组。我们的方法通过利用BC的智能合约来聚合全球模型,从而消除了对集中式聚合器的需求。同时,增强型DBSCAN识别参数空间中的恶意更新,在保护隐私的同时有效减轻敌对影响。我们在LF红色和后门攻击下评估了我们的框架和传统的FL,实验结果表明,我们的方法在准确率、损失、精度、召回率和f1分数等多个指标上优于传统的FL。这些发现强调了我们基于bc的分散聚合结合增强的DBSCAN技术在提高FL系统稳健性和安全性方面的有效性。
{"title":"DADM2D-SFL: Decentralised Aggregation framework based on DBSCAN Malicious Model Detection for Secure Federated Learning","authors":"Amira Ailane ,&nbsp;Samir Bourekkache ,&nbsp;Okba Ben Atia ,&nbsp;Mustafa Al Samara ,&nbsp;Nadia Hamani ,&nbsp;Laid Kahloul ,&nbsp;Pascal Lorenz","doi":"10.1016/j.comnet.2025.111987","DOIUrl":"10.1016/j.comnet.2025.111987","url":null,"abstract":"<div><div>Federated Learning (FL) is susceptible to adversarial attacks, such as Label Flipping (LF) and Backdoor, where malicious clients manipulate the updates of their local model to reduce the global model’s performance. Traditional FL relies on a centralised aggregator, which must be trusted, creating a single point of failure. This centralization not only increases computational cost but also introduces scalability challenges. To address these issues, we propose a Blockchain (BC) based FL framework that decentralises the aggregation process and incorporates an enhanced Density-Based Spatial Clustering of Applications with Noise (DBSCAN) method to identify and remove malicious updates without ignoring minor groups. Our approach eliminates the need for a centralised aggregator by leveraging BC’s smart contracts to aggregate the global model. Simultaneously, Enhanced DBSCAN identifies malicious updates in the parameter space, effectively mitigating adversarial influence while preserving privacy. We evaluate both of our framework and the traditional FL under LF <strong>red</strong>and Backdoor attacks, experimental results demonstrate that our approach outperforms the traditional FL according to multiple metrics, including accuracy, loss, precision, recall, and F1-score. These findings emphasise the effectiveness of our BC-based decentralised aggregation combined with enhanced DBSCAN technique in improving the robustness and security of FL systems.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"276 ","pages":"Article 111987"},"PeriodicalIF":4.6,"publicationDate":"2026-01-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927419","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
From emerging LEO satellite constellations to the space cloud: Emulation platforms and orchestration methods 从新兴的低轨道卫星星座到空间云:仿真平台和编排方法
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-02 DOI: 10.1016/j.comnet.2025.111970
Camilo J. Rojas , Fabio Patrone , Juan A. Fraire , Mario Marchese
In the rapidly advancing field of satellite communications, mega-constellations of Low Earth Orbit (LEO) satellites are gaining significant attention from the academic and industrial sectors. Managing these expanding constellations has become increasingly complex, and integrating them with classical cellular networks presents new automation challenges. We envision a Space Cloud in which Multi-access Edge Computing (MEC) services are deployed within cross-liked space networks to address emerging Non-Terrestrial Networks (NTNs) latency demands. Integrating computation services in orbit will be instrumental in unlocking a Space Cloud that reduces the need to route computation requests to the Internet backbone. This study’s first contribution is MeteorNet, an open-source constellation and edge computing emulation platform aimed at assessing the expected performance of future Space Clouds. MeteorNet realistically replicates the behavior of edge computing in a synthetic satellite constellation network hosting onboard containerized servers. The second contribution comprises two innovative edge orchestration strategies based on fuzzy logic and reinforcement learning. These strategies leverage historical data on task loads and processing failures to control the activation of on-orbit edge servers, ensuring efficient resource utilization. A Pareto-efficient analysis of multiple Key Performance Indicators (KPIs) using MeteorNet proves the approach’s feasibility in space missions with energy constraints and limited computation resources.
在快速发展的卫星通信领域,低地球轨道(LEO)卫星巨型星座正受到学术界和工业界的极大关注。管理这些不断扩大的星座变得越来越复杂,并且将它们与传统的蜂窝网络集成在一起提出了新的自动化挑战。我们设想了一个空间云,其中多接入边缘计算(MEC)服务部署在交叉空间网络中,以解决新兴的非地面网络(ntn)延迟需求。在轨道上集成计算服务将有助于释放空间云,从而减少将计算请求路由到互联网主干的需要。本研究的第一个贡献是MeteorNet,这是一个开源星座和边缘计算仿真平台,旨在评估未来空间云的预期性能。MeteorNet实际地复制了承载车载容器化服务器的合成卫星星座网络中的边缘计算行为。第二个贡献包括两个基于模糊逻辑和强化学习的创新边缘编排策略。这些策略利用任务负载和处理故障的历史数据来控制在轨边缘服务器的激活,确保有效地利用资源。利用MeteorNet对多个关键性能指标(kpi)进行了帕累托效率分析,证明了该方法在能源约束和计算资源有限的空间任务中的可行性。
{"title":"From emerging LEO satellite constellations to the space cloud: Emulation platforms and orchestration methods","authors":"Camilo J. Rojas ,&nbsp;Fabio Patrone ,&nbsp;Juan A. Fraire ,&nbsp;Mario Marchese","doi":"10.1016/j.comnet.2025.111970","DOIUrl":"10.1016/j.comnet.2025.111970","url":null,"abstract":"<div><div>In the rapidly advancing field of satellite communications, mega-constellations of Low Earth Orbit (LEO) satellites are gaining significant attention from the academic and industrial sectors. Managing these expanding constellations has become increasingly complex, and integrating them with classical cellular networks presents new automation challenges. We envision a Space Cloud in which Multi-access Edge Computing (MEC) services are deployed within cross-liked space networks to address emerging Non-Terrestrial Networks (NTNs) latency demands. Integrating computation services in orbit will be instrumental in unlocking a Space Cloud that reduces the need to route computation requests to the Internet backbone. This study’s first contribution is MeteorNet, an open-source constellation and edge computing emulation platform aimed at assessing the expected performance of future Space Clouds. MeteorNet realistically replicates the behavior of edge computing in a synthetic satellite constellation network hosting onboard containerized servers. The second contribution comprises two innovative edge orchestration strategies based on fuzzy logic and reinforcement learning. These strategies leverage historical data on task loads and processing failures to control the activation of on-orbit edge servers, ensuring efficient resource utilization. A Pareto-efficient analysis of multiple Key Performance Indicators (KPIs) using MeteorNet proves the approach’s feasibility in space missions with energy constraints and limited computation resources.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"276 ","pages":"Article 111970"},"PeriodicalIF":4.6,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145927415","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 secure multi-party sorting protocol based on private set intersection for sealed-bid auctions 基于私有集交集的密封竞价安全多方排序协议
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-02 DOI: 10.1016/j.comnet.2025.111978
Han Zhang , Qingan Zheng , Zhaofeng Ma , Tiezheng Wu
Sealed-bid auctions are crucial for value assessment and privacy preservation. However, existing mechanisms often fail to provide bidders with crucial feedback on their relative standings, thereby hindering strategic decision-making and market efficiency. This paper addresses this limitation by introducing a sealed-bid auction framework that empowers bidders with insights into their rank through secure multi-party sorting. At its core, we design a single-sided Private Set Intersection (PSI) protocol, leveraging a binary encoding method for private comparison. This protocol underpins our secure multi-party sorting solution, enabling each participant to privately ascertain their precise rank among all bidders without revealing actual bid values. Participant anonymity is further ensured through the group signatures. Extensive experimental results demonstrate that our scheme is several orders of magnitude faster than solutions based on homomorphic encryption, confirming its practical feasibility for large-scale scenarios. In conclusion, our work offers a versatile and robust framework for secure ranking, applicable to a broad spectrum of multi-party sorting scenarios.
密封竞拍对于价值评估和隐私保护至关重要。然而,现有机制往往无法向竞标者提供有关其相对地位的关键反馈,从而阻碍了战略决策和市场效率。本文通过引入密封投标拍卖框架来解决这一限制,该框架使竞标者能够通过安全的多方排序来了解他们的排名。在其核心,我们设计了一个单边私有集交集(PSI)协议,利用二进制编码方法进行私有比较。该协议支持我们安全的多方排序解决方案,使每个参与者能够私下确定他们在所有投标人中的精确排名,而无需透露实际出价。通过群签名进一步保证了参与者的匿名性。大量的实验结果表明,我们的方案比基于同态加密的解决方案快几个数量级,证实了其在大规模场景下的实际可行性。总之,我们的工作为安全排序提供了一个通用且健壮的框架,适用于广泛的多方排序场景。
{"title":"A secure multi-party sorting protocol based on private set intersection for sealed-bid auctions","authors":"Han Zhang ,&nbsp;Qingan Zheng ,&nbsp;Zhaofeng Ma ,&nbsp;Tiezheng Wu","doi":"10.1016/j.comnet.2025.111978","DOIUrl":"10.1016/j.comnet.2025.111978","url":null,"abstract":"<div><div>Sealed-bid auctions are crucial for value assessment and privacy preservation. However, existing mechanisms often fail to provide bidders with crucial feedback on their relative standings, thereby hindering strategic decision-making and market efficiency. This paper addresses this limitation by introducing a sealed-bid auction framework that empowers bidders with insights into their rank through secure multi-party sorting. At its core, we design a single-sided Private Set Intersection (PSI) protocol, leveraging a binary encoding method for private comparison. This protocol underpins our secure multi-party sorting solution, enabling each participant to privately ascertain their precise rank among all bidders without revealing actual bid values. Participant anonymity is further ensured through the group signatures. Extensive experimental results demonstrate that our scheme is several orders of magnitude faster than solutions based on homomorphic encryption, confirming its practical feasibility for large-scale scenarios. In conclusion, our work offers a versatile and robust framework for secure ranking, applicable to a broad spectrum of multi-party sorting scenarios.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"276 ","pages":"Article 111978"},"PeriodicalIF":4.6,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145978834","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
ABO For anomaly detection and computer network optimization ABO用于异常检测和计算机网络优化
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-02 DOI: 10.1016/j.comnet.2025.111911
Grace Mupoyi Ntuala , Qi Xia , Qiufang Li , Jiaqin Liu , Patrick Mukala , Ansu Badjie , Lan Ma , Hu Xia , Jianbin Gao
Blockchain networks face critical challenges in anomaly detection, scalability, and resilience under adversarial attacks. Existing solutions often lack integrated approaches that combine time-domain and frequency-domain analyses, failing to detect periodic patterns and provide real-time correction mechanisms. This paper introduces ABO (Advanced Blockchain Optimization), a novel framework that integrates Eigenvalue Theory, Discrete Fourier Transform (DFT), and Gaussian Mixture Models (GMM) for comprehensive anomaly detection, correction, and network optimization. ABO employs DFT for frequency-domain analysis to uncover hidden periodic transaction patterns, GMM for probabilistic real-time anomaly scoring, and Eigenvalue Theory to model transaction dependencies and identify critical nodes. A key innovation is the adaptive anomaly correction mechanism that recalibrates transaction flows, reallocates resources, and isolates malicious nodes to restore normal operations. Additionally, Fatou’s Lemma provides rigorous long-term transaction volume estimation for optimal resource allocation. Extensive experiments on real-world Ethereum datasets (70 million transactions) demonstrate that ABO achieves superior performance: 95.5% average detection accuracy (6% improvement over CNN/GRU/LSTM baselines), 44.2ms detection time (45% faster), 8460 tx/s throughput (98% higher), and 3.58J energy consumption (49% lower). Under adversarial attack scenarios including evasion, poisoning, structural, perturbation, and model-specific attacks, ABO maintains robust detection accuracy above 94% across all attack types. These results confirm that ABO provides a scalable, resilient, and efficient solution for blockchain security and optimization in large-scale deployments.
b区块链网络在异常检测、可扩展性和对抗性攻击下的弹性方面面临着严峻的挑战。现有的解决方案往往缺乏结合时域和频域分析的集成方法,无法检测周期性模式并提供实时校正机制。本文介绍了ABO(高级区块链优化),这是一个集成了特征值理论、离散傅立叶变换(DFT)和高斯混合模型(GMM)的新框架,用于全面的异常检测、校正和网络优化。ABO采用DFT进行频域分析,揭示隐藏的周期性事务模式;采用GMM进行概率实时异常评分;采用特征值理论建立事务依赖关系模型,识别关键节点。一个关键的创新是自适应异常纠正机制,重新校准事务流,重新分配资源,并隔离恶意节点以恢复正常操作。此外,法头引理还为资源的最佳分配提供了严格的长期交易量估计。在真实的以太坊数据集(7000万笔交易)上进行的大量实验表明,ABO实现了卓越的性能:平均检测准确率为95.5%(比CNN/GRU/LSTM基线提高6%),检测时间为44.2ms(提高45%),吞吐量为8460 tx/s(提高98%),能耗为3.58J(降低49%)。在对抗性攻击场景下,包括逃避、中毒、结构、扰动和模型特定攻击,ABO在所有攻击类型中保持94%以上的鲁棒检测准确率。这些结果证实,ABO为大规模部署中的区块链安全性和优化提供了可扩展、有弹性和高效的解决方案。
{"title":"ABO For anomaly detection and computer network optimization","authors":"Grace Mupoyi Ntuala ,&nbsp;Qi Xia ,&nbsp;Qiufang Li ,&nbsp;Jiaqin Liu ,&nbsp;Patrick Mukala ,&nbsp;Ansu Badjie ,&nbsp;Lan Ma ,&nbsp;Hu Xia ,&nbsp;Jianbin Gao","doi":"10.1016/j.comnet.2025.111911","DOIUrl":"10.1016/j.comnet.2025.111911","url":null,"abstract":"<div><div>Blockchain networks face critical challenges in anomaly detection, scalability, and resilience under adversarial attacks. Existing solutions often lack integrated approaches that combine time-domain and frequency-domain analyses, failing to detect periodic patterns and provide real-time correction mechanisms. This paper introduces ABO (Advanced Blockchain Optimization), a novel framework that integrates Eigenvalue Theory, Discrete Fourier Transform (DFT), and Gaussian Mixture Models (GMM) for comprehensive anomaly detection, correction, and network optimization. ABO employs DFT for frequency-domain analysis to uncover hidden periodic transaction patterns, GMM for probabilistic real-time anomaly scoring, and Eigenvalue Theory to model transaction dependencies and identify critical nodes. A key innovation is the adaptive anomaly correction mechanism that recalibrates transaction flows, reallocates resources, and isolates malicious nodes to restore normal operations. Additionally, Fatou’s Lemma provides rigorous long-term transaction volume estimation for optimal resource allocation. Extensive experiments on real-world Ethereum datasets (70 million transactions) demonstrate that ABO achieves superior performance: 95.5% average detection accuracy (6% improvement over CNN/GRU/LSTM baselines), 44.2ms detection time (45% faster), 8460 tx/s throughput (98% higher), and 3.58J energy consumption (49% lower). Under adversarial attack scenarios including evasion, poisoning, structural, perturbation, and model-specific attacks, ABO maintains robust detection accuracy above 94% across all attack types. These results confirm that ABO provides a scalable, resilient, and efficient solution for blockchain security and optimization in large-scale deployments.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 111911"},"PeriodicalIF":4.6,"publicationDate":"2026-01-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145981826","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 Networks
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1