CN108834175B - Queue-driven equipment access and resource allocation joint control method in mMTC network - Google Patents
Queue-driven equipment access and resource allocation joint control method in mMTC network Download PDFInfo
- Publication number
- CN108834175B CN108834175B CN201810814558.1A CN201810814558A CN108834175B CN 108834175 B CN108834175 B CN 108834175B CN 201810814558 A CN201810814558 A CN 201810814558A CN 108834175 B CN108834175 B CN 108834175B
- Authority
- CN
- China
- Prior art keywords
- time slot
- access
- queue
- equipment
- base station
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 36
- 238000013468 resource allocation Methods 0.000 title claims abstract description 32
- 230000004913 activation Effects 0.000 claims abstract description 36
- 230000005540 biological transmission Effects 0.000 claims abstract description 32
- 238000005457 optimization Methods 0.000 claims description 13
- 238000004422 calculation algorithm Methods 0.000 claims description 3
- 238000010276 construction Methods 0.000 claims description 3
- 238000010845 search algorithm Methods 0.000 claims description 3
- 230000000977 initiatory effect Effects 0.000 abstract 1
- 238000004891 communication Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 238000004088 simulation Methods 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000015556 catabolic process Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000003203 everyday effect Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W28/00—Network traffic management; Network resource management
- H04W28/02—Traffic management, e.g. flow control or congestion control
- H04W28/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/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 queue-driven equipment access and resource allocation joint control method in an mMTC network, which comprises the following steps: 1) a base station broadcasts an access control parameter p and configuration information of a Physical Random Access Channel (PRACH); 2) each device backlogged in the mMTC network generates a random number, and when the random number is smaller than a control parameter p, the random number successfully passes through an access control program; 3) each activation device in step 2) transmits the selected pilot frequency and the respective device ID information; 4) when the pilot frequency is selected by only one device, the base station can successfully decode the corresponding device ID information; otherwise, the base station cannot successfully decode the corresponding equipment ID information; 5) when the activation equipment is successfully accessed randomly and the PUSCH channel allocated by the activation equipment is idle, immediately initiating data transmission; 6) the base station broadcasts a corresponding idle indication when the current time slot is finished; 7) and repeating the steps 2) to 6) until all data transmission is completed, wherein the method can effectively improve the throughput of the network.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and relates to a queue-driven equipment access and resource allocation joint control method in an mMTC network.
Background
With the rapid development of the internet of things (IoT) oriented to the interconnection of everything and ubiquitous information acquisition and exchange, large-scale Machine-Type communication (mtc) has been proposed as an important communication scenario among three major scenarios in the future 5G network. Machine Type (MTC) devices are currently in widespread use in everyday life, for example: monitoring equipment in an intelligent traffic management system, wearable equipment in intelligent medical treatment, automatic control equipment for industrial 4.0, sensing equipment in a fire or emergency early warning system, and the like. In the next 10 years, the number of MTC devices in a wireless network is expected to exceed 500 hundred million, and mMTC networks have great application prospects.
However, currently facing simultaneous access and transmission of a large number of devices accommodated by an mtc network, two key challenging issues remain technically: the first challenge is how to perform effective congestion control, when a large number of devices initiate access simultaneously, if there is no corresponding access control procedure, because the pilot resources are limited, the network will have severe pilot collision, resulting in network congestion, and numerous researchers have proposed respective technical solutions to alleviate network congestion. Another challenge is how to perform efficient resource allocation between a Physical Random Access Channel (PRACH) and a Physical Uplink Shared Channel (PUSCH) with a certain total radio resources, which is a problem that many researchers are easily overlooked, and they often assume that there are enough PUSCH resources in the network for successful access of a subsequent data transmission of a device. In fact, under the condition that the total resources are limited, even if the device successfully accesses in the contention access phase, the device fails to transmit due to lack of corresponding PUSCH resources; on the other hand, if too many resources are divided into PUSCHs, serious pilot collision can be caused in the contention access stage, so that the successful access quantity is greatly reduced, and the resource waste is also caused. Therefore, there is a balance in the allocation between PRACH and PUSCH resources, and how to obtain the optimal balance is a considerable problem to study.
In order to meet the above challenges, an mtc-oriented random contention access and data transmission procedure needs to be improved and designed, and a corresponding queue-driven device access and resource allocation joint control scheme is proposed to improve the throughput of the network.
Disclosure of Invention
The invention aims to overcome the defects of the prior art and provides a queue-driven device access and resource allocation joint control method in an mMTC network, which can effectively improve the throughput of the network.
In order to achieve the above object, the method for jointly controlling access to and resource allocation of a queue-driven device in an mtc network according to the present invention comprises the following steps:
1) when a time slot starts, a base station broadcasts an access control parameter p of the current time slot and configuration information of a Physical Random Access Channel (PRACH) to all equipment in an mMTC network through a downlink channel;
2) uniformly generating a random number by each accumulated device in the mMTC network in an interval (0, 1), and when the random number generated by any device is smaller than a control parameter p, successfully accessing the control program by the device, and marking the device successfully accessing the control program as an activated device; when the random number generated by any equipment is more than or equal to the control parameter p, the equipment is blocked in the current time slot, and the equipment backs off to the next time slot to try to pass through the access control program again;
3) each activation device in the step 2) selects a pilot frequency from the pilot frequency pool, and then transmits the selected pilot frequency and the ID information of each device to the base station on the PRACH;
4) the base station tries to decode the corresponding equipment ID information after receiving the selected pilot frequency, when the pilot frequency is selected by only one equipment, the base station can successfully decode the corresponding equipment ID information, and the pilot frequency is successfully transmitted; when the pilot frequency is selected by a plurality of devices, the base station cannot successfully decode the corresponding device ID information; the base station takes the pilot frequency which is successfully transmitted as a random access response RAR;
5) when an activation device in an mMTC network receives a Random Access Response (RAR) matched with self pilot frequency and device ID information, the activation device is indicated to be successfully accessed randomly, if the channel idle mark in the RAR is true, the assigned PUSCH is indicated to be idle, the activation device immediately initiates data transmission on the PUSCH, and if the channel idle mark in the RAR is false, the activation device enters a waiting state until a channel idle finger broadcasted by a base station in a subsequent time slot is received; when the activation equipment does not receive a random access response RAR matched with the self pilot frequency and equipment ID information, indicating that the activation equipment fails to access, and retrying to pass through an access control program in the next time slot;
6) the base station judges whether the occupied PUSCH channel resources re-enter the idle state or not according to the mark of the end of the data transmission of each activation device, counts to re-enter the idle channel in the current time slot, broadcasts a corresponding idle indication when the current time slot is finished, and starts to transmit data in the next time slot when the device in a waiting state receives the idle indication of the channel;
7) and repeating the steps 2) to 6) until all data transmission is finished, and finishing the joint control of equipment access and resource allocation driven by the queue in the mMTC network.
The random access response RAR in step 4) includes the identified pilot, device ID information, pre-assigned RUSCH information, and channel idle flag.
Allocation of physical random access channel PRACH in step 1)Setting information as resource blocks RBs for pilot frequency transmission in random access stage and number d thereof*Correspondingly, the number of PUSCH resource blocks for data transmission is l-q-d*Wherein q is the total number of resource blocks in the mtc network, and if M resource blocks and n resource blocks are required to construct a pilot channel and a PUSCH channel, the number of pilot channels M and the number of PUSCH channels T in the mtc network are:
the access control parameter p is the window size for controlling the load in the access control program, and the access control parameter p is the estimated value of the average value of the backlog equipment number of the current time slot
And the optimal mean value r of the number of activated devices*Determining, wherein,
wherein (r)*，d*) The solving process of (2) is as follows:
setting F as the number of devices with new service arriving in the current time slot, B as the number of blocked devices in step 2), C as the number of devices with pilot collision in step 4), and A as the number of backlogged devices, then A is F + B + C; if a new service arrives in a poisson process with a strength of λ, the backlog device number a may be approximated by a poisson distribution with an average value of a, correspondingly, the number R of active devices follows the poisson distribution with an average value of R ═ pa, and the number of devices that simultaneously select the pilot b is set to MbThen M isbSubject to a Poisson distribution with a mean value r/M and a random variable MbAnd b is 1, …, M are independent of each other, so the number S of successfully accessed devices obeys the parameter (M, P)11) Two-term distribution:
wherein, P11For the probability that pilot b is selected by only one device:
setting the rate in the process of arrival of the device waiting queue in the step 5) as the number S of devices successfully accessed in each time slot, the rate in the process of departure of the device waiting queue as the maximum number T of devices capable of completing data transmission in each time slot supported by the system, and the length of the waiting queue as Q, then the length Q of the waiting queue of the current time slottLength Q of waiting queue with next time slott+1The relationship of (1) is:
Qt+1＝max{Qt+S-T，0}
to prevent the queuing wait time from being too long, the violation probability constraint of the length of the waiting queue is constructed as follows:
Pr{Q＞Qth}＜e
to make the wait queue length violation probability constraint hold, it is ensured that:
Ψ(S，θ)≤Φ(T，θ)
where Ψ (S, θ) and Φ (T, θ) represent the effective access rate and the effective transmission rate, respectively, of the queuing system,
where, θ is the target queue index, where,
according to the queuing theory, when the waiting queue is stable, the average leaving rate of the waiting queue is equal to the average arriving rate, and the average rate is set as the throughput ζ of the system, then:
construction with resource Allocation d*And activation device intensity r*Optimization problems for the optimization objective of the independent variables to maximize the system throughput, i.e.
s.t.Ψ(S，θ)≤Φ(T，θ)
Solving the optimization problem to obtain the optimal resource allocation d*And activation device intensity r*。
Solving the optimization problem by adopting a two-step search algorithm to obtain the optimal resource allocation d*And activation device intensity r*。
And the base station decides the access control parameter rho and the configuration information of the physical random access channel PRACH by adopting an iterative algorithm in each time slot.
The invention has the following beneficial effects:
when the method for joint control of equipment access and resource allocation driven by queues in the mMTC network is specifically operated, a queuing waiting process is added between the random access stage and the data transmission stage, and the waste of access resources or transmission resources is avoided by dynamically adjusting the relationship between the number of equipment successfully accessed and the number of equipment successfully transmitted in the network, so that the throughput of the system is improved.
Furthermore, the invention improves the throughput of the system and the robustness of the network by the joint optimization of the access control parameters and the resource allocation.
Furthermore, the waiting queue index is adjusted to adapt to the probability violation constraint of the waiting queue lengths with different strengths so as to adapt to different service delay requirements.
Drawings
FIG. 1 is a diagram of an mMTC network scenario in the present invention;
fig. 2 is a flow chart of an improved random access and data transmission in the present invention;
FIG. 3 is a schematic block diagram of a joint access control and resource allocation strategy in the present invention;
FIG. 4 is a graph of system capacity as a function of queue index for an implementation of the present invention;
FIG. 5 is a graph comparing the performance of the system capacity as a function of queue index for the present invention and prior art solutions;
FIG. 6 is a graph comparing the performance of the system throughput as a function of the strength of arrival of new traffic for the present invention and prior art solutions;
fig. 7 is a graph comparing the performance of successful access probability as a function of new traffic arrival intensity for the present invention and prior art solutions;
FIG. 8 is a graph comparing the performance of the mean value of the number of backlog devices of the present invention with the change of the new service arrival strength according to the prior art;
fig. 9 is a graph comparing the performance of the inventive arrangements with the prior art arrangements in terms of the variation of the queue length violation probability with the threshold value.
Detailed Description
The invention is described in further detail below with reference to the accompanying drawings:
referring to fig. 1 and fig. 2, in the large-scale communication network, a large number of MTC devices randomly access a base station in a contention-based manner and transmit respective data, where new services in the network arrive in a poisson process with a strength of λ, and the data amount of each service is set to be the same, the base station divides q resource blocks in the network into PRACH resources for random access, and divides the PUSCH resource for data transmission and sets an optimal access control parameter p to alleviate network congestion.
The device access and resource allocation joint control method of queue drive in the mMTC network comprises the following steps:
1) when a time slot starts, a base station broadcasts an access control parameter p of the current time slot and configuration information of a Physical Random Access Channel (PRACH) to all equipment in an mMTC network through a downlink channel;
2) uniformly generating a random number by each accumulated device in the mMTC network in an interval (0, 1), and when the random number generated by any device is smaller than a control parameter p, successfully accessing the control program by the device, and marking the device successfully accessing the control program as an activated device; when the random number generated by any equipment is more than or equal to the control parameter p, the equipment is blocked in the current time slot, and the equipment backs off to the next time slot to try to pass through the access control program again;
3) each activation device in the step 2) selects a pilot frequency from the pilot frequency pool, and then transmits the selected pilot frequency and the ID information of each device to the base station on the PRACH;
4) the base station tries to decode the corresponding equipment ID information after receiving the selected pilot frequency, when the pilot frequency is selected by only one equipment, the base station can successfully decode the corresponding equipment ID information, and the pilot frequency is successfully transmitted; when the pilot frequency is selected by a plurality of devices, the base station cannot successfully decode the corresponding device ID information; the base station takes the pilot frequency which is successfully transmitted as a random access response RAR;
5) when an activation device in an mMTC network receives a Random Access Response (RAR) matched with self pilot frequency and device ID information, the activation device is indicated to be successfully accessed randomly, if the channel idle mark in the RAR is true, the assigned PUSCH is indicated to be idle, the activation device immediately initiates data transmission on the PUSCH, and if the channel idle mark in the RAR is false, the activation device enters a waiting state until a channel idle finger broadcasted by a base station in a subsequent time slot is received; when the activation equipment does not receive a random access response RAR matched with the self pilot frequency and equipment ID information, indicating that the activation equipment fails to access, and retrying to pass through an access control program in the next time slot;
6) the base station judges whether the occupied PUSCH channel resources re-enter the idle state or not according to the mark of the end of the data transmission of each activation device, counts to re-enter the idle channel in the current time slot, broadcasts a corresponding idle indication when the current time slot is finished, and starts to transmit data in the next time slot when the device in a waiting state receives the idle indication of the channel;
7) and repeating the steps 2) to 6) until all data transmission is finished, and finishing the joint control of equipment access and resource allocation driven by the queue in the mMTC network.
The random access response RAR in step 4) includes the identified pilot, device ID information, pre-assigned RUSCH information, and channel idle flag.
The configuration information of the physical random access channel PRACH in the step 1) is resource blocks RBs used for pilot frequency transmission in the random access phase and the number d thereof*Correspondingly, the number of PUSCH resource blocks for data transmission is l-q-d*Wherein q is the total number of resource blocks in the mtc network, and if M resource blocks and n resource blocks are required to construct a pilot channel and a PUSCH channel, the number of pilot channels M and the number of PUSCH channels T in the mtc network are:
the access control parameter p is the window size for controlling the load in the access control program, and the access control parameter p is the estimated value of the average value of the backlog equipment number of the current time slot
And the optimal mean value r of the number of activated devices*Determining, wherein,
wherein (r)*，d*) The solving process of (2) is as follows:
setting F as the number of devices with new service arriving in the current time slot, B as the number of blocked devices in step 2), C as the number of devices with pilot collision in step 4), and A as the number of backlogged devices, then A is F + B + C; if a new service arrives in a poisson process with a strength of λ, the backlog device number a may be approximated by a poisson distribution with an average value of a, correspondingly, the number R of active devices follows the poisson distribution with an average value of R ═ pa, and the number of devices that simultaneously select the pilot b is set to MbThen M isbSubject to a Poisson distribution with a mean value r/M and a random variable MbAnd b is 1, …, M are independent of each other, so the number S of successfully accessed devices obeys the parameters (M,P11) Two-term distribution:
wherein, P11For the probability that pilot b is selected by only one device:
setting the rate in the process of arrival of the device waiting queue in the step 5) as the number S of devices successfully accessed in each time slot, the rate in the process of departure of the device waiting queue as the maximum number T of devices capable of completing data transmission in each time slot supported by the system, and the length of the waiting queue as Q, then the length Q of the waiting queue of the current time slottLength Q of waiting queue with next time slott+1The relationship of (1) is:
Qt+1＝max{Qt+S-T，0}
to prevent the queuing wait time from being too long, the violation probability constraint of the length of the waiting queue is constructed as follows:
Pr{Q＞Qth}＜e
to make the wait queue length violation probability constraint hold, it is ensured that:
Ψ(S，θ)≤Φ(T，θ)
where Ψ (S, θ) and Φ (T, θ) represent the effective access rate and the effective transmission rate, respectively, of the queuing system,
where, θ is the target queue index, where,
according to the queuing theory, when the waiting queue is stable, the average leaving rate of the waiting queue is equal to the average arriving rate, and the average rate is set as the throughput ζ of the system, then:
construction with resource Allocation d*And activation device intensity r*Optimization problems for the optimization objective of the independent variables to maximize the system throughput, i.e.
s.t.Ψ(5，θ)≤Φ(T，θ)
Solving the optimization problem to obtain the optimal resource allocation d*And activation device intensity r*。
Solving the optimization problem by adopting a two-step search algorithm to obtain the optimal resource allocation d*And activation device intensity r*The method specifically comprises the following steps:
1a) initialization d*D 1 and ζ*When it is 0, calculate the corresponding
Peak Ψ (S, θ) calculation of effective access rater＝MAnd effective transmission rate phi (T, theta) & gtnon & ltr＝M；
Case 1: Ψ (S, θ) & gtnon & gtr＝M＜Φ(T，θ)|r＝MThen the optimal solution r*＝M；
Case 2: Ψ (S, θ) & gtnon & gtr＝M＞Φ(T，θ)|r＝MThen in the real number interval [0, M]Searching for a solution r of equation Ψ (S, θ) ═ Φ (T, θ) by bisection method*；
1b) Calculating the corresponding throughput ζ -r*e-r/MWhen ζ is not less than ζ*Then, update ζ*＝ζ，d*D, otherwise, not updating; d is made to be d +1, and the process goes to the step 1a) until the solution d in the feasible solution set is completed*∈ {1, 2, …, q-1}, and a method for searching the sameUntil now.
The base station adopts an iterative algorithm to decide the access control parameter p and the configuration information of the physical random access channel PRACH in each time slot, and the method specifically comprises the following steps:
2a) network initialization: time slot p is 1, the mean of the number of devices
2b) If it is
The access control parameter of the current time slot is set as:
the distribution quantity of the PRACH resources is as follows: d ═ d*(ii) a Otherwise, setting the access control parameter as p ═ 1, and searching the optimal PRACH resource allocation number through single step traversal:
3c) broadcasting the decision result (p, d) obtained in step 2b) to all MTC devices in the network;
3d) after the random access stage is finished, counting the number V of the collided pilot frequencies in the current time slottAnd from this estimate the backlog device number average for the next slot:
3e) let t be t +1, go to the next slot, and repeat steps 2a) to 3d) until all data is completed.
Referring to FIG. 4, system capacity is referred to as being at an optimal solution (r)*，d*) The maximum value of the system throughput can be seen as the perfect matching between the theoretical value and the actual simulation value, and the theoretical accuracy of the invention is verified. Furthermore, the larger n, the smaller the system capacity, which is in line with the intuition: radio resources required for transmitting data of one device per timeThe more sources, the weaker the processing power of the system.
And selecting comparison schemes, wherein the comparison schemes comprise a queue-free scheme, a queue-free and access control-free scheme, a queue-free and queue-length-free probability constraint scheme and a traditional fixed resource allocation scheme (M ═ T).
From the results in FIG. 5, it can be confirmed that the present invention is close to the limit performance of the unconstrained scheme when the queue index goes towards 0; when the queue index tends to + ∞, the invention tends to the conventional M ═ T scheme, where for any queue length threshold value, the corresponding queue length violation probability is 0, i.e. the queue is in an empty state at the moment, and the conventional M ═ T scheme can ensure that the number of devices successfully accessed per slot is less than or equal to the maximum number of devices successfully transmitted, i.e. ensure that the queue length is 0, i.e. correspond to the performance of the invention when the queue index tends to + ∞. In addition, when theta is less than or equal to 0.2, the system capacity realized by the invention is larger than the actual value of the no-queue scheme, and when theta is less than or equal to 0.2, the queue length violation probability constraint is stricter (for example, if the threshold Q is setthThe corresponding violation probability ∈ of 20 is already small at 0.0183. therefore, the present invention can achieve system capacity next to the limit performance scheme on an acceptable violation probability basis, confirming the superiority of the present invention over conventionally achievable schemes.
Referring to fig. 6, 7 and 8, compared to the conventionally achievable schemes (except for the ultimate performance of the unconstrained scheme), the present invention achieves greater system throughput as the new traffic strength increases, achieving higher probability of successful access and lower number of backlogged devices in the system at all strengths. In summary, the maximum new service reaching strength allowed by all schemes is constrained by the system capacity that can be realized by each scheme, and when the new service reaching strength exceeds the capacity, the throughput realized by the system converges to the capacity value and does not increase any more; and when the new service arrival intensity approaches the capacity, the successful access probability is rapidly reduced, the number of the backlogged equipment exponentially increases and diverges to infinity as the time slot increases, indicating that the system is at the edge of breakdown. By combining three indexes, the invention realizes the performance second to the unconstrained limit scheme, and compared with the traditional realizable scheme, the invention can obtain higher successful transmission probability and lower backlog equipment number when the system is stable, and the robustness of the system is stronger.
Referring to fig. 9, the violation probability curve of the present invention is below the theoretical curve of the set constraint, which indicates that the present invention completely meets the set length violation probability requirement, while the other two comparison schemes lack the corresponding requirements in the design, and the simulation result seriously violates the length violation probability constraint.
Claims (6)
1. A queue-driven device access and resource allocation joint control method in an mMTC network is characterized by comprising the following steps:
1) when a time slot starts, a base station broadcasts an access control parameter p of the current time slot and configuration information of a Physical Random Access Channel (PRACH) to all equipment in an mMTC network through a downlink channel;
2) uniformly generating a random number by each accumulated device in the mMTC network in an interval (0, 1), and when the random number generated by any device is smaller than a control parameter p, successfully accessing the control program by the device, and marking the device successfully accessing the control program as an activated device; when the random number generated by any equipment is more than or equal to the control parameter p, the equipment is blocked in the current time slot, and the equipment backs off to the next time slot to try to pass through the access control program again;
3) each activation device in the step 2) selects a pilot frequency from the pilot frequency pool, and then transmits the selected pilot frequency and the ID information of each device to the base station on the PRACH;
4) the base station tries to decode the corresponding equipment ID information after receiving the selected pilot frequency, when the pilot frequency is selected by only one equipment, the base station can successfully decode the corresponding equipment ID information, and the pilot frequency is successfully transmitted; when the pilot frequency is selected by a plurality of devices, the base station cannot successfully decode the corresponding device ID information; the base station takes the pilot frequency which is successfully transmitted as a random access response RAR;
5) when an activation device in an mMTC network receives a Random Access Response (RAR) matched with self pilot frequency and device ID information, the activation device is indicated to be successfully accessed randomly, if the channel idle mark in the RAR is true, the assigned PUSCH is indicated to be idle, the activation device immediately initiates data transmission on the PUSCH, and if the channel idle mark in the RAR is false, the activation device enters a waiting state until a channel idle finger broadcasted by a base station in a subsequent time slot is received; when the activation equipment does not receive a random access response RAR matched with the self pilot frequency and equipment ID information, indicating that the activation equipment fails to access, and retrying to pass through an access control program in the next time slot;
6) the base station judges whether the occupied PUSCH channel resources re-enter the idle state or not according to the mark of the end of the data transmission of each activation device, counts to re-enter the idle channel in the current time slot, broadcasts a corresponding idle indication when the current time slot is finished, and starts to transmit data in the next time slot when the device in a waiting state receives the idle indication of the channel;
7) and repeating the steps 2) to 6) until all data transmission is finished, and finishing the joint control of equipment access and resource allocation driven by the queue in the mMTC network.
2. The method for joint control of queue-driven device access and resource allocation in an mtc network according to claim 1, wherein the random access response RAR comprises the identified pilot, device ID information, pre-allocated physical uplink shared channel PUSCH information, and channel idle flag.
3. The method for joint control of queue-driven device access and resource allocation in an mtc network according to claim 1, wherein the configuration information of the physical random access channel PRACH in step 1) is resource blocks RBs used for pilot transmission in the random access phase and the number d thereof*Correspondingly, the number of PUSCH resource blocks for data transmission is l-q-d*Wherein q is the total number of resource blocks in the mtc network, and if M resource blocks and n resource blocks are required to construct a pilot channel and a PUSCH channel, the number of pilot channels M and the number of PUSCH channels T in the mtc network are:
the access control parameter p is the window size for controlling the load in the access control program, and the access control parameter p is the estimated value of the average value of the backlog equipment number of the current time slot
And the optimal mean value r of the number of activated devices*Determining, wherein,
4. the method for joint control of queue-driven device access and resource allocation in mMTC network of claim 3, wherein (r) is*，d*) The solving process of (2) is as follows:
setting F as the number of devices with new service arriving in the current time slot, B as the number of blocked devices in step 2), C as the number of devices with pilot collision in step 4), and A as the number of backlogged devices, then A is F + B + C; if a new service arrives in a poisson process with the strength of a, the backlog device number a may be approximated by a poisson distribution with the average value of a, correspondingly, the number R of activated devices follows the poisson distribution with the average value of R ═ pa, and the number of devices that simultaneously select the pilot b is set to MbThen M isbSubject to a Poisson distribution with a mean value r/M and a random variable MbAnd b is 1, …, M are independent of each other, so the number S of successfully accessed devices obeys the parameter (M, P)11) Two-term distribution:
wherein, P11For the probability that pilot b is selected by only one device:
setting the rate in the process of arrival of the device waiting queue in the step 5) as the number S of devices successfully accessed in each time slot, the rate in the process of departure of the device waiting queue as the maximum number T of devices capable of completing data transmission in each time slot supported by the system, and the length of the waiting queue as Q, then the length Q of the waiting queue of the current time slottLength Q of waiting queue with next time slott+1The relationship of (1) is:
Qt+1＝max{Qi+S-T，0}
to prevent the queuing wait time from being too long, the violation probability constraint of the length of the waiting queue is constructed as follows:
Pr{Q＞Qth}＜e
to make the wait queue length violation probability constraint hold, it is ensured that:
ψ(S，θ)≤Φ(T，θ)
where ψ (S, θ) and Φ (T, θ) denote an effective access rate and an effective transmission rate of the queuing system, respectively, where,
where θ is the target queue index, QthIs a threshold, wherein,
according to the queuing theory, when the waiting queue is stable, the average leaving rate of the waiting queue is equal to the average arriving rate, and the average rate is set as the throughput ζ of the system, then:
construction with resource Allocation d*And activation device intensity r*Optimization problems for the optimization objective of the independent variables to maximize the system throughput, i.e.
s.t.ψ(S，θ)≤Φ(T，θ)
Solving the optimization problem to obtain the optimal resource allocation d*And activation device intensity r*。
5. The method for joint control of queue-driven device access and resource allocation in an mtc network according to claim 1, wherein a two-step search algorithm is used to solve the optimization problem to obtain the optimal resource allocation d*And activation device intensity r*。
6. The method for joint control of equipment access and resource allocation driven by queues in an mMTC network according to claim 1, wherein a base station adopts an iterative algorithm to decide an access control parameter p and configuration information of a Physical Random Access Channel (PRACH) in each time slot.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810814558.1A CN108834175B (en) | 2018-07-23 | 2018-07-23 | Queue-driven equipment access and resource allocation joint control method in mMTC network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810814558.1A CN108834175B (en) | 2018-07-23 | 2018-07-23 | Queue-driven equipment access and resource allocation joint control method in mMTC network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108834175A CN108834175A (en) | 2018-11-16 |
| CN108834175B true CN108834175B (en) | 2020-08-18 |
Family
ID=64139512
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810814558.1A Active CN108834175B (en) | 2018-07-23 | 2018-07-23 | Queue-driven equipment access and resource allocation joint control method in mMTC network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108834175B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109963272B (en) * | 2019-04-28 | 2021-01-19 | 西安交通大学 | Random access method for differentiated MTC network |
| CN111294775B (en) * | 2020-02-10 | 2021-04-20 | 西安交通大学 | Resource allocation method based on H2H dynamic characteristics in large-scale MTC and H2H coexistence scene |
| CN111918358B (en) * | 2020-07-30 | 2021-04-13 | 重庆六花网络科技有限公司 | Intelligent activation system and method for terminal equipment in communication network based on big data access |
| CN112218384B (en) * | 2020-09-24 | 2022-09-20 | 中国科学院上海微系统与信息技术研究所 | Distributed queue random access method based on priority |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103491622A (en) * | 2012-06-12 | 2014-01-01 | 电信科学技术研究院 | Uplink transmission method and device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107295693B (en) * | 2016-04-13 | 2020-02-21 | 中国移动通信有限公司研究院 | Random access method, base station and terminal |
| CN105979591B (en) * | 2016-04-27 | 2019-02-05 | 西安交通大学 | Based on minimum effectively SINR optimal user scheduling method under the big connection scene of low-power consumption |
| CN108234005A (en) * | 2016-12-21 | 2018-06-29 | 北京信威通信技术股份有限公司 | A kind of method and device of wave beam training |
-
2018
- 2018-07-23 CN CN201810814558.1A patent/CN108834175B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103491622A (en) * | 2012-06-12 | 2014-01-01 | 电信科学技术研究院 | Uplink transmission method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108834175A (en) | 2018-11-16 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Lanante et al. | Performance analysis of the 802.11 ax UL OFDMA random access protocol in dense networks | |
| CN108834175B (en) | Queue-driven equipment access and resource allocation joint control method in mMTC network | |
| Shahin et al. | Hybrid slotted-CSMA/CA-TDMA for efficient massive registration of IoT devices | |
| CN111294775B (en) | Resource allocation method based on H2H dynamic characteristics in large-scale MTC and H2H coexistence scene | |
| CN109417720B (en) | Congestion control method, base station and terminal | |
| CN108924939B (en) | Uplink transmission preamble allocation method for NB-IoT system to prioritize devices | |
| US10070287B2 (en) | Method and apparatus for energy adaptive resource allocation in energy harvesting network | |
| CN104285487A (en) | Scheduling method, user equipment, and base station | |
| WO2019154250A1 (en) | Carrier set determination method and device, storage medium and electronic device | |
| CN108810927B (en) | Method and system for processing scheduling request | |
| JP2022084701A (en) | Communication device and communication method | |
| US11477817B2 (en) | Systems and methods for prioritized channel access for 802.11ax clients in BSS with mixed clients | |
| Lee et al. | Recycling random access opportunities with secondary access class barring | |
| WO2023071055A1 (en) | Method for configuring and updating random access resources in multi-antenna mimo scenario | |
| CN103974443B (en) | Distributed channel connection control method and equipment | |
| Guo et al. | Resource allocation for low-latency vehicular communications with packet retransmission | |
| CN108513309A (en) | A kind of access jamming control method of NB-IoT systems | |
| Zhang et al. | Resource allocation based performance analysis for 5G vehicular networks in urban areas | |
| CN109963272B (en) | Random access method for differentiated MTC network | |
| CN113056010A (en) | Reserved time slot distribution method based on LoRa network | |
| CN116326120A (en) | Communication method and device | |
| WO2024021860A1 (en) | Data transmission method and apparatus, storage medium, and program product | |
| Zhang et al. | AI-aided traffic control scheme for M2M communications in the internet of vehicles | |
| CN115379423A (en) | Random access control method and system based on preamble multiplexing and collision sensing | |
| CN112004212B (en) | Random access system and method based on sliding window |
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 | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231218 Address after: 230000 floor 1, building 2, phase I, e-commerce Park, Jinggang Road, Shushan Economic Development Zone, Hefei City, Anhui Province Patentee after: Dragon totem Technology (Hefei) Co.,Ltd. Address before: Beilin District Xianning West Road 710049, Shaanxi city of Xi'an province No. 28 Patentee before: XI'AN JIAOTONG University |
|
| TR01 | Transfer of patent right |