首页 > 最新文献

Computer Networks最新文献

英文 中文
V-FedMM: Dynamic sample selection for efficient multimodal federated learning over vehicular networks V-FedMM:车辆网络上高效多模态联邦学习的动态样本选择
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-14 DOI: 10.1016/j.comnet.2026.112020
Haoyu Tu , Wen Wu , Liang Li , Yongguang Lu , Lin Chen , Xu Chen
In vehicular networks, federated learning (FL) using multimodal sensory data from connected vehicles is critical for emerging autonomous driving applications, such as trajectory prediction, object detection, and semantic segmentation. However, imbalanced learning contributions across modalities and heterogeneous computation/communication capabilities of vehicles pose fundamental challenges, leading to biased model training, slow convergence, and inefficient resource utilization. In this paper, we propose V-FedMM, a novel framework for vehicular federated learning with multimodal data that optimizes both sample and vehicle selection. Particularly, sample selection follows a two-stage mechanism: (i) modality-level selection, where the server determines vehicle participation and per-modality sample counts based on onboard data distribution and modality-specific training contributions; and (ii) sample-level selection, where each vehicle selects specific multimodal data samples by balancing sample importance and utilization to strategically incentivize the participation of low-contribution data. We theoretically analyze the impact of varying modality contributions on training performance by deriving an upper bound for the loss function. To determine the optimal per-modality sample counts for each vehicle under a strict per-round delay constraint, we formulate a joint vehicle selection and per-modality sample count optimization problem that maximizes the contribution from all selected samples. We solve optimization problem by first selecting vehicles guided by a theoretical property, then solving the remaining sample allocation problem as an integer linear programming (ILP) problem with the branch and bound algorithm. Extensive simulation results demonstrate the superior performance of V-FedMM, achieving nearly 5% higher accuracy compared to conventional vehicular FL approaches and saving 16.8% computation overhead compared to the conventional sampling algorithm.
在车辆网络中,使用来自联网车辆的多模态传感数据的联邦学习(FL)对于新兴的自动驾驶应用至关重要,例如轨迹预测、目标检测和语义分割。然而,不同模式的不平衡学习贡献和车辆的异构计算/通信能力构成了根本性的挑战,导致模型训练有偏差、收敛缓慢和资源利用效率低下。在本文中,我们提出了V-FedMM,这是一个具有多模态数据的车辆联合学习的新框架,可以优化样本和车辆的选择。特别是,样本选择遵循两个阶段的机制:(i)模式级选择,服务器根据车载数据分布和特定模式的培训贡献确定车辆参与和每个模式的样本计数;(ii)样本水平选择,其中每辆车通过平衡样本重要性和利用率来选择特定的多模式数据样本,以战略性地激励低贡献数据的参与。我们通过推导损失函数的上界,从理论上分析了不同模态贡献对训练性能的影响。为了在严格的每轮延迟约束下确定每辆车的最优单模态样本数,我们制定了一个联合车辆选择和单模态样本数优化问题,使所有选定样本的贡献最大化。首先根据理论性质选择车辆,然后利用分支定界算法将剩余样本分配问题求解为整数线性规划(ILP)问题。大量的仿真结果证明了V-FedMM的优越性能,与传统的车载FL方法相比,精度提高了近5%,计算开销比传统的采样算法节省了16.8%。
{"title":"V-FedMM: Dynamic sample selection for efficient multimodal federated learning over vehicular networks","authors":"Haoyu Tu ,&nbsp;Wen Wu ,&nbsp;Liang Li ,&nbsp;Yongguang Lu ,&nbsp;Lin Chen ,&nbsp;Xu Chen","doi":"10.1016/j.comnet.2026.112020","DOIUrl":"10.1016/j.comnet.2026.112020","url":null,"abstract":"<div><div>In vehicular networks, federated learning (FL) using multimodal sensory data from connected vehicles is critical for emerging autonomous driving applications, such as trajectory prediction, object detection, and semantic segmentation. However, imbalanced learning contributions across modalities and heterogeneous computation/communication capabilities of vehicles pose fundamental challenges, leading to biased model training, slow convergence, and inefficient resource utilization. In this paper, we propose V-FedMM, a novel framework for <u>v</u>ehicular <u>fed</u>erated learning with <u>m</u>ulti<u>m</u>odal data that optimizes both sample and vehicle selection. Particularly, sample selection follows a two-stage mechanism: (i) modality-level selection, where the server determines vehicle participation and per-modality sample counts based on onboard data distribution and modality-specific training contributions; and (ii) sample-level selection, where each vehicle selects specific multimodal data samples by balancing sample importance and utilization to strategically incentivize the participation of low-contribution data. We theoretically analyze the impact of varying modality contributions on training performance by deriving an upper bound for the loss function. To determine the optimal per-modality sample counts for each vehicle under a strict per-round delay constraint, we formulate a joint vehicle selection and per-modality sample count optimization problem that maximizes the contribution from all selected samples. We solve optimization problem by first selecting vehicles guided by a theoretical property, then solving the remaining sample allocation problem as an integer linear programming (ILP) problem with the branch and bound algorithm. Extensive simulation results demonstrate the superior performance of V-FedMM, achieving nearly 5% higher accuracy compared to conventional vehicular FL approaches and saving 16.8% computation overhead compared to the conventional sampling algorithm.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 112020"},"PeriodicalIF":4.6,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039704","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 task offloading and resource allocation with emergency/general task coexistence in vehicle edge computing 车辆边缘计算中紧急/一般任务共存的动态任务卸载与资源分配
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-14 DOI: 10.1016/j.comnet.2026.112023
Yaoping Zeng, Shisen Chen, Yimeng Ge
Vehicle edge computing (VEC) meets the growing computational demands of vehicles by bringing computing resources closer to the vehicle through roadside units (RSUs). However, the types of tasks to be handled in different vehicular applications are different, such as streaming media, where tasks to be handled are energy-sensitive, termed by general tasks (GTs), while in autonomous driving, tasks are latency-sensitive, called by emergency tasks (ETs). Therefore, how to effectively utilize system resources to satisfy these heterogeneous demands has become a current challenge. In this paper, we propose a novel algorithm aiming to minimize the average total cost, and establish a joint optimization objective function for the energy cost of GTs and the processing delay of ETs. Considering that the proposed problem is a long-term stochastic optimization problem, we leverage the Lyapunov optimization to transform it into two deterministic online optimization subproblems based on variable types. In the subproblem related to discrete variables, namely transmit power control and channel selection, we innovatively establish it as a potential game model by utilizing the linear combination of exact potential game and ordinary potential game, and prove the existence of the Nash equilibrium. Another subproblem involves continuous variables, i.e., RSU computing resource allocation, and we obtain their optimal solutions using convex optimization theory. Finally, numerical results show that the proposed algorithm outperforms other baseline algorithms.
车辆边缘计算(VEC)通过路边单元(rsu)使计算资源更接近车辆,从而满足车辆日益增长的计算需求。然而,在不同的车辆应用程序中要处理的任务类型是不同的,例如流媒体,其中要处理的任务是能量敏感的,称为一般任务(gt),而在自动驾驶中,任务是延迟敏感的,称为紧急任务(et)。因此,如何有效地利用系统资源来满足这些异构需求已成为当前的挑战。本文提出了一种以平均总代价最小为目标的新算法,并建立了gt能量代价和ETs处理延迟的联合优化目标函数。考虑到所提出的问题是一个长期随机优化问题,我们利用Lyapunov优化将其转化为两个基于变量类型的确定性在线优化子问题。在涉及离散变量的子问题发射功率控制和信道选择中,我们创新性地利用精确势博弈和普通势博弈的线性组合将其建立为势博弈模型,并证明了纳什均衡的存在性。另一个子问题涉及连续变量,即RSU计算资源分配,我们利用凸优化理论得到了它们的最优解。最后,数值结果表明,该算法优于其他基准算法。
{"title":"Dynamic task offloading and resource allocation with emergency/general task coexistence in vehicle edge computing","authors":"Yaoping Zeng,&nbsp;Shisen Chen,&nbsp;Yimeng Ge","doi":"10.1016/j.comnet.2026.112023","DOIUrl":"10.1016/j.comnet.2026.112023","url":null,"abstract":"<div><div>Vehicle edge computing (VEC) meets the growing computational demands of vehicles by bringing computing resources closer to the vehicle through roadside units (RSUs). However, the types of tasks to be handled in different vehicular applications are different, such as streaming media, where tasks to be handled are energy-sensitive, termed by general tasks (GTs), while in autonomous driving, tasks are latency-sensitive, called by emergency tasks (ETs). Therefore, how to effectively utilize system resources to satisfy these heterogeneous demands has become a current challenge. In this paper, we propose a novel algorithm aiming to minimize the average total cost, and establish a joint optimization objective function for the energy cost of GTs and the processing delay of ETs. Considering that the proposed problem is a long-term stochastic optimization problem, we leverage the Lyapunov optimization to transform it into two deterministic online optimization subproblems based on variable types. In the subproblem related to discrete variables, namely transmit power control and channel selection, we innovatively establish it as a potential game model by utilizing the linear combination of exact potential game and ordinary potential game, and prove the existence of the Nash equilibrium. Another subproblem involves continuous variables, i.e., RSU computing resource allocation, and we obtain their optimal solutions using convex optimization theory. Finally, numerical results show that the proposed algorithm outperforms other baseline algorithms.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 112023"},"PeriodicalIF":4.6,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039283","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
Throughput maximization for UAV-assisted IoT with NOMA 无人机辅助物联网与NOMA的吞吐量最大化
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-14 DOI: 10.1016/j.comnet.2026.111999
Tianyi Zheng , Mengping Zhong , Zhe Sun , Jihan Feng , Xin Liu
In scenarios lacking terrestrial communication infrastructure, unmanned aerial vehicles (UAVs) serve as cost-effective and highly mobile aerial internet of things (IoT) base stations, delivering enhanced communication services to ground users (GUs) within designated regions. Non-orthogonal multiple access (NOMA) facilitates large-scale network connectivity while maximizing spectral efficiency. This paper examines an IoT communication model incorporating NOMA-enabled UAV assistance, maximizing downlink throughput through the joint optimization of GUs communication scheduling, per-timeslot power allocation, and UAV flight trajectory. The formulated non-convex optimization problem is decomposed into three distinct subproblems: GUs scheduling optimization, power allocation optimization, and UAV flight trajectory optimization. An alternating iterative optimization algorithm addressing these three subproblems is proposed. Numerical analyses demonstrate that the NOMA-UAV IoT system achieves superior throughput compared to orthogonal multiple access (OMA)-UAV IoT systems.
在缺乏地面通信基础设施的情况下,无人机(uav)可以作为具有成本效益和高移动性的空中物联网(IoT)基站,为指定区域内的地面用户(gu)提供增强的通信服务。非正交多址(NOMA)促进了大规模网络连接,同时最大限度地提高了频谱效率。本文研究了一种结合noma支持的无人机辅助的物联网通信模型,通过联合优化GUs通信调度、每时隙功率分配和无人机飞行轨迹,最大限度地提高下行吞吐量。将所建立的非凸优化问题分解为三个不同的子问题:GUs调度优化、功率分配优化和无人机飞行轨迹优化。提出了一种求解这三个子问题的交替迭代优化算法。数值分析表明,与正交多址(OMA)-无人机物联网系统相比,noma -无人机物联网系统具有更高的吞吐量。
{"title":"Throughput maximization for UAV-assisted IoT with NOMA","authors":"Tianyi Zheng ,&nbsp;Mengping Zhong ,&nbsp;Zhe Sun ,&nbsp;Jihan Feng ,&nbsp;Xin Liu","doi":"10.1016/j.comnet.2026.111999","DOIUrl":"10.1016/j.comnet.2026.111999","url":null,"abstract":"<div><div>In scenarios lacking terrestrial communication infrastructure, unmanned aerial vehicles (UAVs) serve as cost-effective and highly mobile aerial internet of things (IoT) base stations, delivering enhanced communication services to ground users (GUs) within designated regions. Non-orthogonal multiple access (NOMA) facilitates large-scale network connectivity while maximizing spectral efficiency. This paper examines an IoT communication model incorporating NOMA-enabled UAV assistance, maximizing downlink throughput through the joint optimization of GUs communication scheduling, per-timeslot power allocation, and UAV flight trajectory. The formulated non-convex optimization problem is decomposed into three distinct subproblems: GUs scheduling optimization, power allocation optimization, and UAV flight trajectory optimization. An alternating iterative optimization algorithm addressing these three subproblems is proposed. Numerical analyses demonstrate that the NOMA-UAV IoT system achieves superior throughput compared to orthogonal multiple access (OMA)-UAV IoT systems.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 111999"},"PeriodicalIF":4.6,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039287","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
STEAM: Securing the connections in wireless sensor networks with varying target priority STEAM:确保无线传感器网络中具有不同目标优先级的连接
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-14 DOI: 10.1016/j.comnet.2026.112024
Truong Q. Vu , Minh T. Trinh , Hien Q. Ta , Hanh T. Nguyen , Binh T.T. Huynh
Achieving multi-connections in wireless sensor networks (WSNs) has been drawing attention from the research community. This paper addresses the problem of providing secure and reliable multi-connectivity in wireless sensor networks (WSNs) when different targets require different connectivity priorities and security levels. Existing multi-connectivity approaches do not incorporate secured communication constraints, operate only in simplified 2D settings, or employ high-complexity algorithms. We formalize the Q-Secure Connectivity problem, which extends Q-Connectivity by enforcing target-dependent secure communication ranges to prevent eavesdropping. To solve this problem efficiently, we propose Sensor Tree Establishment and Adjacency Mapping (STEAM), a novel graph-based heuristic that minimizes the number of relay nodes while ensuring node-disjoint and secure paths. STEAM builds a minimum spanning tree over targets and applies a Hungarian-based mapping to construct feasible connections. Experiments on realistic 3D datasets show that STEAM significantly reduces relay-node count by 3 times and computation time by 15 times, and achieves 30% lower energy consumption, 20% lower outage probability, 40% lower latency, and 50% higher throughput compared to the state-of-the-art method. This work provides the first practical solution to Q-Secure Connectivity in realistic 3D environments.
在无线传感器网络中实现多连接一直是研究领域的热点问题。本文研究了在不同目标对连接优先级和安全级别要求不同的情况下,如何在无线传感器网络中提供安全可靠的多连接。现有的多连接方法不包含安全通信约束,仅在简化的2D设置中运行,或者采用高复杂性算法。我们形式化了Q-Secure Connectivity问题,它通过强制目标相关的安全通信范围来扩展Q-Connectivity,以防止窃听。为了有效地解决这个问题,我们提出了传感器树建立和邻接映射(STEAM),这是一种新颖的基于图的启发式算法,可以在确保节点不相交和安全路径的同时最大限度地减少中继节点的数量。STEAM在目标上建立一个最小生成树,并应用基于匈牙利的映射来构建可行的连接。在真实3D数据集上的实验表明,与现有方法相比,STEAM显著减少了3倍的中继节点数和15倍的计算时间,能耗降低30%,中断概率降低20%,延迟降低40%,吞吐量提高50%。这项工作为现实3D环境中的Q-Secure连接提供了第一个实用的解决方案。
{"title":"STEAM: Securing the connections in wireless sensor networks with varying target priority","authors":"Truong Q. Vu ,&nbsp;Minh T. Trinh ,&nbsp;Hien Q. Ta ,&nbsp;Hanh T. Nguyen ,&nbsp;Binh T.T. Huynh","doi":"10.1016/j.comnet.2026.112024","DOIUrl":"10.1016/j.comnet.2026.112024","url":null,"abstract":"<div><div>Achieving multi-connections in wireless sensor networks (WSNs) has been drawing attention from the research community. This paper addresses the problem of providing secure and reliable multi-connectivity in wireless sensor networks (WSNs) when different targets require different connectivity priorities and security levels. Existing multi-connectivity approaches do not incorporate secured communication constraints, operate only in simplified 2D settings, or employ high-complexity algorithms. We formalize the <em>Q</em>-Secure Connectivity problem, which extends <em>Q</em>-Connectivity by enforcing target-dependent secure communication ranges to prevent eavesdropping. To solve this problem efficiently, we propose Sensor Tree Establishment and Adjacency Mapping (STEAM), a novel graph-based heuristic that minimizes the number of relay nodes while ensuring node-disjoint and secure paths. STEAM builds a minimum spanning tree over targets and applies a Hungarian-based mapping to construct feasible connections. Experiments on realistic 3D datasets show that STEAM significantly reduces relay-node count by 3 times and computation time by 15 times, and achieves 30% lower energy consumption, 20% lower outage probability, 40% lower latency, and 50% higher throughput compared to the state-of-the-art method. This work provides the first practical solution to <em>Q</em>-Secure Connectivity in realistic 3D environments.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 112024"},"PeriodicalIF":4.6,"publicationDate":"2026-01-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039290","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
Enhancing network security: A novel intrusion detection system utilizing dual-optimization techniques for feature selection and classification 增强网络安全:一种利用特征选择和分类双优化技术的新型入侵检测系统
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-13 DOI: 10.1016/j.comnet.2026.112021
D. Vinod , M Prasad
The growing complexity and interconnectivity of modern networks have increased the importance of Intrusion Detection System (IDS) for safeguarding data integrity and privacy. This work presents advanced IDS that deliver improved performance in detecting and mitigating cyber-attacks. The system incorporates an Enhanced Elman Spike Neural Network (EESNN) and a novel hybrid feature selection algorithm which combines Archimedes Optimization Algorithm (AOA) with Fennec Fox Optimization Algorithm (FFOA) for feature selection. Initially, the input data undergoes pre-processing to ensure quality and optimal formatting, critical for achieving high detection accuracy. AOA contributes its strength in global optimization by exploring the search space effectively, while FFOA enhances local search precision, creating a balanced framework for selecting impactful features. The classification task is performed by EESNN, which enhances the traditional Elman Neural Network (ENN) by incorporating spike-based neural dynamics for processing temporal data. EESNN features a context layer to retain memory of previous states, enabling it to effectively capture complex temporal patterns and classify attack types with precision. The proposed IDS demonstrate 96.38% accuracy, 96.84% precision, 96.57% recall, specificity 96.15% and remarkable F1-score of 96.70% indicating superiority over other similar classifiers.
现代网络的复杂性和互联性日益增加,使得入侵检测系统(IDS)对于保护数据完整性和隐私的重要性日益增加。这项工作提出了先进的IDS,在检测和减轻网络攻击方面提供了改进的性能。该系统采用了一种增强的Elman Spike神经网络(EESNN)和一种将阿基米德优化算法(AOA)与Fennec Fox优化算法(FFOA)相结合的新型混合特征选择算法。最初,输入数据经过预处理以确保质量和最佳格式,这对于实现高检测精度至关重要。AOA通过有效地探索搜索空间,在全局优化方面发挥了优势,而FFOA提高了局部搜索精度,为选择有影响力的特征创建了一个平衡的框架。EESNN对传统的Elman神经网络(ENN)进行了改进,加入了基于峰值的神经动力学来处理时间数据。EESNN具有上下文层来保留以前状态的记忆,使其能够有效地捕获复杂的时间模式并精确地分类攻击类型。该方法的准确率为96.38%,准确率为96.84%,召回率为96.57%,特异性为96.15%,f1得分为96.70%,优于其他同类分类器。
{"title":"Enhancing network security: A novel intrusion detection system utilizing dual-optimization techniques for feature selection and classification","authors":"D. Vinod ,&nbsp;M Prasad","doi":"10.1016/j.comnet.2026.112021","DOIUrl":"10.1016/j.comnet.2026.112021","url":null,"abstract":"<div><div>The growing complexity and interconnectivity of modern networks have increased the importance of Intrusion Detection System (IDS) for safeguarding data integrity and privacy. This work presents advanced IDS that deliver improved performance in detecting and mitigating cyber-attacks. The system incorporates an Enhanced Elman Spike Neural Network (EESNN) and a novel hybrid feature selection algorithm which combines Archimedes Optimization Algorithm (AOA) with Fennec Fox Optimization Algorithm (FFOA) for feature selection. Initially, the input data undergoes pre-processing to ensure quality and optimal formatting, critical for achieving high detection accuracy. AOA contributes its strength in global optimization by exploring the search space effectively, while FFOA enhances local search precision, creating a balanced framework for selecting impactful features. The classification task is performed by EESNN, which enhances the traditional Elman Neural Network (ENN) by incorporating spike-based neural dynamics for processing temporal data. EESNN features a context layer to retain memory of previous states, enabling it to effectively capture complex temporal patterns and classify attack types with precision. The proposed IDS demonstrate 96.38% accuracy, 96.84% precision, 96.57% recall, specificity 96.15% and remarkable F1-score of 96.70% indicating superiority over other similar classifiers.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 112021"},"PeriodicalIF":4.6,"publicationDate":"2026-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146025382","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
Deadline-aware service scheduling via multi-head MARL in device-edge-cloud environments 在设备边缘云环境中通过多头MARL实现的截止日期感知服务调度
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-13 DOI: 10.1016/j.comnet.2026.112019
Ayeh Mahjoubi, Arunselvan Ramaswamy, Karl-Johan Grinnemo
Mobile Edge Computing (MEC) enables latency-sensitive Internet of Things (IoT) applications by offloading computation to nearby edge servers. However, most existing intelligent scheduling approaches either neglect the full three-tier device-edge-cloud architecture or fail to account for heterogeneous IoT services composed of multiple dependent tasks with diverse deadlines and resource demands. These gaps hinder adaptability under dynamic network conditions. We propose a multi-agent reinforcement learning (MARL) framework in which cellular IoT devices and the edge server act as cooperative agents to optimize task offloading and scheduling. Each agent employs a multi-head deep Q-network (MH-DQN)-with one head per service type-to efficiently manage heterogeneous service workflows. We further implement a multi-head Double DQN (MH-DDQN) variant to improve stability and convergence. In addition, we benchmark our approach against four heuristic baselines and an adaptive simulated annealing (SA) scheduler. Simulation results demonstrate that both MH-DQN and MH-DDQN substantially outperform the heuristic baselines, and that the learned policies match or slightly exceed the SA acceptance ratio while achieving noticeably lower processing times, maintaining high deadline compliance (up to approximately 85% acceptance at heavy load), and reducing latency. MH-DDQN achieves the fastest convergence, greater stability, and slightly lower delays, highlighting its advantage for adaptive scheduling in complex MEC environments.
移动边缘计算(MEC)通过将计算卸载到附近的边缘服务器来实现对延迟敏感的物联网(IoT)应用。然而,大多数现有的智能调度方法要么忽略了完整的三层设备边缘云架构,要么无法考虑由具有不同截止日期和资源需求的多个依赖任务组成的异构物联网服务。这些差距阻碍了动态网络条件下的适应性。我们提出了一个多智能体强化学习(MARL)框架,其中蜂窝物联网设备和边缘服务器作为协作代理来优化任务卸载和调度。每个代理使用一个多头深度q网络(MH-DQN)——每个服务类型有一个头——来有效地管理异构服务工作流。我们进一步实现了一个多头双DQN (MH-DDQN)变体,以提高稳定性和收敛性。此外,我们针对四个启发式基线和一个自适应模拟退火(SA)调度程序对我们的方法进行了基准测试。仿真结果表明,MH-DQN和MH-DDQN的性能都大大优于启发式基线,并且学习到的策略匹配或略高于SA接受率,同时实现了明显较低的处理时间,保持了较高的最后期限遵从性(在高负载下高达约85%的接受度),并减少了延迟。MH-DDQN收敛速度快,稳定性好,延迟稍低,在复杂的MEC环境中具有自适应调度的优势。
{"title":"Deadline-aware service scheduling via multi-head MARL in device-edge-cloud environments","authors":"Ayeh Mahjoubi,&nbsp;Arunselvan Ramaswamy,&nbsp;Karl-Johan Grinnemo","doi":"10.1016/j.comnet.2026.112019","DOIUrl":"10.1016/j.comnet.2026.112019","url":null,"abstract":"<div><div>Mobile Edge Computing (MEC) enables latency-sensitive Internet of Things (IoT) applications by offloading computation to nearby edge servers. However, most existing intelligent scheduling approaches either neglect the full three-tier device-edge-cloud architecture or fail to account for heterogeneous IoT services composed of multiple dependent tasks with diverse deadlines and resource demands. These gaps hinder adaptability under dynamic network conditions. We propose a multi-agent reinforcement learning (MARL) framework in which cellular IoT devices and the edge server act as cooperative agents to optimize task offloading and scheduling. Each agent employs a multi-head deep Q-network (MH-DQN)-with one head per service type-to efficiently manage heterogeneous service workflows. We further implement a multi-head Double DQN (MH-DDQN) variant to improve stability and convergence. In addition, we benchmark our approach against four heuristic baselines and an adaptive simulated annealing (SA) scheduler. Simulation results demonstrate that both MH-DQN and MH-DDQN substantially outperform the heuristic baselines, and that the learned policies match or slightly exceed the SA acceptance ratio while achieving noticeably lower processing times, maintaining high deadline compliance (up to approximately 85% acceptance at heavy load), and reducing latency. MH-DDQN achieves the fastest convergence, greater stability, and slightly lower delays, highlighting its advantage for adaptive scheduling in complex MEC environments.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 112019"},"PeriodicalIF":4.6,"publicationDate":"2026-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039821","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
Certificateless federated authentication and key agreement in IoV 车联网中的无证书联合认证和密钥协议
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-13 DOI: 10.1016/j.comnet.2026.112017
Raghav , Chanchal Maurya , Shekhar Verma
The increasing connectivity of IoV requires secure and efficient authentication techniques that ensure trusted communication between vehicles and service providers. Federated authentication and single sign on techniques are frequently used to facilitate user verification across multiple domains. However, these techniques are dependent on centralized entities and involve complex certificate management, making them vulnerable to key escrow problems, scalability challenges, and attacks such as impersonation, replay, and ESL. In addition, they introduce substantial computational and communication overhead, making them unsuitable for delay-sensitive vehicular environments. To overcome these limitations, this paper proposes the first certificateless federated authentication and key agreement scheme (CL-FAKA-IoV) for cross-domain IoV environments. The scheme is designed to enable efficient mutual authentication between vehicles and service providers without requiring the TA during real-time communication. The security of CL-FAKA-IoV is formally proven under the RoR model, demonstrating its resistance to cryptographic attacks such as impersonation, replay, and man-in-the-middle. Additionally, the protocol is validated using the AVISPA tool, confirming its robustness against adversaries. Informally, CL-FAKA-IoV guarantees critical security properties, including ESL resistance, KCI resistance, anonymity and unlinkability, as well as perfect forward and backward secrecy and replay protection. Performance evaluation results show that the proposed scheme significantly reduces execution time, communication cost, and memory overhead compared to existing federated authentication protocols, making it a practical and scalable solution for secure deployment in real-world IoV ecosystems.
日益增长的车联网需要安全高效的认证技术,以确保车辆和服务提供商之间的可信通信。联邦身份验证和单点登录技术经常用于促进跨多个域的用户验证。然而,这些技术依赖于集中的实体,并涉及复杂的证书管理,使它们容易受到关键托管问题、可伸缩性挑战和攻击(如模拟、重播和ESL)的影响。此外,它们引入了大量的计算和通信开销,使它们不适合延迟敏感的车辆环境。为了克服这些限制,本文提出了第一个跨域车联网环境下的无证书联合认证和密钥协议方案(CL-FAKA-IoV)。该方案旨在实现车辆和服务提供商之间有效的相互认证,而无需在实时通信中使用TA。CL-FAKA-IoV的安全性在RoR模型下得到了正式证明,证明了它对模拟、重播和中间人等加密攻击的抵抗力。此外,该协议使用AVISPA工具进行验证,确认其对对手的鲁棒性。非正式地,CL-FAKA-IoV保证关键的安全属性,包括ESL抵抗,KCI抵抗,匿名性和不可链接性,以及完美的前向和后向保密和重播保护。性能评估结果表明,与现有的联邦身份验证协议相比,所提出的方案显着减少了执行时间,通信成本和内存开销,使其成为现实世界中安全部署的实用且可扩展的解决方案。
{"title":"Certificateless federated authentication and key agreement in IoV","authors":"Raghav ,&nbsp;Chanchal Maurya ,&nbsp;Shekhar Verma","doi":"10.1016/j.comnet.2026.112017","DOIUrl":"10.1016/j.comnet.2026.112017","url":null,"abstract":"<div><div>The increasing connectivity of IoV requires secure and efficient authentication techniques that ensure trusted communication between vehicles and service providers. Federated authentication and single sign on techniques are frequently used to facilitate user verification across multiple domains. However, these techniques are dependent on centralized entities and involve complex certificate management, making them vulnerable to key escrow problems, scalability challenges, and attacks such as impersonation, replay, and ESL. In addition, they introduce substantial computational and communication overhead, making them unsuitable for delay-sensitive vehicular environments. To overcome these limitations, this paper proposes the first certificateless federated authentication and key agreement scheme (CL-FAKA-IoV) for cross-domain IoV environments. The scheme is designed to enable efficient mutual authentication between vehicles and service providers without requiring the TA during real-time communication. The security of CL-FAKA-IoV is formally proven under the RoR model, demonstrating its resistance to cryptographic attacks such as impersonation, replay, and man-in-the-middle. Additionally, the protocol is validated using the AVISPA tool, confirming its robustness against adversaries. Informally, CL-FAKA-IoV guarantees critical security properties, including ESL resistance, KCI resistance, anonymity and unlinkability, as well as perfect forward and backward secrecy and replay protection. Performance evaluation results show that the proposed scheme significantly reduces execution time, communication cost, and memory overhead compared to existing federated authentication protocols, making it a practical and scalable solution for secure deployment in real-world IoV ecosystems.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 112017"},"PeriodicalIF":4.6,"publicationDate":"2026-01-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146039282","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
Efficient evaluation of nonblocking property of optical circuit-Switched clos networks with non-Uniform link distribution 链路分布不均匀的光交换闭合网络非阻塞特性的有效评价
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-11 DOI: 10.1016/j.comnet.2026.112008
Takeru Inoue , Toru Mano , Takeaki Uno
Datacenter networks (DCNs) are transitioning to optical circuit switches (OCSes) for their energy efficiency and data-rate transparency. Since OCS-based DCNs operate as circuit-switched networks, their Clos structures, a standard DCN architecture, must be designed and maintained to be nonblocking for efficient operation. However, non-uniform inter-switch link distributions naturally arise due to link failures and network expansions, making nonblocking evaluations significantly more complex. Existing methods for assessing the nonblocking property in non-uniform Clos networks are computationally expensive and take tens of minutes for large-scale DCNs, rendering them impractical for time-sensitive scenarios such as link failure response. This paper presents an efficient algorithm for evaluating the nonblocking property of Clos networks with non-uniform link distributions. We establish a rigorous equivalence between nonblocking evaluation and the well-known knapsack problem, which allows us to leverage dynamic programming techniques tailored to the knapsack problem for efficient computation. Our algorithm achieves a speed enhancement of up to 273 × , completing large-scale evaluations for a DCN with 32K terminals in under 22 seconds. Furthermore, we validate the algorithm in realistic scenarios, including random link failures and non-uniform network expansions, demonstrating its robustness and scalability.
数据中心网络(dcn)正在向光电路交换机(ocse)过渡,以提高其能源效率和数据速率透明度。由于基于ocs的DCN作为电路交换网络运行,其Clos结构(标准DCN架构)必须被设计和维护为非阻塞以实现高效运行。然而,由于链路故障和网络扩展,交换机间链路分布不均匀,使得非阻塞评估变得更加复杂。现有的评估非均匀Clos网络非阻塞特性的方法在计算上很昂贵,并且对于大规模dcn需要数十分钟,这使得它们对于时间敏感的场景(如链路故障响应)不切实际。本文提出了一种评估链路分布不均匀的Clos网络非阻塞性的有效算法。我们在非阻塞评估和众所周知的背包问题之间建立了严格的等价关系,这使我们能够利用为背包问题量身定制的动态规划技术进行高效计算。我们的算法实现了高达273 × 的速度提升,在22秒内完成了32K终端的DCN的大规模评估。此外,我们在实际场景中验证了该算法,包括随机链路故障和非均匀网络扩展,证明了它的鲁棒性和可扩展性。
{"title":"Efficient evaluation of nonblocking property of optical circuit-Switched clos networks with non-Uniform link distribution","authors":"Takeru Inoue ,&nbsp;Toru Mano ,&nbsp;Takeaki Uno","doi":"10.1016/j.comnet.2026.112008","DOIUrl":"10.1016/j.comnet.2026.112008","url":null,"abstract":"<div><div>Datacenter networks (DCNs) are transitioning to optical circuit switches (OCSes) for their energy efficiency and data-rate transparency. Since OCS-based DCNs operate as circuit-switched networks, their Clos structures, a standard DCN architecture, must be designed and maintained to be <em>nonblocking</em> for efficient operation. However, <em>non-uniform</em> inter-switch link distributions naturally arise due to link failures and network expansions, making nonblocking evaluations significantly more complex. Existing methods for assessing the nonblocking property in non-uniform Clos networks are computationally expensive and take tens of minutes for large-scale DCNs, rendering them impractical for time-sensitive scenarios such as link failure response. This paper presents an efficient algorithm for evaluating the nonblocking property of Clos networks with non-uniform link distributions. We establish a rigorous equivalence between nonblocking evaluation and the well-known knapsack problem, which allows us to leverage dynamic programming techniques tailored to the knapsack problem for efficient computation. Our algorithm achieves a speed enhancement of up to 273 × , completing large-scale evaluations for a DCN with 32K terminals in under 22 seconds. Furthermore, we validate the algorithm in realistic scenarios, including random link failures and non-uniform network expansions, demonstrating its robustness and scalability.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"276 ","pages":"Article 112008"},"PeriodicalIF":4.6,"publicationDate":"2026-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145978836","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-scale attention fusion for enhanced transformer models in intrusion detection systems 入侵检测系统中改进型变压器模型的多尺度注意力融合
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-11 DOI: 10.1016/j.comnet.2025.111985
Samia Saidane , Francesco Telch , Kussai Shahin , Fabrizio Granelli
Modern network environments generate vast streams of complex and evolving traffic data, presenting significant challenges for accurate and real-time intrusion detection. Conventional deep learning approaches often fail to effectively capture the multi-scale temporal patterns and are frequently hampered by severe class imbalance and catastrophic forgetting when faced with non-stationary data streams. To overcome these limitations, this paper introduces a novel Multi-scale Attention Fusion (MAF) module, a general-purpose architectural enhancement for transformer-based models designed to achieve synergistic optimization across three critical dimensions: computational efficiency, continual learning adaptability, and multi-scale temporal perception. We present two instantiations of this approach: MEGA+MAF and FNet+MAF. These models synergistically combine short-term local context, long-range dependencies, and global sequence information through an adaptive, learnable gating mechanism. A comprehensive evaluation across four diverse benchmark datasets—ToN-IoT, X-IIoTID, CICEVS2024, and CSE-CIC-IDS2018—demonstrates state-of-the-art performance with balanced optimization across all three dimensions: (1) FNet+MAF achieved superior computational efficiency with up to 8.5 ×  lower memory and 5.3 ×  faster inference while maintaining high accuracy; (2) MEGA+MAF demonstrated exceptional continual learning capability, achieving 99.10% accuracy in dynamic streaming environments while effectively eliminating backward forgetting (0.00%) and minimizing forward forgetting (0.06%); and (3) Both models exhibited robust multi-scale perception, capturing threats across short-term bursts, mid-range sessions, and global traffic patterns with up to 99.97% F1-score. Our ablation study after 20 epochs of training identifies 80 tokens as optimal, achieving 85.20% accuracy with 145.1 samples/second throughput. Interpretability analyses further confirm that the models learn robust and semantically meaningful feature representations aligned with network security semantics. The proposed framework represents a significant advancement toward building adaptive, next-generation intrusion detection systems capable of evolving with emerging threats while maintaining operational efficiency in resource-constrained environments.
现代网络环境产生了大量复杂和不断变化的流量数据流,为准确和实时的入侵检测提出了重大挑战。传统的深度学习方法往往不能有效地捕获多尺度时间模式,并且在面对非平稳数据流时经常受到严重的类不平衡和灾难性遗忘的阻碍。为了克服这些限制,本文引入了一种新的多尺度注意力融合(MAF)模块,这是一种针对基于变压器的模型的通用架构增强,旨在实现三个关键维度的协同优化:计算效率、持续学习适应性和多尺度时间感知。我们提出了这种方法的两个实例:MEGA+MAF和FNet+MAF。这些模型通过一种自适应的、可学习的门控机制,协同地结合了短期的局部上下文、长期依赖关系和全局序列信息。对四个不同基准数据集(ton - iot、X-IIoTID、CICEVS2024和cse - cicic - ids2018)的综合评估显示,在所有三个维度上进行了平衡优化,显示了最先进的性能:(1)FNet+MAF实现了卓越的计算效率,在保持高精度的同时,内存降低了8.5 × ,推理速度提高了5.3 × ;(2) MEGA+MAF表现出卓越的持续学习能力,在动态流环境中达到99.10%的准确率,同时有效消除向后遗忘(0.00%)和最大限度地减少向前遗忘(0.06%);(3)两种模型均表现出较强的多尺度感知能力,在短时突发、中程会话和全球流量模式中捕获威胁,f1得分高达99.97%。经过20次训练后,我们的消融研究确定了80个标记为最佳标记,以145.1个样本/秒的吞吐量实现了85.20%的准确率。可解释性分析进一步证实,模型学习了与网络安全语义一致的鲁棒且语义上有意义的特征表示。所提出的框架代表了构建自适应的下一代入侵检测系统的重大进步,该系统能够随着新出现的威胁而发展,同时在资源受限的环境中保持运行效率。
{"title":"Multi-scale attention fusion for enhanced transformer models in intrusion detection systems","authors":"Samia Saidane ,&nbsp;Francesco Telch ,&nbsp;Kussai Shahin ,&nbsp;Fabrizio Granelli","doi":"10.1016/j.comnet.2025.111985","DOIUrl":"10.1016/j.comnet.2025.111985","url":null,"abstract":"<div><div>Modern network environments generate vast streams of complex and evolving traffic data, presenting significant challenges for accurate and real-time intrusion detection. Conventional deep learning approaches often fail to effectively capture the multi-scale temporal patterns and are frequently hampered by severe class imbalance and catastrophic forgetting when faced with non-stationary data streams. To overcome these limitations, this paper introduces a novel Multi-scale Attention Fusion (MAF) module, a general-purpose architectural enhancement for transformer-based models designed to achieve synergistic optimization across three critical dimensions: computational efficiency, continual learning adaptability, and multi-scale temporal perception. We present two instantiations of this approach: <strong>MEGA+MAF</strong> and <strong>FNet+MAF</strong>. These models synergistically combine short-term local context, long-range dependencies, and global sequence information through an adaptive, learnable gating mechanism. A comprehensive evaluation across four diverse benchmark datasets—<em>ToN-IoT, X-IIoTID, CICEVS2024</em>, and <em>CSE-CIC-IDS2018</em>—demonstrates state-of-the-art performance with balanced optimization across all three dimensions: (1) <strong>FNet+MAF</strong> achieved superior computational efficiency with up to 8.5 ×  <strong>lower memory</strong> and 5.3 ×  <strong>faster inference</strong> while maintaining high accuracy; (2) <strong>MEGA+MAF</strong> demonstrated exceptional continual learning capability, achieving <strong>99.10%</strong> accuracy in dynamic streaming environments while effectively eliminating backward forgetting (<strong>0.00%</strong>) and minimizing forward forgetting (<strong>0.06%</strong>); and (3) Both models exhibited robust multi-scale perception, capturing threats across short-term bursts, mid-range sessions, and global traffic patterns with up to <strong>99.97%</strong> F1-score. Our ablation study after 20 epochs of training identifies 80 tokens as optimal, achieving 85.20% accuracy with 145.1 samples/second throughput. Interpretability analyses further confirm that the models learn robust and semantically meaningful feature representations aligned with network security semantics. The proposed framework represents a significant advancement toward building adaptive, next-generation intrusion detection systems capable of evolving with emerging threats while maintaining operational efficiency in resource-constrained environments.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 111985"},"PeriodicalIF":4.6,"publicationDate":"2026-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145981824","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
Federated learning-blockchain synergy for multi-objective replication optimization in dynamic cloud-edge networks 动态云边缘网络中多目标复制优化的联邦学习-区块链协同
IF 4.6 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Pub Date : 2026-01-10 DOI: 10.1016/j.comnet.2026.112014
Peng Xiao, Saifeng Zeng
The evolution of cloud-edge computing has intensified the need for efficient data replication strategies to balance latency, resource efficiency, and adaptability in dynamic environments. Existing approaches often prioritize isolated objectives, neglect privacy risks, and lack scalability under fluctuating network conditions and node churn. This paper introduces RPMO, a multi-objective replication algorithm integrating Lagrangian Relaxation and adaptive bound adjustments to optimize latency, energy consumption, and coverage systematically. The framework is further enhanced by FL-MORP, a federated learning model that embeds multi-objective optimization into distributed training and blockchain-based trust management, enabling proactive replication while preserving data privacy and auditability with minimal overhead. Experimental evaluations on a hybrid cloud-edge testbed demonstrate that FL-MORP reduces worst-case latency by 18–50 %, energy consumption by 13–27 %, and convergence time by 26 % compared to baselines.
云边缘计算的发展加强了对高效数据复制策略的需求,以平衡动态环境中的延迟、资源效率和适应性。现有的方法通常优先考虑孤立的目标,忽视隐私风险,并且在波动的网络条件和节点混乱下缺乏可伸缩性。RPMO是一种集成拉格朗日松弛和自适应界调整的多目标复制算法,可以系统地优化延迟、能耗和覆盖。FL-MORP进一步增强了该框架,FL-MORP是一种联邦学习模型,将多目标优化嵌入到分布式训练和基于区块链的信任管理中,在保持数据隐私和可审计性的同时,以最小的开销实现主动复制。在混合云边缘测试平台上的实验评估表明,与基线相比,FL-MORP将最坏情况延迟降低了18 - 50%,能耗降低了13 - 27%,收敛时间降低了26%。
{"title":"Federated learning-blockchain synergy for multi-objective replication optimization in dynamic cloud-edge networks","authors":"Peng Xiao,&nbsp;Saifeng Zeng","doi":"10.1016/j.comnet.2026.112014","DOIUrl":"10.1016/j.comnet.2026.112014","url":null,"abstract":"<div><div>The evolution of cloud-edge computing has intensified the need for efficient data replication strategies to balance latency, resource efficiency, and adaptability in dynamic environments. Existing approaches often prioritize isolated objectives, neglect privacy risks, and lack scalability under fluctuating network conditions and node churn. This paper introduces RPMO, a multi-objective replication algorithm integrating Lagrangian Relaxation and adaptive bound adjustments to optimize latency, energy consumption, and coverage systematically. The framework is further enhanced by FL-MORP, a federated learning model that embeds multi-objective optimization into distributed training and blockchain-based trust management, enabling proactive replication while preserving data privacy and auditability with minimal overhead. Experimental evaluations on a hybrid cloud-edge testbed demonstrate that FL-MORP reduces worst-case latency by 18–50 %, energy consumption by 13–27 %, and convergence time by 26 % compared to baselines.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"277 ","pages":"Article 112014"},"PeriodicalIF":4.6,"publicationDate":"2026-01-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145981820","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