[go: up one dir, main page]

CN115066037B - Random access method, system, device and terminal for adaptive distributed queue - Google Patents

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

Info

Publication number
CN115066037B
CN115066037B CN202210713502.3A CN202210713502A CN115066037B CN 115066037 B CN115066037 B CN 115066037B CN 202210713502 A CN202210713502 A CN 202210713502A CN 115066037 B CN115066037 B CN 115066037B
Authority
CN
China
Prior art keywords
devices
random access
group
conflict resolution
conflict
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN202210713502.3A
Other languages
Chinese (zh)
Other versions
CN115066037A (en
Inventor
甄立
李舒畅
张昱堃
王文静
秦浩
宋彬
王军选
卢光跃
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xian University of Posts and Telecommunications
Original Assignee
Xian University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xian University of Posts and Telecommunications filed Critical Xian University of Posts and Telecommunications
Priority to CN202210713502.3A priority Critical patent/CN115066037B/en
Publication of CN115066037A publication Critical patent/CN115066037A/en
Application granted granted Critical
Publication of CN115066037B publication Critical patent/CN115066037B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0833Random access procedures, e.g. with 4-step access
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/70Services for machine-to-machine communication [M2M] or machine type communication [MTC]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W74/00Wireless channel access
    • H04W74/08Non-scheduled access, e.g. ALOHA
    • H04W74/0833Random access procedures, e.g. with 4-step access
    • H04W74/0841Random access procedures, e.g. with 4-step access with collision treatment
    • H04W74/085Random access procedures, e.g. with 4-step access with collision treatment collision avoidance
    • YGENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02DCLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00Reducing energy consumption in communication networks
    • Y02D30/70Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

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

Random access method, system, equipment and terminal of self-adaptive distributed queue
Technical Field
The invention belongs to the technical field of wireless communication, and particularly relates to a random access method, a system, equipment and a terminal of a self-adaptive distributed queue (Distributed Queueing, DQ), which can be used for conflict resolution in wireless communication.
Background
At present, once the concept of the internet of things is proposed, the concept of the internet of things becomes a popular research field, and the wide application of the concept of the internet of things is related to aspects of human life, and is regarded as the third wave of development of information industry after computers and the internet. As one of the key technologies of the internet of things, machine-to-Machine (M2M) communication enables autonomous communication between Machine devices without human intervention, which is an important way for realizing the internet of things 'everything interconnection' prospect. According to the predictions of research institutions such as 3GPP, global M2M traffic will be tens to hundreds of times higher than Human-to-Human (H2H) traffic in the next decade, and the number of device connections will reach the billion level. Meanwhile, china is one of the largest M2M market areas worldwide at present, the construction capacity and equipment manufacturing capacity of an M2M communication network are to be continuously improved, and the development of the M2M industry is promoted. Therefore, the M2M has wide application development prospect, and becomes a very potential information industry, and the research on the M2M application and the large-scale communication thereof has important significance.
Because of the huge number of machine type Communication (MACHINE TYPE Communication) devices, when large-scale MTC devices initiate random access requests at the same time, the base station load is too large, and serious blocking problems exist, which cause the increase of access delay and energy consumption of MTC devices, and if the blocking time is too long, the situation that the devices cannot access to the network is also likely to occur. Therefore, in order to cope with the scenario that large-scale M2M devices initiate access simultaneously, the capability of processing and resolving collisions of Physical Random access channels (Physical Random ACCESS CHANNEL, PRACH) needs to be improved to cope with the blocking problem in case of overload of the base station. There are many efforts to solve the problem of efficient collision, and 3GPP has proposed some solutions to avoid blocking to cope with this challenge, such as device classification management, random back-off mechanism and access class limitation (ACCESS CLASS Barring, ACB), and the congestion problem is alleviated by setting related parameters to reduce the number of devices that initiate access requests at the same time, but such mechanisms have significant drawbacks, and fixed parameter configuration cannot solve the problem of collision under complex load conditions. There is also a study to propose a random access mechanism based on a distributed queue, in which a device with access failure enters a conflict resolution queue to wait for initiating an access attempt again, but the conflict resolution delay is too long due to the excessive partitioning problem in the later period of conflict resolution.
Most of the existing works only can solve the problem of conflict resolution under the scene of specific equipment types, such as low time delay and low energy consumption. The base station cannot adaptively adjust the operation mode according to the device type to meet the requirements of different types of devices, and therefore, an adaptive conflict resolution method needs to be designed. In addition, the existing work does not consider the influence of uplink grant limitation on the relevant performance.
Through the above analysis, the problems and defects existing in the prior art are as follows:
(1) In the existing scheme for avoiding blocking, the fixed parameter configuration cannot solve the problem of conflict under the complex load condition, and the conflict resolution delay is overlong due to the excessive division problem in the later period of conflict resolution.
(2) The prior art can only solve the problem of conflict resolution in the scene of specific equipment types, but the base station cannot adaptively adjust the working mode according to the equipment types to meet the requirements of different types of equipment.
(3) The prior art does not consider the impact of uplink grant limitations on correlation performance.
Disclosure of Invention
Aiming at the problems existing in the prior art, the invention provides a random access method, a system, equipment and a terminal of a self-adaptive distributed queue.
The invention is realized in such a way, and provides a random access method of a self-adaptive distributed queue, which aims at the blocking problem in the random access process of large-scale equipment. When the devices conflict, a conflict resolution queue is formed according to the sequence number of the leading sequence of the conflicting devices, when the number of the devices in the group is larger than the number of the devices in the optimal group, random access is sequentially initiated according to the sequence of the conflict resolution queue, and when the number of the devices in the group is smaller than the number of the devices in the optimal group, the devices in the current subgroup and the devices in the subsequent subgroup are combined to enable the number of the devices in the group to reach the optimal. The scheme achieves the purpose of reducing time delay or energy consumption by controlling the number of devices in a group, and comprises the following steps:
And if the equipment collides, executing a self-adaptive distributed queue conflict solution method, otherwise, the equipment is successfully accessed into the network, wherein the self-adaptive distributed queue conflict solution method is to adaptively adjust the number of the equipment in the conflict solution queue according to the equipment type requirement when the number of the equipment in the group is smaller than an optimal value, so that the related performance is optimal, and comprises the steps of obtaining the lowest time delay or the lowest energy consumption of the low-power consumption equipment by the time delay sensitive equipment, analyzing the influence of the uplink authorization limit on the related performance, and optimizing the resource utilization efficiency.
Further, the random access method of the adaptive distributed queue comprises the following steps:
The method comprises the steps that a base station periodically sends random access configuration information through a broadcast signal, wherein the random access configuration information comprises the available preamble number, a physical random access channel and the optimal intra-group device number, and when the optimal intra-group device number is the optimal intra-group device number, the related performance is optimal. The required parameters are provided for the execution of the random access.
And step two, the equipment sends access request information, wherein the access request information is that the equipment randomly selects one from available preambles as a preamble sequence according to broadcast information, and the preamble sequence is transmitted through a physical random access channel in the random access opportunity of the time and is used as the access request information. The device informs the base station to initiate random access.
And thirdly, the base station replies a random access response, decodes the access request information after receiving the access request information, and feeds back the random access response for each access request by a physical downlink shared channel. The base station responds to the random access request of the device and allocates access resources for the device.
And step four, the equipment sends connection request information, wherein the connection request information is that the equipment transmits uplink resource blocks allocated to the equipment by the base station after receiving the random access response information. The device sends a connection request on the resources allocated by the base station.
Judging whether the equipment generates conflict, if the same preamble sequences are selected by a plurality of equipment as the sending request information, the equipment has mutual conflict, the conflict solution stage is entered, the self-adaptive DQ conflict solution method is executed according to the equipment type, if the conflict does not exist, the base station sends the conflict solution information to the equipment, and the equipment is successfully accessed. And carrying out conflict resolution on the conflict equipment according to the provided self-adaptive DQ conflict resolution method.
Further, the performing adaptive DQ conflict resolution method in the fifth step includes:
Dividing the devices which are caused by the failure of the access due to the selection of the same leader sequence into a group, forming a conflict resolution queue by the sequence numbers of the leader sequences, when the number of the devices in the group is larger than the number of the devices in the optimal group, sequentially restarting random access in the next random access opportunity according to the sequence of the conflict resolution queue, and when the number of the devices in the group is smaller than the number of the devices in the optimal group, merging the devices in the subgroup with the devices in the follow-up subgroup to ensure that the number of the devices in the group reaches the optimal value.
Further, the device average collision resolution delay is expressed as:
wherein M represents the number of devices initiating access at the same time, N g is the number of devices in the optimal group, d total is the preamble transmission number which does not exceed the maximum number of attempts, d U represents the d U layer of tree splitting before the devices are successfully accessed, Representing the number of devices per group of successful conflict resolution at the d-th level of tree splitting, L (d, N g) representing the number of groups shared at the d-th level of tree splitting, L (d, N g) representing the average number of random access opportunities that need to be waited for the conflict resolution to be completed at the d-level,A window size representing one random access opportunity.
The time delay sensitive device needs to meet the low time delay requirement, and the number of users N g in the group is optimized, so that the number of devices in the optimal time delay group is expressed as:
Wherein the number of devices in the group N g is a positive integer, the upper limit range is set to N g_max, and the parameter set to N g_max=Np,Np represents the available front derivative.
Further, the d-th layer of the tree splitting each constitutes the number of devices that do conflict resolutionAlso affected by the maximum upstream authorization number, expressed as:
Where g is the maximum number of uplink grants obtained, P s(d,Ng) represents the probability of collision resolution at the tree split d-level, Representing the number of devices that initiate conflict resolution simultaneously for each group at layer d.
Further, the average collision resolution energy consumption of the device includes preamble transmission energy, energy of the device receiving the RAR, and energy of maintaining clock synchronization, and the average collision resolution energy consumption is expressed as:
E(M,Ng)=EPA(M,Ng)+ERAR(M,Ng)+Eidle(M,Ng);
wherein, three parts of energy are respectively expressed as:
EPA(M,Ng)=R(M,Ng)*PPA*DPA;
ERAR(M,Ng)=R(M,Ng)*PRAR*DRAR;
Eidle(M,Ng)=T(M,Ng)*Pidle;
wherein T (M, ng) represents average conflict resolution time delay, P PA、PRAR and P idle respectively represent power of transmitting a preamble, power of receiving RAR information and power required for maintaining operation of equipment, D PA and D RAR respectively represent duration of transmitting the preamble and size of a receiving RAR window, R (M, N g) represents average preamble transmission times of M equipment access, and a formula of R (M, N g) is as follows:
Wherein, Indicating the number of devices that were not successfully accessed at the tree split layer d.
The low-power consumption type equipment needs to meet the low-energy consumption requirement, the number of users N g in the group is optimized, and the number of the equipment in the optimal energy consumption group is expressed as:
wherein the number of devices in the group N g is a positive integer, the upper limit of the variation range is N g_max, and the parameter is set to N g_max=Np.
Another object of the present invention is to provide an adaptive distributed queue random access system to which the adaptive distributed queue random access method is applied, the adaptive distributed queue random access system comprising:
the system comprises a configuration information sending module, a configuration information sending module and a configuration information receiving module, wherein the configuration information sending module is used for periodically sending random access configuration information through a broadcast signal by a base station, wherein the random access configuration information comprises the available preamble number, a physical random access channel and the optimal intra-group device number;
the access request information sending module is used for sending the access request information by the equipment; the access request information is that the equipment randomly selects one from available preambles as a preamble sequence according to broadcast information, and in the random access opportunity, the preamble sequence is transmitted through a physical random access channel and is used as the access request information;
The base station decodes the access request information after receiving the access request information and feeds back the random access response for each access request by a physical downlink shared channel;
The connection request information sending module is used for sending connection request information by the equipment, wherein the connection request information is transmitted in an uplink resource block allocated to the equipment by the base station after the equipment receives the random access response information;
The device conflict generation judging module is used for judging whether the devices generate conflict, if the plurality of devices select the same preamble sequences as the sending request information, the devices have mutual conflict, a conflict solution stage is entered, a self-adaptive DQ conflict solution method is executed according to the device type, and if the conflict does not exist, the base station sends a conflict solution message to the devices, and the devices are successfully accessed.
It is a further object of the present invention to provide a computer device comprising a memory and a processor, the memory storing a computer program which, when executed by the processor, causes the processor to perform the random access method of the adaptive distributed queue.
It is a further object of the present invention to provide a computer readable storage medium storing a computer program which, when executed by a processor, causes the processor to perform the random access method of an adaptive distributed queue.
Another object of the present invention is to provide an information data processing terminal, which is used for implementing the random access system of the adaptive distributed queue.
In combination with the above technical solution and the technical problems to be solved, please analyze the following aspects to provide the following advantages and positive effects:
First, aiming at the technical problems in the prior art and the difficulty in solving the problems, the technical problems solved by the technical proposal of the invention are analyzed in detail and deeply by tightly combining the technical proposal to be protected, the results and data in the research and development process, and the like, and some technical effects brought after the problems are solved have creative technical effects. The specific description is as follows:
the invention provides a random access method based on an adaptive distributed queue, which is used for executing the adaptive distributed queue conflict resolution method when equipment conflicts, otherwise, the equipment is successfully accessed to a network. The self-adaptive distributed queue conflict solution method is mainly characterized in that when the number of devices in a group is smaller than an optimal value, the number of the devices in the conflict solution queue is self-adaptively adjusted according to the device type requirement, so that the related performance is optimal, for example, delay sensitive devices obtain the lowest delay or low-power consumption devices consume the lowest energy consumption. In addition, the influence of the uplink authorization limit on the related performance is analyzed, so that the resource utilization efficiency is optimized. Simulations indicate that there is a significant performance improvement using the present invention compared to the ACB mechanism and the conventional C-DQ mechanism.
The execution self-adaptive DQ conflict resolution method shortens the length of a conflict resolution queue, reduces the average conflict resolution time delay of time delay sensitive equipment and the average conflict resolution energy consumption of low-power consumption equipment, ensures that the time delay sensitive equipment needs to meet low time delay requirements, optimizes the number of users N g in a group to ensure that the conflict resolution time delay is shortest, and ensures that the low-power consumption equipment needs to meet low energy consumption requirements, and optimizes the number of users N g in the group to ensure that the conflict resolution energy consumption is lowest.
According to the invention, the optimal number of devices in the group is calculated according to different device types, and the base station executes the self-adaptive DQ conflict resolution process according to the optimal number of devices in the group so as to meet the device requirements. The random access method based on the self-adaptive distributed queue provided by the invention can be used for resolving conflict in wireless communication.
Secondly, the technical scheme is regarded as a whole or from the perspective of products, and the technical scheme to be protected has the following technical effects and advantages:
The invention can adaptively adjust the number of the devices in the group in the conflict resolution queue according to the device type requirement, so that the average conflict resolution time delay and the average conflict resolution energy consumption performance are improved. The invention achieves optimal performance for both delay sensitive devices and low power devices. In addition, the invention analyzes the influence of the uplink authorization limit on the related performance, so that the resource utilization efficiency is optimized.
Thirdly, as inventive supplementary evidence of the claims of the present invention, the following important aspects are also presented:
(1) The expected benefits and commercial values after the technical scheme of the invention is converted are as follows:
the invention can effectively reduce round trip time delay or energy consumption of a communication system in equipment communication aiming at different equipment types under the condition of ensuring high reliability of communication, ensure good experience of users in the process of using the equipment, promote enterprises to save energy, reduce consumption more reasonably and effectively utilize energy sources, realize maximum energy-saving benefit and be beneficial to realizing sustainable development of the energy sources.
(2) The technical scheme of the invention fills the technical blank in the domestic and foreign industries:
an important premise of realizing the establishment of a communication link between a base station and equipment is that a key for ensuring effective transmission of system data is a high-efficiency and high-reliability random access technology, and has been widely paid attention to the industry in recent years. However, the existing research results cannot meet the low-delay and high-energy-efficiency access requirements of large-scale MTC devices in the Internet of things. Therefore, the invention provides a random access method based on self-adaption DQ, which can ensure the low-delay, low-energy consumption and high-reliability access requirements of mass MTC devices.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings that are needed in the embodiments of the present invention will be briefly described below, and it is obvious that the drawings described below are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
Fig. 1 is a schematic diagram of information interaction between a base station and a device provided in an embodiment of the present invention;
fig. 2 is a flowchart of a random access method of an adaptive distributed queue according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of an adaptive DQ collision resolution mechanism provided by an embodiment of the invention;
FIG. 4 is a schematic diagram of an adaptive DQ conflict resolution queue provided by an embodiment of the invention;
Fig. 5 is a schematic diagram illustrating an effect of an uplink grant limit on related performance according to an embodiment of the present invention;
FIG. 6 is a graph comparing average conflict resolution delays with other methods provided by embodiments of the present invention;
FIG. 7 is a graph comparing average conflict resolution power consumption with other methods provided by embodiments of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the following examples in order to make the objects, technical solutions and advantages of the present invention more apparent. It should be understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the scope of the invention.
Aiming at the problems existing in the prior art, the invention provides a random access method, a system, equipment and a terminal of a self-adaptive distributed queue, and the invention is described in detail below with reference to the accompanying drawings.
The embodiment of the invention provides a random access method based on a self-adaptive distributed queue, which mainly comprises the following steps that under the scene of large-scale machine Communication (MASSIVE MACHINE TYPE Communication, mMTC), the traditional distributed queue method has the problem of excessive division, and the working mode cannot be adjusted according to the type of equipment so as to meet the specific requirements of different types of equipment. The invention meets the requirements of different equipment types, such as low time delay and low energy consumption by an Adaptive-Based Distributed Queuing Random Access, ADQRA method based on an Adaptive distributed queue. Meanwhile, the embodiment of the invention optimizes the efficiency of the method by optimizing the limit number of the uplink authorization.
As shown in fig. 1, a schematic diagram of base station and device information interaction is provided in an embodiment of the present invention, in which a base station covers large-scale MTC devices, and the devices simultaneously send access requests in the same random access opportunity (Random Access Opportunity, RAO), unlike the conventional random access procedure, in the embodiment of the present invention, a ADQRA procedure is performed on conflicting devices according to the conflict situation.
As shown in fig. 2, the random access method of the adaptive distributed queue provided by the embodiment of the invention includes the following steps:
s101, after a base station periodically transmits random access configuration information through a broadcast signal, equipment transmits access request information, and the base station replies random access response;
s102, 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 by a physical downlink shared channel;
S103, the device sends connection request information to judge whether the device collides.
The random access configuration information in step S101 provided by the embodiment of the present invention includes the number of available preambles, the physical random access channel, and the optimal number of devices in the group, where the optimal number of devices in the group is the number of devices in the optimal group, so that the correlation performance is optimal.
The access request information in step S101 provided by the embodiment of the present invention is that a device randomly selects one from available preambles according to broadcast information as a preamble sequence, and in the random access opportunity, the preamble sequence is transmitted through a physical random access channel and is used as access request information.
The connection request information in step S103 provided by the embodiment of the present invention is that after the device receives the random access response information, the device transmits the random access response information in an uplink resource block allocated to the device by the base station.
The step S103 of judging whether the equipment generates the conflict comprises the steps that if a plurality of equipment select the same preamble sequences as sending request information, the equipment has mutual conflict, a conflict solution stage is entered, a self-adaptive DQ conflict solution method is executed according to the equipment type, and if no conflict exists, a base station sends a conflict solution message to the equipment, and the equipment is successfully accessed.
And dividing the devices which are in conflict in the random access process and are failed to access by selecting the same preamble sequence into a group, forming a conflict resolution queue by the sequence numbers of the preamble sequence, when the number of the devices in the group is larger than the number of the devices in the optimal group, restarting random access in the next random access opportunity according to the sequence of the conflict resolution queue, and when the number of the devices in the group is smaller than the number of the devices in the optimal group, merging the devices in the subgroup with the devices in the subsequent subgroup to ensure that the number of the devices in the group reaches the optimal value, shortening the length of the conflict resolution queue, and reducing the average conflict resolution time delay of the time delay sensitive devices and the average conflict resolution energy consumption of the low-power consumption devices.
Assuming that there are 4 preambles available in each RAO, fig. 3 and 4 explain the adaptive DQ conflict resolution process and the conflict resolution queue diagram in detail. D1-D10 respectively represent one device, and the optimal number of devices in the group in the conflict resolution process is set to be 4. Each device randomly selects one preamble sequence to initiate an access request in RAO1, assuming that D1, D2, and D3 simultaneously select preamble 1, D5 select preamble 2, D6, D9, and D7 select preamble 3, D4, D8, and D10 select the same preamble 4. The 10 devices initiate random access requests on RA O1 at the same time, the base station detects that collision occurs on three preambles, and then feeds back detection results to the corresponding devices. The conflicting devices are sequentially ordered at the end of the conflict resolution queue in the order of their preambles chosen so that in fig. 4D 1, D2 and D3 would enter the first position of the queue, D6, D9 and D7 enter the second position and D4, D8 and D10 enter the third position. Since only D5 selects preamble 2 to initiate random access, no collision occurs with other devices, and the device completes collision resolution for subsequent data transmission.
And the devices in the conflict resolution queue also adopt an adaptive DQ mechanism to carry out conflict resolution, and the devices arranged at the head of the queue re-initiate random access in RAO2, but the number of devices in the group is 3 and less than the optimal number of devices 4, so that the number of devices at the head of the queue can be adaptively adjusted. One device is randomly selected from the devices at the position 2 to be combined with the head of the queue, so that D1, D2, D3 and D7 in RAO#2 are dequeued, then a random access request is randomly initiated, and the fact that the same preamble 3 is selected by D2 and D7 to collide and enter the tail of the queue, namely the third position of the queue is assumed. D1 and D3 do not collide and the contention resolution is successful in this slot.
In RAO3, since D7 has been combined with the devices in the previous group in the previous RAO, the devices now ranked at the head of the team have only D6 and D9, again not meeting the specifications for the optimal number of devices. D8 and D10 in position 2 of the random select queue are combined with it, while the devices initiating random access are D6, D8, D9 and D10. In the RAO, no conflict occurs, and all 4 devices complete conflict resolution. At this time, the devices arranged at the head of the queue have only D4, and there are only two groups of devices in the whole queue, and the sum of the two groups of devices is also smaller than the optimal value. Combining the two groups of devices to a total of 3, D2, D4 and D7 initiates a random access request in the RAO. Assuming that D2 completes the conflict resolution and D4 and D7 again collide, because the conflict resolution queue is currently empty, the two devices are queued at the head of the queue, the request is initiated again in RAO5, and the conflict resolution is completed. So far, all the devices are successfully accessed, the conflict resolution queue is empty, and the conflict resolution is completed.
The device average conflict resolution latency may be expressed as:
Wherein M represents the number of devices initiating access simultaneously, N g is the number of devices in the optimal group, d total is the number of preamble transmissions not exceeding the maximum number of attempts, d U represents d U of tree splitting before devices can be successfully accessed, Representing the number of devices that each group can successfully resolve a collision at the d-th level of tree splitting, l (d, N g) represents the number of groups that are common at the d-th level of tree splitting. L (d, N g) represents the average number of random access opportunities that need to be waited for the collision resolution to be completed in the d layer,A window size representing one random access opportunity.
The average collision resolution energy consumption of the device includes preamble transmission energy, the energy of the device receiving the RAR, and the energy of maintaining clock synchronization, and can be expressed as:
E(M,Ng)=EPA(M,Ng)+ERAR(M,Ng)+Eidle(M,Ng)
Wherein, the three parts of energy can be expressed as:
EPA(M,Ng)=R(M,Ng)*PPA*DPA
ERAR(M,Ng)=R(M,Ng)*PRAR*DRAR
Eidle(M,Ng)=T(M,Ng)*Pidle
Wherein T (M, ng) represents average collision resolution delay, P PA、PRAR and P idle represent power of a transmission preamble, power of a received RAR information and power required for maintaining operation of a device, D PA and D RAR represent duration of the transmission preamble and size of a received RAR window, respectively, R (M, N g) represents average preamble transmission times of M device accesses, and the formula is:
Wherein, Indicating the number of devices that were not successfully accessed at the tree split layer d.
The delay sensitive device needs to meet the low delay requirement, optimizing the number of users N g in the group can ensure that the conflict resolution delay is the shortest, and the number of devices in the optimal delay group can be expressed as:
Wherein the number of devices in the group N g is a positive integer, the upper limit range is set to N g_max, and the parameter is set to N g_max=Np.
The low power consumption type equipment needs to meet the low energy consumption requirement, the number of users N g in the group is optimized, so that the conflict resolution energy consumption is minimum, and the number of the equipment in the optimal energy consumption group can be expressed as:
wherein the number of devices in the group N g is a positive integer, the upper limit of the variation range is N g_max, and setting the parameter to N g_max=Np,Np represents the available front derivative.
The d-th layer of tree splitting can successfully resolve the number of devices in each groupAlso affected by the maximum uplink authorization number, which can be expressed as:
Where g is the maximum uplink grant number that can be obtained, P s(d,Ng) represents the probability of collision resolution at the tree split d level, Representing the number of devices that initiate conflict resolution simultaneously for each group at layer d.
The random access system of the self-adaptive distributed queue provided by the embodiment of the invention comprises the following components:
the system comprises a configuration information sending module, a configuration information sending module and a configuration information receiving module, wherein the configuration information sending module is used for periodically sending random access configuration information through a broadcast signal by a base station, wherein the random access configuration information comprises the available preamble number, a physical random access channel and the optimal intra-group device number;
the access request information sending module is used for sending the access request information by the equipment; the access request information is that the equipment randomly selects one from available preambles as a preamble sequence according to broadcast information, and in the random access opportunity, the preamble sequence is transmitted through a physical random access channel and is used as the access request information;
The base station decodes the access request information after receiving the access request information and feeds back the random access response for each access request by a physical downlink shared channel;
The connection request information sending module is used for sending connection request information by the equipment, wherein the connection request information is transmitted in an uplink resource block allocated to the equipment by the base station after the equipment receives the random access response information;
The device conflict generation judging module is used for judging whether the devices generate conflict, if the plurality of devices select the same preamble sequences as the sending request information, the devices have mutual conflict, a conflict solution stage is entered, a self-adaptive DQ conflict solution method is executed according to the device type, and if the conflict does not exist, the base station sends a conflict solution message to the devices, and the devices are successfully accessed.
The following is described in connection with data, charts, etc. of the experimental procedure.
1. Simulation conditions:
Experiments were simulated using MatlabR2016b on a WINDOWS10 system with CPU Core (TM) i7-9750H 2.60GHz and 16.00GB memory.
The experimental parameters are selected in all experiments, wherein the available front derivative is N p =56, the maximum retransmission times are 20 times, the number of devices in the optimal time delay group is 56, the number of devices in the optimal energy consumption group is 31, and the base station allocation RAO interval time is 10ms.
2. The experimental contents are as follows:
simulation experiment 1. The influence of the uplink authorization number on the relevant performance of the invention is explored. The experimental results are shown in FIG. 5.
Simulation experiment 2 for time delay sensitive equipment, the performance of the invention is compared with that of other methods, and the experimental result is shown in figure 6.
Simulation experiment 3 for low power consumption type equipment, the performance of the invention is compared with that of other methods, and the experimental result is shown in figure 7.
Wherein the ACB mechanism is selected from references 3GPP TS 36.321V9.3.0.Medium Access Control (MAC) Protocol Specification S, 2010.
The C-DQ mechanism is selected from references A.Laya,C.Kalalas,F.Vazquez-Gallego,L.Alonso andJ.Alonso-Zarate.Goodbye,ALOHA![J].IEEEAccess,2016,4:2029-2040.
3. Simulation experiment result analysis:
Fig. 5 shows the effect of maximum uplink grant limits on average collision resolution delay and average collision resolution energy consumption in the present invention, with maximum uplink grant numbers set to N p/8,Np/4,Np/2 and N p, respectively. It can be seen from the figure that as the maximum uplink grant number increases, the average collision resolution delay and energy consumption achieve more excellent performance. Until the maximum uplink grant number is N p/2, the average contention resolution delay is substantially consistent with the performance of the energy consumption compared to the maximum uplink grant number of N p (without uplink grant restrictions). For reasons of no loss of generality, in order to maximize access efficiency, the maximum uplink grant number is set to g=n p/2 in the following simulations.
Fig. 6 shows an average collision resolution delay comparison of a delay sensitive device using an embodiment of the present invention with other methods. At an access device number of 1500, the average conflict resolution latency is reduced by 59% compared with the traditional DQ mechanism, and is reduced by 64% compared with the ACB mechanism under the same condition.
FIG. 7 illustrates an average conflict resolution power consumption comparison of a low power device using an embodiment of the present invention with other methods.
As can be seen from the figure, in the case of 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 condition, the average conflict resolution energy consumption of the self-adaptive DQ conflict resolution mechanism is reduced by 28% compared with that of the traditional DQ conflict resolution mechanism, and the average conflict resolution energy consumption of the self-adaptive DQ conflict resolution mechanism is superior to that of the traditional DQ conflict resolution mechanism.
It should be noted that the embodiments of the present invention can be realized in hardware, software, or a combination of software and hardware. The hardware portions may be implemented using dedicated logic and the software portions may be stored in a memory for execution by a suitable instruction execution system, such as a microprocessor or dedicated design hardware. Those of ordinary skill in the art will appreciate that the apparatus and methods described above may be implemented using computer executable instructions and/or embodied in processor control code, such as provided on a carrier medium such as a magnetic 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 device of the present invention and its modules may be implemented by hardware circuitry, such as very large scale integrated circuits or gate arrays, semiconductors such as logic chips, transistors, etc., or programmable hardware devices such as field programmable gate arrays, programmable logic devices, etc., as well as software executed by various types of processors, or by a combination of the above hardware circuitry and software, such as firmware.
The foregoing is merely illustrative of specific embodiments of the present invention, and the scope of the invention is not limited thereto, but any modifications, equivalents, improvements and alternatives falling within the spirit and principles of the present invention will be apparent to those skilled in the art within the scope of the present invention.

Claims (5)

1.一种自适应分布式队列的随机接入方法,其特征在于,所述自适应分布式队列的随机接入方法包括以下步骤:1. A random access method for an adaptive distributed queue, characterized in that the random access method for an 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 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; 步骤五,判断设备是否发生冲突;如果多个设备选择相同的前导序列作为发送请求信息,则设备之间存在相互冲突,将进入冲突解决阶段,按照设备类型执行自适应DQ冲突解决方法;如果不存在冲突,则基站向设备发送冲突解决消息,设备成功接入;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: 其中,M表示同时发起接入的设备数,Ng为最优组内设备数,dtotal为不超出最大尝试次数的前导传输次数,dU表示树分裂的dU后才有设备成功接入,表示在树分裂的第d层每一组成功冲突解决的设备数,l(d,Ng)表示在树分裂的第d层共有的组数;L(d,Ng)表示在d层完成冲突解决所需要等待的平均随机接入机会数,表示一个随机接入机会的窗口大小;Where M represents the number of devices that initiate access at the same time, Ng is the number of devices in the optimal group, dtotal is the number of leading transmissions that does not exceed the maximum number of attempts, dU represents that the device successfully accesses after dU of tree splits, represents the number of devices that successfully resolve conflicts in each group at the dth layer of the tree split; l(d,N g ) represents the number of groups in the dth layer 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; 所述按照设备类型执行自适应DQ冲突解决方法包括:The method of performing an adaptive DQ conflict resolution method according to device type includes: 时延敏感型设备需要满足低时延需求,对组内用户数Ng进行优化,则最优时延组内设备数表示为:Delay-sensitive devices need to meet low delay requirements. The number of users in the group Ng is optimized, and the number of devices in the optimal delay group is expressed as: 其中,组内设备数Ng为正整数,上限范围设置为Ng_max,将参数设置为Ng_max=NpThe number of devices in the group Ng is a positive integer, the upper limit range is set to Ng_max , and the parameter is set to Ng_max = Np ; 所述树分裂的第d层每一组成功冲突解决的设备数还受到最大上行授权数的影响,表示为: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: 其中,g为获得的最大上行授权数,Ps(d,Ng)表示在树分裂d层的冲突解决概率,表示在第d层每一组同时发起冲突解决的设备数;Where g is the maximum number of uplink grants obtained, Ps (d, Ng ) represents the probability of conflict resolution at the dth level of tree splitting, It indicates the number of devices that simultaneously initiate conflict resolution in each group at layer d; 所述设备平均冲突解决能耗包括前导传输能量、设备接收RAR的能量和维持时钟同步的能量,平均冲突解决能耗表示为: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,Ng)=EPA(M,Ng)+ERAR(M,Ng)+Eidle(M,Ng);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: EPA(M,Ng)=R(M,Ng)*PPA*DPAE PA (M,N g )=R (M,N g )*P PA *D PA ; ERAR(M,Ng)=R(M,Ng)*PRAR*DRARE RAR (M, N g ) = R (M, N g ) * P RAR * D RAR ; Eidle(M,Ng)=T(M,Ng)*PidleE idle (M, N g ) = T (M, N g ) * P idle ; 其中,T(M,Ng)表示平均冲突解决时延;PPA、PRAR和Pidle分别表示发送前导的功率、接收RAR信息的功率和维持设备运行所需的功率;DPA和DRAR分别表示发送前导持续时间和接收RAR窗口的大小;R(M,Ng)表示M个设备接入的平均前导传输次数,R(M,Ng)的公式为:Wherein, T(M,N g ) represents the average conflict resolution delay; P PA , P RAR and P idle represent the power of sending preamble, the power of receiving RAR information and the power required to maintain device operation respectively; D PA and D RAR represent the duration of sending preamble and the size of receiving RAR window respectively; R(M,N g ) represents the average number of preamble transmissions for M devices to access, and the formula of R(M,N g ) is: 其中,表示在树分裂第d层未成功接入的设备数;in, Indicates the number of devices that failed to access the dth layer of the tree split; 低功耗型设备需要满足低能耗需求,对组内用户数Ng进行优化,最优能耗组内设备数表示为:Low-power devices need to meet low energy consumption requirements. The number of users Ng in the group is optimized. The number of devices in the optimal energy consumption group is expressed as: 其中,组内设备数Ng为正整数,变化范围上限为Ng_max,将参数设置为Ng_max=NpThe number of devices in the group Ng is a positive integer, and the upper limit of the variation range is Ng_max . The parameter is set to Ng_max = Np ; 所述步骤五中的执行自适应DQ冲突解决方法还包括:The step 5 of executing 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.一种应用如权利要求1所述的自适应分布式队列的随机接入方法的自适应分布式队列的随机接入系统,其特征在于,所述自适应分布式队列的随机接入系统包括:2. A random access system of an adaptive distributed queue using the random access method of an adaptive distributed queue according to claim 1, characterized in that the random access system of the adaptive distributed queue comprises: 配置信息发送模块,用于基站通过广播信号周期性的发送随机接入配置信息;随机接入配置信息包括可用前导数量、物理随机接入信道和最优组内设备数;最优组内设备数为当组内设备数为最优组内设备数时使相关性能达到最优;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 is optimal; 接入请求信息发送模块,用于设备发送接入请求信息;接入请求信息为设备根据广播信息从可用前导中随机选择一个作为前导序列;在本次随机接入机会中,通过物理随机接入信道传输,前导序列作为接入请求信息;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; 设备冲突发生判断模块,用于判断设备是否发生冲突,如果多个设备选择相同的前导序列作为发送请求信息,则设备之间存在相互冲突,将进入冲突解决阶段,按照设备类型执行自适应DQ冲突解决方法;如果不存在冲突,则基站向设备发送冲突解决消息,设备成功接入。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.一种计算机设备,其特征在于,所述计算机设备包括存储器和处理器,所述存储器存储有计算机程序,所述计算机程序被所述处理器执行时,使得所述处理器执行如权利要求1所述的自适应分布式队列的随机接入方法。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 of the adaptive distributed queue as described in claim 1. 4.一种计算机可读存储介质,存储有计算机程序,所述计算机程序被处理器执行时,使得所述处理器执行如权利要求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.一种信息数据处理终端,其特征在于,所述信息数据处理终端用于实现如权利要求2所述的自适应分布式队列的随机接入系统。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.
CN202210713502.3A 2022-06-22 2022-06-22 Random access method, system, device and terminal for adaptive distributed queue Active CN115066037B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202210713502.3A CN115066037B (en) 2022-06-22 2022-06-22 Random access method, system, device and terminal for adaptive distributed queue

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210713502.3A CN115066037B (en) 2022-06-22 2022-06-22 Random access method, system, device and terminal for adaptive distributed queue

