Wireless resource allocation method, apparatus and system supporting the coexistence of periodic and non-periodic machine users

Abstract

This invention discloses a wireless resource allocation method, apparatus, and system that supports the coexistence of periodic and aperiodic machine users. The wireless resource allocation method includes classifying machine users into periodic and aperiodic types; allocating resources to periodic machine users based on transmission delay duration constraints; and allocating resources to aperiodic users based on delay statistical performance constraints. In this invention, since resource allocation is fixed, there is no need for dynamic requests to the base station, and idle wireless resources can be fully utilized, thereby improving resource utilization efficiency and reducing signaling complexity.

Description

Technical Field

[0001] This invention belongs to the field of wireless communication technology, and specifically relates to a wireless resource allocation method, apparatus and system that supports the coexistence of periodic and non-periodic machine users. Background Technology

[0002] Ultra-reliable and low-latency communications (URLLC) is an important application scenario in mobile communication technology, especially in 5G and future 6G networks. Its purpose is to provide high reliability and low latency performance for machine users, and it is widely used in fields with high requirements for communication reliability and latency, such as autonomous driving, telemedicine, industrial automation, and virtual reality. URLLC encompasses both reliability and latency requirements. Reliability requirements are typically achieved through physical layer technologies such as diversity and channel coding; latency requirements, in addition to physical layer technologies, also involve resource allocation techniques. This invention focuses on resource allocation techniques aimed at meeting the latency performance requirements of machine users.

[0003] Existing low-latency resource allocation technologies can be broadly categorized into two main types. The first type is grant-based resource allocation technologies, such as Earliest Deadline First (EDF) scheduling. The second type is grant-free resource allocation technologies, such as Semi-Persistent Scheduling (SPS), Non-Orthogonal Multiple Access (NOMA), and Rate-Splitting Multiple Access (RSMA) resource allocation.

[0004] Existing low-latency resource allocation methods based on semi-persistent scheduling primarily consider allocating a fixed amount of resources to machine users at fixed intervals, thereby satisfying latency requirements in a very simplified signaling manner. However, the following two aspects are rarely considered. First, among machine users, a large category of users have periodically arriving messages, meaning they generate a fixed-format message at fixed intervals and are required to transmit it to the base station within a given timeframe. Second, besides periodically arriving users, some machine users may have randomly arriving messages, meaning they generate a message at random times due to conditional triggering, and the transmission timeout probability must not fall below a certain threshold. Considering these two aspects together, it is meaningful to design a wireless communication system that supports both periodic and non-periodic machine users, and to propose a corresponding wireless resource allocation method, for scenarios dominated by periodic machine users but with a small number of non-periodic machine users. Summary of the Invention

[0005] To address the aforementioned problems, this invention proposes a wireless resource allocation method, apparatus, and system that supports the coexistence of periodic and non-periodic machine users, thereby improving the efficiency of wireless resource utilization.

[0006] To achieve the above-mentioned technical objectives and effects, the present invention is implemented through the following technical solution:

[0007] In a first aspect, the present invention provides a wireless resource allocation method that supports the coexistence of periodic and non-periodic machine users, comprising:

[0008] Machine users are categorized into periodic and non-periodic types.

[0009] Resources are allocated to the periodic machine users based on transmission delay time constraints;

[0010] Resources are allocated to the non-periodic users based on latency statistical performance constraints.

[0011] In conjunction with the first aspect, optionally, the allocation of resources to the periodic machine users constrained by transmission delay period, and the allocation of resources to the non-periodic users constrained by delay statistical performance, includes:

[0012] Let the set of all periodic machine users be . The set of non-periodic machine users is ;

[0013] initialization , For the first For each channel, repeat the following steps until the preset conditions are met:

[0014] Initial allocation in A set of periodic machine users on a channel for At the same time, clear the set. ;

[0015] Initial allocation in Set of non-periodic machine users on a channel It is an empty set;

[0016] initialization The feasible solution set is the set of all natural numbers, denoted as set . , ,in, The scheduling period length representing semi-persistent scheduling is One time slot;

[0017] Considering periodic users, update the set according to the preset first update rule. Perform the first update step;

[0018] Considering periodic users, the set obtained after the first update step is processed according to the preset second update rule. Proceed to the second update step;

[0019] Considering periodic users, the set obtained after the second update step is processed according to the preset third update rule. Perform the third update step; wherein, the first update rule, the second update rule, and the third update rule are all related to the transmission delay period constraint;

[0020] Considering non-periodic users, the set obtained after the third update step is updated according to the preset fourth update rule related to latency statistical performance constraints. Proceed to the fourth update step;

[0021] Based on the set obtained after the fourth update step and sets ,gather ,gather Based on the preset logical rules, return to execute the first update step or the fourth update step, or execute the step of allocating resources to machine users.

[0022] In conjunction with the first aspect, optionally, the consideration of periodic users and the updating of the set according to a preset first update rule are described. The first update step includes:

[0023] calculate ,in, Representing the The cycle of a periodic machine user, Representing the The transmission delay period for each periodic machine user, The total number of periodic machine users;

