Last updated: 2026-11-22 05:01 UTC
All documents
Number of pages: 179
| Author(s) | Title | Year | Publication | Keywords | ||
|---|---|---|---|---|---|---|
| Shuang Zheng, Xing Zhang, Michael Sheng, Haixu Wang, Wenbo Wang | Beam Hopping Low Earth Orbit Satellite Resource Allocation for Differentiated Services and Robustness Analysis under Model Attacks | 2026 | Early Access | Beams Satellites Resource management Modeling Optimization Schedules Scheduling Low earth orbit satellites Algorithms Bridges LEO satellite communications deep reinforcement learning digital twin resource allocation adversarial attack | Beam hopping (BH)-enabled Low Earth Orbit (LEO) satellites play a pivotal role in next-generation communication networks, providing global coverage, improving spectrum efficiency, and supporting flexible adaptation to heterogeneous service demands. To fully exploit these capabilities, artificial intelligence (AI) techniques are increasingly employed for dynamic resource allocation and power management. However, limited onboard resources and potential adversarial perturbations pose challenges to both efficiency and robustness. To address these issues, we leverage digital twin technology to accurately capture the spatio-temporal dynamics of user–satellite visibility, providing precise state information for decision-making. Building on this, we formulate a joint optimization framework for BH scheduling and power allocation as a Markov Decision Process and propose the BRIDGE—BH with Reinforcement learning incorporating Integrated Dirichlet and Gumbel-TopK Exploration—which integrates a quality of service (QoS)-driven subchannel scheduling mechanism to ensure efficient and differentiated resource allocation. The model’s robustness is systematically evaluated under three classical adversarial attacks. Simulation results demonstrate that our approach achieves superior energy efficiency, service throughput, and fairness, while the robustness analysis shows stable performance under the considered bounded adversarial perturbations. | 10.1109/TNSM.2026.3710750 |
| Hongyuan Cheng, Lihua Yin, Tianqing Zhu, Hongyu Yang, Dexin Zhu, Weixiang Jiang, Nan Wei | Pattern2Bot: A malicious server IP detection model based on self-trained heterogeneous graph neural network | 2026 | Early Access | Labeling Modeling Signal detection Training Botnet Servers IP networks Sequential analysis Conferences Security Botnet detection Self-supervised Graph neural network Command & Control service | Botnets play a key role in network attacks such as Distributed Denial-of-Service (DDoS) attacks, spamming and click fraud. Command & Control server is an important node for botmaster to control bots and distribute attack commands. Bot disguise as normal domain requests through DNS traffic, but leave malicious records in DNS logs containing client IP, query domain, server IP and other complex interactions. This information provides important clues for detecting those botnets. In the current study, researchers detect botnets through multiple perspectives, including abstracting DNS communication records into graphs and using graph neural network models for detection. Conventional approaches often necessitate massive labeled datasets for model training, which substantially incurs training costs. Moreover, despite enriching node embeddings via topological relations, graph models often suffer performance degradation when confronted with structural semantic obfuscation from evasion techniques like double-flux. In order to understand the abstract and complex relationship patterns in DNS records while reducing label usage to lower training costs, we propose a botnet Command & Control server detection model based on DNS traffic. This is a self-training heterogeneous graph neural network model that does not require a large number of labels. By integrating the high-order relational semantics derived from multiple meta-paths with the local topologies of target nodes, the model achieves finer-grained structural awareness and semantic abstraction, thereby enhancing detection performance. We validate the effectiveness of the model in a real dataset, and the results show that the model has a better understanding of the special structure possessed by the IPs of Command & Control servers. | 10.1109/TNSM.2026.3741111 |
| Xuejun Zhang, Hui Chen, Yexin Fan, Yanchun Hu, Jiami Guo, Xiaodong Yang | FedLoc-Guard: Cross-Round Behavior Modeling for Backdoor Defense in Federated RSSI Fingerprint Localization | 2026 | Early Access | Federated learning Modeling Location awareness Servers Received signal strength indicator Automatic speech recognition Fingerprint recognition Timing Educational institutions Cleaning Federated learning indoor localization Wi-Fi fingerprint localization backdoor attack cross-round behavior modeling robust aggregation | Federated learning provides a privacy-preserving paradigm for Wi-Fi RSSI fingerprint-based indoor localization, but remains vulnerable to stealthy backdoor attacks. In federated RSSI localization, environmental variation, device heterogeneity, and sampling-condition differences cause benign client updates to fluctuate across communication rounds, complicating malicious-update discrimination based on single-round statistics. To address this challenge, we propose FedLoc-Guard, a server-side defense framework that models client reliability from server-observable behavior across rounds. FedLoc-Guard estimates instantaneous reliability from directional consistency, relative update magnitude, and normalized turnaround-time consistency, updates client reliability across rounds, and uses the resulting reliability states for high-reliability client retention and risk-constrained aggregation with pre-normalization weight clipping. The method requires neither previously trusted clients nor an additional clean server-side reference set. Experiments on UJIIndoorLoc and Mall under IID and non-IID settings demonstrate that FedLoc-Guard substantially reduces attack success rates against BadNets, Scaling Attack, DBA, and an A3FL-inspired adaptive backdoor attack while maintaining useful localization performance under the evaluated settings, thereby improving the reliability and trustworthiness of federated indoor localization services. | 10.1109/TNSM.2026.3755818 |
| Yuan Gao, Xuelong Wang, Zhenguo Dong, Yong Zhang, Yanyan Han | C2R: Causal-Corrected Residuals for Network Traffic Forecasting in Proactive Network Management | 2026 | Early Access | Modeling Forecasting Timing Learning (artificial intelligence) Fasteners Windows Foundation models Libraries Technology Telecommunication traffic Network Traffic Forecasting Time-Series Foundation Models Causal Discovery Residual Correction Network Management | In large-scale networks characterized by complex spatio-temporal couplings, accurate traffic forecasting serves as a cornerstone for proactive network management, capacity planning, and dynamic bandwidth allocation. Recent deep learning-based time-series foundation models have demonstrated remarkable capabilities in capturing long-term temporal dependencies for automated operations. However, a critical gap remains as these architectures often overlook network-specific topology in management scenarios and lack explicit modeling of cross-variable structural dependencies associated with traffic variations. These limitations can affect forecast accuracy during abrupt traffic changes. To address this challenge, we introduce C2R, a novel framework that augments the Chronos-Bolt foundation model with a TabPFN-based residual correction mechanism. Specifically, C2R constructs a regime-aware LPCMCI graph library by clustering historical traffic windows and learning lagged structural dependencies from the pooled observations within each regime, and then maps the selected structural candidates to residual errors to refine horizon-specific traffic forecasts. Experiments on core-network traffic datasets show that C2R achieves dataset-dependent incremental forecasting gains over the frozen backbone at the predefined evaluation origin while providing model-level structural attribution through the dependencies used by the residual-correction module. | 10.1109/TNSM.2026.3755281 |
| Pengbo Li, Xingwei Wang, Hao Lu, Qiang He, Donghong Han, Saru Kumari, Keqin Li, Sajal K. Das | FedC3P: Compatibility Cost Sharing and Congestion-Aware Posted Pricing for Heterogeneous Multi-Cloud Federations | 2026 | Early Access | Resource management Clouds Costing Pricing Investment Optimization Modeling Routing Delays Virtual machines Cloud federation compatibility investment congestion-aware posted pricing cost sharing provider participation resource allocation | Heterogeneous multi-cloud federations pool resources across providers. Compatibility investment reduces service costs caused by incompatibility, but returns depend on workload allocation under capacity and congestion. Existing allocation and pricing studies generally fix compatibility, leaving investment and cost sharing undetermined. We propose a mechanism for compatibility cost sharing and congestion-aware posted pricing in heterogeneous multi-cloud federations (FedC3P). FedC3P updates compatibility investment across providers on the slower time scale and allocates elastic workloads on the faster time scale. For fixed investment, FedC3P maximizes federation welfare subject to demand and regional capacity constraints and derives resource prices from optimality conditions. Given these prices and service costs from incomplete compatibility, independent service quantity and routing decisions by workload classes implement the welfare-maximizing allocation. FedC3P then shares compatibility costs, checks the feasibility of provider participation under budget balance, and determines provider payoffs through weighted Nash bargaining when distributable surplus is positive. We establish an O(T−1/2) saddle-gap bound for inner averages over T iterations and first-order stationarity of every outer accumulation point under sufficient conditions. At the default setting, semi-synthetic experiments on 277 cloud-region records show welfare gains of 18.9% and 30.8% over Routing-NUM and TD3-Routing; median runtime remains below 5 s at the largest scales. | 10.1109/TNSM.2026.3754272 |
| Zhaogang Shu, Dawei Lin, Haihui Xie, Shuwu Chen | PeriSTNet: A Topology-Anchored Residual Graph Evolution Model for Multi-Step Traffic Matrix Forecasting | 2026 | Early Access | Forecasting Modeling Matrices Learning (artificial intelligence) Timing Topology Educational institutions Conferences Sequences Sequential analysis Traffic Matrix Forecasting Spatio-Temporal Graph Neural Networks Residual Graph Evolution Topology Anchoring Wide Area Networks | Accurate multi-step Traffic Matrix (TM) forecasting enables Wide Area Network (WAN) operators to plan capacity, anticipate congestion, and assess traffic-engineering actions before service quality is affected. Existing spatio-temporal graph neural networks often rely on a fixed physical topology, whereas fully data-driven and long-sequence models may not explicitly retain network-structure priors. These choices can miss demand correlations induced by routing and application behavior, while recursive decoding can accumulate error at longer horizons. We propose PeriSTNet, a topology-anchored residual graph evolution framework that learns a sparse, phase-conditioned predictive dependency graph around a physical topology prior. This graph is integrated into a Dual-Graph Fusion Gated Recurrent Unit, and a Spatio-Temporal Shortcut stabilizes recursive rollouts. Across Abilene, GÉANT, and CERNET, PeriSTNet achieves lower aggregate MAE, MAPE, and RMSE than the evaluated graph-based and Transformer baselines; horizon-wise, multi-seed, and efficiency analyses support this result under one reproducible protocol. By coupling dynamic predictive dependencies with a stable physical backbone, PeriSTNet provides a lightweight forecasting component for proactive capacity planning and traffic-engineering workflows. | 10.1109/TNSM.2026.3753266 |
| Mayank Ramnani, Shasank Dixit, Sushil Yadav, Saad Ahmed, Sidharth Sharma | Split-Aware Function Placement with Availability Guarantees and Optical Provisioning in vRANs | 2026 | Early Access | Radio access networks 5G mobile communication Joining processes Topology Regional area networks Gallium Modeling Copper Optimization Costing 5G virtualized RAN VNF placement network slicing lightpath provisioning DWDM shared backup functional splitting genetic algorithm | The rapid evolution of beyond-5G and emerging 6G networks is driving the need for flexible, reliable, and cost-efficient virtualized Radio Access Network (vRAN) architectures capable of supporting heterogeneous services such as enhanced Mobile Broadband (eMBB), Ultra-Reliable Low-Latency Communication (URLLC), and Massive Machine-Type Communication (mMTC). Future disaggregated RAN systems are expected to rely heavily on network slicing, functional split flexibility, and optical x-haul infrastructures to support stringent performance, scalability, and availability requirements. In this paper, we present an integrated framework for reliable, slice-aware, and functional split-aware Virtual Network Function (VNF) placement with lightpath provisioning in disaggregated vRAN environments. The proposed approach maximizes mobile network operators’ profit by jointly optimizing function placement and optical resource allocation under latency, processing, bandwidth, and availability constraints. We formulate the problem as an Integer Linear Programming (ILP) model with two variants: one that employs unshared backups and another that uses a more cost-efficient shared backup scheme. To address ILP complexity, we develop a heuristic algorithm and a GA-based metaheuristic that provide computationally efficient alternatives for larger instances. Extensive evaluations on topologies up to 128 nodes show that shared backup variants yield up to 18% higher profit, while maintaining up to 5–10% lower normalized CPU usage than unshared counterparts. | 10.1109/TNSM.2026.3751852 |
| Deemah H. Tashman, Soumaya Cherkaoui | Trustworthy AI-Driven Dynamic Hybrid RIS: Joint Optimization and Reward Poisoning-Resilient Control in Cognitive MISO Networks | 2026 | Early Access | Reconfigurable intelligent surfaces Reliability Optimization Security MISO Array signal processing Vectors Satellites Reflection Interference Beamforming cascaded channels cognitive radio networks deep reinforcement learning dynamic hybrid reconfigurable intelligent surfaces energy harvesting poisoning attacks | Cognitive radio networks (CRNs) are a key mechanism for alleviating spectrum scarcity by enabling secondary users (SUs) to opportunistically access licensed frequency bands without harmful interference to primary users (PUs). To address unreliable direct SU links and energy constraints common in next-generation wireless networks, this work introduces an adaptive, energy-aware hybrid reconfigurable intelligent surface (RIS) for underlay multiple-input single-output (MISO) CRNs. Distinct from prior approaches relying on static RIS architectures, our proposed RIS dynamically alternates between passive and active operation modes in real time according to harvested energy availability. We also model our scenario under practical hardware impairments and cascaded fading channels. We formulate and solve a joint transmit beamforming and RIS phase optimization problem via the soft actor-critic (SAC) deep reinforcement learning (DRL) method, leveraging its robustness in continuous and highly dynamic environments. Notably, we conduct the first systematic study of reward poisoning attacks on DRL agents in RIS-enhanced CRNs, and propose a lightweight, real-time defense based on reward clipping and statistical anomaly filtering. Numerical results demonstrate that the SAC-based approach consistently outperforms established DRL base-lines, and that the dynamic hybrid RIS strikes a superior trade-off between throughput and energy consumption compared to fully passive and fully active alternatives. We further show the effectiveness of our defense in maintaining SU performance even under adversarial conditions. Our results advance the practical and secure deployment of RIS-assisted CRNs, and highlight crucial design insights for energy-constrained wireless systems. | 10.1109/TNSM.2026.3660728 |
| Messaoud Ait-Yahia, Wael Jaafar, Rami Langar | Joint Design of Blockchain-Enabled Service Placement and Task Assignment in Vehicular Fog Computing Networks | 2026 | Early Access | Delays Timing Optimization Autonomous aerial vehicles Modeling Gallium Central Processing Unit Joints Bandwidth Elementary particles Resource allocation Blockchain VNF placement task assignment vehicular fog computing PSO GA IoV | Driven by the evolution of blockchain and fog computing, vehicular networks are increasingly capable of supporting latency-sensitive applications with enhanced security and trust guarantees. However, the joint resource allocation for task offloading and blockchain services has been insufficiently investigated in existing works. To address this gap, this paper proposes a framework for jointly allocating resources of blockchain, users’ virtualized services, and Mobile Edge Computing (MEC) task assignment in Vehicular Fog Computing (VFC) networks. Specifically, we formulate the optimization problem as an integer nonlinear programming model aiming to maximize the satisfaction rate of users’ service requests while minimizing the corresponding blockchain operation time under mobility, queuing, instantiation, and resource constraints. To solve it in a timely manner, we design two-stage hierarchical low-complexity solutions, namely a Particle Swarm Optimization-based Joint Blockchain-enabled Service placement and Task Assignment algorithm (PSO-JBSTA), and a Genetic Algorithm-based approach (GA-JBSTA). Through extensive simulations, we demonstrate the effectiveness of PSO-JBSTA (resp. GA-JBSTA) and their adaptability to network conditions, achieving an average 35% (resp. 24%) improvement in users’ service satisfaction rate and 9.5% (resp. 10.2%) reduction in average blockchain validation delay compared with the baselines. | 10.1109/TNSM.2026.3737068 |
| Soonbeom Kwon, Yusu Noh, Youngwoo Jang, Illyoung Choi, Byungchul Tak, In-geol Chun, Young-Kyoon Suh | Scalable and Robust Resource Provisioning via Adaptive Task Scheduling for Edge Devices | 2026 | Early Access | Schedules Scheduling Cloning Timing Educational institutions Computers Transcoding Videos Tail Edge computing Edge devices Edge server Resource augmentation Task distribution Kubernetes | Edge devices, such as wearables, drones, and CCTV systems, are vital for real-time data collection in urban intelligence. However, their limited computational and storage capacities pose significant challenges. While offloading to public clouds offers scalability, it often incurs high latency and operational costs. Conversely, centralizing workloads on edge servers may result in the underutilization of high-performance edge devices. To address these limitations, we introduce ERPF, a Kubernetes-based Edge Resource Provisioning Framework that augments the capabilities of heterogeneous edge environments. ERPF orchestrates dynamic volume provisioning, GPU-aware resource allocation, execution context migration, and adaptive task distribution to improve system flexibility and efficiency. Building on this, we propose a novel adaptive task scheduling technique, termed eATS, composed of three key mechanisms: (i) Partition Smoothing Scheme for stable task granularity control, (ii) Resilient Edge Reintegration for failure detection and task reassignment, and (iii) Competitive Task Cloning for speculative execution with fastest-result commitment. The proposed eATS scheme reduces task execution time by up to 27.6%, lowers partition size variability by 8.7×, and improves scheduling robustness across heterogeneous edge devices over the baseline. | 10.1109/TNSM.2026.3694238 |
| Chenyu Wu, Kexin Zhang, Shuai Han, Qiuyue Nie, Tony Q. S. Quek | A Distributed Routing and Load Balancing Optimization Method for Inclined-Orbit Constellations | 2026 | Early Access | LEO satellite networks inclined-orbit Walker constellation virtual node method load-balancing routing | Traditional distributed routing algorithms do not explicitly account for the virtual-node displacement introduced by nonzero phase factors in inclined-orbit constellations. This mismatch can cause routing deviation, while uneven traffic may lead to local congestion. To address these problems, we propose a distributed routing method for inclined-orbit satellite networks. First, a phase-factor-driven distributed routing algorithm (DRA-F) is designed based on the virtual node method. By incorporating a regional offset compensation mechanism, DRA-F corrects routing deviations caused by topology distortion. Furthermore, to avoid potential link congestion, we develop load-balancing DRA-F (LB-DRAF) that extends link-state awareness to a two-hop range and devises a hop-constrained relay node selection strategy to mitigate local congestion. Simulation results show that DRA-F reduces end-to-end delay and routing overhead relative to the implemented OPSPF and LAOR baselines. Under high load, LB-DRAF further improves delay and throughput relative to DRA-F. Specifically, in the representative 28-plane setting, DRA-F reduces average end-to-end delay by 8.7% and normalized routing overhead by 97.6% relative to LAOR. | 10.1109/TNSM.2026.3756107 |
| Qianli Di, Keju Du, Gang Chen, Hai Deng | ReAct-IDS: An Agentic LLM Zero-Day Screening Layer for UAV Intrusion Detection Cascades | 2026 | Early Access | Large language models Tools Poles and zeros Modeling Autonomous aerial vehicles Labeling Seeds (agriculture) LoRa Testing Training UAV Networks Intrusion Detection Systems Zero-day Attacks Agentic LLM ReAct Framework Explainable AI | Unmanned aerial vehicle (UAV) networks expose edge nodes to cyber threats. ReAct-IDS combines a local three-billion-parameter language model with tools and a supervised classifier. On UAVIDS/Cyber-Physical under leave-one-attack-out (LOAO), with the router bypassed, the post-hoc-selected four-tool/autoencoder-augmented cascades reach 63.3%/52.8% recall (run mean/three-seed sample-bootstrap mean) at false-unknown rates (FURs) 0.405/0.423 and known-class macro F1 0.684/0.605. FUR measures the fraction of known traffic flagged as unknown. Cyber-Physical headline recall covers only denial of service and replay, which share the benign capture schema. An equal-false-unknown-rate ablation gives an agent-minus-own-gate mean recall difference of −0.009 over four dataset–configuration combinations. Under IDS-Agent’s nine-attack CIC-IoT’ 23 protocol, mean unknown recall is 0.575 (95% confidence interval [0.560, 0.589]) at FUR 0.102, with detection supplied by the supervised confidence gate. An audit of 12,000 stored explanations against reconstructed reference evidence finds evidence-citing claims 97.7% supported yet claim-level faithfulness 0.44; on unknown verdicts it is 0.07. Incomplete original-prompt recovery limits this audit. | 10.1109/TNSM.2026.3755833 |
| Edson José Pacheco, Mauro Sérgio Pereira Fonseca, Carlos Marcelo Pedroso | Interpretable Multi-Plane Intrusion Detection for 5G Networks with Adaptive Feature Engineering | 2026 | Early Access | Planing Modeling Recording Windows Modules (abstract algebra) 5G mobile communication Fluid flow Floods Timing Training Intrusion detection 5G security explainable machine learning cybersecurity feature engineering | Fifth-generation mobile networks expose multiple protocol planes to cyberattacks, yet intrusion detection research evaluates one feature representation, often on one plane, and relies on opaque classifiers that hinder root-cause analysis by network operators. We present an intrusion detection pipeline that applies one framework to every 5G network plane and trains an independent detector for each. The pipeline evaluates three feature modules (per-flow statistics, rolling temporal differentials, and windowed complexity descriptors) on each plane and selects one by a fixed rule under blocked and purged cross-validation, in which no training sample shares a record with a test sample. An Explainable Boosting Machine (EBM) classifies the traffic and produces auditable shape functions that reveal which traffic characteristics distinguish each attack class. Validation covers four public datasets, one of which contributes two planes, and spans user, mixed data, control, signaling, and service-based traffic. On these datasets, committing every plane to per-flow statistics, the module most common in the literature, costs 0.2493 F1 Macro on average and 0.6533 on NAS signaling. The EBM stays within 0.0058 F1 Macro of the best tree ensemble on every plane, and after Holm correction the cost of the additive restriction is not significant on any plane. On four planes, its mean F1 Macro is at or above that of six deep architectures. The service-based plane remains the hardest, at 0.5136 F1 Macro. These results indicate that interpretability and multi-plane coverage are achievable, and the pipeline accommodates further modules and planes as new attack surfaces emerge. | 10.1109/TNSM.2026.3755668 |
| Junxiong Lin, Xiuyi Zhao, Pan Li, Tian-Yu Zuo, Mingyi Liu, Hailiang Zhao, Yichuan Jiang, Jiuchuan Jiang, Kai Di, Ning Luo | Hallucination-Aware Teaming for Reliable Service Composition in LLM-Driven Industrial Agent Networks | 2026 | Early Access | Modeling Large language models Educational institutions Costing Algorithms Conferences Collaboration Multi-agent systems Voting Social networking (online) LLM-driven industrial agent hallucination teaming reliable service composition multi-agent system | Large-language-model-driven (LLM-driven) industrial agents increasingly exchange intermediate results through service-composition pipelines, so an upstream hallucination can corrupt several downstream decisions. We formulate hallucination-aware teaming (HATP), which jointly considers capability coverage, distinct-base-family redundancy, resource budgets, and chain-level error propagation, and prove that its deterministic special case is NP-hard. We then propose HAT, a polynomial-time heuristic that combines master-driven recruitment with self-consistency, cross-agent agreement, external-constraint signals, and bounded fallback. In five simulator settings with 200 paired trials each, HAT has the highest mean Acc and lowest mean HPL in four settings; LLM Debate leads in Easy, and the HAT–Debate Acc differences in Easy and Complex are not significant after Holm correction. A 100-instance exact-enumeration study yields a 0.95% median relative utility gap and an approximately 10× median speedup for the tractable HATP instantiation with upstream discount and fallback disabled and a fixed scalar utility with normalized propagation length. Paired ablations show clear contributions from Phase B, bounded fallback, and the combined trust mechanism, whereas most individual trust-signal effects overlap with uncertainty. In a fixed 50-task live-LLM check using five 8B–30B model families, HAT attains Acc 0.280 versus 0.300 for Beta-Reputation and does not lead every comparator on propagation length. The live study is therefore a limited test outside the simulator and does not show that HAT is generally better in deployment. | 10.1109/TNSM.2026.3752977 |
| Umair Ullah Tariq, Fariza Sabrina, Steven Gordon, Ahsan Morshed, Yufeng Lin, Mohammad Mamunur Rashid, Mubashir Hussain | SLA-Driven Network Planning for Hybrid QKD–PQC Security in Smart Grids | 2026 | Early Access | Technology Costing Seeds (agriculture) Maintenance engineering Gallium Educational institutions Planning Joining processes Quantum key distribution Timing Network planning service-level agreements quantum-safe security quantum key distribution post-quantum cryptography smart grid networks infrastructure management feasibility optimization | Operational deployment of hybrid QKD–PQC security in smart grids requires coordinated planning under coupled service-level agreement (SLA) constraints, including startup latency, sustained key availability, real-time bounds, technology budget, and site storage capacity. This paper presents an SLA-driven network-planning framework solved using feasibility-first bounded local search (FF-BLS). A broad 36,300-run campaign across seven benchmark networks (14–6,495 nodes) maps deployment regimes and algorithmic ablations. Full FF-BLS attains 60.9% feasibility under fixed installed site capacity, while relaxing the site-cap constraint yields 100%. Focused studies further vary storage, technology budget, QKD-adoption target, and startup–traffic stress. FF-BLS reaches 100% feasibility at the highest tested storage multiplier (γ = 0.40), while a restrictive technology budget (b = 0.60) remains independently binding once storage is sufficient. On 246 comparison scenarios, FF-BLS achieves 100% feasibility, whereas unassisted GA, SA, Tabu, and VNS achieve 24.4–58.9%; feasibility-aware initialization and repair substantially improve the generic baselines. A separate 100-instance topology/storage stress benchmark and an aligned CPU–GPU study evaluate robustness and computational scaling. The results show that site storage is the dominant practical bottleneck under fixed installed capacity, while its importance depends on the provisioning regime. Low-to-moderate QKD adoption is most robust under constrained storage, whereas higher adoption becomes feasible when sufficient storage head-room is provisioned. These findings provide practical guidance for scalable quantum-safe smart-grid deployment under stringent SLAs. | 10.1109/TNSM.2026.3751647 |
| Gustavo Z. Bruno, Gabriel M. Almeida, Aloízio Da Silva, Luiz A. DaSilva, Joao F. Santos, Alexandre Huff, Kleber V. Cardoso, Cristiano B. Both | Towards Energy- and QoS-aware Load Balancing for 5G Advanced: Leveraging O-RAN to Achieve Sustainability and Energy Efficiency | 2026 | Early Access | Open RAN Modeling Timing Energy Energy efficiency Optimization Handover Cells (biology) Energy conservation Quality of service O-RAN RIC 5G Advanced Energy Efficiency Dynamic Demand Resource Management | The increasing energy consumption of next-generation mobile networks necessitates the adoption of autonomous and energy-aware management strategies. This article proposes a novel adaptive solution leveraging the Open Radio Access Network (O-RAN) architecture to optimize energy efficiency while maintaining Quality of Service (QoS). The proposed approach introduces a hierarchical O-RAN-aligned control framework in which a Non-Real-Time RAN Intelligent Controller (Non-RT RIC) periodically computes energy-aware policies from long-term historical data, while a Near-Real-Time RIC enforces those policies through per-User Equipment (UE) handover actions on a sub-second timescale. We formulate a joint energy- and QoS-aware load balancing problem as a Mixed-Integer Non-Linear Programming (MINLP) model. This model optimizes UE association across E2 Nodes to minimize transmission power and autonomously deactivate underutilized cells, while satisfying strict QoS constraints. To validate the proposed solution, we deploy it in an experimental environment that simulates massive sports events. Experimental results demonstrate 72% energy savings over a 24-hour trace and sub-second handover delays (0.123–0.204 s/UE), confirming the solution’s feasibility for autonomous and sustainable 5G Advanced networks. This work provides guidelines for deploying energy-efficient strategies in O-RAN environments and underscores the potential of adaptive solutions for sustainable mobile communications. | 10.1109/TNSM.2026.3751565 |
| Mario Chahoud, Hani Sami, Ahmad Hammoud, Rabeb Mizouni, Hadi Otrok, Jamal Bentahar, Azzam Mourad, Chamseddine Talhi | Multi-agent Deep Reinforcement Learning Scheme for On-Demand Federated Learning | 2026 | Early Access | Modeling Federated learning Training Learning (artificial intelligence) Convergence Accuracy Internet of Things Resource management Servers Optimization Federated Learning Multi-Agent Deep Reinforcement Learning On-Demand Federated Learning Client Selection Mobility-Aware Learning Partially Observable Markov Game Centralized Training and Decentralized Execution Edge Computing | The rapid growth of intelligent IoT devices and mobile edge infrastructures has generated massive decentralized data, necessitating efficient and privacy-preserving learning. Federated Learning (FL) enables distributed model training without sharing raw data; however, its performance degrades in dynamic mobile environments due to unpredictable availability, stragglers, and frequent dropouts. In On-Demand FL, training services and models are deployed only when needed rather than relying on always-active infrastructure, requiring orchestrators to adapt to client arrivals, departures, and mobility while efficiently allocating limited resources and maintaining training continuity. Existing client-selection methods rely on static heuristics or centralized Reinforcement Learning models that struggle to scale and adapt to such dynamics. To address these challenges, we propose a cooperative Multi-Agent Deep Reinforcement Learning (MADRL) framework for client selection in On-Demand FL. Multiple orchestrators act as agents under a Centralized Training and Decentralized Execution (CTDE) paradigm. The problem is formulated as a Partially Observable Markov Game (POMG), capturing mobility, partial observability, and distributed decision-making. A mobility-aware reward integrates accuracy, resource efficiency, and a Useful Handoff Bonus to preserve learning continuity. Containerization further enhances adaptability. Experiments demonstrate faster convergence, improved resource utilization, and enhanced robustness under real mobility traces. | 10.1109/TNSM.2026.3750310 |
| Ting-Yu Chang, Cooper Cheng-Yuan Ku | Two-tier Framework with AutoML for Detection and Classification of Multiple Types of Anomalies in Intrusion Attacks | 2026 | Early Access | Modeling Optimization Probability Automated machine learning Labeling Training Algorithms Stacking Accuracy Tuning Intrusion Detection Anomaly Classification Cybersecurity Data Imbalance Computational Efficiency Two-tier Framework Machine Learning Probability Stacking Method | Ensuring cybersecurity is paramount for protecting sensitive data and defending against increasingly sophisticated cyberattacks. Consequently, intrusion detection (ID) has become a critical area of research in network security. This paper proposes a two-tier framework that leverages efficient automated machine learning (AutoML) techniques to address data imbalance and optimize feature combinations for ID and classification of multiple types of anomalies. In the first tier, two complementary models are selected: a primary model optimized for overall dataset performance and a secondary model specifically chosen for its effectiveness on balanced data distributions. In the second tier, a probability stacking approach, supported by Out-of-Fold (OOF) cross-validation, integrates insights from the first-tier models. It acts as a binary safety net that successfully recovers rare minority attacks while preventing irreversible information loss. The proposed framework effectively mitigates the adverse effects of data imbalance while requiring only a minimal runtime memory footprint of approximately 44 MB (NSL-KDD) and a total process footprint of 165.52 MB (CIC-IIoT-2025), and achieves a rapid cold-start initialization of 0.85 seconds. These advantages make it well-suited for edge computing. Experimental results on the NSL-KDD dataset demonstrate that the proposed approach achieves an overall accuracy of 99.73%, outperforming many state-of-the-art methods by 0.4-20.6%. Furthermore, evaluations on the CIC-IDS-2017 dataset show a 6.3% accuracy improvement and a significant 36% increase in macro-average recall compared with a random-forest-only (RF-only) model. Moreover, extensive validation on the contemporary CIC-IIoT-2025 dataset reveals a significant 4.20% improvement in Macro F1-score over up-to-date baselines. Finally, evaluations on an independent set with novel attack types (KDDTest+) confirm strong generalization capability, achieving 77.10% accuracy and underscoring the framework's robustness in modern industrial scenarios. | 10.1109/TNSM.2026.3747311 |
| Rahman Abdul Rafi, Christian Stephens, Shakil Ahmed, Ibrahim Almazyad, Ashfaq Khokhar | Asynchronous SLM Orchestrator for Mission-Critical Tactile Communications | 2026 | Early Access | Modeling Costing Optimization Delays Timing Labeling Jitter Architecture Computer architecture Radio frequency 6G+ Tactile Internet Mission Critical Systems URLLC SLM Cross-Layer Optimization | Mission-critical tactile applications such as remote surgery require sub-10 millisecond (ms) one-way latency and deadline-miss rates below 0.1% to preserve haptic stability, yet existing cross-layer optimization methods struggle to adapt transport, redundancy, and application parameters under wireless conditions without violating time constraints. To address this gap, we present SLM-COP, a two-tier edge architecture that decouples real-time execution from adaptive policy selection. A fast dataplane executor applies pre-validated cross-layer presets at 1–10 ms intervals while an asynchronous small language model (SLM) meta-controller runs every 50–200 ms to interpret telemetry and language-encoded objectives to propose configurations from 72 validated presets spanning FEC level, congestion control, frame aggregation, sampling rate, and packet-loss concealment. Using trace-driven experiments with da Vinci surgical kinematic traces from the JIGSAWS dataset across 5,000 emulated network conditions, the SLM meta-controller achieved mean cost 8.93 under Top-1 selection on 1,000 held-out scenarios, improving over rule-based heuristics by 53% while maintaining 100% feasibility with DMR ≤ 0.1%. Further, oracle analysis shows 85% of scenarios admit multiple near-optimal presets within a 10% cost margin. This facilitates Top-K shortlist evaluation, under which SLM-COP reaches cost 7.08 at Top-5 versus 6.74 for oracle. Batched inference over all 72 presets requires 100 ms, aligning with the slow-loop budget and preserving the fast-loop real-time guarantees. Thus, we demonstrate that asynchronous SLM-based orchestration can provide adaptive cross-layer control for deploy-able tactile internet systems over emerging 6G+ infrastructure. | 10.1109/TNSM.2026.3755916 |
| Jing Zhang, Chao Luo, Rui Shao | MTG-GAN: A Masked Temporal Graph Generative Adversarial Network for Cross-Domain System Log Anomaly Detection | 2026 | Early Access | Anomaly detection Adaptation models Generative adversarial networks Feature extraction Data models Load modeling Accuracy Robustness Contrastive learning Chaos Log Anomaly Detection Generative Adversarial Networks (GANs) Temporal Data Analysis | Anomaly detection of system logs is crucial for the service management of large-scale information systems. Nowadays, log anomaly detection faces two main challenges: 1) capturing evolving temporal dependencies between log events to adaptively tackle with emerging anomaly patterns, 2) and maintaining high detection capabilities across varies data distributions. Existing methods rely heavily on domain-specific data features, making it challenging to handle the heterogeneity and temporal dynamics of log data. This limitation restricts the deployment of anomaly detection systems in practical environments. In this article, a novel framework, Masked Temporal Graph Generative Adversarial Network (MTG-GAN), is proposed for both conventional and cross-domain log anomaly detection. The model enhances the detection capability for emerging abnormal patterns in system log data by introducing an adaptive masking mechanism that combines generative adversarial networks with graph contrastive learning. Additionally, MTG-GAN reduces dependency on specific data distribution and improves model generalization by using diffused graph adjacency information deriving from temporal relevance of event sequence, which can be conducive to improve cross-domain detection performance. Experimental results demonstrate that MTG-GAN outperforms existing methods on multiple real-world datasets in both conventional and cross-domain log anomaly detection. | 10.1109/TNSM.2026.3654642 |