Group-Based Greedy Scheduling for Wireless Resource Management
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current LTE systems face challenges in accommodating increasing data communication demands due to the limitations of frequency resources and the need for extensive network expansions, leading to high operational and capital expenditures, and require efficient radio resource management in multi-tier/small cell radio access networks.
Innovation Solution
A method and apparatus for efficient radio resource management in wireless communication systems, involving user equipment grouping and scheduling using a group-based greedy algorithm, which allows for base station cooperative communication with overlap, optimizing antenna usage, and power allocation to enhance network capacity and reduce costs.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If more base stations are constructed to accommodate increasing data communication demands, then network capacity is improved, but operational and capital expenditures increase
Solution Approach 1:
The patent applies base station cooperation where multiple base stations work together as a unified entity. User equipment can be served by multiple base stations simultaneously through coordinated multi-point transmission, merging the resources of multiple base stations to provide enhanced capacity without requiring each base station to operate independently at full capacity. This reduces the total number of base stations needed while maintaining or improving network capacity.
Solution Approach 2:
The patent enables base stations to serve multiple functions through cooperation. A single base station can participate in serving multiple user equipment across different clusters, and user equipment can be served by multiple base stations. This multi-functionality increases the utilization efficiency of each base station, reducing the need for additional infrastructure investments.
2Device complexity
If base station clusters do not overlap, then resource allocation is simplified, but network flexibility and adaptability are reduced
Solution Approach 1:
The patent segments the network into multiple base station clusters that can overlap in space. Each cluster is managed independently with its own resource allocation, but the segmentation allows for flexible composition and reconfiguration of clusters based on traffic demands and user equipment locations, providing both manageability and adaptability.
Solution Approach 2:
The patent implements dynamic cluster formation where base station clusters can be formed, modified, or dissolved based on real-time network conditions, user equipment mobility, and traffic demands. This dynamic approach allows the network to adapt to changing conditions while maintaining manageable resource allocation through the clustered structure.
Data Source
AI summary
The present invention relates to a wireless communication system. More specifically, the present invention relates to a method for scheduling a terminal in a wireless communication system permitting overlapping between base station clusters, and an apparatus therefor, the method comprising the steps of: grouping a plurality of terminals into a plurality of groups satisfying predetermined conditions; and selecting one more terminals for scheduling by means of a group-based greedy algorithm for each of the plurality of groups, wherein, in the group-based greedy algorithm, a check is skipped for whether the total number of base station antennas corresponding to each group is equal to or greater than the number of terminals selected from each group.