CN110691373A - Random access congestion control method and electronic equipment - Google Patents
Random access congestion control method and electronic equipment Download PDFInfo
- Publication number
- CN110691373A CN110691373A CN201910966707.0A CN201910966707A CN110691373A CN 110691373 A CN110691373 A CN 110691373A CN 201910966707 A CN201910966707 A CN 201910966707A CN 110691373 A CN110691373 A CN 110691373A
- Authority
- CN
- China
- Prior art keywords
- access
- priority
- slot
- time slot
- load
- 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.)
- Granted
Links
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, e.g. scheduled or random access
- H04W74/08—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access]
- H04W74/0833—Non-scheduled or contention based access, e.g. random access, ALOHA, CSMA [Carrier Sense Multiple Access] using a random access procedure
-
- 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]
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), estimating the load of each priority device of the next access time slot by a base station; 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 load of each priority device of the next access time slot; step 3) broadcasting the access prohibition priority and the access prohibition probability of the next access time slot by the base station; wherein the barring priority is used for the device to determine whether to access, access with a barring probability, or barring access. The invention can improve the access success rate of the MTC equipment in the 5G system machine communication scene.
Description
Technical Field
The invention relates to the technical field of wireless communication, in particular to a random access congestion control method and electronic equipment.
Background
In a 5G system Machine-Type Communication (MTC) scenario, mass Machine-Type Communication devices (i.e., MTC devices, hereinafter simply referred to as devices or terminals) communicate with each other through a mobile network. If a large number of MTC devices access concurrently in a short time, serious network congestion may be caused, which may cause problems such as access delay and even access failure.
Currently, an ACB (Access Class Barring) mechanism is widely used to solve the problem of network congestion, in which a base station dynamically adjusts an ACB factor according to a load of MTC devices and broadcasts a message including the ACB factor, the MTC devices generate a random number after receiving the message, and if the random number is smaller than the ACB factor, the MTC devices are allowed to initiate random Access, otherwise, the MTC devices initiate random Access after backoff for a period of time. When the congestion level is very high, the ACB factor is set to a lower value for limiting the access number of the MTC devices to solve the network congestion problem, and the ACB mechanism does not prioritize the MTC devices, which may cause the high-priority MTC devices to be unable to access late. Aiming at the problem of network congestion, a method for self-adapting multiple ACB factors based on EAB (extended access Barring) is provided, the method sets different ACB factors aiming at MTC (machine type communication) equipment with different priorities, and ensures the access success rate and the access delay of high-priority MTC equipment (such as time-delay sensitive MTC equipment) when congestion occurs.
In the above existing method for solving the network congestion problem, the delay requirements of different MTC devices are not considered, or the delay requirement of a high-priority MTC device is only guaranteed, so that a low-priority MTC device (for example, a delay-tolerant MTC device) cannot obtain an access opportunity for a long time. How to guarantee the time delay requirements of each level of MTC equipment while relieving network congestion is a problem which needs to be solved urgently at present.
Disclosure of Invention
In order to overcome the problems in the prior art, according to an embodiment of the present invention, a method for controlling random access congestion is provided, including:
step 1), estimating the load of each priority device of the next access time slot by a base station;
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 load of each priority device of the next access time slot;
step 3) broadcasting the access prohibition priority and the access prohibition probability of the next access time slot by the base station; wherein the barring priority is used for the device to determine whether to access, access with a barring probability, or barring access.
In the above method, the priorities are 1-N from high to low, respectively, where 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 less than the number of the available lead codes, the base station sets the access prohibition priority of the next access time slot to be N, and sets the access prohibition probability of the next access time slot to be 1;
otherwise find out to satisfyN, the base station sets the access barring priority of the next access slot to n +1 and sets the access barring probability of the next access slot to nWhere R represents the number of available preambles, i +1 represents the next access slot,representing the load of the device with the next access slot priority k,and N is more than or equal to 0 and less than or equal to N-1.
In the above method, step 1) comprises: and estimating the load of each priority device of the next access time slot by the base station according to the load of each priority device of a plurality of access time slots before the next access time slot.
In the above method, the priorities are 1-N from high to low, respectively, where N is an integer greater than 1, and step 1) includes estimating the load of each priority device in the next access slot according to the following formula:
where i +1 denotes the next access slot,representing the load of 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'iIs Mi-n+1,jTo Mi,jAverage value of (1), Mi,jRepresenting the load of the device with i-th access slot priority j, Mi-n+1,jRepresenting the load of the device with the i-n +1 th access time slot with the priority of j, 1 < n ≦ i, m "iIs m'i-n+1To m'iAverage value of (a).
In the above method, the method further includes calculating, by the base station, for each of a plurality of access slots before a 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 each priority device allowed to be accessed by the access time slot according to the proportion of each priority device successfully accessed by the access time slot in all the devices 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 allowed to be accessed by the access time slot.
In the above method, calculating the load of each priority device of the access slot according to the prohibited access priority and the prohibited access probability of the access slot and the number of each priority device permitted to access the access slot includes:
for the equipment with the priority higher than the access prohibition priority of the access time slot, the load is equal to the number of corresponding priority equipment which is allowed to be accessed by the access time slot;
for the equipment with the priority equal to the access prohibition priority of the access time slot, the load is equal to the ratio of the number of corresponding priority equipment which is allowed to be accessed by the access time slot to the access prohibition probability of the access time slot;
for devices with a priority lower than the access-prohibited priority of the access slot, the load is equal to the number of corresponding priority devices allowed to access the access slot immediately preceding the access slot.
The above method may further comprise:
step 4), the equipment determines self priority according to the access waiting time and the delay tolerance thereof;
and step 5) determining whether to carry out access, carry out access with the access prohibition probability received from the base station or forbid access by the equipment according to the access prohibition priority received from the base station and the self priority.
In the above method, step 5) includes:
if the self priority is higher than the access prohibition priority, the equipment determines to access;
if the self priority is equal to the access prohibition priority, the equipment generates a random number between 0 and 1, if the generated random number is smaller than the access prohibition probability, the equipment determines to access, and if the generated random number is larger than or equal to the access prohibition probability, the equipment re-executes the steps 4) -5 after retreating for a first preset time period);
if the self priority is lower than the access prohibition priority, the equipment re-executes the steps 4) -5) after retreating for the first preset time period.
The above method may further comprise: if the access fails, the device re-executes the steps 4) -5) after retreating for a second preset time period.
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 delay tolerance thereof;
step b) determining whether to carry out access, carry out access with the access prohibition probability received from the base station or forbid access by the equipment according to the access prohibition priority received from the base station and the self priority.
There is also provided, in accordance with an embodiment of the present invention, electronic apparatus including: a processor; and a memory storing instructions executable by the processor, the instructions when executed by the processor causing the electronic device to implement the above random access congestion control method.
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 delay, the delay requirement of the low-priority MTC equipment is ensured, and therefore the access success rate of the MTC equipment is improved.
Drawings
Example embodiments will be described in detail with reference to the accompanying drawings, which are intended to depict example embodiments and should not be construed as limiting the intended scope of the claims. The drawings are not to be considered as drawn to scale unless explicitly indicated.
Fig. 1 shows a flow chart of a random access congestion control method according to one embodiment of the invention;
fig. 2 shows a flow chart of a method of estimating the load of priority devices of a next access slot according to one embodiment of the invention;
fig. 3 illustrates a flow diagram of a method of obtaining and broadcasting a barring priority and a barring probability for a next access slot according to one embodiment of the invention; and
fig. 4 shows a flowchart of a method for access control according to recently received access control parameters and self-priorities according to an embodiment of the present 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 embodiments with reference to the accompanying drawings. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
An MTC device (hereinafter, referred to as a device) establishes a connection with a base station during a communication process, and first needs to perform a random access procedure, including: the device selects a preamble with equal probability from an available preamble set as msg1 to be sent to the base station, and multiple devices may select the same preamble in the same time-frequency resource; the base station sends a random access response message msg2 (including T) to the deviceback_off) (ii) a The equipment completes uplink synchronization according to the received msg2, sends an uplink message msg3 with UE identification, and starts a contention resolution timer after sending msg 3; and, the base station sends a contention resolution message msg4 to the device. According to an embodiment of the present invention, a random access congestion control method is provided, wherein msg3 carries a priority indication so that a base station can obtain the number of successful access devices corresponding to each priority, thereby estimating the device load (i.e., the load of each priority device) corresponding to each priority in the next access slot, and further calculating an access control parameter to control the access of the device. In addition, the priority of the devices is also dynamically adjusted to guarantee the latency requirements of low priority devices.
Fig. 1 schematically shows a flow chart of a random access congestion control method according to an embodiment of the present invention, in which the priority of a device is divided into three levels, high, medium, and low, and the steps of the method 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 may estimate the load of priority devices of the next access slot based on the load of priority devices of the previous access slot (next access slot)To obtain access control parameters for the next access slot. Where i +1 denotes the next access slot,representing the estimatedThe load of the next access slot high priority device,representing the estimated load of the priority device in the next access slot,representing the estimated load of the low priority device of the next access slot.
Referring to fig. 2, according to an embodiment of the present invention, step S11 includes the following sub-steps:
step S111, calculating the total number M of the devices which initiate random access in the current access time sloti(i.e. the total number of devices allowed to access, i denotes the current access slot).
Assuming that the total number of devices initiating random access in the current access time slot is MiThen the number of idle preambles is represented as follows:
wherein M isfRepresents the number of idle preambles for the current access slot and R represents the number of available preambles, such that from M according to the above equationfAnd R can obtain the total number M of the equipment initiating random access in the current access time sloti。
Step S112, initiating random access in the current access time slotiIn the method, the number M of devices corresponding to each priority is calculatedh、Mm、Ml。
As described above, when randomly accessing, the msg3 message sent by the device to the base station carries a priority indication (for indicating the priority of the device), and then the base station can obtain the number M of successfully accessed devices corresponding to each priority in the current access time slot according to the priority indications,h、Ms,m、Ms,lWherein M iss,hNumber of high priority devices indicating successful access in the current access slot, Ms,mMedium priority indicating successful access in current access slotNumber of stages, Ms,lNumber of low priority devices, M, indicating successful access in the current access slots=Ms,h+Ms,m+Ms,lRepresenting the total number of successfully accessed devices in the current access slot. When the random access is carried out, the device selects the preamble with equal probability for access, so the probability of successful access is the same. Thus, according to one embodiment of the present invention, the total number of devices M initiating random access in the current access slot is calculated according to the following formulaiIn (2), the number M of devices corresponding to each priorityh、Mm、Ml:
Mh=Mi*(Ms,h/Ms) (2)
Mm=Mi*(Ms,m/Ms) (3)
Ml=Mi*(Ms,l/Ms) (4)
Step S113, load M of each priority device (or device load corresponding to each priority) of the current access time slot is calculatedi,h、Mi,m、Mi,lWhere i denotes the current access slot, Mi,hRepresenting the load of a high priority device of the current access slot, Mi,mIndicating the load of the priority device in the current access slot, Mi,lRepresenting the load of the low priority device of the current access slot.
The load of each priority device is the sum of the number of the two parts of devices which are allowed to access (i.e. initiate random access) and forbidden to access corresponding to the priority. According to an embodiment of the present invention, the probability of access barring α may be based on the current access slotiAnd the forbidden access priority indication P to calculate the load of each priority device of the current access slot (it should be understood that the initial probability of forbidden access can be set using the prior art, such as the ACB mechanism). As shown in table 1.
TABLE 1
P=HP | P=MP | P=LP | |
Mi,h | Mh/αi | Mh | Mh |
Mi,m | 0 | Mm/αi | Mm |
Mi,l | 0 | 0 | Ml/αi |
Wherein, P ═ HPIndicating that the barring priority of the current access slot is high, i.e. only high priority devices are allowed to access with the barring probability alpha of the current access slotiAccessing, and prohibiting access by the medium-priority equipment and the low-priority equipment; m is P ═ MPThe forbidden access priority of the current access time slot is medium, that is, the high priority equipment is allowed to directly access, the medium priority equipment is allowed to access with the forbidden access probability alphaiAccessing, and forbidding access by low-priority equipment; p ═ LPThe forbidden access priority of the current access time slot is low, namely, the high-priority device and the medium-priority device are allowed to directly access, and the low-priority device is allowed to access with the forbidden access probability alphaiAnd (6) accessing. Therefore, as shown in table 1, if the prohibited access priority of the current access slot indicates P ═ HPThen load M of the high priority device of the current access time sloti,hIs Mh/αiAnd the load M of the medium and low priority devicesi,m、Mi,lIs 0; if the access prohibition priority indication P is MPThen load M of the high priority device of the current access time sloti,hIs Mh(i.e. the number of high priority devices initiating random access at the current access slot), the load M of medium priority devicesi,mIs Mm/αiAnd the load M of the low priority devicei,lIs 0; if the access prohibition priority indication P is equal to LPThen load M of the high priority device of the current access time sloti,hIs MhLoad M of medium priority devicesi,mIs MmLoad M of low priority devicesi,lIs Ml/α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 corresponding to the 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.
Generally, when the network reaches a steady state, the load status of the adjacent time slot does not change much, and according to an embodiment of the present invention, the load of each priority device of the current access time slot can be used as the load of each priority device of the next access time slot.
And S12, the base station obtains the access prohibition priority and the access prohibition probability of the next access time slot according to the estimated load of each priority device of the next access time slot, and broadcasts access control parameters including the access prohibition priority and the access prohibition probability. It should be understood that the access control parameters also typically include a barred access time.
As described above, conventional ACB mechanisms broadcast a fixed ACB factor and a barring access time to devices by a base station. However, a fixed ACB factor reduces control efficiency as access load varies. The inventor finds that the control efficiency can be effectively improved by dynamically adjusting the access control parameters according to the load change. Because different devices have different requirements on time delay, in order to guarantee the access time delay of devices with different priorities and guarantee that devices sensitive to time delay can be accessed preferentially, an access prohibition priority indication P can be added in an access control parameter, wherein the access prohibition priority indication P is used for indicating the access prohibition priority, that is, the access prohibition probability is for which device corresponds to which priority, and a device with a higher priority than the access prohibition priority can be accessed directly while a device with a lower priority than the access prohibition priority prohibits access.
Furthermore, for the barring probability, throughput is maximized and system efficiency is maximized when the access load is close to the number R of available preambles, so the barring probability can be dynamically adjusted according to the load to make the number of devices that get access opportunity equal to the number of available preambles.
Referring to fig. 3, according to an embodiment of the present invention, step S12 includes the following sub-steps:
step S121, load of the estimated next access time slot high-priority equipment is comparedAnd the number of available preambles, R, ifGreater than or equal to the number of available preambles, setting the prohibited access priority indication of the next access slot P-HP(i.e., indicating a high priority of barring access) and calculating the probability of barring access α according to equation (5)i+1(i +1 denotes the next access slot, α)i+1Probability of access barring for next access slot), broadcast includes P and αi+1Access control parameters of (2); otherwise, step S122 is executed.
Wherein the barring priority indication P ═ HPIndicating that only high priority devices are allowed with probability ai+1And accessing, and prohibiting accessing by the medium-priority equipment and the low-priority equipment.
Step S122, load of the next access time slot high-priority equipment is comparedLoad with medium priority devicesThe sum of this and the number of available preambles, R, ifAndif the sum is greater than or equal to the number R of available preambles, setting the access barring priority indication P-M of the next access slotP(i.e., indicating a medium barring priority), and calculating the barring probability a for the next access slot according to equation (6)i+1Broadcast includes P and alphai+1Access control parameters of (2); otherwise, step S123 is executed.
Wherein the barring priority indication P ═ MPIndicating that high priority devices can access directly, and medium priority devices with probability alphai+1Access is prohibited by low priority devices.
Step S123. compare the estimated load of all priority devices of the next access slot (i.e. the load of all priority devices of the next access slot is compared) In-line with the aboveAnd 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 slotP(i.e. indicating that the barred access priority is low) and calculating the barred access probability a for the next access slot according to equation (7)i+1Broadcast includes P and alphai+1Access control parameters of (2); otherwise, step S124 is performed.
Wherein the barring priority indication P ═ LPMeans that the high priority device and the medium priority device can be accessed directly, and the low priority device is accessed with a probability alphai+1And (6) accessing.
Step s124, the estimated load sum of all priority devices of the next access slot is less than the number R of available preambles, so that each priority device can directly access, and the prohibited access priority indication P ═ L of the next access slot is setP(i.e. indicating that the barred access priority is low) and setting the probability of barred access alpha for the next access sloti+1Broadcast includes P and α as 1i+1Access control parameters of.
The algorithm in table 2 shows the whole flow of acquiring the barring probability and the 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 self priority, and performing access control according to the recently received access control parameters and the self priority.
The following three parameters are set at each device: maximum tolerated delay T for high priority deviceshMaximum tolerated delay T for medium priority devicesmAnd maximum tolerated delay T for low priority devicesl. The device priority may be one of the three levels high, medium, and low. 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 requirement on real-time performance, for example, the device with real-time performance index lower than a predetermined low threshold) is set as a low-priority device, the device with low delay tolerance (for example, the device with real-time performance index higher than a predetermined high threshold) is set as a high-priority device, and the device with general delay tolerance (for example, the device with real-time performance index between the predetermined low threshold and the high threshold) is set as a medium-priority device.
In summary, to avoid starvation of low-priority devices or medium-priority devices, the current access control delay of a device is calculated and compared with the delay tolerance of the device to determine whether a condition for updating the priority is met, and if yes, the priority is dynamically updated; then, the access control (including whether to access and how to access) is carried out according to the self priority and the recently received access control parameters. According to an embodiment of the present invention and referring to fig. 4, step S13 includes the following sub-steps:
step S131. receiving, by the device, access control parameters broadcast by the base station, including a probability of forbidden access (e.g. P), a forbidden access priority indication (e.g. alpha)i+1) And forbidden access times (e.g. T)barring)。
As described above, the barring probability and barring priority indication are dynamically adjusted with network load conditions. Generally, 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; when the load is low, the access barring probability is correspondingly increased, thereby improving the channel utilization (see steps S11-S12).
Step S132, determining self priority by the equipment. According to one embodiment of the present invention, step S132 includes the following sub-steps:
step S1321, calculating the current access control delay T by the equipmentdelayThe access control delay corresponds to the access latency of the device.
In particular, the access control delay TdelayIs 0; if the device was previously barred from access, TdelayAlso account for the forbidden access time TbarringEtc.; if the device has allowed access but failed, TdelayThe back-off time T is also taken into accountback_offAnd 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 equipmentdelayIs equal to T-TdelayThe delay tolerance T represents the maximum access delay allowed by the device, and different devices have different delay tolerances. If Δ T ≦ ThIf the current priority of the equipment is not high, the equipment updates the priority of the equipment to be high; if T ish<ΔT≤TmIf the current priority of the equipment is not in the middle, the equipment updates the priority of the equipment to be in the middle; if T ism<ΔT≤TlAnd if the current priority of the equipment is not low, the equipment updates the priority of the equipment to be low.
And S133, comparing the self priority with the access prohibition priority indicated by the recently received access prohibition priority by the equipment, and executing corresponding control operation according to the comparison result.
Specifically, the following three cases are classified:
if the self priority is higher than the priority of forbidding access, directly accessing;
if the self priority is lower than the access prohibition priority, access is prohibited, and the access is prohibited within the back-off time Tbarring(i.e., access time is prohibited), the procedure returns to step S132 to recalculate TdelayAnd priority, and step S133 is performed.
If the self priority is equal to the access prohibition priority, the equipment generates a random number q between 0 and 1, and if the q is less than the recently received access prohibition probability, the equipment performs access; otherwise at the back-off time TbarringThereafter, the process returns to step S132 to recalculate TdelayAnd priority, and performs step S133;
wherein, after the device initiates access, it establishes with the base station according to the above-mentioned random access processConnecting, if access fails, according to the back-off time T in msg2back_offAfter the back-off, go back to step S132 to recalculate TdelayAnd priority, and step S133 is performed.
The embodiment can effectively relieve the problem of network congestion and ensure the delay requirement of the high-priority equipment. In addition, the priority of the equipment can be adjusted according to the access control delay, and the delay requirement of the 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 the priority devices of the next access slot may be estimated according to the load of the priority devices of 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 the priority devices of the previous access slots may refer to the calculation method of the load of the priority devices of the current access slot, see steps S111-S113 specifically), for example, an average value or a weighted average value of the loads of the priority devices of the previous access slots is used as the load of the priority device of the next access slot. According to an embodiment of the present invention, a trend prediction method may also be adopted to estimate the load of each priority device in the next time slot. Taking a 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 denotes the next access slot,an estimate representing the load of the next access slot high priority device; a ═ 2m'i-m”i,m'iIs Mi-n+1,hTo Mi,hAverage value of (wherein, M)i,hRepresenting the load of the i-th access slot high priority device, Mi-n+1,hRepresenting the load of the high-priority equipment of the i-n +1 th access time slot, wherein n is the length of the mobile window and is more than 1 and less than or equal to i); m'iIs m'i-n+1To m'iAverage value of (a).
A similar approach can be used to estimate the load of priority devices and low priority devices in the next time slot.
In the above embodiment, the priority of the device is divided into three levels of high, medium, and low. Those skilled in the art will appreciate that the priority of the devices may also be divided into two levels, four levels, five levels, and so on.
It should be noted that some exemplary methods are depicted as flowcharts. Although a flowchart may describe the operations as being performed serially, it can be appreciated that many of the operations can be performed in parallel, concurrently, or with synchronization. In addition, the order of the operations may be rearranged. A process may terminate when an operation is completed, but may have additional steps not included in the figure or embodiment.
The above-described methods may be implemented by hardware, software, firmware, middleware, pseudocode, hardware description languages, or any combination thereof. When implemented in software, firmware, middleware, or pseudo code, the program code or code segments to perform the tasks may be stored in a computer readable medium such as a storage medium, and a processor may perform the tasks.
It should be appreciated that the software-implemented exemplary embodiment is 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 drive) 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.
Although the present invention has been described by way of preferred embodiments, the present invention is not limited to the embodiments described herein, and various changes and modifications may be made without departing from the scope of the present invention.
Claims (11)
1. A random access congestion control method, comprising:
step 1), estimating the load of each priority device of the next access time slot by a base station;
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 load of each priority device of the next access time slot;
step 3) broadcasting the access prohibition priority and the access prohibition probability of the next access time slot by the base station; wherein the barring priority is used for the device to determine whether to access, access with a barring probability, or barring access.
2. The method of claim 1, wherein the priorities are 1-N from high to low, respectively, N being an integer greater than 1, and step 2) comprises:
if the sum of the loads of the priority devices of the next access time slot is less than the number of the available lead codes, the base station sets the access prohibition priority of the next access time slot to be N, and sets the access prohibition probability of the next access time slot to be 1;
otherwise find out to satisfyN, the base station sets the access barring priority of the next access slot to n +1 and sets the access barring probability of the next access slot to nWhere R represents the number of available preambles, i +1 represents the next access slot,representing the load of the device with the next access slot priority k,and N is more than or equal to 0 and less than or equal to N-1.
3. The method of claim 1, wherein step 1) comprises:
and estimating the load of each priority device of the next access time slot by the base station according to the load of each priority device of a plurality of access time slots before the next access time slot.
4. A method according to claim 3, wherein the priorities are from high to low 1-N, respectively, N being an integer greater than 1, and step 1) comprises estimating the load of each priority device of the next access slot according to:
where i +1 denotes the next access slot,representing the load of 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'iIs Mi-n+1,jTo Mi,jAverage value of (1), Mi,jRepresenting the load of the device with i-th access slot priority j, Mi-n+1,jRepresenting the load of the device with the i-n +1 th access time slot with the priority of j, 1 < n ≦ i, m "iIs m'i-n+1To m'iAverage value of (a).
5. The method of claim 3, wherein the method further comprises calculating, by the base station, for each of a plurality of access slots prior to a next access slot, a load of a priority device for 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 each priority device allowed to be accessed by the access time slot according to the proportion of each priority device successfully accessed by the access time slot in all the devices 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 allowed to be accessed by the access time slot.
6. The method of claim 5, wherein calculating the load of each priority device of the access slot according to the barring priority and the barring probability of the access slot and the number of each priority device allowed to access the access slot comprises:
for the equipment with the priority higher than the access prohibition priority of the access time slot, the load is equal to the number of corresponding priority equipment which is allowed to be accessed by the access time slot;
for the equipment with the priority equal to the access prohibition priority of the access time slot, the load is equal to the ratio of the number of corresponding priority equipment which is allowed to be accessed by the access time slot to the access prohibition probability of the access time slot;
for devices with a priority lower than the access-prohibited priority of the access slot, the load is equal to the number of corresponding priority devices allowed to access the access slot immediately preceding the access slot.
7. The method of any of claims 1-6, further comprising:
step 4), the equipment determines self priority according to the access waiting time and the delay tolerance thereof;
and step 5) determining whether to carry out access, carry out access with the access prohibition probability received from the base station or forbid access by the equipment according to the access prohibition priority received from the base station and the self priority.
8. The method of claim 7, wherein step 5) comprises:
if the self priority is higher than the access prohibition priority, the equipment determines to access;
if the self priority is equal to the access prohibition priority, the equipment generates a random number between 0 and 1, if the generated random number is smaller than the access prohibition probability, the equipment determines to access, and if the generated random number is larger than or equal to the access prohibition probability, the equipment re-executes the steps 4) -5 after retreating for a first preset time period);
if the self priority is lower than the access prohibition priority, the equipment re-executes the steps 4) -5) after retreating for the first preset time period.
9. The method of claim 7, further comprising:
if the access fails, the device re-executes the steps 4) -5) after retreating for a second preset time period.
10. A random access congestion control method, comprising:
step a), equipment determines self priority according to access waiting time and delay tolerance thereof;
step b) determining whether to carry out access, carry out access with the access prohibition probability received from the base station or forbid access by the equipment according to the access prohibition priority received from the base station and the self priority.
11. An electronic device, comprising:
a processor; and
a memory storing instructions executable by the processor, the instructions when executed by the processor causing the electronic device to implement the method of any of claims 1-10.
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 true CN110691373A (en) | 2020-01-14 |
CN110691373B 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) |
Cited By (2)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111526530A (en) * | 2020-05-15 | 2020-08-11 | 广东技术师范大学 | 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 (6)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101159974A (en) * | 2007-11-16 | 2008-04-09 | 中兴通讯股份有限公司 | Access grade control method |
US20120063305A1 (en) * | 2010-09-10 | 2012-03-15 | Industrial Technology Research Institute | 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 |
US20180139652A1 (en) * | 2016-11-16 | 2018-05-17 | Institute For Information Industry | 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 (7)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101159974A (en) * | 2007-11-16 | 2008-04-09 | 中兴通讯股份有限公司 | Access grade control method |
US20120063305A1 (en) * | 2010-09-10 | 2012-03-15 | Industrial Technology Research Institute | Prioritized random access 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 |
US20180139652A1 (en) * | 2016-11-16 | 2018-05-17 | Institute For Information Industry | Base station and access class barring method thereof and communication terminal |
CN106937393A (en) * | 2017-04-25 | 2017-07-07 | 电子科技大学 | A kind of scheduling method for wireless resource based on priority |
Cited By (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111526530A (en) * | 2020-05-15 | 2020-08-11 | 广东技术师范大学 | Optimization method of random access congestion control algorithm for NB-IoT |
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 |
Also Published As
Publication number | Publication date |
---|---|
CN110691373B (en) | 2023-06-06 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US20210242970A1 (en) | Terminal device, network node and method for random access in coverage enhancement operation | |
JP5688148B2 (en) | Mechanism for accessing wide channels in overlapping networks | |
CN111526530B (en) | Optimization method of random access congestion control algorithm for NB-IoT | |
US8027327B2 (en) | Distributed scheduling in wireless networks with service differentiation | |
JP2013131834A (en) | Radio communication device and radio communication method | |
CN109699089B (en) | Channel access method and device | |
CN110691373B (en) | Random access congestion control method and electronic equipment | |
CN113940135A (en) | Sending reports of random access procedures | |
US7839884B2 (en) | Method and device for resolving collision in a wireless telecommunications network | |
CN113810883A (en) | Internet of things large-scale random access control method | |
JP2001237839A (en) | Wireless packet priority control method | |
US11979205B1 (en) | Method for configuring and updating random access resources in multi-antenna MIMO environment | |
CN111542124B (en) | Method and device for starting RTS/CTS mechanism | |
KR102448310B1 (en) | Method and apparatus for determining contention window size in communication system | |
KR20210106959A (en) | Base station and terminal, and control method thereof | |
KR101816085B1 (en) | Method for controlling contention window with low latency in unlicenced band and device for performing the method | |
US20210359820A1 (en) | Methods and devices for sending and receiving messages, and storage medium | |
CN107086900B (en) | M2M communication access control optimization method for handling LTE network emergency | |
KR102242637B1 (en) | Random access systems, terminal devices applied to the same and control method thereof | |
CN115119261B (en) | Network congestion control method, electronic device and computer program product | |
US9462608B2 (en) | Method and device for regulating transmission in a telecommunication network | |
KR102223146B1 (en) | Methods and apparatuses for random access using random power backoff | |
Misic et al. | Explicit power ramping during random access in LTE/LTE-A | |
US20240121829A1 (en) | Methods and apparatuses for association between random access channel occasions | |
US10349402B2 (en) | Transmission control method intended for being implemented by a station in a telecommunications network |
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 |