🤖 AI Summary
This work addresses the challenge that conventional configured grant (CG) scheduling struggles to meet the bounded latency requirements of deterministic communication under variable traffic conditions. To overcome this limitation, the paper proposes a novel CG scheduling mechanism that integrates traffic prediction with robust optimization, explicitly incorporating prediction uncertainty into resource pre-allocation decisions for the first time. The approach dynamically adapts to the heterogeneous latency constraints of mixed traffic types while ensuring bounded end-to-end delays. By jointly optimizing resource allocation under uncertainty, the method significantly improves resource utilization without compromising timing guarantees. Extensive evaluations demonstrate that the proposed scheme maintains superior performance even in highly dynamic and diverse traffic scenarios, thereby substantially enhancing the system’s capability to support deterministic services.
📝 Abstract
Future wireless networks must enhance their capacity to sustain deterministic service levels and support emerging time-sensitive services in key verticals. The ability to guarantee bounded latencies heavily depends on efficient radio resource management. Configured Grant (CG) scheduling can reduce latency by pre-allocating resources, but its effectiveness and efficiency decrease under variable traffic patterns. This study presents a novel predictive CG scheduling scheme that pre-allocates resources based on traffic predictions while accounting for prediction inaccuracies. By considering these inaccuracies, the scheme significantly improves the ability to meet bounded latency requirements, which are essential for supporting deterministic service levels. Our evaluations show that the proposed scheme significantly enhances the capacity to support deterministic service levels while improving resource utilization, even in scenarios with variable and mixed traffic flows with diverse requirements.