Dynamic Resource Allocation in Cellular Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current methods for allocating resources in cellular networks face inefficiencies due to limited system capacity and co-channel interference, particularly in static channel allocation schemes, which do not adapt well to changing resource demands.
Innovation Solution
A non-iterative, rule-based algorithm dynamically allocates resources to cells or groups of cells based on current resource requests, using metrics to select cells for allocation, ensuring that resources are distributed optimally and avoiding reuse within cell groups, while maintaining linear complexity independent of the total number of resources.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If resources are reused in different cells to increase system capacity, then resource utilization improves, but co-channel interference increases
Solution Approach 1:
The network is divided into cell groups where resources are allocated independently within each group. By segmenting the network into manageable units with controlled resource reuse, the patent enables higher overall resource utilization while containing interference within localized groups rather than across the entire network.
Solution Approach 2:
Different resource allocation strategies are applied to different cell groups based on local conditions. Each cell group can have customized resource allocation that adapts to local interference patterns and traffic demands, allowing resource reuse where appropriate while protecting against interference in sensitive areas.
2Device complexity
If static channel allocation is used to simplify resource management, then device complexity decreases, but adaptability to changing resource demands worsens
Solution Approach 1:
The patent implements dynamic resource allocation where resources are assigned based on current traffic conditions and interference levels. The system continuously monitors network state and adjusts resource allocation accordingly, transitioning from static to dynamic management to balance complexity and adaptability.
Solution Approach 2:
The resource allocation system automatically adapts to changing conditions through self-organizing mechanisms. Cell groups independently manage their resource allocation based on local conditions, reducing the need for complex centralized control while maintaining high adaptability to varying demands.
3Productivity
If iterative algorithms are used to optimize resource allocation, then resource allocation efficiency improves, but computational complexity increases
Solution Approach 1:
The optimization problem is divided into smaller sub-problems by segmenting the network into cell groups. Each group undergoes independent optimization, reducing the overall computational complexity from a network-wide iterative solution to multiple smaller, more manageable local optimizations that can be performed more efficiently.
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
AI summary
The method involves classifying a network into multiple cell groups under consideration of a predetermined reuse distance. Each cell of the cell groups has a distance from each other, which is smaller than the predetermined reuse distance. The cell groups partially overlap each other. The effective number of requested resources is determined for each cell. An independent claim is included for a cellular network with multiple decentralized units for executing the method.