[0024] set All of the above Remove all elements from the collection to complete the process. This is the first update.

[0025] In conjunction with the first aspect, optionally, the set obtained after the first update step, considering periodic users, is updated according to a preset second update rule. The second update step includes:

[0026] For the set after performing the first update step Each element in Perform the following operations: For the first For a periodic machine user, if Then calculate Conversely, if Then calculate ;get After determining the value, classify the machine user as number 1. Class, where, denoted To be classified as the first A collection of periodic machine users of a class;

[0027] calculate ,in , Representing the The number of time slots required for messages from a periodic machine user;

[0028] The set obtained after performing the first update step All of the above satisfy Remove all elements, completing the process for updating the set obtained after the first update step. The second update;

[0029] If the set after performing the second update step If it is not an empty set, then for that set... Perform the third update step; otherwise, remove from the set. Remove some users and put them back into the collection. Then, for this set Perform the first update step.

[0030] In conjunction with the first aspect, optionally, the set obtained after the second update step, considering periodic users, is updated according to a preset third update rule. The third update step includes:

[0031] For the set after performing the second update step Each element in Perform the following operations: Calculate Then calculate Next, calculate ;

[0032] The set obtained after performing the second update step All of the above satisfy Delete all elements, including It is a threshold value, the set obtained after completing the second update step. The third update;

[0033] If the set obtained after performing the third update step If it is not an empty set, then for that set... Perform the fourth update step; otherwise, remove from the set. Remove some users and put them back into the collection. Then, for this set Perform the first update step.

[0034] In conjunction with the first aspect, optionally, the set obtained after the third update step, which considers non-periodic users, is updated according to a preset fourth update rule related to delay statistical performance constraints. The fourth update includes:

[0035] From the set Select a non-periodic machine user For this non-periodic machine user calculate The value of , Defined as satisfying delay statistical performance constraints the smallest ,in It is a free parameter greater than 0. It is a real number between 0 and 1. It is a preset probability threshold. Represents the non-periodic machine user The extension period, The message arrival density representing the non-periodic machine user, i.e., the average arrival per time slot. Message Represents the non-periodic machine user The moment generating function of the message length, which... Recorded as ;

[0036] The set obtained after performing the third update step All of the above satisfy Delete all elements. For set The first in The set of elements obtained after completing the third update step. This is the fourth update.

[0037] In conjunction with the first aspect, optionally, based on the set obtained after performing the fourth update step. and sets ,gather ,gather Based on preset logical rules, return to execute the first update step or the fourth update step, or execute the step of allocating resources to machine users, including:

[0038] If set If it is not an empty set, then it will be a non-periodic machine user. From the set Move into set In, then from the set Then select another non-periodic machine user and return to the set, considering non-periodic users, and update the set according to the preset fourth update rule related to latency statistical performance constraints. Proceed to the fourth update step;

[0039] If set It is an empty set, a set It is also an empty set, and the set There are also non-periodic machine users who haven't tried it, starting from the set. Then select another non-periodic machine user and return to the set, considering non-periodic users, and update the set according to the preset fourth update rule related to latency statistical performance constraints. Proceed to the fourth update step;

[0040] If set It is an empty set, a set It is also an empty set, and the set All non-periodic machine users have been tested, starting from the set. Remove some users and put them back into the collection. Then, return to the execution process, taking into account periodic users, and update the set according to the preset first update rule. Perform the first update step;

[0041] If set It is an empty set, but the set If the set is not empty, then proceed with the step of allocating resources to the machine user.

[0042] In conjunction with the first aspect, optionally, the allocation of resources to machine users includes:

[0043] From the set The scheduling cycle is selected according to a certain rule. The value of , and then in the Resource allocation is performed on each channel;

[0044] For sets Periodic users In other words, if So every A scheduling cycle is allocated to this user One time slot;

[0045] For sets Non-periodic users In other words, if It is to satisfy The smallest one So every Each scheduling cycle allocates a periodic user Each time slot.

[0046] Secondly, the present invention provides a wireless resource allocation apparatus that supports the coexistence of periodic and non-periodic machine users, comprising:

[0047] The machine user classification module is used to classify machine users into periodic and non-periodic types.

[0048] The first resource allocation module is used to allocate resources to the periodic machine users based on the transmission delay period.

[0049] The second resource allocation module is used to allocate resources to the non-periodic users based on latency statistical performance constraints.

[0050] Thirdly, the present invention provides a wireless resource allocation system that supports the coexistence of periodic and non-periodic machine users, including a storage medium and a processor;

[0051] The storage medium is used to store instructions;

[0052] The processor is configured to operate according to the instructions to perform the method according to any one of the first aspects.

[0053] Compared with the prior art, the beneficial effects of the present invention are as follows:

[0054] In terms of improving resource utilization efficiency, this invention can make full use of the idle wireless resources of periodic machine users, thereby improving the overall resource utilization efficiency of the system.

[0055] In terms of reducing signaling complexity, the resource allocation is fixed for both periodic and non-periodic machine users in this invention, without the need for dynamic requests to the base station, thereby greatly reducing signaling complexity. Attached Figure Description

