Radio resource allocation method, device and system supporting periodic and non-periodic machine user coexistence

Abstract

The invention discloses a wireless resource allocation method, device and system supporting the coexistence of periodic and non-periodic machine users. The wireless resource allocation method comprises the following steps: dividing the machine users into periodic and non-periodic periods; allocating resources to the periodic machine users by taking a transmission delay period as a constraint; and allocating resources to the non-periodic users by taking the delay statistical performance as a constraint. According to the method and the device, the resource allocation is fixed, dynamic application to the base station is not needed, and idle wireless resources can be fully utilized, so that the resource utilization efficiency is improved, and the signaling complexity is reduced.

Description

Technical Field

[0001] The present invention belongs to the technical field of wireless communications, and in particular relates to a wireless resource allocation method, device and system supporting the coexistence of periodic and non-periodic machine users. Background Art

[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. It is widely used in autonomous driving, telemedicine, industrial automation, virtual reality and other fields that have high requirements for communication reliability and latency. In ultra-reliable and low latency communications, both reliability and latency are required. Reliability requirements are usually achieved through physical layer technologies such as diversity and channel coding; for latency requirements, in addition to physical layer technologies, resource allocation technology is also involved. The present invention focuses on resource allocation technology that meets the latency performance requirements of machine users.

[0003] Existing low-latency resource allocation technologies are mainly divided into two categories. The first category is grant-based resource allocation technology, such as Earliest Deadline First (EDF) scheduling. The second category is grant-free resource allocation technology, such as Semi-Persistent Scheduling (SPS), non-orthogonal multiple access (NOMA), rate splitting multiple access (RSMA) resource allocation, etc.

[0004] The existing low-latency resource allocation method based on the semi-persistent scheduling principle mainly considers allocating a fixed amount of resources to machine users at a fixed time, so that the latency requirements can be met in a very simplified signaling manner. However, the following two aspects are less considered. First, among machine users, there is a large class of machine users whose messages arrive periodically, that is, a message with a fixed format is generated at a fixed interval and is required to be transmitted to the base station within a given period. Second, in addition to periodic users, there may be some machine users whose messages arrive randomly, that is, a message is generated at a random time triggered by a condition, and the transmission timeout probability is required not to be lower than a certain threshold value. Considering these two aspects together, it is very meaningful to design a wireless communication system that supports periodic and non-periodic machine users and propose a corresponding wireless resource allocation method for scenarios with periodic machine users as the main ones and a small number of non-periodic machine users. Summary of the invention

[0005] In view of the above problems, the present invention proposes a method, device and system for allocating wireless resources that support the coexistence of periodic and non-periodic machine users, so as to improve the utilization efficiency of wireless resources.

[0006] In order to achieve the above technical objectives and the above technical effects, the present invention is implemented through the following technical solutions:

[0007] In a first aspect, the present invention provides a method for allocating wireless resources supporting coexistence of periodic and aperiodic machine users, comprising:

[0008] Classify machine users into periodic and aperiodic users;

[0009] Allocating resources to the periodic machine user based on a transmission delay period as a constraint;

[0010] Resources are allocated to the non-periodic users based on the delay statistical performance as a constraint.

[0011] In combination with the first aspect, optionally, allocating resources to the periodic machine user based on a transmission delay period as a constraint; allocating resources to the non-periodic user based on a delay statistical performance as a constraint includes:

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

[0013] initialization , For the Repeat the following steps until the preset conditions are met:

[0014] Initialization allocation is in The set of periodic machine users on the channel for , while clearing the collection ;

[0015] Initialization allocation is in The set of non-periodic machine users on the channel is an empty set;

[0016] initialization The feasible solution set of is the set of all natural numbers, denoted as the set , ,in, The scheduling cycle length representing semi-continuous scheduling is time slots;

[0017] Considering periodic users, the set Perform a first update step;

[0018] Considering periodic users, the set obtained after the first update step is updated according to the preset second update rule Perform a second update step;

[0019] Considering periodic users, the set obtained after the second update step is updated according to the preset third update rule Performing a third updating step; wherein the first updating rule, the second updating rule, and the third updating rule are all related to the transmission delay limit constraint;

[0020] Considering non-periodic users, the set obtained after the third update step is performed according to the preset fourth update rule related to the delay statistical performance constraint Perform the fourth update step;

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

[0022] In combination with the first aspect, optionally, the periodic user is considered, and the set is updated according to a preset first update rule. Perform a first update step, including:

[0023] calculate ,in, Representative The period of a periodic machine user, Representative The transmission delay period of a periodic machine user, is the total number of periodic machine users;

[0024] Will gather All greater than Delete all elements of the set, and complete the First update of .

[0025] In combination with the first aspect, optionally, the periodic user is considered, and the set obtained after the first updating step is updated according to a preset second updating rule. Perform the second update step, including:

[0026] After the first update step, the set Each element in Proceed as follows: For For a periodic machine user, if , then calculate On the contrary, if , then calculate ;get After taking the value of Class, among which, To be classified as the set of periodic machine users of the class;

[0027] calculate ,in , Representative The number of time slots that a periodic machine user's message needs to occupy;

[0028] The set obtained after executing the first update step All satisfied Delete all elements of The second update of;

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

[0030] In combination with the first aspect, optionally, the periodic user is considered, and the set obtained after the second updating step is performed according to a preset third updating rule. Perform the third update step, including:

[0031] After the second update step, the set Each element in Perform the following operations: Calculate , then calculate , then calculate ;

[0032] The set obtained after the second update step is All satisfied Delete all elements of is a threshold value, and the set obtained after the second update step is completed The third update of;

[0033] If the set obtained after executing the third update step If it is not an empty set, Execute the fourth update step; otherwise, from the set Remove some users and put them back into the collection Then, for this collection A first update step is performed.

[0034] In combination with the first aspect, optionally, the non-periodic user is considered, and the set obtained after the third update step is performed according to a preset fourth update rule related to the delay statistical performance constraint. The fourth update includes:

[0035] From the collection Select a non-periodic machine user , for this non-periodic machine user calculate The value of Defined as satisfying the latency statistical performance constraints the smallest ,in is a free parameter greater than 0, is a real number between 0 and 1, is the preset probability threshold, Represents the aperiodic machine user The delay period, Represents the message arrival density of the non-periodic machine user, that is, the average number of messages arriving per time slot Messages, Represents the aperiodic machine user The moment generating function of the length of the message, put this Recorded as ;

[0036] The set obtained after executing the third update step All satisfied Delete all elements of For collection The elements, completing the set obtained after the third update step The fourth update of .

[0037] In combination with the first aspect, optionally, based on the set obtained after performing the fourth updating step , and the collection ,gather ,gather and preset logic rules, returning to execute the first updating step or the fourth updating step, or executing the step of allocating resources to machine users, including:

[0038] If the collection If it is not an empty set, the non-periodic machine users From the collection Move into collection Then from the collection Select another non-periodic machine user from the set, and return to execute the non-periodic user, and update the set according to the fourth update rule related to the delay statistical performance constraint. Perform the fourth update step;

[0039] If the collection is an empty set, a set is also an empty set, and the set There are still non-periodic machine users who have not tried it, so from the collection Select another non-periodic machine user from the set, and return to execute the non-periodic user, and update the set according to the fourth update rule related to the delay statistical performance constraint. Perform the fourth update step;

[0040] If the collection is an empty set, a set is also an empty set, and the set All non-periodic machine users in the set have been tried, so Remove some users and put them back into the collection And return to consider the periodic users, and update the set according to the preset first update rule Perform a first update step;

[0041] If the collection is an empty set, but the set If it is not an empty collection, the step of allocating resources to machine users is executed.

[0042] In combination with the first aspect, optionally, allocating resources to machine users includes:

[0043] From the collection According to some rules, an element is selected as the scheduling period , and then in the Allocate resources on channels;

[0044] For collections Periodic users in For example, if , then every Scheduling cycles are allocated to the user time slots;

[0045] For collections Non-periodic users in For example, if is satisfied The smallest one , then every The scheduling period is allocated to the non-periodic user time slots.

[0046] In a second aspect, the present invention provides a wireless resource allocation device supporting coexistence of periodic and aperiodic machine users, comprising:

[0047] A machine user classification module, for classifying machine users into periodic periodic and non-periodic periodic;

[0048] A first resource allocation module, configured to allocate resources to the periodic machine user based on a transmission delay period as a constraint;

[0049] The second resource allocation module is used to allocate resources to the non-periodic users based on the delay statistical performance as a constraint.

[0050] In a third aspect, the present invention provides a wireless resource allocation system supporting coexistence of periodic and aperiodic 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 execute the method according to any one of the first aspects.

[0053] Compared with the prior art, the present invention has the following beneficial effects:

[0054] In terms of improving resource utilization efficiency, the present invention can fully utilize 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, in the present invention, regardless of whether it is a periodic machine user or a non-periodic machine user, resource allocation is fixed and does not require dynamic application to the base station, thereby greatly reducing signaling complexity. BRIEF DESCRIPTION OF THE DRAWINGS

[0056] In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings required to be used in the embodiments are briefly introduced 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 labor, among which:

[0057] Figure 1 is a flow chart of a wireless resource allocation method provided by an embodiment of the present invention;

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

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

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

[0061] Figure 5 This is the second part of the calculation process provided by the embodiment of the present invention. DETAILED DESCRIPTION

[0062] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0063] In addition, if there are descriptions involving "first", "second", etc. in the embodiments of the present invention, the descriptions of "first", "second", etc. are only used for descriptive purposes and cannot be understood as indicating or suggesting their relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include at least one of the features. In addition, the technical solutions between the various embodiments can be combined with each other, but they must be based on the ability of ordinary technicians in the field to implement them. When the combination of technical solutions is contradictory or cannot be implemented, it should be deemed that such a combination of technical solutions does not exist and is not within the scope of protection required by the present invention.

