Random Access Back-Off Time Bounds for Throughput
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current random access procedures in wireless communication systems, particularly in 3GPP LTE, face inefficiencies due to the lack of a non-zero lower bound for back-off time in random access preamble retransmissions, leading to decreased throughput under varying traffic loads.
Innovation Solution
A method is introduced where a user equipment (UE) selects a back-off time value between a lower bound and an upper bound, with the lower bound being non-zero and randomly selected according to a uniform distribution, to optimize the random access procedure by avoiding small wait times and improving throughput.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If a conventional random access procedure with zero lower bound for back-off time is used, then the procedure is simple to implement, but the throughput decreases under varying traffic loads
Solution Approach 1:
The patent changes the parameter of back-off time lower bound from zero to a non-zero value determined by network conditions. The base station determines the lower bound based on traffic load and other parameters, and the UE selects the back-off time uniformly from [lower bound, upper bound]. This parameter change resolves the contradiction by improving throughput through non-zero lower bound while maintaining implementation simplicity through standardized uniform distribution selection.
2Productivity
If a non-zero lower bound for back-off time is introduced, then throughput is improved under varying traffic loads, but the complexity of determining back-off time parameters increases
Solution Approach 1:
The UE performs self-service by randomly selecting the back-off time from the determined range [lower bound, upper bound] using uniform distribution. The base station determines the bounds based on network conditions, and the UE independently selects the back-off time without further intervention. This self-service mechanism improves throughput while keeping the operation process simple and standardized.
3Productivity
If the back-off time lower bound is set to zero, then the random access procedure is easy to implement, but the variance of traffic load distribution is reduced leading to lower throughput
Solution Approach 1:
The back-off time determination is segmented into two independent parts: the lower bound determination (performed by the base station based on traffic load) and the upper bound determination (performed by the UE based on random selection). This segmentation allows the system to achieve higher throughput through non-zero lower bound while maintaining ease of implementation through clear division of responsibilities and standardized procedures.
Data Source
AI summary
A method for performing random access is provided. The method is performed for random access procedure based on a lower bound of back-off time and an upper bound of back-off time. Based on the proposed method, subsequent transmission of a random access preamble is determined by control information included in a random access response. The control information explicitly or implicitly indicates an upper bound and a lower bound of a back-off time value. An exact back-off time is selected from a uniform distribution between the lower bound and the upper bound.