Resource Allocation in Heterogeneous Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In multi-RAT communications systems, base stations lack visibility into the data received by user equipment from multiple sources, leading to challenges in ensuring fair bandwidth distribution and quality of service, as they cannot objectively manage scheduling due to incomplete information about data consumption from uncontrolled networks.
Innovation Solution
A method where a controller generates a measure of data received from multiple sources and uses this information to regulate data communication schedules between user equipment and base stations, ensuring a predetermined minimum throughput and fair resource allocation across multiple user equipment, even when data is received from uncontrolled networks.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If base stations allocate resources without visibility into data from multiple sources, then device operation flexibility is improved, but fair bandwidth distribution deteriorates
Solution Approach 1:
The patent implements feedback mechanisms where UEs report traffic data to base stations, enabling the network to observe and respond to multi-RAT usage patterns. This feedback loop allows resource allocation decisions to be adjusted based on actual data consumption from multiple sources, resolving the contradiction between operational flexibility and fair bandwidth distribution.
Solution Approach 2:
The patent introduces intermediary entities such as network controllers and scheduling algorithms that aggregate and process traffic data from multiple sources. These intermediaries enable the base station to make informed resource allocation decisions without directly controlling all data paths, maintaining flexibility while ensuring fairness through centralized coordination.
2Adaptability or versatility
If base stations cannot observe data from uncontrolled networks, then network independence is improved, but quality of service management deteriorates
Solution Approach 1:
The patent implements preliminary actions by establishing measurement and reporting frameworks in advance. Base stations configure UEs to monitor and report traffic data from uncontrolled networks before resource allocation decisions are made. This proactive approach enables QoS management without compromising network independence, as the network has advance visibility into multi-RAT usage patterns.
Solution Approach 2:
The patent implements feedback mechanisms where UEs report traffic data to base stations, enabling the network to observe and respond to multi-RAT usage patterns. This feedback loop allows resource allocation decisions to be adjusted based on actual data consumption from multiple sources, resolving the contradiction between operational flexibility and fair bandwidth distribution.
3Device complexity
If resource allocation ignores multi-source data reception, then scheduling complexity is reduced, but throughput guarantee deteriorates
Solution Approach 1:
The patent applies partial action by implementing simplified scheduling mechanisms that focus on key metrics rather than complete multi-source traffic management. Base stations use representative samples of traffic data and simplified allocation algorithms that provide sufficient throughput guarantees without the complexity of comprehensive multi-source control, accepting that not all aspects of multi-RAT traffic can be optimally managed.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method, in a heterogeneous communications system, for resource allocation between user equipment (UE) and a base station node of the system, wherein the UE is operable to receive data contemporaneously from the node and at least one other source, the method comprising generating a measure representing the amount of data received by the UE from the or each other source, and using the generated measure to regulate a schedule for data communications between the UE and the base station node.