Cluster-Based Uplink Joint Scheduling for Interference Mitigation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional joint scheduling techniques in wireless networks consume substantial network resources and fail to effectively mitigate inter-cluster interference, limiting their ability to optimize throughput and coverage.
Innovation Solution
The method involves performing iterative and sequential joint scheduling within clusters, incorporating an out-of-cluster utility component to maximize sum utility, which includes loosely and tightly coordinated neighboring base stations, and using pico and macro base stations to coordinate scheduling decisions, thereby reducing signaling overhead and computational complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Object-affected harmful factors
If conventional joint scheduling techniques are used to coordinate scheduling decisions among neighboring base stations, then interference mitigation is improved, but network resource consumption increases
Solution Approach 1:
The patent divides the network into multiple clusters of base stations, where each cluster performs joint scheduling independently. This segmentation reduces the scope of coordination from the entire network to individual clusters, thereby reducing computational complexity and network resource consumption while still providing interference mitigation within each cluster.
Solution Approach 2:
Instead of requiring all base stations to participate in joint scheduling, the patent applies joint scheduling partially to clusters of base stations. This partial action approach allows interference mitigation to be achieved in key areas without the full computational burden of network-wide coordination.
2Device complexity
If clustering base stations into separate groups is performed to reduce scheduling complexity, then computational requirements are reduced, but inter-cluster interference mitigation is lost
Solution Approach 1:
The patent segments the network into clusters while introducing a mechanism where each cluster considers not only intra-cluster interference but also inter-cluster interference effects. This is achieved by having clusters exchange scheduling information and utility functions, allowing them to make scheduling decisions that account for external interference without requiring full network coordination.
Solution Approach 2:
The patent introduces an intermediary mechanism where clusters exchange scheduling information and utility function estimates with external clusters. This intermediary communication allows each cluster to incorporate inter-cluster interference considerations into their scheduling decisions without direct coordination between all clusters, thus maintaining reduced complexity while addressing inter-cluster interference.
3Productivity
If exhaustive search approaches are used to compute scheduling agreements, then scheduling optimization is improved, but computation time and network resources increase
Solution Approach 1:
The patent segments the scheduling optimization problem into cluster-level problems rather than network-wide problems. Each cluster performs optimization independently using its own scheduling information and utility functions, which dramatically reduces the computation time and resources required compared to exhaustive search across the entire network.
Solution Approach 2:
The patent applies optimization techniques partially at the cluster level rather than exhaustively at the network level. This partial optimization approach achieves sufficient scheduling improvement within each cluster without the computational burden of exhaustive network-wide search.
Data Source
AI summary
An embodiment method for performing joint scheduling in a cluster of base stations (BSs) of a wireless network includes receiving coarse scheduling information pertaining to external BSs and performing joint scheduling for the instant cluster of BSs such that a sum utility is maximized. The sum utility includes an out-of-cluster utility component representing interference observed by the external BSs as a result of the joint scheduling. The out-of-cluster utility component is computed in accordance with the coarse scheduling information.