CN110191487B - Group paging method based on flow dispersion and capable of realizing stable throughput - Google Patents

Group paging method based on flow dispersion and capable of realizing stable throughput Download PDF

Info

Publication number
CN110191487B
CN110191487B CN201910473965.5A CN201910473965A CN110191487B CN 110191487 B CN110191487 B CN 110191487B CN 201910473965 A CN201910473965 A CN 201910473965A CN 110191487 B CN110191487 B CN 110191487B
Authority
CN
China
Prior art keywords
devices
random access
preamble
successful
time slot
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201910473965.5A
Other languages
Chinese (zh)
Other versions
CN110191487A (en
Inventor
严蕾
张锐
李勇朝
阮玉晗
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Xidian University
Original Assignee
Xidian University
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Xidian University filed Critical Xidian University
Priority to CN201910473965.5A priority Critical patent/CN110191487B/en
Publication of CN110191487A publication Critical patent/CN110191487A/en
Application granted granted Critical
Publication of CN110191487B publication Critical patent/CN110191487B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

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/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 group paging method based on flow dispersion, which can realize stable throughput and mainly solves the problem that the prior art is easy to generate wireless access network congestion when massive MTC (machine type communication) equipment is simultaneously accessed into a network. The implementation scheme is as follows: 1) the base station side obtains an optimal dispersion factor according to parameters configured by a network after comprehensively considering three conditions that the number of the physical downlink control channel resources is less than the number of devices successfully detecting the lead code, equal to the number of the devices successfully detecting the lead code and more than the number of the devices successfully detecting the lead code; 2) the base station end obtains the total group number of the groups according to the optimal dispersion factor and sends a paging message; 3) and the paged MTC equipment performs packet access according to the total packet group number. The MTC equipment is uniformly dispersed to different random access time slots by the optimal dispersion factor to execute the random access process, network congestion caused by simultaneous access of mass equipment is avoided, the maximum stable throughput is realized, and the method can be used for the random access network of the MTC equipment for machine type communication.

Description

