Base Station Grouping for Centralized Scheduler Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Legacy communication network designs with centralized schedulers face limitations in managing a large number of base stations, leading to reduced system throughput due to complexity and load constraints, which restricts the application of Proportional Fairness (PF) scheduling across multiple cells.
Innovation Solution
A method and apparatus for selecting a group of base stations to be mapped to an integral scheduler, utilizing received signal power and cell edge terminal information to determine optimal combinations that maximize network throughput, thereby enhancing PF across the entire system.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a centralized integrated scheduler manages a large number of base stations, then system throughput and Proportional Fairness are improved, but system complexity and computational load increase excessively
Solution Approach 1:
The patent segments the base station group into multiple subsets, with each integral scheduler managing a specific subset. This division reduces the computational load and complexity of each individual scheduler while maintaining the benefits of integrated scheduling across the entire network through coordination between multiple schedulers.
Solution Approach 2:
The patent introduces a new dimension of organization by grouping base stations into subsets and assigning them to different integral schedulers. This multi-level hierarchical structure allows the system to scale by adding more schedulers and subsets rather than increasing the burden on a single scheduler.
2Area of stationary object
If the number of base stations managed by an integral scheduler is increased, then network coverage and throughput are improved, but the scheduler reaches its management capacity limit
Solution Approach 1:
The patent divides the base station group into multiple subsets that can be managed by separate integral schedulers. This segmentation allows the network to cover a larger area by incorporating more base stations without overloading any single scheduler, as each scheduler handles a manageable subset.
Solution Approach 2:
The patent combines multiple integral schedulers to manage the entire base station group collectively. Each scheduler manages its assigned subset, and their coordinated operation achieves the benefits of managing a large number of base stations while keeping individual scheduler complexity manageable.
3Device complexity
If distributed scheduling is used for each base station independently, then system complexity is reduced, but overall network throughput and Proportional Fairness deteriorate
Solution Approach 1:
The patent merges multiple integral schedulers to manage base station subsets collectively, enabling coordinated resource allocation across the network. This combination maintains lower individual scheduler complexity while achieving improved network throughput and Proportional Fairness through integrated decision-making across subsets.
Solution Approach 2:
The patent segments the scheduling function across multiple integral schedulers, each handling a subset of base stations. This segmentation reduces the complexity burden on each scheduler compared to a single centralized scheduler managing all base stations, while still achieving coordinated network-wide optimization.
Data Source
AI summary
A method and apparatus for selecting a scheduling group of base stations is provided for use in a communication system. The method includes receiving, at the control apparatus, received signal power information for a signal received by a terminal; receiving cell edge terminal information on the terminal located at a cell edge; determining a combination of base stations that maximize throughput based on the received signal power information and the cell edge terminal information; and mapping the determined combination of the base stations to the integral scheduler.