[0064] Example 1

[0065] An embodiment of the present invention provides a method for allocating wireless resources supporting coexistence of periodic and aperiodic machine users, comprising the following steps:

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

[0067] (2) allocating resources to the periodic machine user based on the transmission delay period as a constraint;

[0068] (3) Allocating resources to the non-periodic users based on the delay statistical performance.

[0069] Based on the wireless resource allocation method supporting the coexistence of periodic and non-periodic machine users in the embodiment 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 a specific implementation of the embodiment of the present invention, the method of allocating resources to the periodic machine user based on the transmission delay period as a constraint and allocating resources to the non-periodic user based on the delay statistical performance as a constraint includes:

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

[0072] initialization , For the Repeat the following steps until the preset conditions are met:

[0073] Initialization allocation is in The set of periodic machine users on the channel for , while clearing the collection ;

[0074] Initialization allocation is in The set of non-periodic machine users on the channel is an empty set;

[0075] initialization The feasible solution set of is the set of all natural numbers, denoted as the set , ,in, The scheduling cycle length representing semi-continuous scheduling is time slots;

[0076] Considering periodic users, the set Perform the first update step (i.e., update the set Make the first update);

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

[0078] Considering periodic users, the set obtained after the second update step is updated according to the preset third update rule Perform the third update step (i.e., update the set Perform a third update); wherein the first update rule, the second update rule, and the third update rule are all related to the transmission delay limit constraint;

