Wireless Scheduling via Virtual Link Adaptation Priority
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication systems face challenges in efficiently managing air interface resources and meeting Quality of Service (QoS) demands, particularly in dynamic channel allocation scenarios where multiple shared channels are involved, leading to suboptimal air interface efficiency and fairness among users.
Innovation Solution
A new scheduling method that calculates a priority function based on virtual link adaptation parameters, considering Quality of Service requirements, current buffer status, and potential data rates across multiple shared channels, allowing for optimized fairness, throughput, and simultaneous service of multiple flows.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional scheduling methods are used in dynamic channel allocation, then system implementation is simpler, but air interface efficiency and QoS fulfillment deteriorate
Solution Approach 1:
The patent transforms the scheduling decision process by changing from conventional simple scheduling parameters to a comprehensive priority function that incorporates multiple parameters including QoS requirements, buffer status, channel quality indicators, and potential data rates. This parameter transformation enables the system to achieve optimal air interface efficiency by dynamically adjusting scheduling decisions based on real-time system state across multiple shared channels.
2Reliability
If scheduling considers multiple QoS parameters and buffer status, then QoS fulfillment improves, but calculation complexity increases
Solution Approach 1:
The patent segments the complex scheduling decision into distinct computational components: determining virtual link adaptation parameters for each shared channel, calculating potential data rates separately, evaluating buffer status independently, and combining these segmented results through the priority function. This segmentation allows the system to maintain high QoS fulfillment through comprehensive parameter consideration while managing calculation complexity through modular processing of individual channel and flow characteristics.
Solution Approach 2:
The patent performs preliminary calculations of virtual link adaptation parameters and potential data rates for all shared channels before executing the final scheduling decision. By pre-computing these parameters based on channel state information and QoS requirements, the system reduces the complexity of the actual scheduling moment while ensuring accurate QoS fulfillment through thorough advance evaluation of all relevant factors.
3Ease of operation
If conventional scheduling is used, then implementation is simpler, but fairness among users deteriorates
Solution Approach 1:
The patent creates a universal scheduling framework that simultaneously handles multiple shared channels, diverse QoS requirements, and various user fairness considerations through a single priority function formulation. This multi-functional approach ensures fair treatment of all users across different channels by incorporating channel quality, buffer status, and QoS parameters for each user- channel combination, achieving comprehensive fairness without requiring separate specialized scheduling mechanisms for each scenario.
Data Source
AI summary
A method is described for scheduling a plurality of data flows to a plurality of shared channels in a wireless communication system transmitting data packets in time intervals of frames and applying adaptive modulation and coding. The method comprises the steps of determining virtual link adaptation parameters for at least a part of all combinations of data flow and shared channel, based on state information from the respective shared channel, and based on Quality of Service requirements for the respective data flow; calculating potential data rates for said combinations of data flow and shared channel, based on said virtual link adaptation parameters; calculating priority values for said combinations of data flow and shared channel, based on said potential data rates; and selecting, based on the calculated priority values, for at least a part of the shared channels, a data flow for which data is to be transmitted on each of these shared channel during the time interval of one frame.