Centralized Resource Distribution for Inter-Cell Interference Coordination
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for inter-cell interference coordination in communication networks, such as those using orthogonal transmission schemes, face challenges in efficiently distributing resources across cells with irregular base station patterns and changing interference situations, leading to high computational efforts and suboptimal solutions due to the complexity of graph coloring problems.
Innovation Solution
A centralized method that assigns and reassigns resources to cells or sectors, ensuring neighboring cells have different resources, with a two-step process: a fast initial assignment and local area color re-assignment to optimize resource distribution and minimize interference, using a centralized algorithm that considers neighbor relations and interference weights.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Manufacturing precision
If a complete frequency plan is obtained by mobile measurements to maximize overall data throughput, then resource distribution optimality is improved, but computational effort increases significantly
Solution Approach 1:
The patent segments the network into local areas and processes resource assignment in two steps: first assigning resources globally to all cells, then performing localized reassignment only in areas with conflicts or new cells. This segmentation reduces the computational scope from the entire network to small local regions, significantly lowering computational effort while maintaining optimality in critical areas.
Solution Approach 2:
The patent performs a preliminary global resource assignment to all cells before conducting localized reassignment. This preliminary action establishes a baseline resource distribution that can be quickly refined in subsequent local optimization steps, avoiding the need to compute the complete optimal solution from scratch in every scenario.
2Adaptability or versatility
If resources are reassigned to accommodate new cells or changing interference situations, then adaptability is improved, but computational complexity increases
Solution Approach 1:
The patent implements a dynamic two-step resource assignment approach that adapts to changing network conditions. When new cells are added or interference situations change, the system performs localized reassignment in affected areas rather than recomputing the entire network configuration, enabling flexible adaptation with reduced computational overhead.
Solution Approach 2:
The patent applies different processing strategies to different parts of the network: global assignment for stable areas and localized reassignment for changing areas. This local quality approach ensures that computational resources are focused on areas that need adaptation while maintaining efficiency in stable regions.
3Speed
If a fast initial resource assignment is performed for all cells, then assignment speed is improved, but resource distribution optimality may be suboptimal in local areas
Solution Approach 1:
The patent divides the resource assignment process into two segments: a fast global assignment phase that provides immediate coverage, and a subsequent local reassignment phase that optimizes specific areas. This segmentation allows the system to achieve both speed in the initial phase and optimality in the refinement phase.
Solution Approach 2:
The patent continues the resource optimization process by performing local reassignment after the initial global assignment. This continuous action ensures that the system maintains both the speed advantage of fast initial assignment and the precision benefit of optimized local distribution.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
The invention concerns a method for distribution of resources from a pool of resources to cells (C1, C2,...) or sectors of a communication network (CN), whereby first, a central device (CED) in the communication network (CN) assigns resources to the cells (C1, C2,...) or the sectors in such a way, that if possible the resources of neighboring cells or sectors are different, and then, in a restricted area comprising cells or sectors for which no resources could have been assigned yet, or the same resources as in neighboring cells or sectors have been assigned, the central device (CED) reassigns the resources in such a way, that the resources of neighboring cells or sectors are different, a central device and a communication network therefor.