Multicast Scheduling Algorithm for Wireless Network Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current multicast scheduling algorithms in wireless networks often limit data throughput for user terminals close to the base station by prioritizing fairness over signal strength, and existing solutions to improve throughput are impractical due to dynamic channel conditions and significant signaling overhead.
Innovation Solution
Implementing a method that receives data rate request values from wireless user terminals and assigns data rates to multicast groups based on these requests and average throughputs, selecting one group to transmit information at the assigned rate, using either Multicast Proportional Fairness (MPF) or Inter-Group Proportional Fairness (IPF) scheduling algorithms to maximize utility value.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multicast scheduling algorithms prioritize fairness among all user terminals by fixing data transmission rate to a default value, then fairness among user terminals is improved, but data throughput for user terminals close to the base station deteriorates
Solution Approach 1:
The patent changes the parameter being optimized from uniform fairness to proportional fairness. Instead of fixing data transmission rate to a default value for all terminals, the system calculates a proportional fairness metric that weights terminal throughput by their channel conditions. This allows terminals with better signal strength to receive higher data rates while still maintaining fairness relative to their capabilities, resolving the contradiction between fairness and throughput.
2Productivity
If multicast scheduling algorithms partition user terminals with similar channel conditions into different multicast groups, then data throughput is improved, but signaling overhead and system complexity deteriorate
Solution Approach 1:
The patent extracts the group partitioning mechanism from the scheduling algorithm. Instead of dynamically creating and managing multiple multicast groups based on channel conditions, the system maintains a single multicast group and applies proportional fairness scheduling directly to individual terminals within that group. This eliminates the signaling overhead associated with group membership changes while preserving the throughput benefits of channel-aware scheduling.
Data Source
AI summary
The invention includes a method and apparatus for scheduling multicast transmissions in a wireless network by selecting one of a plurality of multicast groups of a cellular region that is permitted to transmit information during a current timeslot. A method includes receiving data rate request values from wireless user terminals of each of a plurality of multicast groups, assigning a data rate to each multicast group using the data rate request values of wireless user terminals belonging to the respective multicast groups, selecting one of the multicast groups using the assigned data rates, and transmitting information to the selected one of the multicast groups at the associated assigned data rate. In one embodiment, the multicast scheduling algorithm may be a multicast proportional fairness (MPF) scheduling algorithm which attempts to maximize utility value of data received by individual users. In one embodiment, the multicast scheduling algorithm may be an inter-group proportional fairness (IPF) scheduling algorithm which attempts to maximize utility value of data received by multicast groups.