Agentic DDQN-Based Scheduling for Licensed and Unlicensed Band Allocation in Sidelink Networks

• URL: http://arxiv.org/abs/2509.06775v3
• Date: Mon, 22 Sep 2025 19:15:41 GMT
• Title: Agentic DDQN-Based Scheduling for Licensed and Unlicensed Band Allocation in Sidelink Networks
• Authors: Po-Heng Chou, Pin-Qi Fu, Walid Saad, Li-Chun Wang,
• Abstract summary: We present an agentic double deep Q-network (DDQN) scheduler for licensed/unlicensed band allocation in New Radio (NR) sidelink (SL) networks.<n>A capacity-aware, quality of service (QoS)-constrained reward aligns the agent with goal-oriented scheduling rather than static thresholding.
• Score: 37.89031907489481
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this paper, we present an agentic double deep Q-network (DDQN) scheduler for licensed/unlicensed band allocation in New Radio (NR) sidelink (SL) networks. Beyond conventional reward-seeking reinforcement learning (RL), the agent perceives and reasons over a multi-dimensional context that jointly captures queueing delay, link quality, coexistence intensity, and switching stability. A capacity-aware, quality of service (QoS)-constrained reward aligns the agent with goal-oriented scheduling rather than static thresholding. Under constrained bandwidth, the proposed design reduces blocking by up to 87.5% versus threshold policies while preserving throughput, highlighting the value of context-driven decisions in coexistence-limited NR SL networks. The proposed scheduler is an embodied agent (E-agent) tailored for task-specific, resource-efficient operation at the network edge.

Related papers

• High-Fidelity Network Management for Federated AI-as-a-Service: Cross-Domain Orchestration [0.12234742322758417]
  This paper introduces an assurance-oriented AI management plane based on Tail-Risk Envelopes (TREs)<n>TREs are signed, composable per-domain descriptors that combine deterministic guardrails with rate-latency-impairment models.<n>We show that tenant-level reservations prevent bursty traffic from inflating tail latency under TRE contracts.
  arXiv  Detail & Related papers  (2026-02-17T00:40:04Z)
• Hierarchical Online-Scheduling for Energy-Efficient Split Inference with Progressive Transmission [23.81409473238433]
  Device-edge collaborative inference with Deep Neural Networks (DNNs) faces fundamental trade-offs among accuracy, latency and energy consumption.<n>This paper proposes a novel ENergy-ACcuracy Hierarchical optimization framework for split Inference, named ENACHI.<n> Experiments on ImageNet dataset demonstrate that ENACHI outperforms state-of-the-art benchmarks under varying deadlines and bandwidths.
  arXiv  Detail & Related papers  (2026-01-13T01:56:46Z)
• QoS-Aware Hierarchical Reinforcement Learning for Joint Link Selection and Trajectory Optimization in SAGIN-Supported UAV Mobility Management [52.15690855486153]
  A space-air-ground integrated network (SAGIN) has emerged as an essential architecture for enabling ubiquitous UAV connectivity.<n>This paper formulates UAV mobility management in SAGIN as a constrained multiobjective joint optimization problem.
  arXiv  Detail & Related papers  (2025-12-17T06:22:46Z)
• Distributed Link Sparsification for Scalable Scheduling Using Graph Neural Networks (Journal Version) [50.894272363373126]
  In wireless networks characterized by dense connectivity, the significant signaling overhead generated by distributed link scheduling algorithms can exacerbate issues like congestion, energy consumption, and radio footprint expansion.<n>We propose a distributed link sparsification scheme employing graph neural networks (GNNs) to reduce scheduling overhead for delay-tolerant traffic while maintaining network capacity.<n>A GNN module is trained to adjust contention thresholds for individual links based on traffic statistics and network topology, enabling links to withdraw from scheduling contention when they are unlikely to succeed.
  arXiv  Detail & Related papers  (2025-09-05T18:59:14Z)
• Entanglement Request Scheduling in Quantum Networks Using Deep Q-Network [3.1856756516735936]
  A novel Deep Q-Network (DQN) based scheduling method is proposed to optimize delay time and fairness among entanglement requests in quantum repeater networks.<n>Results show that the proposed technique achieves higher performance compared to Greedy, Proportional fair and FIFO scheduling schemes.
  arXiv  Detail & Related papers  (2025-05-18T15:32:21Z)
• ReinWiFi: Application-Layer QoS Optimization of WiFi Networks with Reinforcement Learning [6.566362478263619]
  A distributed channel access (EDCA) mechanism can not adapt to particular quality-of-service (QoS) objective, network topology, and interference level.<n>In this paper, a novel reinforcement-learning-based scheduling framework is proposed and implemented.<n>It is demonstrated that the proposed framework can achieve a significantly better performance than the EDCA mechanism.
  arXiv  Detail & Related papers  (2024-05-06T14:44:06Z)