[0056] To more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the drawings used in the embodiments will be briefly described below. Obviously, the drawings described below are only some embodiments of the present invention. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort, wherein:

[0057] Figure 1 This is a flowchart of the wireless resource allocation method provided in an embodiment of the present invention;

[0058] Figure 2 This is an architecture diagram of the wireless resource allocation system provided in an embodiment of the present invention;

[0059] Figure 3 This is a diagram illustrating an example of wireless resource allocation provided in an embodiment of the present invention;

[0060] Figure 4 This is the first part of the calculation process provided in the embodiments of the present invention;

[0061] Figure 5 This is the second part of the calculation process provided in the embodiments of the present invention. Detailed Implementation

[0062] The technical solutions of the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only a part of the embodiments of the present invention, and not all of them. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative effort are within the scope of protection of the present invention.

[0063] Furthermore, if the embodiments of this invention involve descriptions such as "first" or "second," these descriptions are for descriptive purposes only and should not be construed as indicating or implying their relative importance or implicitly specifying the number of technical features indicated. Therefore, a feature defined with "first" or "second" may explicitly or implicitly include at least one of those features. Additionally, the technical solutions of the various embodiments can be combined with each other, but this must be based on the ability of those skilled in the art to implement them. If the combination of technical solutions is contradictory or impossible to implement, it should be considered that such a combination of technical solutions does not exist and is not within the scope of protection claimed by this invention.

[0064] Example 1

[0065] This invention provides a method for allocating wireless resources that supports the coexistence of periodic and non-periodic machine users, comprising the following steps:

[0066] (1) Divide machine users into periodic and non-periodic types;

[0067] (2) Allocate resources to the periodic machine users with the transmission delay period as a constraint;

[0068] (3) Allocate resources to the non-periodic users with the delay statistics performance as a constraint.

[0069] Based on the wireless resource allocation method supporting the coexistence of periodic and non-periodic machine users in the embodiments of the present invention, the idle wireless resources of periodic machine users can be fully utilized, thereby improving the overall resource utilization efficiency of the system.

[0070] In one specific embodiment of the present invention, the method of allocating resources to the periodic machine user based on transmission delay periodicity constraints and allocating resources to the non-periodic user based on delay statistical performance constraints includes:

[0071] Let the set of all periodic machine users be . The set of non-periodic machine users is ;

[0072] initialization , For the first For each channel, repeat the following steps until the preset conditions are met:

[0073] Initial allocation in A set of periodic machine users on a channel for At the same time, clear the set. ;

[0074] Initial allocation in Set of non-periodic machine users on a channel It is an empty set;

[0075] initialization The feasible solution set is the set of all natural numbers, denoted as set . , ,in, The scheduling period length representing semi-persistent scheduling is One time slot;

[0076] Considering periodic users, update the set according to the preset first update rule. Perform the first update step (i.e., update the set) (First update)

[0077] Considering periodic users, the set obtained after the first update step is processed according to the preset second update rule. Perform the second update step (i.e., update the set) (Second update to be performed)

[0078] Considering periodic users, the set obtained after the second update step is processed according to the preset third update rule. Perform the third update step (i.e., update the set) (A third update will be performed); whereby the first update rule, the second update rule, and the third update rule are all related to the transmission delay period constraint;

[0079] Considering non-periodic users, the set obtained after the third update step is updated according to the preset fourth update rule related to latency statistical performance constraints. Perform the fourth update step (i.e., update the set) (Fourth update)

[0080] Based on the set obtained after the fourth update step and sets ,gather ,gather Based on the preset logical rules, return to execute the first update step or the fourth update step, or execute the step of allocating resources to machine users.

[0081] In one specific embodiment of the present invention, the step of considering periodic users and updating the set according to a preset first update rule is described. The first update step includes:

[0082] calculate ,in, Representing the The cycle of a periodic machine user, Representing the The transmission delay period for each periodic machine user, The total number of periodic machine users;

[0083] set All of the above Remove all elements from the collection to complete the process. The first update step.

[0084] In one specific embodiment of the present invention, considering periodic users, the set obtained after the first update step is updated according to a preset second update rule. The second update step includes:

[0085] For the set after performing the first update step Each element in Perform the following operations: For the first For a periodic machine user, if Then calculate Conversely, if Then calculate ;get After determining the value, classify the machine user as number 1. Class, where, denoted To be classified as the first A collection of periodic machine users of a class;

[0086] calculate ,in , Representing the The number of time slots required for messages from a periodic machine user;

[0087] The set obtained after performing the first update step All of the above satisfy Remove all elements, completing the process for updating the set obtained after the first update step. The second update;

[0088] If the set after performing the second update step If it is not an empty set, then for that set... Perform the third update step; otherwise, remove from the set. Remove some users and put them back into the collection. Then, for this set Perform the first update step.

[0089] In one specific embodiment of the present invention, considering periodic users, the set obtained after the second update step is updated according to a preset third update rule. The third update step includes:

[0090] For the set after performing the second update step Perform the following operation on each element in the dataset: Calculate Then calculate Next, calculate .

[0091] The set obtained after performing the second update step All of the above satisfy Delete all elements, including It is a threshold value, the set obtained after completing the second update step. The third update;

[0092] If the set obtained after performing the third update step If it is not an empty set, then for that set... Perform the fourth update step; otherwise, remove from the set. Remove some users and put them back into the collection. Then, for this set Perform the first update step.

[0093] In one specific embodiment of the present invention, considering non-periodic users, the set obtained after the third update step is updated according to a preset fourth update rule related to latency statistical performance constraints. The fourth update includes:

[0094] from Select a non-periodic machine user For this non-periodic machine user calculation The value of , Defined as satisfying delay statistical performance constraints the smallest ,in It is a free parameter greater than 0. It is a real number between 0 and 1. It is a preset probability threshold. Represents the non-periodic machine user The extension period, The message arrival density representing the non-periodic machine user, i.e., the average arrival per time slot. Message Represents the non-periodic machine user The moment generating function of the message length, which... Recorded as ;

[0095] The set obtained after performing the third update step All of the above satisfy Delete all elements. For set The first in The set of elements obtained after completing the third update step. This is the fourth update.

[0096] In one specific embodiment of the present invention, based on the set obtained after the fourth update step... and sets ,gather ,gather Based on preset logical rules, return to execute the first update step or the fourth update step, or execute the step of allocating resources to machine users, including:

[0097] If set If it is not an empty set, then the non-periodic machine user... From the set Move into set In, then from the set Then select another non-periodic machine user and return to the set, considering non-periodic users, and update the set according to the preset fourth update rule related to latency statistical performance constraints. Proceed to the fourth update step;

[0098] If set It is an empty set, a set It is also an empty set, and the set There are also non-periodic machine users who haven't tried it, starting from the set. Then select another non-periodic machine user and return to the set, considering non-periodic users, and update the set according to the preset fourth update rule related to latency statistical performance constraints. Proceed to the fourth update step;

[0099] If set It is an empty set, a set It is also an empty set, and the set All non-periodic machine users have been tested, starting from the set. Remove some users and put them back into the collection. Then, return to the execution process, taking into account periodic users, and update the set according to the preset first update rule. Perform the first update step;

[0100] If set It is an empty set, but the set If the set is not empty, then proceed with the step of allocating resources to the machine user.

[0101] In one specific embodiment of the present invention, allocating resources to machine users includes:

[0102] From the set The scheduling cycle is selected according to a certain rule. The value of , and then in the Resource allocation is performed on each channel;

[0103] For sets Periodic users In other words, if So every A scheduling cycle is allocated to this user One time slot;

[0104] For sets Non-periodic users In other words, if It is to satisfy The smallest one So every A scheduling cycle is allocated to this user Each time slot.

[0105] The wireless resource allocation method in this embodiment of the invention will be described in detail below with reference to a specific implementation method.

[0106] Consider as Figure 2 In the scenario shown, the wireless resource allocation method includes the following steps:

[0107] Step 1: Initialization, such as Figure 1 As shown in the image.

[0108] In this step, let the set of all periodic machine users be denoted as . The set of non-periodic machine users is Starting with the first channel, i.e., initialization... .

[0109] In this step, the initial allocation is performed at the 1st stage. A set of periodic machine users on a channel for At the same time, clear the set. Initialize allocation in the first Set of non-periodic machine users on a channel It is an empty set.

[0110] In this step, initialization The feasible solution set is the set of all natural numbers, denoted as set . ,in The scheduling period length representing semi-persistent scheduling is Each time slot.

[0111] Step 2: Consider periodic users and perform a set Perform the first update, such as Figure 1 As shown in the image.

[0112] In this step, calculation ,in Representing the The cycle of a periodic machine user, Representing the The transmission delay period for each periodic machine user, This represents the total number of periodic machine users.

[0113] In this step, the set All of the above Remove all elements from the collection to complete the process. This is the first update.

[0114] Step 3: Considering periodic users, perform a set update after the first update step. Perform the second update step, such as Figure 1 As shown in the image.

[0115] In this step, the set after the first update step is performed... Each element in Perform the following operations: For the first For a periodic machine user, if Then calculate Conversely, if Then calculate ;get After determining the value, classify the machine user as number 1. Class, where, denoted To be classified as the first A collection of periodic machine users of a class.

[0116] In this step, calculation ,in , Representing the The number of time slots required for messages from a periodic machine user.

[0117] In this step, the set obtained after performing the first update step will be... All of the above satisfy Remove all elements, completing the process for updating the set obtained after the first update step. The second update.

[0118] In this step, if the set after performing the second update step... If the set is not empty, continue with the next steps; otherwise, remove the set. Remove some users and put them back into the collection. Then return to step 2. There are several possible choices for the removal rules. For example, all periodic machine users could be removed according to... The values ​​are sorted from largest to smallest, and then three are removed each time, starting from the head. Alternatively, random selection can be used.

