Random access method, system, device and terminal for adaptive distributed queue

Abstract

The present invention belongs to the field of wireless communication technology, and discloses a random access method, system, device and terminal of an adaptive distributed queue. If a device conflict occurs, an adaptive distributed queue conflict resolution method is executed, otherwise the device successfully accesses the network; wherein the adaptive distributed queue conflict resolution method is: when the number of devices in the group is less than the optimal value, the number of devices in the group in the conflict resolution queue is adaptively adjusted according to the device type requirements, so that the relevant performance is optimized, including delay-sensitive devices obtaining the lowest delay or low-power devices consuming the lowest energy consumption; analyzing the impact of uplink authorization restrictions on related performance, so that resource utilization efficiency is optimized. The present invention can adaptively adjust the number of devices in the group in the conflict resolution queue according to the device type requirements, so that the performance of average conflict resolution delay and average conflict resolution energy consumption can be improved. For both delay-sensitive devices and low-power devices, the present invention can achieve optimal performance.

Description

Technical Field

[0001] This invention belongs to the field of wireless communication technology, and particularly relates to a random access method, system, device and terminal for adaptive distributed queue (DQ), which can be used for conflict resolution in wireless communication. Background Technology

[0002] Currently, the concept of the Internet of Things (IoT) has become a hot research area since its inception, with its widespread applications already touching upon all aspects of human life. It is considered the third wave of information industry development after computers and the internet. As one of the key technologies of IoT, Machine-to-Machine (M2M) communication enables autonomous communication between machine devices without human intervention, and is an important way to realize the IoT's vision of "interconnected everything." According to predictions from research institutions such as 3GPP, in the next decade, global M2M traffic will be tens or even hundreds of times greater than Human-to-Human (H2H) traffic, with the number of connected devices reaching tens of billions. Meanwhile, my country is currently one of the world's largest M2M market regions, and it is crucial to continue improving its M2M communication network construction capabilities and equipment manufacturing capabilities to promote the development of the M2M industry. Therefore, M2M has broad application prospects and will become a highly promising information industry; researching M2M applications and its large-scale communication is of great significance.

[0003] Due to the sheer number of Machine Type Communication (MTC) devices, the simultaneous initiation of random access requests by a large number of MTC devices can overload base stations, leading to severe congestion. This results in increased access latency and energy consumption for MTC devices, and prolonged congestion can even prevent devices from accessing the network. Therefore, to address scenarios where large-scale M2M devices simultaneously initiate access requests, it is necessary to improve the Physical Random Access Channel (PRACH)'s ability to handle and resolve collisions to address congestion issues under high base station load. Much work has been done on efficient collision resolution, and 3GPP has proposed several congestion avoidance solutions to address this challenge, such as device classification management, random backoff mechanisms, and Access Class Barring (ACB). These mechanisms reduce the number of devices simultaneously initiating access requests by setting relevant parameters to alleviate congestion. However, these mechanisms also have significant drawbacks; fixed parameter configurations cannot resolve collision issues under complex load conditions. Another study proposed a random access mechanism based on a distributed queue, in which devices that fail to access enter a conflict resolution queue to wait for another access attempt. However, due to the problem of over-division in the later stages of conflict resolution, the conflict resolution time is too long.

[0004] Most existing solutions only address conflict resolution within specific device type scenarios, such as low latency and low power consumption. Base stations cannot adaptively adjust their operating modes to meet the needs of different device types; therefore, adaptive conflict resolution methods are required. Furthermore, existing solutions do not consider the impact of uplink license restrictions on related performance.

[0005] Based on the above analysis, the problems and shortcomings of the existing technology are as follows:

[0006] (1) In the existing blocking avoidance schemes, the fixed parameter configuration cannot solve the conflict problem under complex load conditions, and the excessive division problem in the later stage of conflict resolution will cause the conflict resolution delay to be too long.

[0007] (2) Existing technologies can only solve conflict problems in specific equipment type scenarios, but base stations cannot adaptively adjust their working modes according to equipment type to meet the needs of different types of equipment.

[0008] (3) The existing technology does not take into account the impact of uplink licensing restrictions on related performance. Summary of the Invention

[0009] To address the problems existing in the prior art, this invention provides a method, system, device, and terminal for random access of an adaptive distributed queue.

[0010] This invention is implemented as follows: an adaptive distributed queue random access method addresses the congestion problem that occurs during random access of large-scale devices. When device conflicts occur, the proposed method constructs a conflict resolution queue according to the sequence number of the conflicting devices. When the number of devices in a group is greater than the optimal number of devices in the group, random access is initiated sequentially according to the conflict resolution queue order. When the number of devices in a group is less than the optimal number of devices in the group, the devices in the current subgroup are merged with those in subsequent subgroups to achieve the optimal number of devices in the group. This scheme reduces latency or energy consumption by controlling the number of devices in a group; it includes:

[0011] If a conflict occurs between devices, an adaptive distributed queue conflict resolution method is executed; otherwise, the device successfully accesses the network. The adaptive distributed queue conflict resolution method involves: when the number of devices in a group is less than the optimal value, adaptively adjusting the number of devices in the conflict resolution queue according to device type requirements to optimize related performance, including ensuring latency-sensitive devices achieve the lowest latency or low-power devices consume the lowest energy; and analyzing the impact of uplink license restrictions on related performance to optimize resource utilization efficiency.

[0012] Furthermore, the adaptive distributed queue random access method includes the following steps:

[0013] Step one: The base station periodically transmits random access configuration information via broadcast signals. This random access configuration information includes the number of available preambles, the physical random access channel, and the optimal number of devices within a group. The optimal number of devices within a group is the number of devices within the group that maximizes performance. This provides the necessary parameters for the execution of random access.

[0014] Step two, the device sends access request information; the access request information is as follows: the device randomly selects one preamble sequence from the available preambles based on the broadcast information; in this random access opportunity, it is transmitted through the physical random access channel, and the preamble sequence serves as the access request information. The device informs the base station to initiate random access.

[0015] Step 3: The base station responds with a random access response. After receiving the access request information, the base station decodes the access request information and sends a random access response back to each access request via the physical downlink shared channel. The base station responds to the device's random access request and allocates access resources to it.

[0016] Step four: The device sends a connection request message; the connection request message is as follows: after receiving the random access response message, the device transmits the data within the uplink resource block allocated to it by the base station. The device sends the connection request on the resources allocated by the base station.

[0017] Step 5: Determine if a device conflict has occurred. If multiple devices select the same preamble sequence as their transmission request information, a conflict exists between the devices, and the conflict resolution phase will begin. An adaptive DQ conflict resolution method will be executed according to the device type. If no conflict exists, the base station sends a conflict resolution message to the device, and the device successfully accesses the network. Conflict resolution for conflicting devices will be performed using the proposed adaptive DQ conflict resolution method.

[0018] Furthermore, the adaptive DQ conflict resolution method in step five includes:

[0019] Devices that fail to access due to selecting the same preamble sequence are grouped together, and a conflict resolution queue is formed by the sequence number of the preamble sequence. When the number of devices in the group is greater than the optimal number of devices in the group, random access is re-initiated in the next random access opportunity according to the order of the conflict resolution queue. When the number of devices in the group is less than the optimal number of devices in the group, the devices in the subgroup are merged with the devices in the subsequent subgroups to make the number of devices in the group reach the optimal value.

[0020] Furthermore, the average conflict resolution delay of the device is expressed as:

[0021]

[0022] Where M represents the number of devices simultaneously initiating access, and N g For the optimal number of devices in the group, d total To avoid exceeding the maximum number of preamble transmissions, d U d represents tree splitting U Only after the layer is reached can a device successfully connect. l(d,N) represents the number of devices that successfully resolved conflicts in each group at level d of the tree split. g L(d,N) represents the number of common groups at the d-th level of the tree split; g The number of random access opportunities required to resolve a conflict at layer d represents the average number of random access opportunities needed to complete the conflict resolution process. This represents the window size for a random access opportunity.

[0023] The latency-sensitive device needs to meet low latency requirements for the number of users N in the group. g After optimization, the number of devices in the optimal latency group is expressed as:

[0024]

[0025] Among them, the number of devices in the group N g It is a positive integer, and the upper limit is set to N. g_max Set the parameter to N g_max =N p Np This indicates that a leading number is available.

[0026] Furthermore, the number of devices that successfully resolved conflicts in each group at the d-th level of the tree split. It is also affected by the maximum uplink authorization number, expressed as:

[0027]

[0028] Where g is the maximum number of uplink licenses obtained, and P s (d,N g ) represents the probability of conflict resolution at level d in a tree split. This represents the number of devices that simultaneously initiate conflict resolution in each group at level d.

[0029] Furthermore, the average conflict resolution energy consumption includes preamble transmission energy, energy for receiving the RAR, and energy for maintaining clock synchronization. The average conflict resolution energy consumption is expressed as:

[0030] E(M,N g ) = E PA (M,N g )+E RAR (M,N g )+E idle (M,N g );

[0031] The three parts of energy are represented as follows:

[0032] E PA (M,N g )=R(M,N g )*P PA *D PA ;

[0033] E RAR (M,N g )=R(M,N g )*P RAR *D RAR ;

[0034] E idle (M,N g )=T(M,N g )*P idle ;

[0035] Where T(M,Ng) represents the average conflict resolution delay; P PA P RAR and P idle These represent the power required to transmit the preamble, the power required to receive RAR information, and the power required to maintain device operation, respectively; D PA and D RARR(M,N) represents the transmit preamble duration and the receive RAR window size, respectively; g R(M,N) represents the average number of preamble transmissions when M devices are connected. g The formula for ) is:

[0036]

[0037] in, This represents the number of devices that failed to connect at level d in the tree split.

[0038] The low-power device needs to meet low energy consumption requirements, and the number of users N in the group needs to be... g After optimization, the optimal number of devices in the energy consumption group is expressed as:

[0039]

[0040] Among them, the number of devices in the group N g It is a positive integer, and the upper limit of its range is N. g_max Set the parameter to N g_max =N p .

[0041] Another object of the present invention is to provide an adaptive distributed queue random access system that applies the aforementioned adaptive distributed queue random access method, the adaptive distributed queue random access system comprising:

[0042] The configuration information sending module is used by the base station to periodically send random access configuration information via broadcast signals. The random access configuration information includes the number of available preambles, the physical random access channel, and the optimal number of devices in the group. The optimal number of devices in the group is the number of devices in the group that maximizes the relevant performance.

[0043] The access request information sending module is used by the device to send access request information. The access request information is a preamble sequence randomly selected by the device from the available preambles based on the broadcast information. In this random access opportunity, it is transmitted through the physical random access channel, and the preamble sequence serves as the access request information.

[0044] The access request information decoding module is used by the base station to reply with a random access response. After receiving the access request information, the base station decodes the access request information and uses the physical downlink shared channel to send back a random access response for each access request.

[0045] The connection request information sending module is used for the device to send connection request information. The connection request information is transmitted in the uplink resource block allocated to the device by the base station after the device receives the random access response information.

[0046] The device conflict determination module is used to determine whether a conflict has occurred between devices. If multiple devices select the same preamble sequence as the transmission request information, there is a conflict between the devices, and the conflict resolution phase will be entered. An adaptive DQ conflict resolution method will be executed according to the device type. If there is no conflict, the base station sends a conflict resolution message to the device, and the device successfully accesses the network.

[0047] Another object of the present invention is to provide a computer device including a memory and a processor, the memory storing a computer program, which, when executed by the processor, causes the processor to perform the adaptive distributed queue random access method described above.

[0048] Another object of the present invention is to provide a computer-readable storage medium storing a computer program, which, when executed by a processor, causes the processor to perform the adaptive distributed queue random access method described above.

[0049] Another objective of this invention is to provide an information data processing terminal for implementing the aforementioned adaptive distributed queue random access system.

[0050] Based on the above technical solutions and the technical problems solved, please analyze the advantages and positive effects of the technical solution to be protected by this invention from the following aspects:

[0051] First, addressing the technical problems existing in the prior art and the difficulty in solving them, this paper closely analyzes, in conjunction with the technical solution to be protected by this invention and the results and data obtained during the research and development process, how the technical solution of this invention solves the technical problems, and the inventive technical effects brought about by solving these problems. The specific description is as follows:

[0052] This invention provides a random access method based on an adaptive distributed queue. If a device conflict occurs, an adaptive distributed queue conflict resolution method is executed; otherwise, the device successfully accesses the network. The main feature of the adaptive distributed queue conflict resolution method is that when the number of devices in a group is less than the optimal value, the number of devices in the conflict resolution queue is adaptively adjusted according to the device type requirements to achieve optimal performance, such as ensuring that latency-sensitive devices achieve the lowest latency or that low-power devices consume the lowest energy. In addition, the impact of uplink license restrictions on related performance is analyzed to optimize resource utilization efficiency. Simulations show that this invention provides significant performance improvements compared to the ACB mechanism and the traditional C-DQ mechanism.

[0053] The adaptive DQ conflict resolution method provided by this invention shortens the conflict resolution queue length, thereby reducing the average conflict resolution latency for latency-sensitive devices and the average conflict resolution energy consumption for low-power devices. Latency-sensitive devices need to meet low latency requirements, and this applies to groups with N users. g Optimization can ensure the shortest conflict resolution latency; low-power devices need to meet low power consumption requirements, for the number of users N in the group. g Optimize the system to ensure the lowest possible energy consumption for conflict resolution.