[0079] Considering non-periodic users, the set obtained after the third update step is performed according to the preset fourth update rule related to the delay statistical performance constraint Perform the fourth update step (i.e., update the set Make the fourth update);

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

[0081] In a specific implementation of the embodiment of the present invention, the periodic user is considered, and the set is updated according to a preset first update rule. Perform a first update step, including:

[0082] calculate ,in, Representative The period of a periodic machine user, Representative The transmission delay period of a periodic machine user, is the total number of periodic machine users;

[0083] Will gather All greater than Delete all elements of the set, and complete the The first update step.

[0084] In a specific implementation of the embodiment of the present invention, the periodic user is considered, and the set obtained after the first update step is updated according to the preset second update rule. Perform the second update step, including:

[0085] After the first update step, the set Each element in Proceed as follows: For For a periodic machine user, if , then calculate On the contrary, if , then calculate ;get After taking the value of Class, among which, To be classified as the set of periodic machine users of the class;

[0086] calculate ,in , Representative The number of time slots that a periodic machine user's message needs to occupy;

[0087] The set obtained after executing the first update step All satisfied Delete all elements of The second update of;

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

[0089] In a specific implementation of the embodiment of the present invention, the periodic user is considered, and the set obtained after the second update step is performed according to the preset third update rule. Perform the third update step, including:

