CN110191487A - The stable group paging method based on flow dispersion of handling capacity can be achieved - Google Patents
The stable group paging method based on flow dispersion of handling capacity can be achieved Download PDFInfo
- Publication number
- CN110191487A CN110191487A CN201910473965.5A CN201910473965A CN110191487A CN 110191487 A CN110191487 A CN 110191487A CN 201910473965 A CN201910473965 A CN 201910473965A CN 110191487 A CN110191487 A CN 110191487A
- Authority
- CN
- China
- Prior art keywords
- devices
- random access
- preamble
- successful
- access time
- 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
- 239000006185 dispersion Substances 0.000 title claims abstract description 38
- 238000000034 method Methods 0.000 title claims abstract description 35
- 238000001514 detection method Methods 0.000 claims abstract description 17
- 230000005540 biological transmission Effects 0.000 claims description 38
- 230000008569 process Effects 0.000 claims description 3
- 238000004891 communication Methods 0.000 abstract description 5
- 238000004088 simulation Methods 0.000 description 12
- 230000007423 decrease Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 2
- 230000007774 longterm Effects 0.000 description 2
- 230000004044 response Effects 0.000 description 2
- 238000007796 conventional method Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
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/0215—Traffic management, e.g. flow control or congestion control based on user or device properties, e.g. MTC-capable devices
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/51—Allocation or scheduling criteria for wireless resources based on terminal or device properties
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W74/00—Wireless channel access
- H04W74/002—Transmission of channel access control information
- H04W74/006—Transmission of channel access control information in the downlink, i.e. towards the terminal
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a kind of stable group paging method based on flow dispersion of achievable handling capacity, the prior art is mainly solved the problems, such as in magnanimity MTC device while while accessing network is also easy to produce wireless access network congestion.Its implementation are as follows: 1) base station end is according to the parameter of network configuration, comprehensively consider physical downlink control channel resource number less than preamble detection successful device number, equal to preamble detection successful device number and greater than three kinds of situations of preamble detection successful device number after, acquire the optimal decentralized factor；2) base station end acquires the total group number of grouping according to the optimal decentralized factor, and sends paging message；3) MTC device being paged is grouped access according to the total group number of grouping.MTC device is evenly spread to different random access time slots by the optimal decentralized factor and executes random access procedure by the present invention, network congestion caused by avoiding bulk device while accessing, maximum stable throughput is realized, can be used for machine type communication MTC device Network with Random Multiple Access System.
Description
Technical Field
The invention belongs to the technical field of communication, and further relates to a group paging method which can be used for a device random access network of Machine Type Communication (MTC), so that the throughput is stabilized, and the number of accessible devices is increased.
Background
Machine Type Communication (MTC) communication is widely applied to smart power grids, industrial automation and electronic medical treatment. In the future, the number of MTC devices will further increase, and a large amount of MTC devices will simultaneously access a network, which may cause system overload and network congestion, and seriously affect system performance. The group paging method is an effective overload control scheme proposed by 3GPP, in which, after a base station sends a paging message, a group of MTC devices to be paged accesses at the next random access slot. The base station can determine when to page the MTC equipment according to the congestion condition of the core network and performs packet paging, so that the scheme can effectively relieve the congestion of the core network and the congestion of a radio access network. However, when the number of MTC devices in a paging group increases, the performance thereof may be significantly degraded.
Some existing researches on backoff-based group paging schemes can improve the performance of the group paging schemes, but the schemes only pay attention to short-term performance improvement, and the system throughput still drops rapidly with the passage of time, so that the long-term performance of the system is reduced. Therefore, it is very necessary to study throughput stability to improve the long-term performance of the system. The scholars propose a group paging scheme FI-TSFGP based on traffic dispersion, and the throughput stability under the condition of short paging interval is realized. However, in the scheme, only the situation that the average value of the number of devices successfully detecting the preamble code is smaller than the number of resources of the physical downlink control channel is considered, and there is a possibility that the average value of the number of devices successfully detecting the preamble code is larger than the number of resources of the physical downlink control channel in practice, so when the paging interval is longer and the number of devices is larger, the throughput of the scheme is still reduced, and the resource utilization rate is reduced.
Disclosure of Invention
The invention aims to overcome the defects of the prior art, provides a group paging method based on flow dispersion and capable of realizing stable throughput, comprehensively considers three conditions that the average value of the number of lead code detection success devices is more than, equal to or less than the number of physical downlink control channel resources, solves the optimal dispersion factor, improves the access success rate, reduces the access delay, realizes the maximum stable throughput and increases the number of user accesses.
The technical idea of the invention is to comprehensively consider the influence of the number of the physical downlink control channel resources, solve the optimal dispersion factor which can enable the system to reach a stable state and has the maximum throughput, group the MTC devices according to the optimal dispersion factor, and perform initial access in different random access time slots, thereby realizing the dispersion of the devices, relieving the congestion of a random access network and improving the network performance. The method comprises the following implementation steps:
(1) the base station end solves the optimal dispersion factor according to the parameters of the network configuration:
(1a) according to physical downlinkValue range M of control channel resource number determining dispersion factorsf∈[1,NACK]Wherein M issfFinger dispersion factor, NACKThe number of physical downlink control channel resources;
(1b) considering the preamble detection probability PjAnd the number of physical downlink control channel resources NACKThe successful device number average value of T random access time slots under different dispersion factor values is solved, wherein T is more than 300:
(1b1) initialization: let the random access time slot index i equal to 1, the device total number average of the 1 st random access time slot | | a1||1＝MsfWherein | · | purple light1Means taking a norm of 1, a1＝[a1[1]]，a1[1]The number of devices performing preamble transmission for the 1 st time;
(1b2) disregarding the preamble detection probability P in the ith random access slotjAnd the number of physical downlink control channel resources NACKWhen the preamble is successfully transmitted, all possible values of the number of devices areWherein,indicates the number of preamble transmission success devices performing the j-th preamble transmission,represents a maximum number of preamble transmissions; r represents the number of preambles, MiIndicates the total number of devices of the ith random access slot,denotes rounding up, where ai＝[ai[1]ai[2]… ai[j]… ai[n]]，ai[j]The number of devices performing the j-th preamble transmission;
(1b3) in the ith random access time slot, the random access control systemNumber of devices successfully transmitting lead codeConsidering the preamble detection probability PjThen, the number of devices successfully detected is calculatedWhereinIndicating the number of devices successfully detected for carrying out the j-th preamble transmission;
(1b4) in the ith random access time slot, the number of devices successfully transmitting any preamble codeFurther consider the number of physical downlink control channel resources NACKCalculating the actual successful device countWhereinIndicating the actual number of successful devices to perform the j-th preamble transmission;
(1b5) in the ith random access time slot, the actual successful equipment number is countedCalculating mathematical expectation to obtain the average value of the actual successful devices in the ith random access time slotWhereinMeans the actual successful device number average for the jth preamble transmission;
(1b6) in the ith random access time slot, solving the generation impactMean of number of devices per burstWhereinThe average value of the number of retransmission devices for the jth lead code transmission;
(1b7) judging the current random access time slot index i: if i is less than T, the average value of the total number of the devices of the (i + 1) th random access time slot is solvedReturning to step (1b2) by making i equal to i + 1; otherwise, executing step (1 c); (ii) a
(1c) According to different MsfMean value of actual successful equipment numbers under value takingSelecting the mean value of the actual successful equipment number along with the variation trend of increasing the time slot numberTaking the value of the dispersion factor which is kept stable and maximal as the optimal dispersion factor
(2) The base station end according to the optimal dispersion factorAnd the total number N of the MTC devices in the cell, solving the total group number I of the groups, and sending a paging message, wherein the paging message comprises the total group number I of the groups;
(3) the method comprises the steps that the paged MTC equipment carries out grouping according to the grouping total group number I, the MTC equipment of different groups carries out random access processes in different random access time slots, if lead code collision occurs, the MTC equipment directly carries out lead code retransmission in the next random access time slot without backoff until access is successful or the maximum transmission times is reached.
Compared with the prior art, the invention has the following advantages:
according to the invention, the optimal dispersion factor is solved under the condition of comprehensively considering the influence of the number of the physical downlink control channel resources, and the MTC equipment is accessed in groups by using the optimal dispersion factor, so that network congestion caused by simultaneous access of a large number of MTC equipment is avoided, the access success rate and the resource utilization rate are improved, the throughput is stable, and the number of the accessible equipment of the random access network is effectively increased.
Drawings
FIG. 1 is a general flow chart of an implementation of the present invention;
FIG. 2 is a sub-flow diagram of the solution of the optimal dispersion factor in the present invention;
FIG. 3 is a timing diagram for solving for an optimal dispersion factor according to an embodiment of the present invention;
FIG. 4 is a simplified timing diagram for solving for an optimal dispersion factor according to an embodiment of the present invention;
FIG. 5 is a graph comparing access success rate simulations of the present invention with a prior art method;
FIG. 6 is a graph comparing the simulation of average access delay of the present invention with a prior method;
fig. 7 is a graph comparing throughput simulation of the present invention with a prior art method.
Detailed Description
The following detailed description of the embodiments and effects of the present invention will be described in conjunction with the accompanying drawings and specific examples so that those skilled in the art can better understand the present invention and can implement the present invention, but the examples are not intended to limit the present invention.
This exampleAssuming that there are N MTC devices in a cell, a base station sends a paging message to page all devices in the cell. Initial access equipment number dispersion factor M allocated for each random access time slotsfAnd (4) showing. The parameters of the network configuration are as follows: the number of available preamble codes is R, and the preamble code detection time is TRARThe random access response window length is WRARRandom access slot period of TRAMaximum number of transmission of preamble isThe number of the physical downlink control channel resources is NACK. In addition, the preamble detection probability is denoted as Pj＝1-e-jAnd j denotes the number of preamble transmissions.
Referring to fig. 1, the implementation steps of this example are as follows:
step 1, a base station end solves an optimal dispersion factor according to parameters of network configuration:
referring to fig. 2, the specific implementation of this step is as follows:
(1a) according to the number N of physical downlink control channel resourcesACKDetermining the value range M of the dispersion factorsf∈[1,NACK]；
(1b) Considering the preamble detection probability PjAnd the number of physical downlink control channel resources NACKThe successful device number average value of T random access time slots under different dispersion factor values is solved, wherein T is more than 300:
by TRAR＝2，WRARBy taking 5 as an example, the timing chart shown in fig. 3 is obtained, and it can be seen from fig. 3 that the state of the kth random access slot is completely the same as the state of the (k + 1) th random access slot, k is 1,3,5, and … …, and the random access slots with the same state are ignored, so that the simplified timing chart shown in fig. 4 can be obtained, wherein the device number average vector a of the ith random access slot is obtainediCan be expressed as:
in the formula, ai[j]The number of devices for carrying out j-th lead code transmission in the ith random access time slot is referred to;
successful device number mean vector of ith random access time slotExpressed as:
in the formula,means the average of the number of successful devices performing the j-th preamble transmission in the ith random access slot; since the colliding device will retransmit in the next random access slotWhereinThe device number average value of the collision representing the j-th preamble transmission in the ith random access time slot can obtain the device number average value vector a of the (i + 1) th random access time sloti+1Comprises the following steps:
therefore, the average of the successful device numbers of the T random access slots can be obtained by recursion.
In summary, the specific implementation of this step is as follows:
(1b1) initialization:
let the random access slot index i equal to 1, | | a1||1＝MsfWherein | · | purple light1Representing taking a 1 norm;
(1b2) disregarding the preamble detection probability P in the ith random access slotjAnd the number of physical downlink control channel resources NACKWhen the preamble is successfully transmitted, all possible values of the number of devices areWherein,indicates the number of preamble transmission success devices performing the j-th preamble transmission,represents a maximum number of preamble transmissions; miIndicates the total number of devices of the ith random access slot,represents rounding up;
all possible values of the number of devices with successful preamble transmissionThe probability is obtained by the following formula:
wherein,refers to M under the condition of R available preamblesiOnly one of the devices hasProbability of individual devices selecting a unique preamble;means thatAn apparatus selectsThe probability of each different preamble can be obtained by:
in the formula,means thatThe probability that a unique preamble is not selected by an individual device is determined by:
(1b3) in the ith random access time slot, the number of devices successfully transmitting any preamble codeConsidering the preamble detection probability Pj＝1-e-jThe number of successful devices for detecting the jth preamble transmission is obtained as follows:
obtaining the total number of successful devicesComprises the following steps:
whereinIndicating the number of devices successfully detected for carrying out the j-th preamble transmission;
(1b4) in the ith random access time slot, the number of devices successfully transmitting any preamble codeFurther consider the number of physical downlink control channel resources NACKAccording to the total number of successful devices detectedAnd the number of physical downlink control channel resources NACKThe relationship between determines the total actual successful device countWhereinRepresents the actual number of successful devices making the jth preamble transmission:
if it isThe total number of successfully detected devicesNumber N of physical downlink control channel resources not exceededACKAll successfully detected devices can successfully access the network, so that the total actual successful device number isThe actual number of successful devices to perform the jth preamble transmission is
If it isThe total number of successfully detected devicesExceeding the number of physical downlink control channel resources NACKOf only NACKEach device can successfully access the network, so the total actual successful device number isThe actual number of successful devices to perform the jth preamble transmission is
(1b5) In the ith random access time slot, forTo find out the mathematical expectation, the average of the actual successful devices performing the j-th preamble transmission may be:
for total actual successful equipment numberCalculating the mathematic expectation to obtain the average value of the total actual successful equipment numbersComprises the following steps:
(1b6) in the ith random access time slot, solving the average value of the total number of the devices with conflictWhereinMeans of the number of devices representing collisions for the jth preamble transmission in the ith random access slot;
(1b7) judging the current random access time slot index i:
if i is less than T, the average value of the total equipment number of the (i + 1) th random access time slot is solvedReturning to step (1b2) by making i equal to i + 1;
otherwise, executing step (1 c);
(1c) according to different MsfMean value of actual successful equipment numbers under value takingWith the variation trend of increasing time slot number, the mean value of the actual successful equipment number is selectedThe dispersion factor that can be stabilized at the maximum value is taken as the optimum dispersion factor
And 2, paging the MTC equipment in the cell by the base station.
(2a) In order to realize the packet access of the MTC equipment in the cell, the base station end needs to be based on the optimal dispersion factorAnd the total number N of the MTC devices in the cell solves the group number I:
(2b) the base station end sends a paging message to inform the MTC equipment in the cell to upload data to the base station, wherein the paging message comprises a packet number I.
And step 3, the paged MTC equipment performs packet access according to the packet number I.
(3a) After the MTC equipment receives the paging message, selecting a random number q belonging to [1, I ] as a group number distributed by the MTC equipment;
(3b) the MTC equipment with the group number q carries out a random access process at the qth random access time slot, namely the MTC equipment randomly selects a lead code to send to the base station, the base station allocates uplink resources to the MTC equipment after successfully detecting the lead code, and if the lead code conflicts, the MTC equipment directly carries out lead code retransmission at the next random access time slot without back-off until the access is successful or the maximum transmission times is reached.
The effects of the present invention can be further illustrated by the following simulations:
1. simulation conditions
The simulation was implemented using MATLAB R2016b software with parameters set to: the period of the random access time slot is 5ms, the length of the random access response window is 5ms, the number of available preamble codes is 54, the detection time of the preamble codes is 2ms, the maximum transmission times of the preamble codes is 16 times, and the number of resources of the physical downlink control channel is 15.
2. Emulated content and results
Simulation 1. under the simulation conditions, the access success rate of the method of the present invention and the existing FI-TSFGP method is simulated, and the result is shown in FIG. 5.
As can be seen from fig. 5, as the total number of MTC devices increases, the access success rate of the existing FI-TSFGP method gradually decreases, but the access success rate of the method provided by the present invention is stabilized at 99%, which effectively increases the number of accessible devices.
Simulation 2. under the simulation conditions, the average access delay of the method of the present invention and the existing FI-TSFGP method is simulated, and the result is shown in fig. 6.
As can be seen from fig. 6, with the increase of the total number of MTC devices, the average access delay of the existing FI-TSFGP method gradually increases, but the average access delay of the method provided by the present invention is stabilized at 38ms, which effectively reduces the average access delay of the random access network.
Simulation 3. under the simulation conditions, the throughput of the FI-TSFGP method of the present invention and the conventional method is simulated, and the result is shown in fig. 7.
As can be seen from fig. 7, as the total number of MTC devices increases, the throughput of the existing FI-TSFGP method gradually decreases, and when the total number of the devices is 50000, the throughput of the existing FI-TSFGP method decreases to 6.7/timeslot, whereas the throughput of the method provided by the present invention is always stabilized at 13.9/timeslot, and the maximum stable throughput is achieved.
The above is only one embodiment of the present invention, which is exemplary and not to be construed as limiting the present invention. All equivalent structures or equivalent flow transformations made by using the contents of the specification and the drawings of the present invention are included in the scope of protection of the present invention.
Claims (7)
1. A group paging method based on traffic dispersion, which can realize stable throughput, is characterized by comprising the following steps:
(1) the base station end solves the optimal dispersion factor according to the parameters of the network configuration:
(1a) determining the value range M of the dispersion factor according to the number of the physical downlink control channel resourcessf∈[1,NACK]Wherein M issfFinger dispersion factor, NACKThe number of physical downlink control channel resources;
(1b) considering the preamble detection probability PjAnd physical downlink controlNumber of channel resources NACKThe successful device number average value of T random access time slots under different dispersion factor values is solved, wherein T is more than 300:
(1b1) initialization: let the random access time slot index i equal to 1, the device total number average of the 1 st random access time slot | | a1||1＝MsfWherein | · | purple light1Means taking a norm of 1, a1＝[a1[1]]，a1[1]The number of devices performing preamble transmission for the 1 st time;
(1b2) disregarding the preamble detection probability P in the ith random access slotjAnd the number of physical downlink control channel resources NACKWhen the preamble is successfully transmitted, all possible values of the number of devices areWherein, indicates the number of preamble transmission successful devices that perform the j-th preamble transmission, j is 1,2, …, n, represents a maximum number of preamble transmissions; r represents the number of preambles, MiIndicates the total number of devices of the ith random access slot, denotes rounding up, where ai＝[ai[1]ai[2]… ai[j]… ai[n]]，ai[j]Finger-feedingThe number of devices transmitting the lead code for the jth time in the row;
(1b3) in the ith random access time slot, the number of devices successfully transmitting any preamble codeConsidering the preamble detection probability PjThen, the number of devices successfully detected is calculatedWherein Indicating the number of devices successfully detected for carrying out the j-th preamble transmission;
(1b4) in the ith random access time slot, the number of devices successfully transmitting any preamble codeFurther consider the number of physical downlink control channel resources NACKCalculating the actual successful device countWherein Indicating the actual number of successful devices to perform the j-th preamble transmission;
(1b5) in the ith random access time slot, the actual successful equipment number is countedCalculating the mathematic expectation to obtain the actual successful equipment number average in the ith random access time slotValue ofWherein Means the actual successful device number average for the jth preamble transmission;
(1b6) in the ith random access time slot, solving the average value of the number of the devices with collisionWherein The average value of the number of retransmission devices for the jth lead code transmission;
(1b7) judging the current random access time slot index i: if i is less than T, the average value of the total number of the devices of the (i + 1) th random access time slot is solvedReturning to step (1b2) by making i equal to i + 1; otherwise, executing step (1 c);
(1c) according to different MsfMean value of actual successful equipment numbers under value takingSelecting the mean value of the actual successful equipment number along with the variation trend of increasing the time slot numberTaking the value of the dispersion factor which is kept stable and maximal as the optimal dispersion factor
(2) The base station end according to the optimal dispersion factorAnd the total number N of the MTC devices in the cell, solving the total group number I of the groups, and sending a paging message, wherein the paging message comprises the total group number I of the groups;
(3) the method comprises the steps that the paged MTC equipment carries out grouping according to the grouping total group number I, the MTC equipment of different groups carries out random access processes in different random access time slots, if lead code collision occurs, the MTC equipment directly carries out lead code retransmission in the next random access time slot without backoff until access is successful or the maximum transmission times is reached.
2. The method of claim 1, wherein in step (1b2), all possible values of the number of successful devices for preamble transmission are selectedThe probability is obtained by the following formula:
wherein,refers to M under the condition of R available preamblesiOnly one of the devices hasA probability that a unique preamble is selected by an individual device;finger-shapedAn apparatus selectsThe probability of each different preamble can be obtained by:
in the formula,finger-shapedThe probability that a unique preamble is not selected by an individual device is determined by:
3. the method of claim 1, wherein in step (1b3), the number of successful devices is detectedThe following equation is used to obtain:
wherein, PjDenotes the preamble detection probability, Pj＝1-e-jAnd j denotes the current preamble transmission number.
4. The method of claim 1, wherein the actual number of successful devices in step (1b4)Is based on the number of successful devices detectedAnd the number of physical downlink control channel resources NACKThe relationship between them determines:
if it isThe actual number of successful devices is
If it isThe actual number of successful devices is
5. The method of claim 1, wherein in step (1b5), the mean of the number of actual successful devicesThe following equation is used to obtain:
wherein,refers to M under the condition of R available preamblesiOnly one of the devices hasProbability of individual devices selecting a unique preamble.
6. According to claim 1The method is characterized in that, in the step (2), the base station end is based on the optimal dispersion factor Msf *And the total number N of the MTC equipment in the cell is used for solving the total group number I of the groups, namely the total number N of the equipment in the cell is divided by the optimal dispersion factor Msf *。
7. The method of claim 1, wherein the MTC devices paged in step (3) are grouped according to the total group number of the groups, and each MTC device selects a random number less than or equal to the total group number I of the groups as its assigned group number.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910473965.5A CN110191487B (en) | 2019-06-02 | 2019-06-02 | Group paging method based on flow dispersion and capable of realizing stable throughput |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910473965.5A CN110191487B (en) | 2019-06-02 | 2019-06-02 | Group paging method based on flow dispersion and capable of realizing stable throughput |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110191487A true CN110191487A (en) | 2019-08-30 |
| CN110191487B CN110191487B (en) | 2021-09-28 |
Family
ID=67719643
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910473965.5A Active CN110191487B (en) | 2019-06-02 | 2019-06-02 | Group paging method based on flow dispersion and capable of realizing stable throughput |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110191487B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103796175A (en) * | 2012-10-31 | 2014-05-14 | 中兴通讯股份有限公司 | Method for sending cluster paging in LTE system and corresponding device, and method for receiving cluster paging in LTE system and corresponding device |
| CN106604407A (en) * | 2015-10-15 | 2017-04-26 | 上海贝尔股份有限公司 | Access control method and apparatus for large number of MTC devices |
-
2019
- 2019-06-02 CN CN201910473965.5A patent/CN110191487B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103796175A (en) * | 2012-10-31 | 2014-05-14 | 中兴通讯股份有限公司 | Method for sending cluster paging in LTE system and corresponding device, and method for receiving cluster paging in LTE system and corresponding device |
| CN106604407A (en) * | 2015-10-15 | 2017-04-26 | 上海贝尔股份有限公司 | Access control method and apparatus for large number of MTC devices |
Non-Patent Citations (3)
| Title |
|---|
| CHANGBAE YOON: "Distributed queuing with preamble grouping for massive IoT devices in LTE random access", 《2016 INTERNATIONAL CONFERENCE ON INFORMATION AND COMMUNICATION TECHNOLOGY CONVERGENCE (ICTC)》 * |
| 刘冬雪等: "一种提高大规模 M2M 通信接入成功率的分层接入方法", 《通信技术》 * |
| 徐露: "面向海量连接的机器类终端接入技术研究", 《中国优秀硕士学位论文全文数据库》 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110191487B (en) | 2021-09-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3857801B1 (en) | Method and apparatus for transmitting uplink signal | |
| CN108882301B (en) | Non-orthogonal random access method based on optimal power backoff in large-scale M2M network | |
| Wei et al. | Modeling and analysis of random access channels with bursty arrivals in OFDMA wireless networks | |
| EP3335512B1 (en) | Contention window adaptation in multi-carrier listen-before-talk protocols | |
| EP3038424B1 (en) | Improved allocation of uplink resources in orthogonal frequency-division multiple access wireless networks | |
| KR101527974B1 (en) | Method for controlling of uplink access in wireless communication system | |
| EP3393167B1 (en) | Resource allocation method and device, and base station | |
| Bello et al. | Application of Q-learning for RACH access to support M2M traffic over a cellular network | |
| CN107006032A (en) | A kind of transmission method of information and base station and user equipment | |
| Harwahyu et al. | Investigating the performance of the random access channel in NB-IoT | |
| EP3964005A1 (en) | Resource indication in random access | |
| CN110972105A (en) | Communication method, communication device and user equipment | |
| Zhang et al. | A hybrid grant NOMA random access for massive MTC service | |
| Zhao et al. | QoS-based dynamic allocation and adaptive ACB mechanism for RAN overload avoidance in MTC | |
| CN107743315B (en) | Method and apparatus for contention-based transmission | |
| CN110191487B (en) | Group paging method based on flow dispersion and capable of realizing stable throughput | |
| CN110113720B (en) | ACB mechanism-based group paging congestion control method | |
| CN109963272B (en) | Random access method for differentiated MTC network | |
| CN108667578B (en) | Communication method and communication device | |
| WO2020126022A1 (en) | Method and apparatus for providing non-scheduled network access | |
| CN102076105B (en) | Polling method for point-to-multipoint communication system | |
| CN111970703A (en) | Method for optimizing uplink communication resources in NB-IoT (NB-IoT) | |
| Althumali et al. | Dynamic tree-splitting algorithm for massive random access of M2M communications in IoT networks | |
| KR101888267B1 (en) | Scheduling method and apparatus considering hardware noise | |
| CN106304391B (en) | PRACH access control method, access method and device |
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 |