[0119] Step 4: Considering periodic users, perform a second update on the set obtained after the second update step. Perform the third update step, such as Figure 1 As shown in the image.

[0120] In this step, the set after performing the second update step is... Perform the following operation on each element in the array: Calculate Then calculate Next, calculate .

[0121] In this step, the set obtained after performing the second update step will be... All of the above satisfy Delete all elements, including It is a threshold value, the set obtained after completing the second update step. This is the third update.

[0122] In this step, if the set obtained after performing the third update step... If the set is not empty, continue with the next steps; otherwise, remove the set. Remove some users and put them back into the collection. Then return to step 2.

[0123] Step 5: Consider non-periodic users and perform a third update on the set obtained after the third update step. Perform the fourth update, such as Figure 1 As shown in the image.

[0124] In this step, from Select a non-periodic machine user Calculations for this non-periodic machine user Calculate the value of . The value of . The definition is to satisfy the constraints the smallest ,in It is a real number between 0 and 1. It is a preset probability threshold. Represents the non-periodic machine user The extension period, The message arrival density representing the non-periodic machine user, i.e., the average arrival per time slot. Message The moment generating function represents the length of the message from this aperiodic machine user. Recorded as .

[0125] In this step, the set obtained after performing the third update step is... To update, that is, to update the set obtained after performing the third update step. All of the above satisfy Delete all elements.

[0126] Step 6: Perform logical processing, such as... Figure 1 As shown in the image.

[0127] In this step, if the set If it is not an empty set, then it will be a non-periodic machine user. From the set Move into set In, then from the set Then select another non-periodic machine user and return to step 5. There are several possible rules for this reselection. For example, all non-periodic machine users could be selected according to... The values ​​are sorted from largest to smallest, and then the user ranked first is selected each time. Alternatively, random selection can be used.

[0128] In this step, if the set It is an empty set, a set It is also an empty set, and the set There are also non-periodic machine users who haven't tried it, starting from the set. Select another non-periodic machine user and then return to step 5.

[0129] In this step, if the set It is an empty set, a set It is also an empty set, and the set All non-periodic machine users have been tested, starting from the set. Remove some users and put them back into the collection. Then return to step 2.

[0130] In this step, if the set It is an empty set, but the set If it is not an empty set, proceed with the following steps.

[0131] Step 7: Allocate resources to machine users, such as... Figure 1 As shown in the image.

[0132] In this step, from the set The scheduling cycle is selected according to a certain rule. The value of , and then in the Resource allocation is performed on each channel.

[0133] In this step, for the set Periodic users In other words, if So every A scheduling cycle is allocated to this user Each time slot.

[0134] In this step, for the set Non-periodic users In other words, if It is to satisfy The smallest one So every A scheduling cycle is allocated to this user Each time slot.

[0135] Step 8: [The text appears to be incomplete and contains several grammatical errors. A more accurate translation would require the full context.] Increase by 1, then return to step 2 until the set is complete. and Until all values ​​are empty.

[0136] The following is Example 2.

[0137] exist Figure 3 An example is provided to illustrate the resource allocation method proposed in this invention. In this example, the time axis is divided into sections of length [length missing]. The scheduling interval for each time slot. There are three periodic machine users with periods of 5, 6, and 10 time slots respectively, and the deadline is the same as the period. Each message occupies one time slot. These three users are divided into two sets. and Therefore, the first user is allocated one time slot in each scheduling interval, the second user is the same as the first user, and the third user is allocated one time slot every two scheduling intervals. Furthermore, the fourth user in this example represents a non-periodic user, and the two time slots starting from the end of each scheduling interval are allocated to this user.

[0138] The number of users in a cycle is set to 20. The cycle for each user is evenly distributed within the range of [40, 80] time slots. Each message occupies one time slot, and message transmission must be completed within one cycle. The threshold in step 4... The value is 0.1.

[0139] Assuming there is one aperiodic user, message arrival follows a Poisson distribution, the average message arrival interval is 100 time slots, and each message occupies one time slot, then the moment generation function in step 5... The maximum allowable delay is 10 time slots, and the maximum allowable timeout probability is... .

[0140] The operation of the proposed resource allocation method is as follows: Figure 4 and Figure 5 As shown. First, the proposed method should update the set according to steps 2-4. .according to Figure 4 As can be seen from the curve in the image, for this example, Functions with the vertical axis on the left It is a function that is roughly increasing over a large range, and the vertical axis is on the right side. It is roughly a decreasing function. After performing these three steps, a feasible solution set can be obtained. It contains most points in the range [12, 40], such as Figure 4 As shown in the yellow square.

[0141] Next, the proposed method should update the set according to step 5. .according to Figure 5 As can be seen from the curve, except for points 12 and 13, the function... The overall growth rate within the feasible interval is greater than the function. The growth rate. Comparing these two functions, we can obtain... The feasible solution set contains two elements, 12 and 13, such as... Figure 5 The green squares in the image are shown. You can choose any one of them as the output.