[0090] After the second update step, the set For each element in , perform the following operations: Calculate , then calculate , then calculate .

[0091] The set obtained after the second update step is All satisfied Delete all elements of is a threshold value, and the set obtained after the second update step is completed The third update of;

[0092] If the set obtained after executing the third update step If it is not an empty set, Execute the fourth update step; otherwise, from the set Remove some users and put them back into the collection Then, for this collection A first update step is performed.

[0093] In a specific implementation of the embodiment of the present invention, the non-periodic user is considered, and the set obtained after the third update step is performed according to the fourth update rule related to the delay statistical performance constraint. 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 the latency statistical performance constraints the smallest ,in is a free parameter greater than 0, is a real number between 0 and 1, is the preset probability threshold, Represents the aperiodic machine user The delay period, Represents the message arrival density of the non-periodic machine user, that is, the average number of messages arriving per time slot Messages, Represents the aperiodic machine user The moment generating function of the length of the message, put this Recorded as ;

[0095] The set obtained after executing the third update step All satisfied Delete all elements of For collection The elements, completing the set obtained after the third update step The fourth update of .

[0096] In a specific implementation of the embodiment of the present invention, based on the set obtained after the fourth updating step , and the collection ,gather ,gather and preset logic rules, returning to execute the first updating step or the fourth updating step, or executing the step of allocating resources to machine users, including:

[0097] If the collection If it is not an empty set, the non-periodic machine user From the collection Move into collection Then from the collection Select another non-periodic machine user from the set, and return to execute the non-periodic user, and update the set according to the fourth update rule related to the delay statistical performance constraint. Perform the fourth update step;

[0098] If the collection is an empty set, a set is also an empty set, and the set There are still non-periodic machine users who have not tried it, so from the collection Select another non-periodic machine user from the set, and return to execute the non-periodic user, and update the set according to the fourth update rule related to the delay statistical performance constraint. Perform the fourth update step;

[0099] If the collection is an empty set, a set is also an empty set, and the set All non-periodic machine users in the set have been tried, so Remove some users and put them back into the collection And return to consider the periodic users, and update the set according to the preset first update rule Perform a first update step;

[0100] If the collection is an empty set, but the set If it is not an empty collection, the step of allocating resources to machine users is executed.

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

[0102] From the collection According to some rules, an element is selected as the scheduling period , and then in the Allocate resources on channels;

[0103] For collections Periodic users in For example, if , then every Scheduling cycles are allocated to the user time slots;

[0104] For collections Non-periodic users in For example, if is satisfied The smallest one , then every Scheduling cycles are allocated to the user time slots.

[0105] The wireless resource allocation method in the embodiment of the present invention is described in detail below in conjunction with a specific implementation manner.

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

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

[0108] In this step, the set of all periodic machine users is , the set of non-periodic machine users is . Starting from the first channel, initialization .

[0109] In this step, the initialization allocation is The set of periodic machine users on the channel for , while clearing the collection , initialize the allocation in the first The set of non-periodic machine users on the channel Is an empty set.

[0110] In this step, initialize The feasible solution set of is the set of all natural numbers, denoted as the set ,in The scheduling cycle length representing semi-continuous scheduling is time slots.

[0111] Step 2: Consider periodic users and To make the first update, Figure 1 as shown in .

[0112] In this step, calculate ,in Representative The period of a periodic machine user, Representative The transmission delay period of a periodic machine user, is the total number of periodic machine users.

[0113] In this step, the collection All greater than Delete all elements of the set and complete the First update of .

[0114] Step 3: Consider periodic users and perform the first update step on the set obtained Perform the second update step, such as Figure 1 as shown in .

[0115] In this step, the set after the first update step is executed Each element in Proceed as follows: For For a periodic machine user, if , then calculate On the contrary, if , then calculate ;get After taking the value of Class, among which, To be classified as A collection of periodic machine users of the class.

[0116] In this step, calculate ,in , Representative The number of time slots that a periodic machine user's message needs to occupy.

[0117] In this step, the set obtained after the first update step is executed All satisfied Delete all elements of Second update of .