Group paging method based on flow dispersion and capable of realizing stable throughput
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) 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 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 are
Figure GDA0003112498210000021
Wherein the content of the first and second substances,
Figure GDA0003112498210000022
Figure GDA0003112498210000023
indicates the number of preamble transmission successful devices that perform the j-th preamble transmission, j is 1,2, …, n,
Figure GDA0003112498210000024
Figure GDA0003112498210000025
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,
Figure GDA0003112498210000026
Figure GDA0003112498210000027
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 number of devices successfully transmitting any preamble code
Figure GDA0003112498210000028
Considering the preamble detection probability PjThen, the number of devices successfully detected is calculated
Figure GDA0003112498210000029
Wherein
Figure GDA00031124982100000210
Figure GDA00031124982100000211
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 code
Figure GDA00031124982100000212
Further consider the number of physical downlink control channel resources NACKCalculating the actual successful device count
Figure GDA00031124982100000213
Wherein
Figure GDA00031124982100000214
Figure GDA00031124982100000215
Indicating the actual number of successful devices to perform the j-th preamble transmission;
(1b5) in the ith random access time slot, the real timeNumber of devices actually successful
Figure GDA0003112498210000031
Calculating mathematical expectation to obtain the average value of the actual successful devices in the ith random access time slot
Figure GDA0003112498210000032
Wherein
Figure GDA0003112498210000033
Figure GDA0003112498210000034
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 collision
Figure GDA0003112498210000035
Wherein
Figure GDA0003112498210000036
Figure GDA0003112498210000037
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 solved
Figure GDA0003112498210000038
Returning 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 taking
Figure GDA0003112498210000039
Selecting the mean value of the actual successful equipment number along with the variation trend of increasing the time slot number
Figure GDA00031124982100000310
Taking the value of the dispersion factor which is kept stable and maximal as the optimal dispersion factor
Figure GDA00031124982100000311
(2) The base station end according to the optimal dispersion factor
Figure GDA00031124982100000312
And 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.
In this example, it is assumed that there are N MTC devices in a cell, and a base station sends a paging message to page all the 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 is
Figure GDA0003112498210000041
The 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，WRARAs an example, fig. 3 shows that the state of the kth random access slot is exactly the same as the state of the (k + 1) th random access slot, k is 1,3,5, and … …, and the timing chart shown in fig. 3 is obtained, and the states of the states are ignoredRandom access time slots, a simplified timing diagram as shown in fig. 4 can be obtained, in which the device number average vector a of the ith random access time slotiCan be expressed as:
Figure GDA0003112498210000042
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 slot
Figure GDA0003112498210000043
Expressed as:
Figure GDA0003112498210000051
in the formula (I), the compound is shown in the specification,
Figure GDA0003112498210000052
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 slot
Figure GDA0003112498210000053
Wherein
Figure GDA0003112498210000054
The 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:
Figure GDA0003112498210000055
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 are
Figure GDA0003112498210000056
Wherein the content of the first and second substances,
Figure GDA0003112498210000057
Figure GDA0003112498210000058
indicates the number of preamble transmission successful devices that perform the j-th preamble transmission, j is 1,2, …, n,
Figure GDA0003112498210000059
Figure GDA00031124982100000510
represents a maximum number of preamble transmissions; miIndicates the total number of devices of the ith random access slot,
Figure GDA00031124982100000511
Figure GDA00031124982100000512
represents rounding up;
all possible values of the number of devices with successful preamble transmission
Figure GDA00031124982100000513
The probability is obtained by the following formula:
Figure GDA00031124982100000514
wherein the content of the first and second substances,
Figure GDA0003112498210000061
refers to M under the condition of R available preamblesiOnly one of the devices has
Figure GDA0003112498210000062
Probability of individual devices selecting a unique preamble;
Figure GDA0003112498210000063
Figure GDA0003112498210000064
means that
Figure GDA0003112498210000065
An apparatus selects
Figure GDA0003112498210000066
The probability of each different preamble can be obtained by:
Figure GDA0003112498210000067
in the formula (I), the compound is shown in the specification,
Figure GDA0003112498210000068
means that
Figure GDA0003112498210000069
The probability that a unique preamble is not selected by an individual device is determined by:
Figure GDA00031124982100000610
(1b3) in the ith random access time slot, the number of devices successfully transmitting any preamble code
Figure GDA00031124982100000611
Considering the preamble detection probability Pj＝1-e-jThe number of successful devices for detecting the jth preamble transmission is obtained as follows:
Figure GDA00031124982100000612
obtaining the total number of successful devices
Figure GDA00031124982100000613
Comprises the following steps:
Figure GDA00031124982100000614
wherein
Figure GDA00031124982100000615
Figure GDA00031124982100000616
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 code
Figure GDA0003112498210000071
Further consider the number of physical downlink control channel resources NACKAccording to the total number of successful devices detected
Figure GDA0003112498210000072
And the number of physical downlink control channel resources NACKThe relationship between determines the total actual successful device count
Figure GDA0003112498210000073
Wherein
Figure GDA0003112498210000074
Figure GDA0003112498210000075
Represents the actual number of successful devices making the jth preamble transmission:
if it is
Figure GDA0003112498210000076
The total number of successfully detected devices
Figure GDA0003112498210000077
Number 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 is
Figure GDA0003112498210000078
The actual number of successful devices to perform the jth preamble transmission is
Figure GDA0003112498210000079
If it is
Figure GDA00031124982100000710
The total number of successfully detected devices
Figure GDA00031124982100000711
Exceeding the number of physical downlink control channel resources NACKOf only NACKEach device can successfully access the network, so the total actual successful device number is
Figure GDA00031124982100000712
The actual number of successful devices to perform the jth preamble transmission is
Figure GDA00031124982100000713
(1b5) In the ith random access time slot, for
Figure GDA00031124982100000714
To find out the mathematical expectation, the average of the actual successful devices performing the j-th preamble transmission may be:
Figure GDA00031124982100000715
for total actual successful equipment number
Figure GDA00031124982100000716
Calculating the mathematic expectation to obtain the average value of the total actual successful equipment numbers
Figure GDA00031124982100000717
Comprises the following steps:
Figure GDA00031124982100000718
(1b6) in the ith random access time slot, solving the average value of the total number of the devices with conflict
Figure GDA00031124982100000719
Wherein
Figure GDA00031124982100000720
Figure GDA00031124982100000721
Means 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 solved
Figure GDA0003112498210000081
Returning 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 taking
Figure GDA0003112498210000082
With increasing trend of time slot number, the actual time slot is selectedMean value of power equipment number
Figure GDA0003112498210000083
The dispersion factor that can be stabilized at the maximum value is taken as the optimum dispersion factor
Figure GDA0003112498210000084
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 factor
Figure GDA0003112498210000085
And the total number N of the MTC devices in the cell solves the group number I:
Figure GDA0003112498210000086
(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 (5)

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 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 are
Figure FDA0003112498200000011
Wherein the content of the first and second substances,
Figure FDA0003112498200000012
Figure FDA0003112498200000013
indicates the number of preamble transmission successful devices that perform the j-th preamble transmission, j is 1,2, …, n,
Figure FDA0003112498200000014
Figure FDA0003112498200000015
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,
Figure FDA0003112498200000016
Figure FDA0003112498200000017
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 number of devices successfully transmitting any preamble code
Figure FDA0003112498200000018
Considering the preamble detection probability PjThen, the number of devices successfully detected is calculated
Figure FDA0003112498200000019
Wherein
Figure FDA00031124982000000110
Figure FDA00031124982000000111
Indicating the number of devices successfully detected for carrying out the j-th preamble transmission; number of devices successfully detected
Figure FDA00031124982000000112
The following equation is used to obtain:
Figure FDA00031124982000000113
wherein, PjDenotes the preamble detection probability, Pj＝1-e-jJ represents the current preamble transmission number;
(1b4) in the ith random access time slot, the number of devices successfully transmitting any preamble code
Figure FDA0003112498200000021
Further consider the number of physical downlink control channel resources NACKCalculating the actual successful device count
Figure FDA0003112498200000022
Wherein
Figure FDA0003112498200000023
Figure FDA0003112498200000024
Indicating the actual number of successful devices to perform the j-th preamble transmission; the actual number of successful devices
Figure FDA0003112498200000025
Is based on the number of successful devices detected
Figure FDA0003112498200000026
And the number of physical downlink control channel resources NACKThe relationship between them determines:
if it is
Figure FDA0003112498200000027
The actual number of successful devices is
Figure FDA0003112498200000028
If it is
Figure FDA0003112498200000029
The actual number of successful devices is
Figure FDA00031124982000000210
(1b5) In the ith random access time slot, the actual successful equipment number is counted
Figure FDA00031124982000000211
To find out the mathematical expectation toActual successful device number average in ith random access slot
Figure FDA00031124982000000212
Wherein
Figure FDA00031124982000000213
Figure FDA00031124982000000214
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 collision
Figure FDA00031124982000000215
Wherein
Figure FDA00031124982000000216
Figure FDA00031124982000000217
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 solved
Figure FDA00031124982000000218
Returning 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 taking
Figure FDA00031124982000000219
Selecting the mean value of the actual successful equipment number along with the variation trend of increasing the time slot number
Figure FDA00031124982000000220
The value of the dispersion factor which is stable and maximum is taken as the optimumDispersion factor
Figure FDA00031124982000000221
(2) The base station end according to the optimal dispersion factor
Figure FDA00031124982000000222
And 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 selected
Figure FDA0003112498200000031
The probability is obtained by the following formula:
Figure FDA0003112498200000032
wherein the content of the first and second substances,
Figure FDA0003112498200000033
refers to M under the condition of R available preamblesiOnly one of the devices has
Figure FDA0003112498200000034
A probability that a unique preamble is selected by an individual device;
Figure FDA0003112498200000035
Figure FDA0003112498200000036
finger-shaped
Figure FDA0003112498200000037
An apparatus selects
Figure FDA0003112498200000038
The probability of each different preamble can be obtained by:
Figure FDA0003112498200000039
in the formula (I), the compound is shown in the specification,
Figure FDA00031124982000000310
finger-shaped
Figure FDA00031124982000000311
The probability that a unique preamble is not selected by an individual device is determined by:
Figure FDA00031124982000000312
3. the method of claim 1, wherein in step (1b5), the mean of the number of actual successful devices
Figure FDA00031124982000000313
The following equation is used to obtain:
Figure FDA00031124982000000314
wherein the content of the first and second substances,
Figure FDA00031124982000000315
refers to M under the condition of R available preamblesiOnly one of the devices has
Figure FDA00031124982000000316
Probability of individual devices selecting a unique preamble.
4. The method of claim 1, wherein in step (2), the base station end performs the step of calculating 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 *。
5. 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.
CN201910473965.5A 2019-06-02 2019-06-02 Group paging method based on flow dispersion and capable of realizing stable throughput Active CN110191487B (en)

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 CN110191487A (en) 2019-08-30
CN110191487B true 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)