• Intent-Aware DRL-Based NOMA Uplink Dynamic Scheduler for IIoT [30.146175299047325]
  We investigate the problem of supporting Industrial Internet of Things user equipment (IIoT UEs) with intent (i.e., requested quality of service (QoS)) and random traffic arrival.<n>A deep reinforcement learning (DRL) based centralized dynamic scheduler for time-frequency resources is proposed to learn how to schedule the available communication resources.
  arXiv  Detail & Related papers  (2024-03-27T08:57:15Z)
• Client Orchestration and Cost-Efficient Joint Optimization for NOMA-Enabled Hierarchical Federated Learning [55.49099125128281]
  We propose a non-orthogonal multiple access (NOMA) enabled HFL system under semi-synchronous cloud model aggregation. We show that the proposed scheme outperforms the considered benchmarks regarding HFL performance improvement and total cost reduction.
  arXiv  Detail & Related papers  (2023-11-03T13:34:44Z)
• Matching Game for Optimized Association in Quantum Communication Networks [65.16483325184237]
  This paper proposes a swap-stable request-QS association algorithm for quantum switches. It achieves a near-optimal (within 5%) performance in terms of the percentage of served requests. It is shown to be scalable and maintain its near-optimal performance even when the size of the QCN increases.
  arXiv  Detail & Related papers  (2023-05-22T03:39:18Z)
• Scaling Limits of Quantum Repeater Networks [62.75241407271626]
  Quantum networks (QNs) are a promising platform for secure communications, enhanced sensing, and efficient distributed quantum computing. Due to the fragile nature of quantum states, these networks face significant challenges in terms of scalability. In this paper, the scaling limits of quantum repeater networks (QRNs) are analyzed.
  arXiv  Detail & Related papers  (2023-05-15T14:57:01Z)
• Guaranteed Dynamic Scheduling of Ultra-Reliable Low-Latency Traffic via Conformal Prediction [72.59079526765487]
  The dynamic scheduling of ultra-reliable and low-latency traffic (URLLC) in the uplink can significantly enhance the efficiency of coexisting services. The main challenge is posed by the uncertainty in the process of URLLC packet generation. We introduce a novel scheduler for URLLC packets that provides formal guarantees on reliability and latency irrespective of the quality of the URLLC traffic predictor.
  arXiv  Detail & Related papers  (2023-02-15T14:09:55Z)
• Artificial Intelligence Empowered Multiple Access for Ultra Reliable and Low Latency THz Wireless Networks [76.89730672544216]
  Terahertz (THz) wireless networks are expected to catalyze the beyond fifth generation (B5G) era. To satisfy the ultra-reliability and low-latency demands of several B5G applications, novel mobility management approaches are required. This article presents a holistic MAC layer approach that enables intelligent user association and resource allocation, as well as flexible and adaptive mobility management.
  arXiv  Detail & Related papers  (2022-08-17T03:00:24Z)
• Deep Reinforcement Learning for Wireless Scheduling in Distributed Networked Control [37.10638636086814]
  We consider a joint uplink and downlink scheduling problem of a fully distributed wireless control system (WNCS) with a limited number of frequency channels.<n>We develop a deep reinforcement learning (DRL) based framework for solving it.<n>To tackle the challenges of a large action space in DRL, we propose novel action space reduction and action embedding methods.
  arXiv  Detail & Related papers  (2021-09-26T11:27:12Z)
• QoS-Aware Scheduling in New Radio Using Deep Reinforcement Learning [2.3857747529378917]
  We propose a QA-Aware Deep Reinforcement learning Agent (QADRA) scheduler for NR networks. In our particular evaluation scenario, the QADRA scheduler improves network throughput by 30% while simultaneously maintaining the satisfaction rate of users served by the network.
  arXiv  Detail & Related papers  (2021-07-14T09:18:39Z)
• Bayesian Nonparametric Modelling for Model-Free Reinforcement Learning in LTE-LAA and Wi-Fi Coexistence [2.8427946758947304]
  This work features a Nonparametric Bayesian reinforcement learning algorithm to cope with the coexistence between Wi-Fi and LTE licensed assisted access (LTE-LAA) agents in 5 GHz unlicensed spectrum. A fairness measure is introduced in the reward function to encourage fair sharing between agents.
  arXiv  Detail & Related papers  (2021-07-06T07:11:34Z)
• Multi-Armed Bandit Based Client Scheduling for Federated Learning [91.91224642616882]
  federated learning (FL) features ubiquitous properties such as reduction of communication overhead and preserving data privacy. In each communication round of FL, the clients update local models based on their own data and upload their local updates via wireless channels. This work provides a multi-armed bandit-based framework for online client scheduling (CS) in FL without knowing wireless channel state information and statistical characteristics of clients.
  arXiv  Detail & Related papers  (2020-07-05T12:32:32Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.