[0118] In this step, if the set after the second update step is If it is not an empty set, continue to execute the following steps; otherwise, Remove some users and put them back into the collection Then go back to step 2. There are many possible choices for the rules to be removed. For example, all periodic machine users can be removed according to Sort the values ​​of from large to small, and then remove 3 from the head each time. For another example, you can choose randomly.

[0119] Step 4: Consider periodic users and perform the second update step on the set obtained Perform the third update step, such as Figure 1 as shown in .

[0120] In this step, the set after the second update step is executed Perform the following operations on each element in . Calculate , then calculate , then calculate .

[0121] In this step, the set obtained after the second update step is executed All satisfied Delete all elements of is a threshold value, and the set obtained after completing the second update step The third update of .

[0122] In this step, if the set obtained after executing the third update step is If it is not an empty set, continue to execute the following steps; otherwise, Remove some users and put them back into the collection and then return to step 2.

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

[0124] In this step, from Select a non-periodic machine user . Calculate the non-periodic machine user The value of The value of is defined as satisfying the constraint the smallest ,in is a real number between 0 and 1, is the preset probability threshold, Represents the aperiodic machine user The delay period, Represents the message arrival density of the non-periodic machine user, that is, the average number of messages arriving per time slot Messages, represents the moment generating function of the length of the message of the aperiodic machine user. Recorded as .

[0125] In this step, the set obtained after executing the third update step Update, that is, the set obtained after executing the third update step All satisfied Delete all elements.

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

[0127] In this step, if the set If it is not an empty set, the non-periodic machine users From the collection Move into collection Then from the collection Then select another non-periodic machine user from the list and return to step 5. There are many possible choices for the reselection rule. For example, all non-periodic machine users can be selected according to The values ​​of are sorted from large to small, and then the user ranked first is selected each time. For another example, random selection can be performed.

[0128] In this step, if the set is an empty set, a set is also an empty set, and the set There are still non-periodic machine users who have not tried it, so from the collection Select another non-periodic machine user and return to step 5.

[0129] In this step, if the set is an empty set, a set is also an empty set, and the set All non-periodic machine users in the set have been tried, so Remove some users and put them back into the collection and then return to step 2.

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

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

[0132] In this step, from the set According to some rules, an element is selected as the scheduling period , and then in the Resources are allocated on channels.

[0133] In this step, for the set Periodic users in For example, if , then every Scheduling cycles are allocated to the user time slots.

[0134] In this step, for the set Non-periodic users in For example, if is satisfied The smallest one , then every Scheduling cycles are allocated to the user time slots.

[0135] Step 8: Increase by 1, and then return to step 2 until the set and Until all are empty.

[0136] The following is Example 2.

[0137] exist Figure 3 An example is provided to illustrate the resource allocation method proposed in the implementation of the present invention. In this example, the time axis is divided into There are three periodic machine users, with periods of 5, 6, and 10 time slots, respectively. The deadline is the same as the period, and 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. In addition, the fourth user in this example represents a non-periodic user, and two time slots starting from the end of each scheduling interval are allocated to this user.

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

[0139] Assume that there is 1 non-periodic user, the arrival of messages follows Poisson distribution, the average message arrival interval is 100 time slots, and each message occupies 1 time slot, then the moment generating function in step 5 is , the maximum allowed delay is 10 time slots, and the maximum allowed timeout probability is .

[0140] The operation of the proposed resource allocation method is as follows Figure 4 and Figure 5 First, the proposed method should update the set according to steps 2-4 .according to Figure 4 It can be seen from the curve in that for this example, , the function with the vertical axis on the left It is a roughly increasing function in the large value range, and the function with the vertical axis on the right It is roughly a decreasing function. After completing these three steps, we can get a feasible solution set contains most of the 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 of . Comparing these two functions, we can get The feasible solution set of contains two elements 12 and 13, such as Figure 5 You can select any one of them as output.

[0142] Finally, execute step 7 to allocate resources to machine users. , then for periodic users For example, if , then every The scheduling cycle allocates 1 time slot to the user. For non-periodic users, it can be calculated that as well as , then 6 time slots are allocated to the user in each scheduling cycle.

[0143] This example shows that the proposed method can quickly find resource allocation solutions for a mixture of periodic and aperiodic users under delay constraints.

