Wireless Scheduling Apparatus for CoMP Network Optimization
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In wireless network systems employing CoMP, the scalability of scheduling algorithms leads to inefficiencies as the number of transmission points and user wireless terminals increases, resulting in prolonged processing times to find the optimum combination for resource allocation, which cannot be completed within the scheduling period.
Innovation Solution
A scheduling apparatus and method that narrows down the search range by limiting the number of transmission points for each user wireless terminal based on the number of target users, using a storage unit, search range decision unit, combination generation unit, evaluation value calculation unit, and holding unit to quickly determine the optimal combination for resource allocation.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If a round-robin search is performed to calculate evaluation values for all possible combinations of transmission points and user wireless terminals, then the reliability of acquiring an optimum combination is improved, but the time required to find the optimum combination increases significantly when the network scale becomes larger
Solution Approach 1:
The patent divides the search space into two parts: a first set containing a small number of transmission points selected based on channel quality, and a second set containing the remaining transmission points. By segmenting the search in this manner, the patent reduces the computational complexity while maintaining reliable optimum combination acquisition through the selective combination of transmission points from both sets.
2Productivity
If the number of transmission points and user wireless terminals increases to improve network capacity and coverage, then the system throughput and coverage are improved, but the number of combinations to be searched becomes enormous, making it impossible to decide the optimum combination within the scheduling period
Solution Approach 1:
The patent performs preliminary selection of transmission points to create the first set based on channel quality indicators before the actual combination search. This preliminary action reduces the number of transmission points that need to be considered in the exhaustive search, thereby reducing computational complexity while maintaining the ability to achieve high system throughput through optimal CoMP scheduling.
Data Source
AI summary
A search range decision unit (103) first decides, as a narrow-down count, the number of transmission points for which each of user wireless terminals becomes a connection candidate, based on the number of user wireless terminals that perform wireless communication with one of the plurality of transmission points. In addition, the search range decision unit (103) limits, based on combination conditions stored in a storage unit (102), the number of the plurality of transmission points that can be combined with one of the user wireless terminals according to the narrow-down count, and sets combination limitation information that associates the plurality of transmission points with the user wireless terminals that are the connection candidates for each of the plurality of transmission points.