Publications (2)

Publication Number Publication Date
CN115066037A CN115066037A (en) 2022-09-16
CN115066037B true CN115066037B (en) 2025-03-04

Family

ID=83203076

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210713502.3A Active CN115066037B (en) 2022-06-22 2022-06-22 Random access method, system, device and terminal for adaptive distributed queue

Country Status (1)

Country Link
CN (1) CN115066037B (en)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO1996033590A1 (en) * 1995-04-21 1996-10-24 Illinois Institute Of Technology Method and apparatus for distributed queue digital data transmission employing variable length data slots
CN103200132B (en) * 2013-04-22 2016-08-10 东南大学 A kind of medical body area network MAC cut-in method of real-time task scheduling
KR102431862B1 (en) * 2020-11-16 2022-08-11 부산대학교 산학협력단 System and Method for Resolving High Speed Competition and Merged Distributed Queueing for Massive Connectivity based on LoRaWAN

Non-Patent Citations (5)

* Cited by examiner, † Cited by third party
Title
Design and performance analysis of a novel distributed queue access protocol for cellular-based massive M2M communications;A.T. H. Bui et al;IEEE Access;20171225;说明书第I-IV节,图8、9 *
Goodbye, ALOHA!;A.Laya, C. Kalalas, F. Vazquez-Gallego, L. Alonso and J. Alonso-Zarate;IEEE Access;20160421;第I-V节 *
基于LTE的M2M随机接入冲突检测与解决方法研究;李蝉;信息科技辑;20190215;第三-五章,图4.3、4.7、4.8 *
李蝉.基于LTE的M2M随机接入冲突检测与解决方法研究.信息科技辑.2019,第三-五章,图4.3、4.7、4.8. *
面向天基物联网的大规模M2M接入控制机制研究;张昱堃;信息科技辑;20230215;全文 *