[0144] Example 2

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

[0146] A machine user classification module, for classifying machine users into periodic periodic and non-periodic periodic;

[0147] A first resource allocation module, configured to allocate resources to the periodic machine user based on a transmission deadline as a constraint;

[0148] The second resource allocation module is used to allocate resources to the non-periodic users based on the delay statistical performance as a constraint.

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

[0150] Example 3

[0151] An embodiment of the present invention provides a wireless resource allocation system supporting coexistence of periodic and aperiodic 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 the embodiments 1.

[0154] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may adopt the form of a complete hardware embodiment, a complete software embodiment, or an embodiment combining software and hardware. Moreover, the present application may adopt the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk storage, CD-ROM, optical storage, etc.) containing computer-usable program codes.

[0155] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or box in the flowchart and / or block diagram, as well as the combination of the processes and / or boxes in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to generate a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 A process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0156] These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing device to operate in a specific manner, so that the instructions stored in the computer-readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 A process or multiple processes and / or boxes Figure 1 A function specified in one or more boxes.

[0157] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operating steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing instructions for implementing the process in the computer or other programmable device. Figure 1 A process or multiple processes and / or boxes Figure 1 The steps for the functions specified in one or more boxes.

[0158] The embodiments of the present invention are described above in conjunction with the accompanying drawings, but the present invention is not limited to the above-mentioned specific implementation methods. The above-mentioned specific implementation methods are merely illustrative and not restrictive. Under the enlightenment of the present invention, ordinary technicians in this field can also make many forms without departing from the scope of protection of the purpose of the present invention and the claims, which all fall within the protection of the present invention.

[0159] The above shows and describes the basic principles and main features of the present invention and the advantages of the present invention. It should be understood by those skilled in the art that the present invention is not limited to the above embodiments. The above embodiments and descriptions are only for explaining the principles of the present invention. Without departing from the spirit and scope of the present invention, the present invention may have various changes and improvements, which fall within the scope of the present invention to be protected. The scope of protection of the present invention is defined by the attached claims and their equivalents.

Claims

1. A wireless resource allocation method supporting coexistence of periodic and aperiodic machine users, characterized in that: include: Classify machine users into periodic and aperiodic users; Allocating resources to the periodic machine user based on a transmission delay period as a constraint; Resources are allocated to the non-periodic users based on the delay statistical performance as a constraint.

2. A method for allocating wireless resources supporting coexistence of periodic and aperiodic machine users according to claim 1, characterized in that: allocating resources to the periodic machine users based on the transmission delay period as a constraint; Allocating resources to the non-periodic user based on delay statistical performance as a constraint, including: Let the set of all periodic machine users be , the set of non-periodic machine users is ; initialization , For the Repeat the following steps until the preset conditions are met: Initialization allocation is in The set of periodic machine users on the channel for , while clearing the collection ; Initialization allocation is in The set of non-periodic machine users on the channel is an empty set; initialization The feasible solution set of is the set of all natural numbers, denoted as the set , ,in, The scheduling cycle length representing semi-continuous scheduling is time slots; Considering periodic users, the set Perform a first update step; Considering periodic users, the set obtained after the first update step is updated according to the preset second update rule Perform a second update step; Considering periodic users, the set obtained after the second update step is updated according to the preset third update rule Performing a third updating step; wherein the first updating rule, the second updating rule, and the third updating rule are all related to the transmission delay limit constraint; Considering non-periodic users, the set obtained after the third update step is performed according to the preset fourth update rule related to the delay statistical performance constraint Perform the fourth update step; Based on the set obtained after the fourth update step , and the collection ,gather ,gather and preset logic rules, return to execute the first updating step or the fourth updating step, or execute the step of allocating resources to machine users.

3. A method for allocating wireless resources supporting coexistence of periodic and aperiodic machine users according to claim 2, characterized in that: The periodic users are considered, and the set is updated according to the preset first update rule. Perform a first update step, including: calculate ,in, Representative The period of a periodic machine user, Representative The transmission delay period of a periodic machine user, is the total number of periodic machine users; Will gather All greater than Delete all elements of the set, and complete the First update of .

4. A method for allocating wireless resources supporting coexistence of periodic and aperiodic machine users according to claim 3, characterized in that: The periodic user is considered, and the set obtained after the first updating step is updated according to the preset second updating rule. Perform the second update step, including: After the first update step, the set Each element in Proceed as follows: For For a periodic machine user, if , then calculate On the contrary, if , then calculate ;get After taking the value of Class, among which, To be classified as the set of periodic machine users of the class; calculate ,in , Representative The number of time slots that a periodic machine user's message needs to occupy; The set obtained after the first update step is All satisfied Delete all elements of The second update of; If the set after the second update step is If it is not an empty set, then Perform the third update step; otherwise, from the set Remove some users and put them back into the collection Then, for this collection A first update step is performed.

5. A method for allocating wireless resources supporting coexistence of periodic and aperiodic machine users according to claim 4, characterized in that: The periodic user is considered, and the set obtained after the second update step is performed according to the preset third update rule Perform the third update step, including: After the second update step, the set Each element in Perform the following operations: Calculate , then calculate , then calculate ; The set obtained after the second update step is All satisfied Delete all elements of is a threshold value, and the set obtained after the second update step is completed The third update of; If the set obtained after executing the third update step If it is not an empty set, Execute the fourth update step; otherwise, from the set Remove some users and put them back into the collection Then, for this collection A first update step is performed.

6. A method for allocating wireless resources supporting coexistence of periodic and aperiodic machine users according to claim 5, characterized in that: The non-periodic users are considered, and the set obtained after the third updating step is performed according to the fourth updating rule related to the delay statistical performance constraint. The fourth update includes: From the collection Select a non-periodic machine user , for this non-periodic machine user calculate The value of Defined as satisfying the latency statistical performance constraints the smallest ,in is a free parameter greater than 0, is a real number between 0 and 1, is the preset probability threshold, Represents the aperiodic machine user The delay period, Represents the message arrival density of the non-periodic machine user, that is, the average number of messages arriving per time slot Messages, Represents the aperiodic machine user The moment generating function of the length of the message, put this Recorded as ; The set obtained after executing the third update step All satisfied Delete all elements of For collection The elements, completing the set obtained after the third update step The fourth update of .

7. A method for allocating wireless resources supporting coexistence of periodic and aperiodic machine users according to claim 6, characterized in that: Based on the set obtained after the fourth update step , and the collection ,gather ,gather and preset logic rules, returning to execute the first updating step or the fourth updating step, or executing the step of allocating resources to machine users, including: If the collection If it is not an empty set, the non-periodic machine users From the collection Move into collection Then from the collection Select another non-periodic machine user from the set, and return to execute the non-periodic user, and update the set according to the fourth update rule related to the delay statistical performance constraint. Perform the fourth update step; If the collection is an empty set, a set is also an empty set, and the set There are still non-periodic machine users who have not tried it, so from the collection Select another non-periodic machine user from the set, and return to execute the non-periodic user, and update the set according to the fourth update rule related to the delay statistical performance constraint. Perform the fourth update step; If the collection is an empty set, a set is also an empty set, and the set All non-periodic machine users in the set have been tried, so Remove some users and put them back into the collection And return to consider the periodic users, and update the set according to the preset first update rule Perform a first update step; If the collection is an empty set, but the set If it is not an empty collection, the step of allocating resources to machine users is executed.

8. According to the method for allocating wireless resources supporting coexistence of periodic and aperiodic machine users according to claim 7, it is characterized in that: The allocating resources to machine users includes: From the collection According to some rules, an element is selected as the scheduling period , and then in the Allocate resources on channels; For collections Periodic users in For example, if , then every Scheduling cycles are allocated to the user time slots; For collections Non-periodic users in For example, if is satisfied The smallest one , then every The scheduling period is allocated to the non-periodic user time slots.

9. A wireless resource allocation device supporting coexistence of periodic and aperiodic machine users, characterized in that: include: A machine user classification module, for classifying machine users into periodic periodic and non-periodic periodic; A first resource allocation module, configured to allocate resources to the periodic machine user based on a transmission delay period as a constraint; The second resource allocation module is used to allocate resources to the non-periodic users based on the delay statistical performance as a constraint.

10. A wireless resource allocation system supporting coexistence of periodic and aperiodic machine users, characterized in that: including storage media and processors; 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-8.

Images