[0142] Finally, proceed to step 7 to allocate resources to the machine users. Assume the following is selected: So for periodic users In other words, if So every One time slot is allocated to this user per scheduling cycle. For non-periodic users, it can be calculated that this satisfies... as well as Therefore, 6 time slots will be allocated to this user in each scheduling cycle.

[0143] This example demonstrates that the proposed method can quickly find resource allocation schemes that mix periodic and aperiodic users under latency constraints.

[0144] Example 2

[0145] Based on the same inventive concept as Embodiment 1, the present invention provides a wireless resource allocation device that supports the coexistence of periodic and non-periodic machine users, comprising:

[0146] The machine user classification module is used to classify machine users into periodic and non-periodic types.

[0147] The first resource allocation module is used to allocate resources to the periodic machine users based on the transmission period.

[0148] The second resource allocation module is used to allocate resources to the non-periodic users based on latency statistical performance constraints.

[0149] The rest are the same as in Example 1.

[0150] Example 3

[0151] This invention provides a wireless resource allocation system that supports the coexistence of periodic and non-periodic machine users, including a storage medium and a processor;

[0152] The storage medium is used to store instructions;

[0153] The processor is configured to operate according to the instructions to execute the method according to any one of Embodiment 1.

[0154] Those skilled in the art will understand that embodiments of this application can be provided as methods, systems, or computer program products. Therefore, this application can take the form of a completely hardware embodiment, a completely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, this application can take the form of a computer program product embodied on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0155] This application is described with reference to flowchart illustrations and / or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of this application. It will be understood that each block of the flowchart illustrations and / or block diagrams, and combinations of blocks in the flowchart illustrations and / or block diagrams, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, special-purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, generate instructions for implementing the flowchart... Figure 1 One or more processes and / or boxes Figure 1 A device that provides the functions specified in one or more boxes.

[0156] These computer program instructions may also be stored in a computer-readable storage medium that can direct a computer or other programmable data processing device to function in a particular manner, such that the instructions stored in the computer-readable storage medium produce an article of manufacture including instruction means, which are implemented in a process Figure 1 One or more processes and / or boxes Figure 1 The function specified in one or more boxes.

[0157] These computer program instructions may also be loaded onto a computer or other programmable data processing equipment to cause a series of operational steps to be performed on the computer or other programmable equipment to produce a computer-implemented process, thereby providing instructions that execute on the computer or other programmable equipment for implementing the process. Figure 1 One or more processes and / or boxes Figure 1 The steps of the function specified in one or more boxes.

[0158] The embodiments of the present invention have been described above with reference to the accompanying drawings. However, the present invention is not limited to the specific embodiments described above. The specific embodiments described above are merely illustrative and not restrictive. Those skilled in the art can make many other forms under the guidance of the present invention without departing from the spirit and scope of the claims. All of these forms are within the protection scope of the present invention.

[0159] The foregoing has shown and described the basic principles, main features, and advantages of the present invention. Those skilled in the art should understand that the present invention is not limited to the above embodiments. The embodiments and descriptions in the specification are merely illustrative of the principles of the invention. Various changes and modifications can be made to the invention without departing from its spirit and scope, and all such changes and modifications fall within the scope of the present invention as claimed. The scope of protection of this invention is defined by the appended claims and their equivalents.

Claims