Also Published As

Publication number Publication date
CN115066037A (en) 2022-09-16

Similar Documents

Publication Publication Date Title
CN109890085B (en) Method for determining random access back-off parameters of priority-classified machine type communication
CN111526530B (en) Optimization method of random access congestion control algorithm for NB-IoT
CN104010378B (en) WLAN access method, access point and wireless local area network (WLAN) system
Liu et al. A novel congestion reduction scheme for massive machine-to-machine communication
CN108282821B (en) A packet-based congestion control access method for giant connection in Internet of Things communication
Lee et al. Recycling random access opportunities with secondary access class barring
Wu et al. An enhanced random access algorithm based on the clustering-reuse preamble allocation in NB-IoT system
CN115348565B (en) Dynamic access and backoff method and system based on load perception in large-scale MTC scenarios
CN113056010A (en) Reserved time slot distribution method based on LoRa network
WO2023071055A1 (en) Method for configuring and updating random access resources in multi-antenna mimo scenario
Lee et al. An efficient contention resolution scheme for massive iot devices in random access to lte-a networks
CN115066037B (en) Random access method, system, device and terminal for adaptive distributed queue
CN109286993B (en) Method for dynamically accessing cellular network based on estimation algorithm
Sim et al. Performance evaluation of partially clustered access scheme for massive machine type communications
CN102665287B (en) Exponential backoff multiple access method in cooperation with network-assisted diversity
CN107743315A (en) Method and apparatus for contention-based transmission
Piao et al. Integrated 2–4 Step Random Access for Heterogeneous and Massive IoT Devices
Zhai et al. Large-Scale Micro-Power Sensors Access Scheme Based on Hybrid Mode in IoT Enabled Smart Grid
CN112218384B (en) A Priority-based Distributed Queue Random Access Method
Zhao et al. Dynamic preamble grouping and access control scheme in machine-to-machine communication
Althumali et al. Dynamic tree-splitting algorithm for massive random access of M2M communications in IoT networks
CN112888081B (en) Multiple access method based on fast feedback mechanism
Aragao et al. A mechanism to control the congestion in machine-to-machine communication in LTE-A networks
WO2017133643A1 (en) Method and device for random access
Alavikia et al. Random multiple data packets transmission scheme in LTE-based machine-type communications

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant