CN113872714B - URLLC millisecond-level time delay guaranteeing method based on quantization self-adaptive frame length - Google Patents
URLLC millisecond-level time delay guaranteeing method based on quantization self-adaptive frame length Download PDFInfo
- Publication number
- CN113872714B CN113872714B CN202111370905.4A CN202111370905A CN113872714B CN 113872714 B CN113872714 B CN 113872714B CN 202111370905 A CN202111370905 A CN 202111370905A CN 113872714 B CN113872714 B CN 113872714B
- Authority
- CN
- China
- Prior art keywords
- transmission time
- delay
- time interval
- discarded
- queuing
- 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 76
- 238000013139 quantization Methods 0.000 title claims abstract description 9
- 230000005540 biological transmission Effects 0.000 claims abstract description 139
- 230000003044 adaptive effect Effects 0.000 claims description 23
- 238000012545 processing Methods 0.000 claims description 19
- 230000008569 process Effects 0.000 claims description 16
- 230000008859 change Effects 0.000 claims description 6
- 230000003190 augmentative effect Effects 0.000 claims description 5
- 238000005516 engineering process Methods 0.000 claims description 5
- 239000006185 dispersion Substances 0.000 claims description 2
- 238000013461 design Methods 0.000 abstract description 17
- 230000006870 function Effects 0.000 description 23
- 238000004088 simulation Methods 0.000 description 22
- 230000007774 longterm Effects 0.000 description 10
- 238000004891 communication Methods 0.000 description 9
- 238000005457 optimization Methods 0.000 description 6
- 230000008901 benefit Effects 0.000 description 5
- 230000007547 defect Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 5
- 230000000694 effects Effects 0.000 description 4
- 238000004364 calculation method Methods 0.000 description 3
- 238000004458 analytical method Methods 0.000 description 1
- 238000010420 art technique Methods 0.000 description 1
- 238000013507 mapping Methods 0.000 description 1
- 230000009467 reduction Effects 0.000 description 1
- 230000001105 regulatory effect Effects 0.000 description 1
- 238000013468 resource allocation Methods 0.000 description 1
- 230000011664 signaling Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B17/00—Monitoring; Testing
- H04B17/30—Monitoring; Testing of propagation channels
- H04B17/382—Monitoring; Testing of propagation channels for resource allocation, admission control or handover
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
- G06F17/15—Correlation function computation including computation of convolution operations
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0446—Resources in time domain, e.g. slots or frames
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/04—Wireless resource allocation
- H04W72/044—Wireless resource allocation based on the type of the allocated resource
- H04W72/0453—Resources in frequency domain, e.g. a carrier in FDMA
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mathematical Analysis (AREA)
- Data Mining & Analysis (AREA)
- Computational Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Mathematical Optimization (AREA)
- Pure & Applied Mathematics (AREA)
- Mathematical Physics (AREA)
- Computing Systems (AREA)
- Algebra (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Electromagnetism (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a URLLC millisecond delay guaranteeing method based on a quantized self-adaptive frame length, which solves the problems of low flexibility of fixed transmission time interval design and overrun of end-to-end delay in the prior art method. The realization step of the invention is that a dynamic queuing model facing to a variable transmission time interval is established based on the trade-off relation of the transmission time delay and the queuing time delay, and the variable transmission time interval is obtained; establishing a self-adaptive frame length model to obtain a self-adaptive frame length which minimizes the end-to-end time delay; and carrying out quantization treatment on the self-adaptive frame length to obtain the quantized self-adaptive frame length. The invention effectively improves the flexibility of the transmission time interval system design, reduces the end-to-end time delay and ensures the requirement of URLLC millisecond time delay.
Description
Technical Field
The invention belongs to the technical field of wireless communication, and further relates to a high-reliability low-delay communication URLLC (Ultra-Reliable and Low Latency Communications) millisecond delay guarantee method based on a quantized self-adaptive frame length in the technical field of low-delay communication. The invention can adapt to various service flow types achieved under the URLLC scene, realize the best balance between queuing delay and transmission delay, and ensure the URLLC millisecond delay.
Background
The 5G communication network expects that the enabled core service high reliability low latency communication URLLC requires that when transmitting a data packet with a size of 32 bits, the end-to-end latency does not exceed 1 millisecond, i.e. the millisecond level latency guarantee needs to be satisfied. For short data packet traffic of URLLC transmissions, a fixed short frame scheme is proposed. However, the block length under the short data packet is continuously changed, when the transmission time interval is fixed, the queuing delay is too high due to the short frame length, the transmission delay is increased due to the long frame length, and the imbalance of the queuing delay and the transmission delay and the end-to-end delay are over-limited. Therefore, reasonable design of transmission time intervals and flexible change of frame length are great challenges in guaranteeing low latency requirements at the level of URLLC milliseconds.
The high-pass corporation discloses in its filed patent document "shortened transmission time interval sTTI configuration for low-latency communication" (patent application No. 201880036831.0, application publication No. CN 110741711A) a method of reducing transmission latency based on the shortened transmission time interval. The method optimizes the shortened physical downlink control channel such that a fixed length shortened transmission time interval sTTI transmission is achieved with minimal changes to the current shortened transmission time interval sTTI (short Transmission Time Interval) configuration and signaling overhead. The method has the defects that the transmission delay and the queuing delay corresponding to the shortened transmission time interval sTTI with fixed length are unchanged, however, the arrival service flow in the URLLC scene is changed rapidly, when data burst and a large amount of data arrives, the transmission delay and the queuing delay cannot reach the optimal balance in the shortened transmission time interval, and the transmission of a large amount of data flow cannot be completed, so the system has lower design flexibility, and the consideration of the dimension of the transmission time interval is lacking, so the degree of freedom of the system design is reduced.
The Shell C, yang C, quek T presents a time delay control method based on a short packet communication Cross-layer optimization scheme in the paper 'Cross-Layer Optimization for Ultra-useable and Low-Latency Radio Access Networks' (IEEE Transactions on Wireless Communications,2017, 17 (1): 127-141) published by the Shell C, yang C, quek T. The method optimizes the packet loss strategy and the resource allocation strategy through a cross-layer optimization framework of the wireless access network considering the transmission delay and the queuing delay so as to ensure the ultra-high reliability and the low delay of the wireless access network. The method has the defect that the frame length corresponding to the short data packet is not adaptively adjusted, so that the fixed frame length can cause the increase of the end-to-end time delay, thereby causing the problem of overrun of the end-to-end time delay.
Disclosure of Invention
The invention aims to overcome the defects of the prior art, and provides a URLLC millisecond-level time delay guaranteeing method based on a quantized self-adaptive frame length, which is used for solving the problems of low flexibility and over-limit of end-to-end time delay based on a fixed transmission time interval system design in a URLLC scene.
Aiming at the short data packets with continuously changing block length in the URLLC scene, the invention establishes a trade-off relation between the transmission delay and the queuing delay, wherein the queuing delay and the transmission delay change trend are opposite at a fixed transmission time interval; based on the trade-off relation, a dynamic queuing model oriented to the variable transmission time interval is established, the optimal trade-off problem of the transmission time delay and the queuing time delay is optimized and solved through a flexible approximate exchange multiplier direction technology, the variable transmission time interval is obtained, and the different delay requirements of various service flows in a URLLC scene can be met through dynamically changing the transmission time interval, so that the degree of freedom of the system design of the transmission time interval is ensured, and the flexibility is improved; then based on the dynamic queuing model, the influence of the frame length on the end-to-end time delay is considered, a self-adaptive frame length model is established, and the end-to-end time delay minimization problem is optimized and solved through a penalty function method and an augmented Lagrangian multiplier method, so that the self-adaptive frame length capable of achieving the shortest end-to-end time delay is obtained, and the time delay performance is improved; the length of the quantized frame is regulated, the adaptive frame length is quantized, the quantized adaptive frame length is obtained, engineering realization is facilitated, and URLLC millisecond time delay is guaranteed.
The steps of the invention for achieving the above purpose include the following:
step 1, discarding URLLC data packets which are greater than or equal to a threshold value in queuing waiting in the current period;
step 2, establishing a trade-off relation between transmission delay and queuing delay as follows:
wherein D is i Indicating that it is notVariable transmission time interval of discarded data packet queuing process in the ith period, i=1, 2,..i, I represents the total number of queuing process periods, N represents the total number of non-discarded data packets to be serviced in the ith period, Q n Indicating the queuing time of the nth non-dropped packet in the ith period, n=1, 2,..,a frame index number representing the transmission from the nth non-discarded data packet l A represents a dynamically changing transmission time interval of the first frame, a l 0,l =1, 2,..>Indicate->The method comprises the steps that a transmission time interval of dynamic change of each frame is sigma, summation operation is represented, queuing delay refers to time for queuing a URLLC short data packet in the transmission time interval, and transmission delay refers to time for data transmission of the URLLC short data packet in the transmission time interval;
step 3, establishing a variable transmission time interval dynamic queuing model for the data packets which are not discarded:
(3a) The variable transmission time interval dynamic queuing model of the data packet which is not discarded is established as follows:
wherein P is 1 i A variable transmission time interval dynamic queuing model representing non-discarded data packets in an ith period, R representing an achievable transmission rate of a channel, M representing a number of bits per non-discarded data packet;
(3b) Solving for variable transmissions using flexible approximation exchange multiplier direction techniquesTime interval dynamic queuing model P 1 i Obtaining variable transmission time intervals of all the data packets which are not discarded in each period;
step 4, calculating the adaptive frame length of each non-discarded data packet in each period:
(4a) The adaptive frame length model of each non-discarded data packet in each period is established as follows:
wherein P is 2 i,l An adaptive frame length model representing an i-th non-dropped packet in an i-th period of a variable transmission time interval of a non-dropped packet queuing process, min representing a minimization operation, a i,l Represents the frame length of the first non-discarded data packet in the ith period, M represents the number of bits contained in each non-discarded data packet, log 2 (-) denotes a logarithmic operation based on 2, P denotes a transmission power of each non-discarded packet, h denotes channel state information of each non-discarded packet, ||denotes an absolute value taking operation, V denotes channel dispersion,representing the inverse of the gaussian Q function, epsilon representing the probability of transmission errors for each non-discarded packet, e representing a natural constant, s.t. representing a constraint, T representing the duration of the period for processing all non-discarded packets;
(4b) Solving the adaptive frame length model P by using a penalty function method and an augmented Lagrangian multiplier method 2 i,l Resulting in each of the periods not being coveredDiscarding adaptive frame length under variable transmission time interval in the data packet queuing process;
and 5, carrying out quantization processing on the adaptive frame length:
and freely combining various quantized frame length sizes to obtain quantized adaptive frame lengths under variable transmission time intervals of queuing processes of the data packets which are not discarded in each period.
Compared with the prior art, the invention has the following advantages:
firstly, the dynamic queuing model for the variable transmission time interval constructed by the invention can realize the optimal balance of the transmission time delay and the queuing time delay, and can adapt to various and rapidly-changing arrival service flows in a URLLC scene by flexibly changing the transmission time interval, thereby overcoming the defect of low design flexibility of a system based on the fixed transmission time interval in the prior art, improving the flexibility of the transmission time interval system and the flexibility of the design of the transmission time interval at the same time, and further having the advantage of guaranteeing the time delay requirement on the URLLC millisecond level.
Secondly, the self-adaptive frame length model of each data packet which is not discarded in each period constructed by the invention can solve the problem of minimizing the end-to-end time delay, and overcomes the defect that the influence of the frame length on the end-to-end time delay cannot be changed and the end-to-end time delay is out of limit because the end-to-end time delay is directly optimized based on the fixed frame length and is not processed in the prior art, so that the invention has the advantages of reducing the end-to-end time delay and guaranteeing the requirement of URLLC millisecond level time delay.
Drawings
FIG. 1 is a flow chart of the present invention;
FIG. 2 is a simulation diagram of a simulation experiment 1 of the present invention;
FIG. 3 is a simulation diagram of simulation experiment 2 of the present invention;
FIG. 4 is a simulation diagram of the simulation experiment 3 of the present invention.
Detailed Description
The invention is described in further detail below with reference to the drawings and examples.
The implementation steps of the present invention will be described in further detail with reference to fig. 1.
In the embodiment of the invention, the queuing process is equally divided into 10 identical processing periods, and the 2 nd processing period is taken as an example to describe the calculation process of variable transmission time interval and quantization self-adaptive frame length. In order to ensure that the URLLC short data packets can be transmitted in real time, the threshold value of the number of arriving data packets is set to be 10 according to the time delay limit of 1ms in the URLLC and the average transmission rate of the short data packets of 1000 megabits per second, and if the number of the arriving data packets of the 2 nd processing period exceeds 10, the system adopts an active packet loss strategy for the exceeded data packets. The rest data packets which are not discarded need to wait for the data transmission of the random number of the data packets which are arranged in the front to be completed, and then the data transmission is carried out.
Establishing a trade-off relation D of transmission delay and queuing delay in the 2 nd processing period 2 The following are provided:
wherein D is 2 Representing the trade-off relation between the transmission delay and the queuing delay of all the non-discarded data packets in the 2 nd processing period in the variable transmission time interval of the non-discarded data packet queuing process, Q n Indicating the queuing time of the nth non-dropped packet in the 2 nd processing cycle, n=1, 2, 10,monotonically increasing and +.>
The channel for which packets are not dropped in processing cycle 2 may achieve the following transmission rates:
wherein R is 2 A channel indicating that no data packets were dropped in processing cycle 2 may achieve a transmission rate. Based on the above trade-off relationship and the achievable transmission rate, the number of non-discarded data packets transmitted in the first transmission time interval in the 2 nd processing period can be obtained asThe total number of non-discarded packets that can be transmitted for the first l transmission time intervals in the 2 nd processing period is as follows:
wherein K is 2 (l) Indicating the total number of non-discarded data packets that can be transmitted in the first transmission time interval of the 2 nd processing period, the non-discarded data packets transmitted in the first transmission time interval of the 2 nd processing period have K 2 (l-1)+1,K 2 (l-1)+1,…,K 2 (l) Based on the mapping relation of the undelivered data packet to the transmission time interval, the corresponding existence
Then in processing cycle 2, a variable transmission time interval dynamic queuing model for the non-dropped packets is derived as follows:
due to P 1 2 Is non-convex and thus cannot be solved with conventional convex optimization methods. The invention adopts the flexible approximate exchange multiplier direction technology to make P 1 2 The non-convex objective function of (a) is converted into convex, the solution of the new objective function is consistent with the solution of the original objective function, and the optimal solution of the original non-convex problem can be obtained by solving the convex problem, thereby obtaining each non-discarded objectVariable transmission time intervals of data packets.
Based on the variable transmission time interval of each non-dropped packet in the 2 nd processing cycle, embodiments of the present invention build an adaptive frame length model of the 3 rd non-dropped packet in the 2 nd cycle as follows:
wherein P is 2 2,3 An adaptive frame length model representing the 3 rd non-dropped packets in the 2 nd period of the variable transmission time interval of the non-dropped packet queuing process.
Due to P 2 2,3 Is non-convex and therefore cannot be solved with conventional convex optimization methods. The specific steps of the solution will be described in detail below. First, P is determined by a penalty function method 2 2,3 Is transferred to the objective function. The penalty function method is to construct a penalty function according to the characteristics of constraint conditions, then add the penalty function into an objective function, convert the objective function into an unconstrained problem, and keep the solution of the new objective function consistent with that of the original objective function. Correspondingly, P 2 2,3 Is converted into P 3 2,3 The form of (2) is as follows:
where β represents the penalty factor of the penalty function. At this time, P 2 2,3 Is transformed to convex, while the objective function is still non-convex. Thus, P is 2 2,3 Is divided into convex and non-convex parts, then P 2 2,3 Can be converted into P 4 2,3 The following are provided:
s.t.x-y＝0
wherein x represents a group P 2 2,3 The frame length of the convex portion, y, is denoted as P 2 2,3 The frame length of the non-convex portion. In addition, G (x) represents P 2 2,3 The objective function of the convex portion,C 1 ＝log 2 (1+P|h| 2 )，h (y) represents P 2 2,3 The objective function of the non-convex portion of the middle,
due to P 4 2,3 There are two parts of convex and non-convex in the objective function of (a), and the convex problem and the non-convex problem cannot be solved simultaneously, so that the convex problem and the non-convex problem need to be solved separately. Substituting a result obtained by solving the convex problem into the non-convex problem as input to solve the non-convex problem; substituting the result obtained by solving the non-convex problem as input into the convex problem, and continuously updating iteration to finish P 4 2,3 And (3) obtaining the adaptive frame length under the variable transmission time interval of the queuing process of the 3 rd data packet which is not discarded in the 2 nd period.
For iterative operation, P is established 4 2,3 The augmented lagrangian function of (2) is as follows:
wherein,representing P 4 2,3 Is represented by lambda, which represents the Lagrangian multiplier, +.>Representing a penalty factor. The extended Lagrangian function is +.>And (3) performing iterative optimization:
wherein x is k+1 Represents the value of x after the k+1st iteration, k=1, 2,.. k Represents the value of x, lambda after the kth iteration k Represents the value of λ after the kth iteration, y k+1 Represents the value of y after the (k+1) th iteration, y k Represents the value of y after the kth iteration, lambda k+1 A value representing λ after the (k+1) th iteration; x after optimizing k+1 ,y k+1 ,λ k+1 Substituted into P 4 2,3 In (a) can be obtained 2,3 * ，a 2,3 * Indicating the adaptive frame length at the variable transmission time interval of the 3 rd non-dropped packet queuing process in cycle 2.
For the convenience of engineering realization and practical application, for the transmission requirement of the data packet which is not discarded, the frame length is uniformly and equally divided from 0.05ms to 1ms, and the set of usable quantized frame length dimensions is defined as follows: b= 0.05,0.1,0.15,0.2,0.25,0.3,0.35,0.4,0.45,0.5,0.55,0.6,0.65,0.7,0.75,0.8,0.85,0.9,0.95,1 in milliseconds. Calculating the quantized adaptive frame length of each undipped data packet queuing process under the variable transmission time interval in each period according to the following steps:
wherein a is B2,3 * Representing the adaptive frame length, a, of the 3 rd non-discarded packet in the 2 nd period B Representing the usable quantized frame length size, a B e.B. And aiming at the actual scene, carrying out quantization processing on the self-adaptive frame length, wherein the quantization self-adaptive frame length is a flexible combination of the quantization frame length sizes so as to facilitate engineering realization.
The effects of the present invention are further described below in conjunction with simulation experiments:
1. simulation experiment conditions:
the hardware platform of the simulation experiment of the invention is: the processor is Intel Pentium CPU, the main frequency is 3.3GHz, and the memory is 8GB.
The software platform of the simulation experiment of the invention is: windows 10 operating system and Matlab2016a.
The number of the non-discarded data packets used in the simulation experiment of the invention is 10, the number of bits contained in each non-discarded data packet is 50, the transmission power is 10mW, the transmission error probability is 0.00001, the total number of frames contained in each period is 50, and the channel state information is 1.
2. Simulation content and result analysis:
the simulation experiment of the invention adopts the invention and two prior arts (long term evolution fixed long frame method and new air interface fixed short frame method) to respectively simulate and verify three dimensions of transmission delay and queuing delay of all non-discarded data packets, transmission time interval of all non-discarded data packets and average end-to-end delay of all non-discarded data packets, and results of simulation experiment 1, simulation experiment 2 and simulation experiment 3 are obtained, as shown in fig. 2, fig. 3 and fig. 4.
In simulation experiments, two prior art techniques employed refer to:
the long term evolution fixed-length frame method in the prior art refers to a fixed transmission time interval and frame length design method proposed by Mohamad K. Et al in Low-Complexity Power-Efficient Schedulers for LTE Uplink With Delay-Sensitive Traffic (IEEE Transactions on Vehicular Technology,2015, 64 (10): 4551-4564), abbreviated as long term evolution fixed-length frame method.
The new air interface fixed short frame method in the prior art refers to a fixed transmission time interval and frame length design method proposed by Amitabha g. Et al in "Latency-Sensitive 5G RAN Slicing for Industry 4.0" (IEEE Access,2019, 7:143139-143159), which is abbreviated as a new air interface fixed short frame method.
The effects of simulation experiment 1, simulation experiment 2, and simulation experiment 3 of the present invention are further described below with reference to the simulation diagrams of fig. 2, 3, and 4.
The curves marked "≡" in fig. 2 (a) and (b) represent transmission delay and queuing delay result curves of all non-discarded data packets using the long term evolution fixed long frame method of the prior art, the curves marked "≡o represent transmission delay and queuing delay result curves of all non-discarded data packets using the new air interface fixed short frame method of the prior art, and the curves marked" × "represent transmission delay and queuing delay result curves of all non-discarded data packets using the present invention.
As can be seen from the graph (a) in fig. 2, compared with the transmission delay result of the new air interface fixed short frame method in the prior art, the transmission delay result of the long term evolution fixed long frame method is larger, mainly because the method only adopts a fixed long transmission time interval, and the longer transmission time interval corresponds to the increase of the encodable block length of the short data packet, so that the transmission delay is increased.
As can be seen from the graph (b) in fig. 2, the queuing delay of the new air interface fixed short frame method in the prior art is larger than that of the long term evolution fixed long frame method in the prior art, mainly because the method only adopts a fixed short transmission time interval, the short transmission time interval causes the reduction of the channel capacity of the short data packet, and the queuing delay is correspondingly increased.
As can be seen from the diagrams (a) and (b) in fig. 2, compared with the two prior art, the result of the present invention is smaller in transmission delay and queuing delay of all the non-discarded data packets, and the relationship between the transmission delay and the queuing delay can be better balanced, which proves that the balanced effect of the transmission delay and the queuing delay of all the non-discarded data packets of the present invention is better than the fixed transmission time interval and the frame length design method of the first two prior art, and the balanced effect is more ideal, thereby ensuring the balanced capability of the transmission delay and the queuing delay of all the non-discarded data packets, and having the advantage of guaranteeing the delay requirement at the level of URLLC millisecond.
The bar graph labeled "-" in fig. 3 shows the fixed transmission time interval result of all non-dropped packets using the long term evolution fixed long frame method of the prior art, the bar graph labeled "\" shows the fixed transmission time interval result of all non-dropped packets using the new air interface fixed short frame method of the prior art, and the bar graph labeled "x" shows the result curve of the change of the transmission time interval of all non-dropped packets using the method of the present invention.
As can be seen from fig. 3, for the long term evolution fixed long frame method and the new air interface fixed short frame method of the prior art, the transmission time intervals of all the data packets which are not discarded are fixed. Compared with the two prior art, the transmission time interval results of the invention gradually decrease and flexibly change along with the arrival of the data stream, and prove that the system design freedom of the invention is higher than that of the fixed transmission time interval and frame length design method of the first two prior art, thereby improving the flexibility of the system design of the transmission time interval and having the advantage of guaranteeing the time delay requirement on the URLLC millisecond level.
The curve marked with "≡" in fig. 4 shows the average end-to-end delay result curve of all the non-discarded data packets using the long term evolution fixed-length frame method of the prior art, the curve marked with "≡o shows the average end-to-end delay result curve of all the non-discarded data packets using the new air interface fixed-length frame method of the prior art, and the curve marked with" × "shows the average end-to-end delay result curve of all the non-discarded data packets using the present invention.
As can be seen from fig. 4, compared with the average end-to-end delay results of all the data packets which are not discarded in the long term evolution fixed long frame method and the new air interface fixed short frame method in the prior art, the end-to-end delay result of the present invention is the lowest, and the calculation duration of the end-to-end delay reaching the lowest is the shortest. The invention obtains the quantized self-adaptive frame length which can reach the shortest end-to-end delay under the influence of the frame length on the average end-to-end delay of all the data packets which are not discarded, and proves that the delay performance obtained in the shorter calculation time is superior to the fixed transmission time interval and the frame length design method in the prior art, thereby ensuring the URLLC millisecond delay requirement.
The simulation experiment shows that: the method establishes a dynamic queuing model oriented to a variable transmission time interval by utilizing the constructed transmission time delay and queuing time delay trade-off relation, can obtain the variable transmission time interval by utilizing a flexible approximate exchange multiplier direction technology, can obtain an adaptive frame length capable of achieving the shortest end-to-end time delay by optimizing and solving the end-to-end time delay minimization problem by a penalty function method and an augmented Lagrangian multiplier method, and can quantize the adaptive frame length so as to facilitate engineering realization. The method solves the problems of low design flexibility and over-limit of end-to-end time delay caused by adopting a fixed transmission time interval and a frame length in the prior art method, and is a very practical method for guaranteeing the requirement of URLLC millisecond time delay.
Claims (1)
1. A URLLC millisecond-level time delay guaranteeing method based on a quantized self-adaptive frame length is characterized in that a dynamic queuing model oriented to a variable transmission time interval is established according to the trade-off relation of transmission time delay and queuing time delay, the self-adaptive frame length model is established with the aim of minimizing end-to-end time delay, and the self-adaptive frame length is quantized; the method comprises the following steps:
step 1, discarding URLLC data packets which are greater than or equal to a threshold value in queuing waiting in the current period;
step 2, establishing a trade-off relation between transmission delay and queuing delay as follows:
wherein D is i A trade-off relationship between transmission delay and queuing delay of all non-discarded packets in an I-th period representing a variable transmission time interval of the non-discarded packets queuing process, i=1, 2 n Indicating the queuing time of the nth non-dropped packet in the ith period, n=1, 2,..,a frame index number representing the transmission from the nth non-discarded data packet l A represents a dynamically changing transmission time interval of the first frame, a l 0,l =1, 2,..>Indicate->The method comprises the steps that a transmission time interval of dynamic change of each frame is sigma, summation operation is represented, queuing delay refers to time for queuing a URLLC short data packet in the transmission time interval, and transmission delay refers to time for data transmission of the URLLC short data packet in the transmission time interval;
step 3, establishing a variable transmission time interval dynamic queuing model for the data packets which are not discarded:
(3a) The variable transmission time interval dynamic queuing model of the data packet which is not discarded is established as follows:
wherein P is 1 i A variable transmission time interval dynamic queuing model representing non-discarded data packets in an ith period, R representing an achievable transmission rate of a channel, M representing a number of bits per non-discarded data packet;
(3b) Solving a variable transmission time interval dynamic queuing model P by utilizing a flexible approximate exchange multiplier direction technology 1 i Obtaining variable transmission time intervals of all the data packets which are not discarded in each period;
step 4, calculating the adaptive frame length of each non-discarded data packet in each period:
(4a) The adaptive frame length model of each non-discarded data packet in each period is established as follows:
wherein P is 2 i,l An adaptive frame length model representing an i-th non-dropped packet in an i-th period of a variable transmission time interval of a non-dropped packet queuing process, min representing a minimization operation, a i,l Represents the frame length of the first non-discarded data packet in the ith period, M represents the number of bits contained in each non-discarded data packet, log 2 (-) denotes a logarithmic operation based on 2, P denotes a transmission power of each of the non-discarded packets, h denotes channel state information of each of the non-discarded packets, |·|denotes an absolute value taking operation, and V denotes channel dispersion，Representing the inverse of the gaussian Q function, epsilon representing the probability of transmission errors for each non-discarded packet, e representing a natural constant, s.t. representing a constraint, T representing the duration of the period for processing all non-discarded packets;
(4b) Solving the adaptive frame length model P by using a penalty function method and an augmented Lagrangian multiplier method 2 i,l Obtaining the self-adaptive frame length of each undipped data packet queuing process under the variable transmission time interval in each period;
and 5, carrying out quantization processing on the adaptive frame length:
and freely combining various quantized frame length sizes to obtain quantized adaptive frame lengths under variable transmission time intervals of queuing processes of the data packets which are not discarded in each period.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111370905.4A CN113872714B (en) | 2021-11-18 | 2021-11-18 | URLLC millisecond-level time delay guaranteeing method based on quantization self-adaptive frame length |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111370905.4A CN113872714B (en) | 2021-11-18 | 2021-11-18 | URLLC millisecond-level time delay guaranteeing method based on quantization self-adaptive frame length |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113872714A CN113872714A (en) | 2021-12-31 |
| CN113872714B true CN113872714B (en) | 2024-02-13 |
Family
ID=78985045
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111370905.4A Active CN113872714B (en) | 2021-11-18 | 2021-11-18 | URLLC millisecond-level time delay guaranteeing method based on quantization self-adaptive frame length |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113872714B (en) |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20060015127A (en) * | 2004-08-13 | 2006-02-16 | 전자부품연구원 | Improved csfq queueing method in a high speed network, and edge router using thereof |
| CN109922488A (en) * | 2019-04-26 | 2019-06-21 | 电子科技大学 | The design method that URLLC grouping abandons in real-time radio control system |
| CN110149646A (en) * | 2019-04-10 | 2019-08-20 | 中国电力科学研究院有限公司 | A kind of smart grid method for managing resource and system based on time delay and handling capacity |
| CN110677178A (en) * | 2019-08-28 | 2020-01-10 | 华北电力大学（保定） | Short packet transmission delay analysis method in large-scale MIMO-NOMA system |
| CN111918402A (en) * | 2020-07-22 | 2020-11-10 | 达闼机器人有限公司 | Method and device for scheduling terminal equipment, storage medium, network equipment and terminal |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8441927B2 (en) * | 2011-01-13 | 2013-05-14 | Alcatel Lucent | System and method for implementing periodic early discard in on-chip buffer memories of network elements |
| US11678272B2 (en) * | 2019-10-30 | 2023-06-13 | University Of Ottawa | System and method for joint power and resource allocation using reinforcement learning |
-
2021
- 2021-11-18 CN CN202111370905.4A patent/CN113872714B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20060015127A (en) * | 2004-08-13 | 2006-02-16 | 전자부품연구원 | Improved csfq queueing method in a high speed network, and edge router using thereof |
| CN110149646A (en) * | 2019-04-10 | 2019-08-20 | 中国电力科学研究院有限公司 | A kind of smart grid method for managing resource and system based on time delay and handling capacity |
| CN109922488A (en) * | 2019-04-26 | 2019-06-21 | 电子科技大学 | The design method that URLLC grouping abandons in real-time radio control system |
| CN110677178A (en) * | 2019-08-28 | 2020-01-10 | 华北电力大学（保定） | Short packet transmission delay analysis method in large-scale MIMO-NOMA system |
| CN111918402A (en) * | 2020-07-22 | 2020-11-10 | 达闼机器人有限公司 | Method and device for scheduling terminal equipment, storage medium, network equipment and terminal |
Non-Patent Citations (2)
| Title |
|---|
| Performance Evaluation of Grant-Free Transmission for Uplink URLLC Services;Chao Wang;2017 IEEE 85th Vehicular Technology Conference (VTC Spring);全文 * |
| URLLC低时延的技术研究及业务应用;董帝烺;许国平;林斌;;移动通信(第04期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113872714A (en) | 2021-12-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113612843B (en) | MEC task unloading and resource allocation method based on deep reinforcement learning | |
| CN110351760B (en) | Dynamic task unloading and resource allocation method for mobile edge computing system | |
| CN106937393B (en) | Wireless resource scheduling method based on priority | |
| CN112995048B (en) | Blocking control and scheduling fusion method of data center network and terminal equipment | |
| CN103209494A (en) | Real-time video business resource distribution method based on importance mark | |
| CN116390125A (en) | Industrial Internet of things cloud edge cooperative unloading and resource allocation method based on DDPG-D3QN | |
| CN112020080B (en) | Edge caching mechanism for optimizing wireless forward transmission delay | |
| CN113891481B (en) | Throughput-oriented cellular network D2D communication dynamic resource allocation method | |
| CN113872714B (en) | URLLC millisecond-level time delay guaranteeing method based on quantization self-adaptive frame length | |
| CN113490239B (en) | Heterogeneous wireless link concurrent transmission control method based on adaptive network coding | |
| CN104936234B (en) | A kind of joint dynamic resource allocation method optimized for efficiency in LTE system | |
| CN107071919B (en) | LTE downlink real-time service scheduling improvement method based on packet loss rate | |
| CN112770398A (en) | Far-end radio frequency end power control method based on convolutional neural network | |
| Zhang et al. | Statistical QoS-driven energy-efficiency optimization for URLLC over 5G mobile wireless networks in the finite blocklength regime | |
| CN115811799B (en) | DDPG-based 5G-TSN joint resource scheduling device and method | |
| CN109874154B (en) | Deep reinforcement learning-based C-RAN user association and computing resource allocation method | |
| CN109922488B (en) | Design method for URLLC packet discarding in real-time wireless control system | |
| CN115915149A (en) | 5G-TSN fusion network resource allocation method based on weighted polling scheduling | |
| CN110677219B (en) | Short data packet decoding method | |
| CN112911613A (en) | DRL-based traffic offload algorithm for NOMA-MEC network and implementation device | |
| Liu et al. | A Buffer-Aware Finite Blocklength Coding Scheme for Low-Latency Energy-Efficient Communications | |
| CN113891491B (en) | Link access method and device | |
| Kulkarni et al. | Improved Resource Scheduler using Kalman Filter in Wireless Communication | |
| CN116170517B (en) | Priority-based water flow cloud edge cooperative data unloading method | |
| CN118353520A (en) | Deep reinforcement learning-based low-orbit satellite multi-beam subcarrier dynamic scheduling method |
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 |