1. A wireless resource allocation method supporting the coexistence of periodic and non-periodic machine users, characterized in that, include: Machine users are categorized into periodic and non-periodic types. Resources are allocated to the periodic machine users based on transmission delay time constraints; Resources are allocated to the non-periodic users based on latency statistical performance constraints. Resources are allocated to the periodic machine users based on the transmission delay period. Resource allocation for the non-periodic users is constrained by latency statistical performance, including: Let Y be the set of all periodic machine users. p The set of non-periodic machine users is Y. ap ; Initialize n = 1, where n is the nth channel. Repeat the following steps until the preset conditions are met: Initialize the set Π of periodic machine users allocated on the nth channel p For Y p At the same time, clear set Y. p ; Initialize the set Π of aperiodic machine users allocated on the nth channel. ap It is an empty set; The feasible solution set for initializing S is the set of all natural numbers, denoted as Λ, where Λ = {1, 2, ...}, and S represents the scheduling period length of the semi-persistent scheduling, which is S time slots. Considering periodic users, perform the first update step on set Λ according to the preset first update rule; Considering periodic users, the set Λ obtained after the first update step is updated according to the preset second update rule; Considering periodic users, a third update step is performed on the set Λ obtained after the second update step according to a preset third update rule; wherein, the first update rule, the second update rule, and the third update rule are all related to the transmission delay period constraint; Considering non-periodic users, the set Λ obtained after the third update step is updated in the fourth update step according to the preset fourth update rule related to the delay statistical performance constraint. Based on the set Λ obtained after the fourth update step, and the set Y ap 、Collection Π p 、Collection Π ap Based on preset logical rules, return to execute the first update step or the fourth update step, or execute the step of allocating resources to machine users; the step of considering periodic users and performing the first update step on set Λ according to the preset first update rule includes: Calculate S max =min{T1,D1,T2,D2,…,T k D k ,,T K D K }, where T k D represents the period of the k-th periodic machine user. k This represents the transmission delay period for the k-th periodic machine user, where K is the total number of periodic machine users. Find all elements in set Λ that are greater than S. max All elements are deleted, completing the first update of set Λ; The second update step, which considers periodic users and applies a preset second update rule to the set Λ obtained after the first update step, includes: For each element S in set Λ after performing the first update step i Perform the following operation: For the k-th periodic machine user, if Then calculate Conversely, if Then calculate After obtaining the value of l, classify the machine user into the l-th category, where U is denoted as l. l The set of periodic machine users classified as class l; calculate in n k This represents the number of time slots required for messages from the k-th periodic machine user. After performing the first update step, all sets Λ that satisfy S will be included in the set Λ. i <R(S) i Delete all elements of ) to complete the second update of the set Λ obtained after the first update step; If the set Λ after the second update step is not empty, then perform the third update step on the set Λ; otherwise, start from set Π. p Remove some users from set Y and put them back into set Y p Then, perform the first update step on the set Λ; The consideration of periodic users, and the third update step performed on the set Λ obtained after the second update step according to the preset third update rule, includes: For each element S in set Λ after performing the second update step i Perform the following operations: Calculate Then calculate Next calculation After performing the second update step, select all sets Λ that satisfy W(S) i Delete all elements that are greater than α, where α is a threshold value, and complete the third update of the set Λ obtained after the second update step; If the set Λ obtained after performing the third update step is not an empty set, then perform the fourth update step on the set Λ; otherwise, proceed from the set Π. p Remove some users from set Y and put them back into set Y p Then, the first update step is performed on the set Λ; considering non-periodic users, the set Λ obtained after the third update step is updated fourthly according to a preset fourth update rule related to delay statistical performance constraints, including: From set Y ap Select an aperiodic machine user j and calculate c for that aperiodic machine user j. * The value of c * Defined as satisfying delay statistical performance constraints The smallest c, where θ is a free parameter greater than 0, c is a real number between 0 and 1, δ is a preset probability threshold, and D j λ represents the delay period of the non-periodic machine user j. j The message arrival density representing the non-periodic machine user, i.e., the average arrival λ per time slot. j Message M j (θ) represents the moment generating function for the length of the message from the aperiodic machine user j, and c * Let it be c j ; All sets Λ obtained after performing the third update step that satisfy... Delete all elements, S i For the i-th element in set Λ, complete the fourth update of set Λ obtained after the third update step; Based on the set Λ obtained after the fourth update step, and the set Y ap 、Collection Π p 、Collection Π ap Based on preset logical rules, return to execute the first update step or the fourth update step, or execute the step of allocating resources to machine users, including: If set Λ is not empty, remove aperiodic machine user j from set Y. ap Move into set Π ap In, then from set Y ap Then select another non-periodic machine user and return to the execution, considering non-periodic users, and perform the fourth update step on the set Λ according to the preset fourth update rule related to the delay statistical performance constraint; If set Λ is an empty set, then set Π ap It is also an empty set, and set Y ap There are also non-periodic machine users who haven't tried it, starting from set Y. ap Then select another non-periodic machine user and return to the execution, considering non-periodic users, and perform the fourth update step on the set Λ according to the preset fourth update rule related to the delay statistical performance constraint; If set Λ is an empty set, then set Π ap It is also an empty set, and set Y ap All non-periodic machine users have been tested, starting from set Π p Remove some users from set Y and put them back into set Y p In the middle, and return to the execution considering periodic users, perform the first update step on the set Λ according to the preset first update rule; If set Λ is an empty set, but set Π ap If the set is not empty, then proceed with the step of allocating resources to the machine user.

2. The wireless resource allocation method supporting the coexistence of periodic and non-periodic machine users as described in claim 1, characterized in that: The allocation of resources to machine users includes: An element is selected from the set Λ according to a certain rule as the value of the scheduling period S, and then resource allocation is performed on the nth channel; For set Π p For a periodic user k in U, if k∈U l Then, every l scheduling cycles, n will be allocated to this user. k One time slot; For set Π ap For non-periodic user j, if l * Is it satisfying l×S×c j The smallest l that is ≥1, then every l * Each scheduling cycle allocates a periodic user Each time slot.

