PDU Set Scheduling with Adaptive CG PUSCH Allocation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing wireless communication systems face challenges in efficiently scheduling protocol data unit (PDU) sets due to varying payload sizes and arrival times, leading to inefficiencies in resource allocation and power consumption, particularly in supporting enhanced mobile broadband and ultra-reliable low-latency communications (eXR) services.
Innovation Solution
The implementation of adaptive scheduling for PDU sets, where a wireless transmit/receive unit (WTRU) determines available configured grant (CG) PUSCH occasions based on delay thresholds, payload sizes, and traffic characteristics, switching between configured and dynamic grants to optimize resource usage and power efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If configured grant (CG) resources are allocated for PDU set transmission, then resource allocation efficiency is improved, but power consumption increases due to frequent PUSCH occasions
Solution Approach 1:
The system dynamically adjusts CG PUSCH occasion availability based on real-time PDU set characteristics. The WTRU determines whether to make CG PUSCH occasions available based on payload size thresholds and traffic patterns, transitioning between static and dynamic grant modes adaptively. This resolves the contradiction by making resource allocation dynamic rather than always using CG, thereby improving efficiency while reducing unnecessary power consumption.
Solution Approach 2:
The invention changes the parameter of CG PUSCH occasion availability from a fixed configuration to a variable state based on PDU set properties. When payload size exceeds a threshold or traffic patterns indicate benefit, CG PUSCH occasions are made available; otherwise, dynamic grants are used. This parameter change allows the system to optimize between resource efficiency and power consumption based on actual conditions.
2Productivity
If adaptive scheduling is implemented to optimize resource usage, then resource allocation efficiency is improved, but device complexity increases
Solution Approach 1:
The scheduling decision process is segmented into distinct evaluation stages: payload size threshold check, PDU set characteristic assessment, and CG PUSCH occasion availability determination. Each stage handles a specific aspect of the decision, reducing overall complexity by breaking down the adaptive scheduling logic into manageable segments rather than a monolithic complex system.
Solution Approach 2:
The system implements feedback mechanisms where the WTRU reports PDU set characteristics and reception of CG PUSCH occasion availability decisions back to the network. This feedback loop enables adaptive scheduling to function efficiently by providing necessary information for optimization without requiring overly complex centralized control, thereby improving resource allocation while managing device complexity.
Data Source
AI summary
Systems, methods, and tools may schedule protocol data unit (PDU) sets. A wireless transmit receive (WTRU) may receive configuration information, including a delay threshold and a configured grant (CG) arrangement, from a network node. The WTRU may receive a first PDU subset and related information from an application. The WTRU may estimate the payload size and arrival time of a second PDU subset. Based on the estimates and the payload size of the first subset, the WTRU may determine the first and second groups of CG PUSCH occasions. If the estimated arrival time difference between the two subsets is larger than the delay threshold, the WTRU may identify an available CG PUSCH occasion. The information may be sent to the network node.