Autonomous Resource Block Assignment in Relay Networks
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional relay-assisted networks face inefficiencies due to centralized resource distribution schemes, leading to high overhead and latency in large networks with numerous relays, necessitating autonomous resource block assignment in cellular networks with self-organizing relaying terminals.
Innovation Solution
A greedy-based autonomous resource block assignment scheme is implemented, where relay terminals use iterative sequential selection techniques to generate and store RB assignment sequences, adapting to changes in available RBs without centralized coordination, using cyclic groups and lookup tables to minimize collisions and computational complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If centralized resource distribution schemes are used in relay-assisted networks, then resource allocation can be coordinated by the base station, but overhead and latency increase significantly in networks with large numbers of relays
Solution Approach 1:
The patent implements self-service by enabling relay terminals to autonomously generate and manage their own resource block assignment sequences without requiring continuous base station coordination. Each relay independently creates assignment sequences using cyclic group theory, allowing self-organized resource distribution that eliminates the latency and overhead associated with centralized control while maintaining coordinated allocation through mathematical structure
2Reliability
If centralized resource distribution schemes are used in relay-assisted networks, then resource allocation can be coordinated by the base station, but communication overhead increases significantly in networks with large numbers of relays
Solution Approach 1:
Relay terminals independently generate resource block assignment sequences using local computational resources based on cyclic group theory, eliminating the need for extensive base station-to-relay communication. The mathematical structure ensures coordinated allocation without requiring continuous information exchange, dramatically reducing overhead while maintaining allocation reliability
Solution Approach 2:
The patent segments the resource allocation function by distributing the sequence generation capability across individual relay terminals rather than centralizing it at the base station. Each relay maintains its own assignment sequence independently, dividing the overall coordination task into discrete, autonomous units that operate without requiring constant centralized control
3Manufacturing precision
If exhaustive search methods are used to generate RB assignment sequences, then optimal sequences can be found, but computational complexity becomes prohibitive for large networks
Solution Approach 1:
The patent changes the fundamental parameter for sequence generation from exhaustive search to cyclic group theory-based construction. By using cyclic groups and their mathematical properties, the system achieves optimal or near-optimal assignment sequences through efficient parameter manipulation rather than brute-force search, reducing computational complexity from exponential to polynomial time complexity while maintaining sequence optimization
Solution Approach 2:
The patent replaces the mechanical exhaustive search process with a mathematical framework based on cyclic group theory. Instead of systematically checking all possible sequences (mechanical approach), the system generates sequences through mathematical operations on cyclic groups, substituting computational brute-force with elegant mathematical structure to achieve optimal results with minimal complexity
4Loss of time
If autonomous resource block assignment is implemented at relay terminals, then overhead and latency are reduced, but collision probability between relays increases
Solution Approach 1:
The patent changes the assignment sequence parameters by using cyclic group theory to generate sequences with specific mathematical properties that minimize collisions. The cyclic group structure ensures that sequences are distributed in a way that reduces overlap between different relays' assignments, lowering collision probability while maintaining autonomous operation and reduced latency
Solution Approach 2:
The system incorporates feedback mechanisms where relays monitor their resource block assignments and can adjust their sequences based on observed collisions or interference. This feedback loop allows the autonomous assignment system to learn from its operation and refine its sequence selection, reducing collision probability over time while maintaining the latency benefits of autonomous operation
Data Source
AI summary
Iterative sequential selection techniques can be used to efficiently compute RB assignment sequences in relay-assisted networks. Embodiment techniques construct a graphical representation of a cyclic group based on a selected pattern in a set of patterns and a selected cyclic-shift in a plurality of cyclic shifts. Remaining patterns are placed in a unitary group, and an iterative sequential selection technique is used to evaluate the remaining patterns in the unitary group for each of the cyclic shifts over a sequence of iterations, thereby complete the list of RB assignment sequences. At the end of each iteration, a new RB assignment sequence is added based on the pattern, cyclic shift tuple producing the fewest collisions with occupied resource blocks of the graphical representation.