Concurrent Random Access Procedures for Wireless Scheduling Requests
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current wireless communication systems, such as LTE, can only handle one Random-Access procedure at a time, leading to potential delays in critical services like public safety and vehicular communications, as they cannot initiate multiple concurrent RACH procedures efficiently, especially when prioritization of SI requests is involved.
Innovation Solution
A method and apparatus for user equipment (UE) to initiate and manage multiple random-access procedures in parallel, allowing simultaneous scheduling request transmission for different radio bearers with varying priorities, even if one procedure is already pending, by determining if simultaneous transmission is permitted and using physical uplink control channel resources for scheduling request messaging.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Loss of time
If only one Random-Access procedure is handled at a time, then system complexity is reduced and resource management is simplified, but access delay increases for critical services
Solution Approach 1:
The patent segments the Random-Access procedure management by introducing bearer-specific control mechanisms. Each radio bearer can independently trigger and manage its own RACH procedure through dedicated logical channels and MAC entities, allowing parallel access procedures for different bearers simultaneously. This segmentation resolves the contradiction by enabling multiple concurrent procedures (reducing access delay) while maintaining manageable complexity through structured bearer-specific control.
Solution Approach 2:
The patent introduces a new dimension of bearer identification and prioritization into the RACH procedure management. By associating each RACH procedure with specific radio bearers and logical channels, the system can differentiate and prioritize access requests across multiple dimensions (bearer type, service criticality, QoS requirements). This dimensional expansion allows critical services to obtain faster access while non-critical services can proceed asynchronously, resolving the time-delay vs. complexity contradiction.
2Productivity
If multiple concurrent RACH procedures are initiated, then access efficiency for critical services improves, but power consumption and resource allocation complexity increase
Solution Approach 1:
The patent implements dynamic power allocation and resource assignment for concurrent RACH procedures. The base station receives RACH requests from multiple bearers simultaneously and dynamically determines power allocation, resource grants, and procedure prioritization based on current network conditions, QoS requirements, and service criticality. This dynamic control enables high access efficiency for critical services while optimizing overall power consumption by adjusting resources in real-time rather than allocating fixed resources to all procedures.
Solution Approach 2:
The patent changes key parameters such as power allocation levels, resource grant sizes, and procedure timing based on bearer priority and service type. High-priority bearers receive optimized parameter configurations that enable faster access with appropriate power levels, while lower-priority bearers receive adjusted parameters that reduce overall power consumption. This parameter adaptation resolves the contradiction between access efficiency and power usage by tailoring resource characteristics to specific service requirements.
3Loss of time
If simultaneous scheduling request transmission is permitted for multiple bearers, then access latency is reduced, but signal interference and transmission reliability issues arise
Solution Approach 1:
The patent introduces the base station as an intermediary that coordinates and manages simultaneous scheduling requests from multiple bearers. Rather than allowing UEs to transmit scheduling requests independently without coordination, the base station receives prioritization information, determines appropriate transmission timing and resources, and assigns orthogonal resources to different bearers. This intermediary control reduces access latency by permitting simultaneous requests while maintaining transmission reliability through coordinated resource allocation and interference management.
Solution Approach 2:
The patent implements preliminary prioritization and resource assignment before simultaneous transmissions occur. The UE provides prioritization information for each bearer's scheduling request in advance, and the base station pre-determines resource allocation, power levels, and timing assignments before the actual transmissions. This preliminary action enables simultaneous transmissions to proceed with reduced latency while maintaining reliability through pre-coordinated resource distribution that prevents harmful interference.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
For handling multiple UL access procedures, methods, apparatus, and systems are disclosed. One apparatus (300) includes a processor (305) and a transceiver (325) for communicating with a mobile communication network using a plurality of radio bearers. The processor (305) initiates (705) a first random-access procedure for a first radio bearer. The processor (305) receives (710) a scheduling request trigger for a second radio bearer while the first random-access procedure remains pending. The processor (305) determines (715) whether simultaneous scheduling request transmission is permitted, wherein the transceiver (325) transmits (720) a first scheduling request message for the second radio bearer in response to simultaneous scheduling request transmission being permitted.