3. A wireless resource allocation device supporting the coexistence of periodic and non-periodic machine users, characterized in that, include: The machine user classification module is used to classify machine users into periodic and non-periodic types. The first resource allocation module is used to allocate resources to the periodic machine users based on the transmission delay period. The second resource allocation module is used to allocate resources to the non-periodic users based on latency statistical performance constraints. Resources are allocated to the periodic machine users based on the transmission delay period. Resource allocation for the non-periodic users is constrained by latency statistical performance, including: Let Y be the set of all periodic machine users. p The set of non-periodic machine users is Y. ap ; Initialize n = 1, where n is the nth channel. Repeat the following steps until the preset conditions are met: Initialize the set Π of periodic machine users allocated on the nth channel p For Y p At the same time, clear set Y. p ; Initialize the set Π of aperiodic machine users allocated on the nth channel. ap It is an empty set; The feasible solution set for initializing S is the set of all natural numbers, denoted as Λ, where Λ = {1, 2, ...}, and S represents the scheduling period length of the semi-persistent scheduling, which is S time slots. Considering periodic users, perform the first update step on set Λ according to the preset first update rule; Considering periodic users, the set Λ obtained after the first update step is updated according to the preset second update rule; Considering periodic users, a third update step is performed on the set Λ obtained after the second update step according to a preset third update rule; wherein, the first update rule, the second update rule, and the third update rule are all related to the transmission delay period constraint; Considering non-periodic users, the set Λ obtained after the third update step is updated in the fourth update step according to the preset fourth update rule related to the delay statistical performance constraint. Based on the set Λ obtained after the fourth update step, and the set Y ap 、Collection Π p 、Collection Π ap Based on preset logical rules, return to execute the first update step or the fourth update step, or execute the step of allocating resources to machine users; the step of considering periodic users and performing the first update step on the set Λ according to the preset first update rule includes: calculating S max =min{T1,D1,T2,D2,…,T k D k ,…,T K D K }, where T k D represents the period of the k-th periodic machine user. k Let S represent the transmission delay period for the k-th periodic machine user, where K is the total number of periodic machine users; then select all values ​​in set Λ greater than S. max All elements are deleted, completing the first update of set Λ; The second update step, which considers periodic users and applies a preset second update rule to the set Λ obtained after the first update step, includes: For each element S in set Λ after performing the first update step i Perform the following operation: For the k-th periodic machine user, if Then calculate Conversely, if Then calculate After obtaining the value of l, classify the machine user into the l-th category, where U is denoted as l. l The set of periodic machine users classified as class l; calculate in n k This represents the number of time slots required for messages from the k-th periodic machine user. After performing the first update step, all sets Λ that satisfy S will be included in the set Λ. i <R(S) i Delete all elements of ) to complete the second update of the set Λ obtained after the first update step; If the set Λ after the second update step is not empty, then perform the third update step on the set Λ; otherwise, start from set Π. p Remove some users from set Y and put them back into set Y p Then, perform the first update step on the set Λ; The consideration of periodic users, and the third update step performed on the set Λ obtained after the second update step according to the preset third update rule, includes: For each element S in set Λ after performing the second update step i Perform the following operations: Calculate Then calculate Next calculation After performing the second update step, select all sets Λ that satisfy W(S) i Delete all elements that are greater than α, where α is a threshold value, and complete the third update of the set Λ obtained after the second update step; If the set Λ obtained after performing the third update step is not an empty set, then perform the fourth update step on the set Λ; otherwise, proceed from the set Π. p Remove some users from set Y and put them back into set Y p Then, the first update step is performed on the set Λ; considering non-periodic users, the set Λ obtained after the third update step is updated fourthly according to a preset fourth update rule related to delay statistical performance constraints, including: From set Y ap Select an aperiodic machine user j and calculate c for that aperiodic machine user j. * The value of c * Defined as satisfying delay statistical performance constraints The smallest c, where θ is a free parameter greater than 0, c is a real number between 0 and 1, δ is a preset probability threshold, and D j λ represents the delay period of the non-periodic machine user j. j The message arrival density representing the non-periodic machine user, i.e., the average arrival λ per time slot. j Message M j (θ) represents the moment generating function for the length of the message from the aperiodic machine user j, and c * Let it be c j ; All sets Λ obtained after performing the third update step that satisfy... Delete all elements, S i For the i-th element in set Λ, complete the fourth update of set Λ obtained after the third update step; Based on the set Λ obtained after the fourth update step, and the set Y ap 、Collection Π p 、Collection Π ap Based on preset logical rules, return to execute the first update step or the fourth update step, or execute the step of allocating resources to machine users, including: If set Λ is not empty, remove aperiodic machine user j from set Y. ap Move into set Π ap In, then from set Y ap Then select another non-periodic machine user and return to the execution, considering non-periodic users, and perform the fourth update step on the set Λ according to the preset fourth update rule related to the delay statistical performance constraint; If set Λ is an empty set, then set Π ap It is also an empty set, and set Y ap There are also non-periodic machine users who haven't tried it, starting from set Y. ap Then select another non-periodic machine user and return to the execution, considering non-periodic users, and perform the fourth update step on the set Λ according to the preset fourth update rule related to the delay statistical performance constraint; If set Λ is an empty set, then set Π ap It is also an empty set, and set Y ap All non-periodic machine users have been tested, starting from set Π p Remove some users from set Y and put them back into set Y p In the middle, and return to the execution considering periodic users, perform the first update step on the set Λ according to the preset first update rule; If set Λ is an empty set, but set Π ap If the set is not empty, then proceed with the step of allocating resources to the machine user.

4. A wireless resource allocation system supporting the coexistence of periodic and non-periodic machine users, characterized in that, Including storage media and processor; The storage medium is used to store instructions; The processor is configured to operate according to the instructions to perform the method according to any one of claims 1-2.

Images