* Cited by examiner, † Cited by third party
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

Patent Citations (2)

* Cited by examiner, † Cited by third party
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 (2)

* Cited by examiner, † Cited by third party
Title
Distributed queuing with preamble grouping for massive IoT devices in LTE random access;Changbae Yoon;《2016 International Conference on Information and Communication Technology Convergence (ICTC)》;20161021;全文 *
面向海量连接的机器类终端接入技术研究;徐露;《中国优秀硕士学位论文全文数据库》;20190415;全文 *

Also Published As

Publication number Publication date
CN110191487A (en) 2019-08-30

Similar Documents

Publication Publication Date Title
Wei et al. Modeling and analysis of random access channels with bursty arrivals in OFDMA wireless networks
CN108882301B (en) Non-orthogonal random access method based on optimal power backoff in large-scale M2M network
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
Harwahyu et al. Investigating the performance of the random access channel in NB-IoT
CN108834175B (en) Queue-driven equipment access and resource allocation joint control method in mMTC network
Pan et al. Cluster-based group paging for massive machine type communications under 5G networks
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
Cheng et al. Uplink OFDMA-based random access mechanism with bursty arrivals for IEEE 802.11 ax systems
CN100429899C (en) Random access method for frequency division multiple address of time division orthogonal frequency
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
Bui et al. Free access distributed queue protocol for massive cellular-based M2M communications with bursty traffic
CN108667578B (en) Communication method and communication device
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
CN106304391B (en) PRACH access control method, access method and device
EP3900468A1 (en) Method and apparatus for providing non-scheduled network access
Prabhu et al. Adaptive and variable backoff algorithm for IEEE 802.16 to render quality of service
Tian et al. Power ramping schemes for M2M and H2H co-existing scenario
Haro-Mendoza et al. Modeling the resource allocation in 5G radio access networks with network slicing
Althumali et al. Opportunities of hybrid random access protocols for M2M communications in LTE/LTE-A networks
CN112218384B (en) Distributed queue random access method based on priority

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