CN110691373B - Random access congestion control method and electronic equipment - Google Patents
Random access congestion control method and electronic equipment Download PDFInfo
- Publication number
- CN110691373B CN110691373B CN201910966707.0A CN201910966707A CN110691373B CN 110691373 B CN110691373 B CN 110691373B CN 201910966707 A CN201910966707 A CN 201910966707A CN 110691373 B CN110691373 B CN 110691373B
- Authority
- CN
- China
- Prior art keywords
- access
- priority
- slot
- load
- devices
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 45
- 230000006854 communication Effects 0.000 abstract description 5
- 238000004891 communication Methods 0.000 abstract description 4
- 230000000977 initiatory effect Effects 0.000 description 6
- 230000007246 mechanism Effects 0.000 description 4
- 230000005540 biological transmission Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000013459 approach Methods 0.000 description 2
- 238000004364 calculation method Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 230000001934 delay Effects 0.000 description 2
- 238000010420 art technique Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 235000003642 hunger Nutrition 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 230000004044 response Effects 0.000 description 1
- 230000037351 starvation Effects 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/0289—Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/08—Non-scheduled access, e.g. ALOHA
- H04W74/0833—Random access procedures, e.g. with 4-step access
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention provides a random access congestion control method and electronic equipment, wherein the random access congestion control method comprises the following steps: step 1), a base station estimates the load of each priority device of the next access time slot; step 2), the base station sets the forbidden access priority and the forbidden access probability of the next access time slot according to the estimated loads of the priority devices of the next access time slot; step 3), broadcasting the forbidden access priority and forbidden access probability of the next access time slot by the base station; wherein the access barring priority is used by the device to determine whether to make access, to make access with an access barring probability, or to barring access. The invention can improve the success rate of the access of the MTC equipment in the machine type communication scene of the 5G system.
Description
Technical Field
The present invention relates to the field of wireless communications technologies, and in particular, to a random access congestion control method and an electronic device.
Background
In the 5G system Machine-type communication (MTC) scenario, a large number of Machine-type communication devices (i.e., MTC devices, hereinafter referred to as devices or terminals) communicate with each other through a mobile network. If a large number of MTC devices are accessed concurrently in a short time, serious network congestion may be caused, which may cause access delay or even failure to access.
Currently, an ACB (Access Class Barring, access class limitation) mechanism is widely used to solve the network congestion problem, under which a base station dynamically adjusts an ACB factor according to the load of MTC equipment and broadcasts a message containing the factor, the MTC equipment generates a random number after receiving the message, if the random number is smaller than the ACB factor, it is allowed to initiate random access, otherwise, after a period of backoff, it initiates random access. When the congestion level is very high, the ACB factor is set to a low value, so as to limit the access number of MTC devices to solve the network congestion problem, and the ACB mechanism does not prioritize MTC devices, which may cause that high priority MTC devices cannot be accessed later. Aiming at the problem of network congestion, there is also a method for self-adapting multiple ACB factors based on EAB (Extended Access Barring, extended access limit), which sets different ACB factors for MTC devices with different priorities, and ensures the access success rate and access delay of high-priority MTC devices (for example, delay-sensitive MTC devices) when congestion occurs.
The above existing method for solving the network congestion problem does not consider the time delay requirement of different MTC devices, or only guarantees the time delay requirement of the MTC device with high priority, so that the MTC device with low priority (for example, the MTC device with time delay tolerance) cannot obtain the access opportunity for a long time. How to ensure the time delay requirement of each level of MTC equipment while relieving network congestion is a current urgent problem to be solved.
Disclosure of Invention
In order to overcome the above-mentioned problems in the prior art, according to one embodiment of the present invention, there is provided a random access congestion control method including:
step 1), a base station estimates the load of each priority device of the next access time slot;
step 2), the base station sets the forbidden access priority and the forbidden access probability of the next access time slot according to the estimated loads of the priority devices of the next access time slot;
step 3), broadcasting the forbidden access priority and forbidden access probability of the next access time slot by the base station; wherein the access barring priority is used by the device to determine whether to make access, to make access with an access barring probability, or to barring access.
In the above method, the priority is 1-N from high to low, N is an integer greater than 1, and step 2) includes:
if the sum of the loads of the priority devices of the next access time slot is smaller than the number of the available lead codes, the base station sets the forbidden access priority of the next access time slot as N, and sets the forbidden access probability of the next access time slot as 1;
otherwise find to satisfy
Is forbidden for the next access time slot by the base stationThe access-stopping priority is set to n+1, and the access-forbidden probability of the next access slot is set to +.>
Wherein R represents the number of available preambles, i+1 represents the next access slot,/I->
Load representing the next access slot priority k device, +.>
And N is more than or equal to 0 and less than or equal to N-1.
In the above method, step 1) includes: the base station estimates the load of each priority device of the next access time slot according to the loads of each priority device of the plurality of access time slots before the next access time slot.
In the above method, the priorities are 1-N from high to low, where N is an integer greater than 1, and step 1) includes estimating the load of each priority device of the next access slot according to the following equation:
where i +1 represents the next access slot,
representing the load of the equipment with the priority of j of the next access time slot, wherein j is more than or equal to 1 and less than or equal to N; a=2m' i -m” i ，/>
m' i Is M i-n+1,j To M i,j Average value of M i,j Representing the load of the device with priority j of the ith access slot, M i-n+1,j Representing the load of the device with the i-n+1th access time slot priority of j, wherein n is 1 < n.ltoreq.i, m' i Is m' i-n+1 To m' i Average value of (2).
In the above method, the method further includes calculating, by the base station, for each access slot of the plurality of access slots before the next access slot, a load of each priority device of the access slot, including:
calculating the total number of devices allowed to be accessed by the access time slot according to the number of idle lead codes of the access time slot and the number of available lead codes;
calculating the number of priority devices which are allowed to be accessed by the access time slot according to the proportion of the priority devices which are successfully accessed by the access time slot in all the devices which are successfully accessed by the access time slot;
and calculating the load of each priority device of the access time slot according to the access prohibition priority and the access prohibition probability of the access time slot and the number of each priority device which is permitted to access by the access time slot.
In the above method, calculating the load of each priority device in the access time slot according to the access prohibition priority and the access prohibition probability of the access time slot and the number of each priority device allowed to access in the access time slot includes:
for devices with higher priority than the access-forbidden priority of the access slot, the load of the devices is equal to the number of corresponding priority devices which are allowed to be accessed by the access slot;
for a device having a priority equal to the access-forbidden priority of the access slot, its load is equal to the ratio of the number of devices of the corresponding priority that the access slot is allowed to access to the access-forbidden probability of the access slot;
for devices with a priority lower than the forbidden access priority of the access slot, the load is equal to the number of corresponding priority devices allowed to access in the previous access slot of the access slot.
The method may further include:
step 4), the equipment determines the priority of the equipment according to the access waiting time and the time delay tolerance thereof;
step 5) the device determines whether to perform access or to perform access with the access prohibition probability recently received from the base station according to the access prohibition priority and the self priority recently received from the base station.
In the above method, step 5) includes:
if the self priority is higher than the access forbidden priority, the equipment determines to access;
if the self priority is equal to the access prohibition priority, generating a random number between 0 and 1 by the equipment, if the generated random number is smaller than the access prohibition probability, determining to access by the equipment, and if the generated random number is greater than or equal to the access prohibition probability, re-executing the steps 4) -5 after the equipment is retracted for a first preset period of time;
and if the self priority is lower than the forbidden access priority, the equipment re-executes the steps 4) -5 after the equipment is backed off for a first preset period of time.
The method may further include: if the access fails, re-executing steps 4) -5) by the device after backoff for a second predetermined period of time.
According to an embodiment of the present invention, there is also provided a random access congestion control method, including:
step a), equipment determines self priority according to access waiting time and time delay tolerance thereof;
step b) the device determines whether to perform access or to perform access with the access prohibition probability received from the base station recently according to the access prohibition priority received from the base station recently and the own priority.
According to an embodiment of the present invention, there is also provided an electronic apparatus including: a processor; and a memory storing instructions executable by the processor, which when executed by the processor, cause the electronic device to implement the random access congestion control method described above.
The embodiment of the invention provides the following beneficial effects:
the problem of network congestion is effectively relieved, and the time delay requirement of the high-priority MTC equipment is guaranteed. In addition, the priority of the MTC equipment can be adjusted according to the access control time delay, and the time delay requirement of the MTC equipment with low priority is ensured, so that the access success rate of the MTC equipment is improved.
Drawings
The exemplary embodiments will be described in detail by reference to the drawings, which are intended to depict the exemplary embodiments and should not be interpreted as limiting the intended scope of the claims. The drawings are not considered to be drawn to scale unless specifically indicated.
Fig. 1 shows a flow chart of a random access congestion control method according to one embodiment of the invention;
FIG. 2 illustrates a flow chart of a method of estimating the load of priority devices for a next access slot in accordance with one embodiment of the invention;
FIG. 3 illustrates a flow chart of a method of obtaining and broadcasting access barring priority and access barring probability for a next access slot in accordance with one embodiment of the present invention; and
fig. 4 shows a flow chart of a method of access control according to recently received access control parameters and self-priority according to one embodiment of the invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be further described in detail by the following examples with reference to the accompanying drawings. 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.
The MTC device (hereinafter referred to as device for short) establishes a connection with a base station in a communication process, and first needs to perform a random access process, including: the device selects one preamble from the available preamble set with medium probability and sends the preamble as msg1 to the base station, and a plurality of devices may select the same preamble in the same time-frequency resource; the base station sends a random access response message msg2 (including T back_off ) The method comprises the steps of carrying out a first treatment on the surface of the The equipment completes uplink synchronization according to the received msg2, transmits an uplink message msg3 with a UE identifier, and starts a contention resolution timer after transmitting the msg 3; and, the base station transmits a contention resolution message msg4 to the device. According to an embodiment of the present invention, there is provided a random access congestion control method, in which a base station is enabled to obtain priorities by carrying a priority indication in msg3The number of successful access devices corresponding to the level is estimated, so that the device load (i.e. the load of each priority device) corresponding to each priority of the next access time slot is estimated, and then the access control parameter is calculated to control the access of the device. In addition, the priority of the devices is dynamically adjusted to ensure latency requirements for low priority devices.
Fig. 1 schematically shows a flow chart of a random access congestion control method according to an embodiment of the invention, in which the priority of a device is divided into three levels, high, medium and low, the individual steps of which are described below with reference to fig. 1.
And S11, estimating the load of each priority device of the next access time slot by the base station.
The base station can estimate the load of each priority device of the next access slot based on the load of each priority device of the previous access slot
To obtain access control parameters for the next access slot. Wherein i+1 represents the next access slot, -/-for the next access slot>
Representing the estimated load of the next access slot high priority device, +.>
Representing the estimated load of priority devices in the next access slot,/>
Representing the estimated load of the next access slot low priority device.
Referring to fig. 2, according to one embodiment of the invention, step S11 comprises the sub-steps of:
s111, calculating the total number M of devices initiating random access in the current access time slot i (i.e. the total number of devices allowed to access, i denotes the current access slot).
Assuming current access slot initiated randomThe total number of accessed devices is M i The number of idle preambles is expressed as follows:
wherein M is f Represents the number of idle preambles of the current access slot, R represents the number of available preambles, and thus, according to the above equation, from M f And R can obtain the total number M of the devices initiating random access in the current access time slot i 。
S112, initiating the total number M of the devices which are randomly accessed in the current access time slot i In the method, the number M of devices corresponding to each priority is calculated h 、M m 、M l 。
As described above, in random access, the msg3 message sent by the device to the base station carries a priority indication (used for indicating the priority of the device), so that the base station can obtain the number M of successful access devices corresponding to each priority in the current access slot according to the priority indication s,h 、M s,m 、M s,l Wherein M is s,h Representing the number of successfully accessed high priority devices in the current access slot, M s,m Representing the number of medium priority devices successfully accessed in the current access slot, M s,l Representing the number of low priority devices successfully accessed in the current access slot, M s ＝M s,h +M s,m +M s,l Indicating the total number of successfully accessed devices in the current access slot. Since the device will select the preamble to access with equal probability at random access, the probability of successful access is the same. Thus, according to one embodiment of the invention, the total number M of devices initiating random access in the current access slot is calculated according to the following equation i In the number M of devices corresponding to each priority h 、M m 、M l ：
M h ＝M i *(M s,h /M s ) (2)
M m ＝M i *(M s,m /M s ) (3)
M l ＝M i *(M s,l /M s ) (4)
S113, calculating the load M of each priority device (or the device load corresponding to each priority) of the current access time slot i,h 、M i,m 、M i,l Where i denotes the current access slot, M i,h Representing the load of the high priority device of the current access slot, M i,m Representing the load of the priority device in the current access slot, M i,l Representing the load of the low priority device for the current access slot.
The load of each priority device is the sum of the number of two parts of devices that are allowed access (i.e. initiate random access) and forbidden access corresponding to the priority. According to one embodiment of the invention, the forbidden access probability alpha of the current access time slot can be based on i And the access barring priority indication P to calculate the load of each priority device of the current access slot (it should be understood that the initial access barring probability may be set using prior art techniques, such as ACB mechanism). As shown in table 1.
TABLE 1
| P＝H P | P＝M P | P＝L P | |
| M i,h | M h /α i | M h | M h |
| M i,m | 0 | M m /α i | M m |
| M i,l | 0 | 0 | M l /α i |
Wherein p=h P Indicating that the forbidden access priority of the current access slot is high, i.e. only high priority devices are allowed to be in forbidden access probability alpha of the current access slot i The access is forbidden by the medium priority device and the low priority device; p=m P Indicating that the forbidden access priority of the current access time slot is medium, i.e. allowing the high priority device to directly access the medium priority device to forbidden access probability alpha i Accessing, and prohibiting accessing by low priority equipment; p=l P Indicating that the forbidden access priority of the current access time slot is low, i.e. allowing high and medium priority devices to directly access, low priority devices to forbidden access probability alpha i And (5) accessing. Thus, as shown in table 1, if the forbidden access priority of the current access slot indicates p=h P Load M of the high priority device of the current access slot i,h Is M h /α i While the load M of the medium and low priority devices i,m 、M i,l Is 0; if access priority is forbidden, P=M P Load M of the high priority device of the current access slot i,h Is M h (i.e. the number of high priority devices initiating random access in the current access slot), the load M of the medium priority devices i,m Is M m /α i While the load M of the low priority device i,l Is 0; if access priority is forbidden, P=L P Load M of the high priority device of the current access slot i,h Is M h Load M of medium priority device i,m Is M m Load M of low priority device i,l Is M l /α i . If the calculated load of a device with a certain priority is 0, according to an embodiment of the present invention, the load of the device with the corresponding priority in the previous access slot (i.e. the previous access slot of the current access slot) may be used as the load of the device with the priority in the current access slot.
S114, estimating the load of each priority device of the next access time slot
In general, when the network reaches a steady state, the load state of adjacent time slots does not change much, and according to one embodiment of the present invention, the load of each priority device in the current access time slot may be used as the load of each priority device in the next access time slot.
And S12, the base station obtains the forbidden access priority and the forbidden access probability of the next access time slot according to the estimated loads of the equipment with each priority of the next access time slot, and broadcasts access control parameters comprising the forbidden access priority and the forbidden access probability. It should be appreciated that the access control parameters typically also include a forbidden access time.
As described above, the conventional ACB mechanism broadcasts a fixed ACB factor to the devices by the base station and prohibits access times. However, as the access load changes, the fixed ACB factor reduces the control efficiency. The inventor finds that the control efficiency can be effectively improved by dynamically adjusting the access control parameters according to the load change. Because the requirements of different devices on time delays are different, in order to ensure the access time delays of devices with different priorities and ensure that the time delay sensitive devices can access preferentially, an access prohibition priority indication P can be added in the access control parameter, wherein the P is used for indicating the access prohibition priority, namely, the access prohibition probability is specific to the device with the corresponding priority, and the device with the higher priority than the access prohibition priority can be accessed directly and the device with the lower priority than the access prohibition priority can prohibit access.
Further, for the access prohibition probability, when the access load approaches the number R of available preambles, the throughput reaches the maximum and the system efficiency is the highest, so the access prohibition probability can be dynamically adjusted according to the load so that the number of devices that obtain access opportunities is equal to the number of available preambles.
Referring to fig. 3, according to one embodiment of the present invention, step S12 includes the sub-steps of:
s121, comparing the estimated load of the next access time slot high priority device
And the number of available preambles R, if +.>
If the number of available preambles is greater than or equal to the number R, setting a forbidden access priority indication p=h of the next access slot P (i.e., indicates that the access barring priority is high), and calculates the access barring probability α according to formula (5) i+1 (i+1 represents the next access slot, α i+1 Forbidden access probability for the next access slot), the broadcast includes P and a i+1 Access control parameters of (a); otherwise, step S122 is performed.
Wherein access priority is prohibited indication p=h P Indicating that only high priority devices are allowed to be represented with probability alpha i+1 Access is disabled for medium priority devices and low priority devices.
S122, comparing the estimated load of the next access time slot high priority device
Load with medium priority device->
Sum and number of available preambles R, if +.>
And->
If the sum is greater than or equal to the number R of available preambles, setting a forbidden access priority indication P=M of the next access slot P (i.e., indicating that the access barring priority is medium), and calculates the access barring probability alpha of the next access slot according to formula (6) i+1 The broadcast includes P and alpha i+1 Access control parameters of (a); otherwise, step S123 is performed.
Wherein access priority is prohibited indication p=m P Indicating that the high priority device can directly access, the medium priority device has probability alpha i+1 Access is disabled by the low priority device.
Step S123. Comparing the estimated loads of all priority devices of the next access slot (i.e.
) The sum and the number R of available preambles, if the sum of the loads of all priority devices is greater than or equal to the number R of available preambles, setting the forbidden access priority indication P=L of the next access time slot P (i.e., indicating that the access barring priority is low), and calculating the access barring probability alpha of the next access slot according to formula (7) i+1 The broadcast includes P and alpha i+1 Access control parameters of (a); otherwise, step S124 is performed.
Wherein access priority prohibition indication p=l P Indicating that the high-priority device and the medium-priority device can be directly accessed, and the low-priority device uses the probability alpha i+1 And (5) accessing.
Step S124, the estimated sum of the loads of all priority devices in the next access time slot is smaller than the number R of available lead codes, so that each priority device can directly access, and the forbidden access priority indication P=L of the next access time slot is set P (i.e. indicating that the access barring priority is low), and setting the access barring probability alpha of the next access slot i+1 =1, broadcast includes P and α i+1 Access control parameters of (a) are provided.
The algorithm in table 2 shows the whole flow of acquiring the access barring probability and access barring priority indication of the next access slot in step S12.
TABLE 2
And S13, receiving the access control parameters from the base station by the equipment, determining the priority of the equipment, and performing access control according to the latest received access control parameters and the priority of the equipment.
Three parameters are set at each device: maximum tolerant delay T for high priority devices h Maximum tolerated latency T for medium priority devices m And maximum tolerated latency T for low priority devices l . The device priority may be one of the high, medium, and low three levels. The initial priority is set by the device according to its own delay tolerance, the device with high delay tolerance (i.e. the device with low real-time requirement, such as the device with real-time index lower than the preset low threshold) is set as the low priority device, the device with low delay tolerance (such as the device with real-time index higher than the preset high threshold) is set as the high priority device, and the device with general delay tolerance (such as the device with real-time index between the preset low threshold and the high threshold) is set as the medium priority device.
In summary, in order to avoid starvation of low-priority equipment or medium-priority equipment, calculating the current access control delay of the equipment, comparing the current access control delay with the delay tolerance of the equipment to judge whether the condition of priority updating is met, and if so, dynamically updating the priority; then, access control (including whether to access, how to access) is performed according to the own priority and the most recently received access control parameters. According to one embodiment of the invention and referring to fig. 4, step S13 comprises the following sub-steps:
step S131, the device receives access control parameters broadcasted by the base station, including access prohibition probability (e.g. P), access prohibition priority indication (e.g. alpha i+1 ) And inhibit access time (e.g., T barring )。
As described above, the access barring probabilities and access barring priority indications may be dynamically adjusted as the network loads conditions. In general, when the load is high, the access prohibition probability is correspondingly reduced, so that the number of devices initiating random access is limited, the collision probability is reduced, and the network congestion is reduced; and when the load is low, the access prohibition probability is correspondingly increased, so that the channel utilization rate is improved (see steps S11-S12).
Step S132, the device determines the self priority. According to one embodiment of the invention, step S132 comprises the sub-steps of:
s1321, calculating a current access control time delay T by the device delay The access control delay corresponds to an access latency of the device.
Specifically, access control delay T delay Is 0; if the device was barred from access, T delay Also taking into account the forbidden access time T barring Etc.; if the device was allowed access but failed access, T delay Also take into account the back-off time T back_off And the time to perform the random access procedure, etc. (see fig. 4).
S1322, calculating the time delay tolerance T and the current access control time delay T by the equipment delay Difference Δt=t-T delay The delay tolerance T represents the maximum access delay allowed by the device, and different devices have different delay tolerance. If DeltaT is less than or equal to T h If the current priority of the equipment is not high, the equipment updates the priority of the equipment to be high; if T h ＜ΔT≤T m If the current priority of the equipment is not in the middle, the equipment updates the priority of the equipment into the middle; if T m ＜ΔT≤T l If the device's current priority is not low, the device updates its priority to low.
And S133, the equipment compares the self priority with the access prohibition priority indicated by the latest received access prohibition priority indication, and executes corresponding control operation according to the comparison result.
Specifically, the following three cases are classified:
if the priority of the access request is higher than the access prohibition priority, directly accessing;
if the self priority is lower than the access forbidden priority, the access is forbidden, and the back-off time T is reached barring After (i.e., access time is prohibited), returning to step S132 to recalculate T delay And priority, and performs step S133.
If the self priority is equal to the forbidden access priority, the device generates a random number q between 0 and 1, and if q is smaller than the forbidden access probability which is received recently, the device accesses; otherwise at the back-off time T barring After that, return to step S132 to recalculate T delay And priority, and performs step S133;
wherein, after the device initiates access, a connection is established with the base station according to the random access procedure described above, and if the access fails, the connection is established according to the back-off time T in msg2 back_off After the back-off, the process returns to step S132 to recalculate T delay And priority, and performs step S133.
The embodiment can effectively relieve the network congestion problem and ensure the time delay requirement of high-priority equipment. In addition, the priority of the equipment can be adjusted according to the access control time delay, and the time delay requirement of low-priority equipment is ensured, so that the access success rate of the equipment is improved.
In the above embodiment, the load of each priority device of the next access slot is estimated according to the load of each priority device of the current access slot in step S114. In other embodiments, the load of each priority device in the next access slot may be estimated according to the load of each priority device in the previous access slots (i.e., the access slots before the next access slot) (it should be understood that the calculation method of the load of each priority device in the previous access slot may refer to the calculation method of the load of each priority device in the current access slot, specifically refer to steps S111-S113), for example, an average value or a weighted average value of the loads of each priority device in the previous access slots is taken as the load of each priority device in the next access slot. According to one embodiment of the present invention, a trend prediction method may also be used to estimate the load of each priority device in the next slot. Taking the high priority device as an example, the load of the next slot high priority device can be estimated according to the following equation:
where i +1 represents the next access slot,
an estimate representing the load of the next access slot high priority device; a=2m' i -m” i ，/>
m' i Is M i-n+1,h To M i,h Average value of (wherein M i,h Representing the load of the i-th access slot high priority device, M i-n+1,h Representing the load of the i-n+1th access time slot high priority device, wherein n is the length of a moving window and is more than 1 and less than or equal to i); m' i Is m' i-n+1 To m' i Average value of (2).
A similar approach may be used to estimate the load of the priority device and the low priority device in the next slot.
In the above embodiment, the priorities of the devices are classified into high, medium, and low three levels. Those skilled in the art will appreciate that the priority of a device may also be divided into two, four, five, etc.
It should be noted that some example methods are depicted as flowcharts. Although the flowchart depicts operations as being performed sequentially, it will be appreciated that many of the operations can be performed in parallel, concurrently or synchronously. In addition, the order of operations may be rearranged. The process may terminate when the operation is completed, but may also have additional steps not included in the figures or embodiments.
The above-described methods may be implemented in hardware, software, firmware, middleware, pseudocode, hardware description language, or any combination thereof. When implemented in software, firmware, middleware or pseudocode, the program code or code segments to perform the tasks can be stored in a computer readable medium such as a storage medium and the processor can perform the tasks.
It should be appreciated that the exemplary embodiments implemented in software are typically encoded on some form of program storage medium or implemented over some type of transmission medium. The program storage medium may be any non-transitory storage medium, such as a magnetic disk (e.g., a floppy disk or a hard disk) or an optical disk (e.g., a compact disk read only memory or "CD ROM"), and may be read-only or random access. Similarly, the transmission medium may be twisted wire pairs, coaxial cable, optical fiber, or some other suitable transmission medium known to the art.
While the invention has been described in terms of preferred embodiments, the invention is not limited to the embodiments described herein, but encompasses various changes and modifications that may be made without departing from the scope of the invention.
Claims (9)
1. A random access congestion control method, comprising:
step 1), a base station estimates the load of each priority device of the next access time slot;
step 2) setting, by the base station, access prohibition priority and access prohibition probability of the next access slot according to the estimated loads of the priority devices of the next access slot, wherein the priorities are respectively 1-N from high to low, N is an integer greater than 1, and the step 2) includes:
if the sum of the loads of the priority devices of the next access time slot is smaller than the number of the available lead codes, the base station sets the forbidden access priority of the next access time slot as N, and sets the forbidden access probability of the next access time slot as 1;
otherwise find to satisfy
Is set by the base station to n+1 and the access barring probability of the next access slot is set to +.>
Wherein R represents the number of available preambles, i+1 represents the next access slot,/I->
Load representing the next access slot priority k device, +.>
N is more than or equal to 0 and less than or equal to N-1;
step 3), broadcasting the forbidden access priority and forbidden access probability of the next access time slot by the base station; wherein the access barring priority is used by the device to determine whether to make access, to make access with an access barring probability, or to barring access.
2. The method of claim 1, wherein step 1) comprises:
the base station estimates the load of each priority device of the next access time slot according to the loads of each priority device of the plurality of access time slots before the next access time slot.
3. The method of claim 2, wherein the priorities are 1-N from high to low, respectively, N being an integer greater than 1, and step 1) includes estimating the load of each priority device for the next access slot according to the following equation:
where i +1 represents the next access slot,
representing the load of the equipment with the priority of j of the next access time slot, wherein j is more than or equal to 1 and less than or equal to N; a=2m' i -m” i ，/>
m' i Is M i-n+1,j To M i,j Average value of M i,j Representing the load of the device with priority j of the ith access slot, M i-n+1,j Representing the load of the device with the i-n+1th access time slot priority of j, wherein n is 1 < n.ltoreq.i, m' i Is m' i-n+1 To m' i Average value of m' i-n+1 Is M i-2n+2,j To M i-n+1,j Average value of M i-2n+2,j Representing the load of the i-2n+2 th access slot priority j device.
4. The method of claim 2, wherein the method further comprises calculating, by the base station, for each access slot of the plurality of access slots preceding the next access slot, a load for each priority device of the access slot, comprising:
calculating the total number of devices allowed to be accessed by the access time slot according to the number of idle lead codes of the access time slot and the number of available lead codes;
calculating the number of priority devices which are allowed to be accessed by the access time slot according to the proportion of the priority devices which are successfully accessed by the access time slot in all the devices which are successfully accessed by the access time slot;
and calculating the load of each priority device of the access time slot according to the access prohibition priority and the access prohibition probability of the access time slot and the number of each priority device which is permitted to access by the access time slot.
5. The method of claim 4, wherein calculating the load of each priority device of the access slot based on the access barring priority and access barring probability of the access slot and the number of each priority device permitted to access by the access slot comprises:
for devices with higher priority than the access-forbidden priority of the access slot, the load of the devices is equal to the number of corresponding priority devices which are allowed to be accessed by the access slot;
for a device having a priority equal to the access-forbidden priority of the access slot, its load is equal to the ratio of the number of devices of the corresponding priority that the access slot is allowed to access to the access-forbidden probability of the access slot;
for devices with a priority lower than the forbidden access priority of the access slot, the load is equal to the number of corresponding priority devices allowed to access in the previous access slot of the access slot.
6. The method of any of claims 1-5, further comprising:
step 4), the equipment determines the priority of the equipment according to the access waiting time and the time delay tolerance thereof;
step 5) the device determines whether to perform access or to perform access with the access prohibition probability recently received from the base station according to the access prohibition priority and the self priority recently received from the base station.
7. The method of claim 6, wherein step 5) comprises:
if the self priority is higher than the access forbidden priority, the equipment determines to access;
if the self priority is equal to the access prohibition priority, generating a random number between 0 and 1 by the equipment, if the generated random number is smaller than the access prohibition probability, determining to access by the equipment, and if the generated random number is greater than or equal to the access prohibition probability, re-executing the steps 4) -5 after the equipment is retracted for a first preset period of time;
and if the self priority is lower than the forbidden access priority, the equipment re-executes the steps 4) -5 after the equipment is backed off for a first preset period of time.
8. The method of claim 6, further comprising:
if the access fails, re-executing steps 4) -5) by the device after backoff for a second predetermined period of time.
9. An electronic device, comprising:
a processor; and
a memory storing instructions executable by the processor, which when executed by the processor, cause the electronic device to implement the method of any one of claims 1-8.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910085792X | 2019-01-29 | ||
| CN201910085792 | 2019-01-29 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110691373A CN110691373A (en) | 2020-01-14 |
| CN110691373B true CN110691373B (en) | 2023-06-06 |
Family
ID=69112552
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910966707.0A Active CN110691373B (en) | 2019-01-29 | 2019-10-12 | Random access congestion control method and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110691373B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111526530B (en) * | 2020-05-15 | 2023-04-28 | 广东技术师范大学 | Optimization method of random access congestion control algorithm for NB-IoT |
| CN113810883A (en) * | 2021-07-01 | 2021-12-17 | 中铁二院工程集团有限责任公司 | Internet of things large-scale random access control method |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159974A (en) * | 2007-11-16 | 2008-04-09 | 中兴通讯股份有限公司 | Access grade control method |
| CN102404865A (en) * | 2010-09-10 | 2012-04-04 | 财团法人工业技术研究院 | Prioritized random access method |
| CN104219732A (en) * | 2013-05-29 | 2014-12-17 | 中兴通讯股份有限公司 | Network access control method and mobile terminal |
| CN106304267A (en) * | 2015-06-03 | 2017-01-04 | 上海无线通信研究中心 | A kind of virtual subdistrict system of selection of customer-centric |
| CN106937393A (en) * | 2017-04-25 | 2017-07-07 | 电子科技大学 | A kind of scheduling method for wireless resource based on priority |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| TWI612834B (en) * | 2016-11-16 | 2018-01-21 | 財團法人資訊工業策進會 | Base station and access class barring method thereof and communication terminal |
-
2019
- 2019-10-12 CN CN201910966707.0A patent/CN110691373B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101159974A (en) * | 2007-11-16 | 2008-04-09 | 中兴通讯股份有限公司 | Access grade control method |
| CN102404865A (en) * | 2010-09-10 | 2012-04-04 | 财团法人工业技术研究院 | Prioritized random access method |
| CN104219732A (en) * | 2013-05-29 | 2014-12-17 | 中兴通讯股份有限公司 | Network access control method and mobile terminal |
| CN106304267A (en) * | 2015-06-03 | 2017-01-04 | 上海无线通信研究中心 | A kind of virtual subdistrict system of selection of customer-centric |
| CN106937393A (en) * | 2017-04-25 | 2017-07-07 | 电子科技大学 | A kind of scheduling method for wireless resource based on priority |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110691373A (en) | 2020-01-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10123352B2 (en) | Fairness in wireless networks with adaptive clear channel assessment thresholds | |
| JP5688148B2 (en) | Mechanism for accessing wide channels in overlapping networks | |
| CN111526530B (en) | Optimization method of random access congestion control algorithm for NB-IoT | |
| CN108924939B (en) | Uplink transmission preamble allocation method for NB-IoT system to prioritize devices | |
| CN110691373B (en) | Random access congestion control method and electronic equipment | |
| US8027327B2 (en) | Distributed scheduling in wireless networks with service differentiation | |
| CN109699089B (en) | Channel access method and device | |
| CN110463334B (en) | Random access method, wireless device and node equipment | |
| CN113940135A (en) | Sending reports of random access procedures | |
| US20160143057A1 (en) | Method and network node for managing collisions | |
| JP2001237839A (en) | Wireless packet priority control method | |
| US11979205B1 (en) | Method for configuring and updating random access resources in multi-antenna MIMO environment | |
| KR102448310B1 (en) | Method and apparatus for determining contention window size in communication system | |
| KR102321370B1 (en) | Base station and terminal, and control method thereof | |
| CN112004212B (en) | Random access system and method based on sliding window | |
| CN113038586B (en) | Configuration method of synchronous signal block and electronic equipment | |
| CN111542124B (en) | Method and device for starting RTS/CTS mechanism | |
| EP3446532B1 (en) | A communications device, an access point and methods therein for accessing a resource unit | |
| CN111107661B (en) | Random access resource acquisition method and device | |
| CN107086900B (en) | M2M communication access control optimization method for handling LTE network emergency | |
| KR101816085B1 (en) | Method for controlling contention window with low latency in unlicenced band and device for performing the method | |
| KR102242637B1 (en) | Random access systems, terminal devices applied to the same and control method thereof | |
| KR102223146B1 (en) | Methods and apparatuses for random access using random power backoff | |
| WO2023093729A1 (en) | Random access method and apparatus, and electronic device and storage medium | |
| Bouzouita et al. | Applying nonlinear optimal control strategy for the access management of MTC devices |
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 |