[0054] This invention calculates the optimal number of devices within a group based on different device types. The base station then executes an adaptive distributed queue (DQ) conflict resolution process according to the optimal number of devices in the group to meet device requirements. The random access method based on adaptive distributed queues provided by this invention can be used for conflict resolution in wireless communication.

[0055] Second, considering the technical solution as a whole or from a product perspective, the technical effects and advantages of the technical solution to be protected by this invention are specifically described as follows:

[0056] This invention adaptively adjusts the number of devices in a conflict resolution queue based on device type requirements, thereby improving the performance of average conflict resolution latency and average conflict resolution energy consumption. This invention achieves optimal performance for both latency-sensitive and low-power devices. Furthermore, this invention analyzes the impact of uplink license restrictions on relevant performance, optimizing resource utilization efficiency.

[0057] Third, as supplementary evidence of the inventive step of the claims of this invention, it is also reflected in the following important aspects:

[0058] (1) The expected benefits and commercial value of the technical solution of this invention after transformation are as follows:

[0059] This invention can effectively reduce round-trip latency or energy consumption in device communication while ensuring high communication reliability, for different device types, ensuring a good user experience, promoting more rational and effective energy use for enterprises, maximizing energy-saving benefits, and contributing to the sustainable development of energy.

[0060] (2) The technical solution of this invention fills a technical gap in the industry both domestically and internationally:

[0061] Highly efficient and reliable random access technology is a crucial prerequisite for establishing communication links between base stations and devices and is key to ensuring effective data transmission in the system, attracting widespread attention in recent years. However, existing research results cannot meet the low-latency and high-energy-efficiency access requirements of large-scale MTC devices in the Internet of Things (IoT). Therefore, this invention proposes a random access method based on adaptive DQ to ensure the low-latency, low-energy-consumption, and high-reliability access requirements of massive MTC devices. Attached Figure Description

[0062] To more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings used in the embodiments of the present invention will be briefly introduced below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.

[0063] Figure 1 This is a schematic diagram of information interaction between a base station and a device provided in an embodiment of the present invention;

[0064] Figure 2 This is a flowchart of the random access method for an adaptive distributed queue provided in an embodiment of the present invention;

[0065] Figure 3 This is a schematic diagram of the adaptive DQ conflict resolution mechanism provided in an embodiment of the present invention;

[0066] Figure 4 This is a schematic diagram of the adaptive DQ conflict resolution queue provided in an embodiment of the present invention;

[0067] Figure 5 This is a schematic diagram illustrating the impact of uplink authorization restrictions on related performance, provided in an embodiment of the present invention.

[0068] Figure 6 This is a comparison chart of the average conflict resolution delay provided by the embodiments of the present invention with other methods;

[0069] Figure 7 This is a comparison chart of the average conflict resolution energy consumption between the embodiments of the present invention and other methods. Detailed Implementation

[0070] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0071] To address the problems existing in the prior art, the present invention provides a method, system, device, and terminal for random access of an adaptive distributed queue. The present invention will be described in detail below with reference to the accompanying drawings.

[0072] This invention provides a random access method based on adaptive distributed queues, mainly comprising: In massive machine-type communication (mMTC) scenarios, traditional distributed queue methods suffer from over-partitioning and cannot adjust their operating modes according to device type to meet the specific needs of different device types. This invention addresses these needs with an Adaptive-Based Distributed Queuing Random Access (ADQRA) method to meet the requirements of different device types, such as low latency and low power consumption. Furthermore, this invention optimizes the uplink license limit to achieve optimal efficiency.

[0073] like Figure 1 The diagram shown is a schematic diagram of base station and device information interaction provided in an embodiment of the present invention. In this embodiment, a base station covers a large number of MTC devices. These devices will send access requests simultaneously in the same Random Access Opportunity (RAO). Unlike the traditional random access process, this embodiment of the present invention will perform the ADQRA process on conflicting devices according to the conflict situation.

[0074] like Figure 2 As shown, the adaptive distributed queue random access method provided in this embodiment of the invention includes the following steps:

[0075] S101, after the base station periodically sends random access configuration information through broadcast signals, the device sends access request information, and the base station replies with a random access response;

[0076] S102, after receiving the access request information, the base station decodes the access request information and uses the physical downlink shared channel to feed back a random access response for each access request;

[0077] S103, the device sends a connection request message to determine whether a conflict has occurred.

[0078] The random access configuration information in step S101 provided in this embodiment of the invention includes the number of available preambles, physical random access channels, and the optimal number of devices in the group; the optimal number of devices in the group is the number of devices in the group that makes the relevant performance optimal.

[0079] The access request information in step S101 provided in this embodiment of the invention is as follows: the device randomly selects one from the available preambles as a preamble sequence according to the broadcast information; in this random access opportunity, the preamble sequence is transmitted through the physical random access channel as the access request information.

[0080] The connection request information in step S103 provided in this embodiment of the invention is as follows: after receiving the random access response information, the device transmits the data in the uplink resource block allocated to the device by the base station.

[0081] The step S103 of the present invention, which determines whether a device conflict has occurred, includes: if multiple devices select the same preamble sequence as the transmission request information, then there is a conflict between the devices, and the conflict resolution stage will be entered, in which an adaptive DQ conflict resolution method is executed according to the device type; if there is no conflict, the base station sends a conflict resolution message to the device, and the device successfully accesses the network.

[0082] For devices that experience conflicts during random access, those that fail to access due to selecting the same preamble sequence are grouped together. A conflict resolution queue is formed by the sequence number of the preamble sequence. When the number of devices in a group is greater than the optimal number of devices in the group, random access is re-initiated in the next random access opportunity according to the order of the conflict resolution queue. When the number of devices in a group is less than the optimal number of devices in the group, the devices in the subgroup are merged with the devices in the subsequent subgroups to achieve the optimal number of devices in the group. This shortens the length of the conflict resolution queue and reduces the average conflict resolution latency for latency-sensitive devices and the average conflict resolution energy consumption for low-power devices.

[0083] Assuming there are 4 available preambles in each RAO, Figure 3 and Figure 4 This section provides a detailed explanation of the adaptive DQ conflict resolution process and a diagram illustrating the conflict resolution queue. D1 through D10 each represent a device, and the optimal number of devices within a group during the conflict resolution process is set to 4. In RAO1, each device randomly selects a preamble sequence to initiate an access request. Assume that D1, D2, and D3 simultaneously select preamble 1, D5 selects preamble 2, D6, D9, and D7 select preamble 3, and D4, D8, and D10 select the same preamble 4. These 10 devices simultaneously initiate random access requests on RAO1. The base station detects conflicts on three preambles and then feeds back the detection results to the corresponding devices. Devices involved in conflicts are placed at the end of the conflict resolution queue according to the order of their selected preambles. Therefore, in... Figure 4 D1, D2, and D3 will enter the first position in the queue, D6, D9, and D7 will enter the second position, and D4, D8, and D10 will enter the third position. Since only D5 selected preamble 2 to initiate random access, there was no conflict with other devices, and this device completed conflict resolution and proceeded with subsequent data transmission.

[0084] For devices in the conflict resolution queue, an adaptive DQ mechanism is also used for conflict resolution. The device at the head of the queue will re-initiate random access in RAO2. However, since the number of devices in the group is 3, which is less than the optimal number of devices (4), the number of devices at the head of the queue will be adaptively adjusted. A device is randomly selected from the devices at position 2 to merge with the head of the queue. Therefore, in RAO#2, D1, D2, D3, and D7 are dequeued and then randomly initiate random access requests. Assuming that D2 and D7 both choose the same leading 3 and conflict, they enter the tail of the queue, i.e., the third position in the queue. D1 and D3 do not conflict, and the contention is successfully resolved in this time slot.

[0085] In RAO3, since D7 has already merged with devices from the previous group in the previous RAO, only D6 and D9 are currently at the head of the queue, which also does not meet the optimal number of devices requirement. D8 and D10, randomly selected from the second position in the queue, are merged with it, and the devices initiating random access are D6, D8, D9, and D10. No conflict occurs in this RAO, and all four devices resolve their conflicts. At this point, only D4 is at the head of the queue, and there are only two groups of devices in the entire queue, and the sum of the numbers in these two groups is less than the optimal value. These two groups are merged, bringing the total to 3. D2, D4, and D7 then initiate random access requests in the RAO. Assuming D2 resolves its conflict but D4 and D7 conflict again, since the conflict resolution queue is currently empty, these two devices are placed at the head of the queue and initiate requests again in RAO5, resolving their conflicts. At this point, all devices have successfully connected, the conflict resolution queue is empty, and the conflict resolution for this instance is complete.

[0086] The average collision resolution delay of the equipment can be expressed as:

[0087]

[0088] Where M represents the number of devices simultaneously initiating access, and N g For the optimal number of devices in the group, d total To avoid exceeding the maximum number of preamble transmissions, d U d represents tree splitting U Only then can devices successfully connect. l(d,N) represents the number of devices that can successfully resolve conflicts in each group at the d-th level of the tree split. g L(d,N) represents the number of common groups at the d-th level of the tree split. g The number of random access opportunities required to resolve a conflict at layer d represents the average number of random access opportunities needed to complete the conflict resolution process. This represents the window size for a random access opportunity.

[0089] The average collision resolution energy consumption includes the preamble transmission energy, the energy for receiving the RAR, and the energy for maintaining clock synchronization. The average collision resolution energy consumption can be expressed as:

[0090] E(M,N g ) = E PA (M,N g )+E RAR (M,N g )+E idle (M,N g )

[0091] The three parts of energy can be represented as follows:

[0092] E PA (M,N g )=R(M,N g )*P PA *D PA

[0093] E RAR (M,N g )=R(M,N g )*P RAR *D RAR

[0094] E idle (M,N g )=T(M,N g )*P idle

[0095] Where T(M,Ng) represents the average conflict resolution delay, and P PA P RAR and P idle These represent the power required to transmit the preamble, the power required to receive RAR information, and the power required to maintain device operation, respectively. PA and D RAR R(M,N) represents the transmit preamble duration and the receive RAR window size, respectively. g ) represents the average number of preamble transmissions when M devices are connected, and its formula is:

[0096]

[0097] in, This represents the number of devices that failed to connect at level d in the tree split.

[0098] Latency-sensitive devices need to meet low latency requirements for the number of users N in the group. g Optimization can ensure the shortest conflict resolution latency. The optimal number of devices in the latency group can be expressed as:

[0099]

[0100] Among them, the number of devices in the group N g It is a positive integer, and the upper limit is set to N. g_max Set the parameter to N g_max =N p .

[0101] Low-power devices need to meet low energy consumption requirements, for the number of users N in the group. g Optimization is performed to ensure the lowest possible energy consumption for conflict resolution. The optimal number of devices in the energy-efficient group can be expressed as:

[0102]

[0103] Among them, the number of devices in the group N g It is a positive integer, and the upper limit of its range is N. g_max Set the parameter to N g_max =N p N p This indicates that a leading number is available.

[0104] The number of devices that can successfully resolve conflicts in each group at level d of the tree split. It is also affected by the maximum uplink authorization number, which can be expressed as:

[0105]

[0106] Where g is the maximum number of uplink licenses that can be obtained, and P s (d,N g ) represents the probability of conflict resolution at level d in a tree split. This represents the number of devices that simultaneously initiate conflict resolution in each group at level d.

[0107] The adaptive distributed queue random access system provided in this embodiment of the invention includes:

[0108] The configuration information sending module is used by the base station to periodically send random access configuration information via broadcast signals. The random access configuration information includes the number of available preambles, the physical random access channel, and the optimal number of devices in the group. The optimal number of devices in the group is the number of devices in the group that maximizes the relevant performance.

[0109] The access request information sending module is used by the device to send access request information. The access request information is a preamble sequence randomly selected by the device from the available preambles based on the broadcast information. In this random access opportunity, it is transmitted through the physical random access channel, and the preamble sequence serves as the access request information.

[0110] The access request information decoding module is used by the base station to reply with a random access response. After receiving the access request information, the base station decodes the access request information and uses the physical downlink shared channel to send back a random access response for each access request.

[0111] The connection request information sending module is used for the device to send connection request information. The connection request information is transmitted in the uplink resource block allocated to the device by the base station after the device receives the random access response information.

[0112] The device conflict determination module is used to determine whether a conflict has occurred between devices. If multiple devices select the same preamble sequence as the transmission request information, there is a conflict between the devices, and the conflict resolution phase will be entered. An adaptive DQ conflict resolution method will be executed according to the device type. If there is no conflict, the base station sends a conflict resolution message to the device, and the device successfully accesses the network.

[0113] The following content describes the experimental process using data, charts, and other materials.

[0114] 1. Simulation conditions:

[0115] The experiment was conducted using Matlab R2016b on a Windows 10 system with a Core™ i7-9750H 2.60GHz CPU and 16.00GB of memory.

[0116] Experimental parameter selection: In all the following experiments, the leading derivative can be N. p =56, maximum retransmission count is 20, number of devices in the optimal latency group is 56, number of devices in the optimal energy consumption group is 31, and base station RAO allocation interval is 10ms.

[0117] 2. Experiment Content:

[0118] Simulation Experiment 1: Investigating the impact of uplink grant count on the relevant performance of this invention. Experimental results are as follows: Figure 5 As shown.

[0119] Simulation Experiment 2: For time-delay sensitive devices, the performance of this invention is compared with other methods. The experimental results are as follows: Figure 6 As shown.

[0120] Simulation Experiment 3: For low-power devices, the performance of this invention is compared with other methods. The experimental results are as follows: Figure 7 As shown.

[0121] The ACB mechanism is selected from reference 3GPP TS 36.321V9.3.0.Medium Access Control (MAC) Protocol Specification[S], 2010.

[0122] The C-DQ mechanism is selected from the reference A. Laya, C. Kallas, F. Vazquez-Gallego, L. Alonso and J. Alonso-Zarate. Goodbye, ALOHA! [J]. IEEE Access, 2016, 4: 2029-2040.

[0123] 3. Analysis of simulation experiment results:

[0124] Figure 5 This illustrates the impact of the maximum uplink license limit on average collision resolution latency and average collision resolution energy consumption in this invention, where the maximum uplink license number is set to N. p / 8, N p / 4, N p / 2 and N p As shown in the graph, with the increase of the maximum uplink license number, the average collision resolution latency and energy consumption achieve significantly better performance. This continues until the maximum uplink license number reaches N. p When / 2, the maximum uplink authorization number is N. p (Without uplink license restrictions) the performance of resolving latency and energy consumption is basically the same as that of average contention. For the sake of generality, and to maximize access efficiency, the maximum number of uplink licenses will be set to g = N in subsequent simulations. p / 2.

[0125] Figure 6 This comparison shows the average conflict resolution latency of latency-sensitive devices using the embodiments of this invention with other methods. With 1500 access devices, the average conflict resolution latency is reduced by 59% compared to the traditional DQ mechanism, and by 64% compared to the ACB mechanism under the same conditions.

[0126] Figure 7 This indicates a comparison of the average conflict resolution energy consumption of low-power devices using the embodiments of this invention with other methods.

[0127] As shown in the figure, with 1500 access devices, the adaptive DQ conflict resolution mechanism reduces the average conflict resolution energy consumption by 71% compared to the ACB mechanism. Under the same conditions, it reduces the average conflict resolution energy consumption by 28% compared to the traditional DQ conflict resolution mechanism, demonstrating that the adaptive DQ conflict resolution mechanism outperforms the traditional DQ conflict resolution mechanism in terms of average conflict resolution energy consumption.

[0128] It should be noted that embodiments of the present invention can be implemented in hardware, software, or a combination of both. The hardware portion can be implemented using dedicated logic; the software portion can be stored in memory and executed by a suitable instruction execution system, such as a microprocessor or dedicated-design hardware. Those skilled in the art will understand that the above-described devices and methods can be implemented using computer-executable instructions and / or included in processor control code, for example, such code provided on a carrier medium such as a disk, CD, or DVD-ROM, a programmable memory such as read-only memory (firmware), or a data carrier such as an optical or electronic signal carrier. The devices and modules of the present invention can be implemented by hardware circuitry such as very large-scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, or programmable hardware devices such as field-programmable gate arrays, programmable logic devices, etc., or by software executed by various types of processors, or by a combination of the above-described hardware circuitry and software, such as firmware.

[0129] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any modifications, equivalent substitutions, and improvements made by those skilled in the art within the scope of the technology disclosed in the present invention, and within the spirit and principles of the present invention, should be covered within the scope of protection of the present invention.

Claims

1. A random access method for an adaptive distributed queue, characterized in that: The random access method of the adaptive distributed queue comprises the following steps: Step 1: The base station periodically sends random access configuration information through a broadcast signal; the random access configuration information includes the number of available preambles, the physical random access channel and the optimal number of devices in the group; the optimal number of devices in the group is when the number of devices in the group is the optimal number of devices in the group so that the relevant performance is optimal; Step 2: The device sends access request information; the access request information is: the device randomly selects one from the available preambles as a preamble sequence according to the broadcast information; in this random access opportunity, the preamble sequence is transmitted through a physical random access channel, and the preamble sequence is used as the access request information; Step 3: The base station replies with a random access response; after receiving the access request information, the base station decodes the access request information and feeds back a random access response for each access request via a physical downlink shared channel; Step 4: The device sends a connection request message; the connection request message is transmitted in an uplink resource block allocated by the base station to the device after the device receives the random access response message; Step 5: Determine whether a device conflicts. If multiple devices select the same preamble sequence as the request information to be sent, there is a conflict between the devices, and the conflict resolution phase will be entered. The adaptive DQ conflict resolution method will be performed according to the device type. If there is no conflict, the base station sends a conflict resolution message to the device, and the device successfully accesses. The average conflict resolution delay of the device is expressed as: Where M represents the number of devices that initiate access at the same time, N g is the optimal number of devices in the group, d total is the number of preamble transmissions that does not exceed the maximum number of attempts, d U d represents the tree split U Only then can a device be successfully connected. represents the number of devices with successful conflict resolution in each group at the dth level of the tree split, l(d,N g ) represents the number of groups in the dth level of the tree split; L(d,N g ) represents the average number of random access opportunities that need to be waited for to complete conflict resolution at layer d, Indicates the window size of a random access opportunity; The method of performing an adaptive DQ conflict resolution method according to device type includes: Delay-sensitive devices need to meet low latency requirements. g After optimization, the number of devices in the optimal delay group is expressed as: Among them, the number of devices in the group is N g is a positive integer, the upper limit range is set to N g_max , set the parameter to N g_max =N p ; The number of devices with successful conflict resolution in each group at level d of the tree split It is also affected by the maximum number of uplink grants, expressed as: Among them, g is the maximum number of uplink authorizations obtained, P s (d,N g ) represents the probability of conflict resolution at level d of the tree split, It indicates the number of devices that simultaneously initiate conflict resolution in each group at layer d; The average conflict resolution energy consumption of the device includes the preamble transmission energy, the energy of the device receiving RAR and the energy of maintaining clock synchronization. The average conflict resolution energy consumption is expressed as: E(M,N g )=E PA (M,N g )+E RAR (M,N g )+E idle (M,N g ); Among them, the three parts of energy are expressed as: E PA (M,N g )=R(M,N g )*P PA *D PA ; E RAR (M,N g )=R(M,N g )*P RAR *D RAR ; E idle (M,N g )=T(M,N g )*P idle ; Among them, T(M,N g ) represents the average conflict resolution delay; P PA , P RAR and P idle They represent the power for sending the preamble, the power for receiving RAR information, and the power required to maintain the operation of the equipment. PA and D RAR Respectively represent the duration of sending preamble and the size of receiving RAR window; R(M,N g ) represents the average number of preamble transmissions for M devices to access, R(M,N g ) is: in, Indicates the number of devices that failed to access the tree at layer d. Low-power devices need to meet low energy consumption requirements. g After optimization, the number of devices in the optimal energy consumption group is expressed as: Among them, the number of devices in the group is N g is a positive integer, and the upper limit of the range is N g_max , set the parameter to N g_max =N p ; The step 5 of performing the adaptive DQ conflict resolution method further includes: Devices that fail to access due to selecting the same preamble sequence are grouped together, and a conflict resolution queue is formed by the sequence number of the preamble sequence. When the number of devices in the group is greater than the optimal number of devices in the group, random access is re-initiated in the next random access opportunity in the order of the conflict resolution queue; when the number of devices in the group is less than the optimal number of devices in the group, the devices in the subgroup are merged with the devices in the subsequent subgroup to make the number of devices in the group reach the optimal value.

2. A random access system of an adaptive distributed queue using the random access method of an adaptive distributed queue as claimed in claim 1, characterized in that: The random access system of the adaptive distributed queue includes: A configuration information sending module is used for the base station to periodically send random access configuration information through a broadcast signal; the random access configuration information includes the number of available preambles, the physical random access channel and the optimal number of devices in the group; the optimal number of devices in the group is when the number of devices in the group is the optimal number of devices in the group so that the relevant performance reaches the best; An access request information sending module is used for a device to send an access request information; the access request information is a preamble sequence randomly selected by the device from available preambles according to broadcast information; in this random access opportunity, the preamble sequence is transmitted through a physical random access channel as the access request information; The access request information decoding module is used for the base station to reply with a random access response; after receiving the access request information, the base station decodes the access request information and feeds back a random access response for each access request via the physical downlink shared channel; A connection request information sending module, used for a device to send a connection request information, where the connection request information is transmitted in an uplink resource block allocated to the device by the base station after the device receives the random access response information; The device conflict judgment module is used to judge whether a device conflict occurs. If multiple devices select the same leading sequence as the sending request information, there is a conflict between the devices, and the conflict resolution phase will be entered. The adaptive DQ conflict resolution method will be performed according to the device type; if there is no conflict, the base station sends a conflict resolution message to the device, and the device successfully accesses.

3. A computer device, characterized in that: The computer device includes a memory and a processor, the memory stores a computer program, and when the computer program is executed by the processor, the processor executes the random access method for the adaptive distributed queue as claimed in claim 1.

4. A computer-readable storage medium storing a computer program, wherein when the computer program is executed by a processor, the processor executes the random access method for an adaptive distributed queue as claimed in claim 1.

5. An information data processing terminal, characterized in that: The information data processing terminal is used to implement the random access system of the adaptive distributed queue as claimed in claim 2.

Images