Uplink Scheduling Based on Active Bearer Priority
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless communication networks, there is a need for fair and efficient allocation of communication resources in uplink without increasing the signalling load, as existing methods allow free-riding by prioritizing services based on radio bearers, leading to inefficient use of limited resources.
Innovation Solution
A method and apparatus that determine active radio bearers and prioritize data transmission based on the highest priority, detecting data transmission and service types to prevent free-riding by scheduling more prioritized services more frequently and reducing communication rates of less prioritized services using rate shaping.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If scheduling is based on highest priority bearer regardless of activity status, then prioritized services are scheduled more frequently, but free-riding traffic on lower priority bearers increases
Solution Approach 1:
The patent applies dynamics by making the scheduling priority dynamic rather than static. The network node determines whether a high-priority bearer is actively transmitting data and adjusts the scheduling behavior accordingly. When the high-priority bearer is active, the UE is scheduled with high priority; when inactive, the scheduling reverts to lower priority, preventing free-riding while maintaining responsiveness to actual service needs.
Solution Approach 2:
The patent implements feedback by continuously monitoring the activity status of radio bearers and using this information to adjust scheduling decisions. The network node receives feedback about data transmission status on different bearers and dynamically modifies the scheduling grants based on this feedback, ensuring that priority allocation reflects actual service requirements rather than static configuration.
2Measurement precision
If scheduling information is increased to accurately allocate resources, then resource allocation accuracy improves, but signalling load on air interface increases
Solution Approach 1:
The patent extracts only the essential scheduling information needed for accurate resource allocation. Instead of transmitting comprehensive scheduling information for all bearers, the network node determines bearer activity status and uses this extracted key information to make scheduling decisions. This reduces the amount of signalling required while maintaining sufficient accuracy for fair resource allocation.
Solution Approach 2:
The patent changes the scheduling parameter from a static priority value to a dynamic parameter that varies based on bearer activity status. By modifying the scheduling parameter according to actual transmission needs rather than using fixed priority values, the system achieves accurate resource allocation with minimal signalling overhead, as the parameter adaptation occurs at the network node without requiring additional uplink signalling from the UE.
Data Source
AI summary
A method performed by a communication network node is provided for scheduling of a User Equipment, UE, in a communication network which comprises the UE and the communication network node. The UE is arranged to communicate data on a plurality of bearers with the communication network node. In the method, one or more active bearers among the plurality of bearers are determined, the highest priority of the active bearers are determined, and a data transmission in uplink is scheduled for the UE based on the highest priority. By only taking active bearers in account when scheduling, UEs with non-active high priority bearer are prevented from performing free-riding traffic on lower prioritized bearers.