A resource allocation method and device, electronic equipment and readable storage medium
By constructing objective functions and constraints, optimizing the ratio of vehicle-to-everything (V2X) communication channels and transmission power, the problem of high data transmission latency was solved, achieving a balance between throughput and latency, and improving resource utilization.
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- CHINA MOBILE M2M
- Filing Date
- 2022-06-24
- Publication Date
- 2026-06-12
AI Technical Summary
In existing vehicle-to-everything (V2X) communication resource allocation schemes, data transmission latency is relatively high, resources are not effectively utilized, resulting in insufficient throughput.
By constructing the first objective function and constraints, the target channel ratio and transmit power of the communication channel are determined, the resource allocation of V2I and V2V links is optimized, and optimization techniques such as Lyapunov optimization algorithm and particle swarm optimization algorithm are used to dynamically allocate resources to reduce latency.
While increasing the total throughput of the communication channel, it effectively reduced data transmission latency, improved resource utilization and system performance.
Smart Images

Figure CN117354928B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of wireless communication technology, and in particular to a resource allocation method, apparatus, electronic device, and readable storage medium. Background Technology
[0002] The Internet of Vehicles (IoV) integrates automotive, information, and communication technologies. Using moving vehicles as sensing objects, it leverages the latest communication technologies to achieve communication connections between vehicles (V2V), between vehicles and base station infrastructure (V2I), and between vehicles and people. Communication resources in the IoV mainly include spectrum and power resources. The allocation of communication resources in the IoV aims to maximize resource utilization while meeting users' quality of service requirements through reasonable resource allocation. However, existing solutions typically only consider the throughput of V2V links during resource allocation, which can easily lead to significant data transmission latency. Summary of the Invention
[0003] This application provides a resource allocation method, apparatus, electronic device, and readable storage medium to solve the problem of large data transmission latency.
[0004] In a first aspect, embodiments of this application provide a resource allocation method, including:
[0005] Obtain the first objective function and the corresponding constraints of the first objective function, wherein the first objective function is related to the total throughput and transmission delay of the communication channel;
[0006] Based on the first objective function and the constraints, the target channel ratio of the communication channel is determined;
[0007] Based on the target channel ratio, a first ratio of orthogonal channels and a second ratio of shared channels are determined in the communication channels. The orthogonal channels are used for communication of at least one vehicle-to-base station facility V2I link, and the shared channels are used for communication of at least one vehicle-to-vehicle V2V link.
[0008] Based on the first ratio and the pre-acquired communication channel parameters, the resource allocation parameters of the at least one V2I link are determined;
[0009] Based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function, the target transmit power of each of the at least one V2I link and the at least one V2V link is determined so that the value of the first objective function is minimized under the target channel ratio, the resource allocation parameters, and the target transmit power.
[0010] Secondly, embodiments of this application also provide a resource allocation device, characterized in that it includes:
[0011] The first acquisition module is used to acquire a first objective function and the constraints corresponding to the first objective function, wherein the first objective function is associated with the total throughput and transmission delay of the communication channel.
[0012] The first determining module is used to determine the target channel ratio of the communication channel based on the first objective function and the constraints.
[0013] The second determining module is used to determine a first proportion of orthogonal channels and a second proportion of shared channels in the communication channels based on the target channel proportion. The orthogonal channels are used for communication of at least one vehicle-to-base station facility V2I link, and the shared channels are used for communication of at least one vehicle-to-vehicle V2V link.
[0014] The third determining module is used to determine the resource allocation parameters of the at least one V2I link based on the first ratio and the pre-acquired communication channel parameters.
[0015] The fourth determining module is used to determine the target transmit power of each of the at least one V2I link and the at least one V2V link based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function, so as to minimize the value of the first objective function under the target channel ratio, the resource allocation parameters, and the target transmit power.
[0016] Thirdly, embodiments of this application also provide an electronic device, including a processor and a memory, wherein the memory stores a program or instructions executable on the processor, and the program or instructions, when executed by the processor, implement the steps of the resource allocation method as described in the first aspect.
[0017] Fourthly, embodiments of this application also provide a readable storage medium storing a program or instructions that, when executed by a processor, implement the steps of the resource allocation method as described in the first aspect.
[0018] In this embodiment, a first objective function and its corresponding constraints are obtained. The first objective function is associated with the total throughput and transmission delay of the communication channel. Based on the first objective function and the constraints, the target channel ratio, the first ratio of orthogonal channels and the second ratio of shared channels in the communication channel, the resource allocation parameters of the at least one V2I link, and the target transmit power of each link are determined sequentially to minimize the value of the first objective function under the target channel ratio, the resource allocation parameters, and the target transmit power. This allows for resource allocation for each link that increases the total throughput of the communication channel while reducing transmission delay. Attached Figure Description
[0019] To more clearly illustrate the technical solutions of this application, the drawings used in the description of the embodiments or prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other drawings can be obtained based on these drawings without creative effort.
[0020] Figure 1 This is a flowchart illustrating a resource allocation method provided in an embodiment of this application;
[0021] Figure 2 This is a schematic diagram of the structure of a resource allocation device provided in an embodiment of this application;
[0022] Figure 3 This is a schematic diagram of the structure of an electronic device provided in an embodiment of this application. Detailed Implementation
[0023] The technical solutions of the embodiments of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.
[0024] The terms "first," "second," etc., used in the embodiments of this application are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. Furthermore, the terms "comprising" and "having," and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or device that includes a series of steps or units is not necessarily limited to those steps or units explicitly listed, but may include other steps or units not explicitly listed or inherent to these processes, methods, products, or devices. Additionally, the use of "and / or" in this application indicates at least one of the connected objects, such as A and / or B and / or C, representing seven possibilities: including A alone, B alone, C alone, and the presence of both A and B, both B and C, both A and C, and the presence of A, B, and C.
[0025] In a vehicle-to-everything (V2X) communication system, communication resources can be allocated to each V2V link and each V2I link to achieve the allocation of communication resources.
[0026] Please see Figure 1 , Figure 1 This is a flowchart illustrating a resource allocation method provided in an embodiment of this application, as shown below. Figure 1 As shown, it includes the following steps:
[0027] Step 101: Obtain the first objective function and the constraints corresponding to the first objective function. The first objective function is related to the total throughput and transmission delay of the communication channel.
[0028] The first objective function, when constructed, can be associated with the total throughput and transmission delay of the communication channel, so that the total throughput and transmission delay of the communication channel serve as the optimization targets of the first objective function. For example, a smaller value of the first objective function indicates a larger total throughput and a smaller transmission delay of the communication channel.
[0029] It can be understood that the above constraints are the conditions that the first objective function must satisfy. For example, when the above constraints are for the value of the first objective function or the parameter value of the first objective function, the corresponding function value or parameter value must satisfy the above constraints during the optimization or solution process of the first objective function.
[0030] Optionally, obtaining the first objective function and the corresponding constraints in step 101 specifically includes:
[0031] A second objective function is established, which is correlated with the total throughput and transmission delay of the communication channel within a preset time period;
[0032] Based on the Lyapunov optimization algorithm, the second objective function is transformed into the first objective function;
[0033] Based on the first objective function, obtain the constraints corresponding to the first objective function.
[0034] The second objective function can be a function constructed to improve the total throughput of the system while reducing the transmission latency of the system communication links. The second objective function is associated with the total throughput and transmission latency of the communication channels within a preset time period, and then the resource allocation of each channel is optimized based on the second objective function.
[0035] Specifically, we can model each communication link in the vehicle-to-everything (V2I) network, including I V2I communication links and V V2V communication links; the second objective function can be expressed as:
[0036]
[0037] Among them, P v T represents the maximum tolerable communication latency for the v-th V2V link. v (t) represents the data transmission delay of the v-th V2V link over the transmission interval, γ represents the instantaneous throughput factor of the system, and μ represents the delay factor of the V2V communication link of the system.
[0038] Since the amount of data in each transmission link on the future transmission time slot is unpredictable, the Lyapunov optimization algorithm can be used to transform the joint optimization objective of the system throughput and delay with a preset time average into the optimization objective of minimizing the upper bound of the Lyapunov offset penalty on a single transmission time slot.
[0039] The second objective function is transformed into the first objective function using the Lyapunov optimization algorithm:
[0040]
[0041] Where K represents a non-negative constant that balances the offset with the first objective function, C(t) represents the sum of the instantaneous transmission rates of each communication link in the t-th transmission slot, μ represents the delay factor of the system's V2V communication link, and P v T represents the maximum tolerable communication latency for the v-th V2V link. v Q(t) represents the data transmission delay of the v-th V2V link in the t-th transmission time slot. v (t) represents the queue length of the v-th V2V link in the t-th transmission slot, Q i (t) represents the queue length of the i-th V2I link in the t-th transmission slot, Z v Z(t) represents the number of data packets successfully transmitted on the v-th V2V link in the t-th transmission time slot. i(t) represents the number of data packets successfully transmitted on the i-th V2I link in the t-th transmission slot, D v (t) represents the queue vector of the v-th V2V link in the t-th transmission slot, D i (t) represents the queue vector of the i-th V2I link in the t-th transmission slot, R i These represent the expected rates of the i-th V2I link.
[0042] It is understandable that the constraints corresponding to the first objective function can be obtained. Under the condition that the constraints are met, the resources of each communication link are allocated based on the first objective function to improve the total throughput of the communication channel while reducing the data transmission latency.
[0043] Step 102: Based on the first objective function and the constraints, determine the target channel ratio of the communication channel.
[0044] Step 103: Determine the first proportion of orthogonal channels and the second proportion of shared channels in the communication channels based on the target channel proportion. The orthogonal channels are used for communication of at least one vehicle-to-base station facility V2I link, and the shared channels are used for communication of at least one vehicle-to-vehicle V2V link.
[0045] It is understandable that in the vehicle-to-everything (V2I) system, the V2I link is the link between the vehicle and the base station facility, and the V2V link is the link between vehicles. The transmission rate and other requirements of the V2I link are higher than those of the V2V link. Orthogonal channels can be used for V2I link communication, and shared channels can be used for V2V link communication.
[0046] In the case of both orthogonal channels and shared channels, the channel ratio of the aforementioned communication channels can be used to represent the channel ratio of the two types. For example, the ratio of orthogonal channels to shared channels can be used as the channel ratio, or the ratio of orthogonal channels in the communication channel can be used as the channel ratio (in which case, the sum of the ratio of orthogonal channels in the communication channel and the ratio of shared channels in the communication channel is 1), or the ratio of shared channels in the communication channel can be used as the channel ratio (in which case, the sum of the ratio of shared channels in the communication channel and the ratio of orthogonal channels in the communication channel is 1). Therefore, based on the aforementioned target channel ratio, a first ratio of orthogonal channels and a second ratio of shared channels in the aforementioned communication channels can be determined.
[0047] Step 104: Based on the first ratio and the pre-acquired communication channel parameters, determine the resource allocation parameters of the at least one V2I link.
[0048] The aforementioned pre-acquired communication channel parameters may include the total number of communication channels, the channel bandwidth of each channel, etc. Through the aforementioned first ratio, it is possible to determine which channels in the communication channels are used as orthogonal channels for V2I link communication, as well as the resources that can be allocated to the V2I link.
[0049] Step 105: Based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function, determine the target transmit power of each of the at least one V2I link and the at least one V2V link, so as to minimize the value of the first objective function under the target channel ratio, the resource allocation parameters, and the target transmit power.
[0050] Before determining the target transmit power for each link, the first ratio, the second ratio, and the resource allocation parameters mentioned above have all been determined. Thus, the transmit power of each link is allocated, and the corresponding transmit power is determined as the target transmit power while minimizing the value of the first objective function.
[0051] In this embodiment, a first objective function and its corresponding constraints are obtained. The first objective function is associated with the total throughput and transmission delay of the communication channel. Based on the first objective function and the constraints, the target channel ratio, the first ratio of orthogonal channels and the second ratio of shared channels in the communication channel, the resource allocation parameters of the at least one V2I link, and the target transmit power of each link are determined sequentially to minimize the value of the first objective function under the target channel ratio, the resource allocation parameters, and the target transmit power. This allows for resource allocation for each link that increases the total throughput of the communication channel while reducing transmission delay.
[0052] Optionally, the constraint conditions include at least one of the following:
[0053] The first constraint condition is used to constrain the transmission rate of each link, and the total throughput is determined based on the transmission rate of the links within the communication channel.
[0054] The second constraint condition is used to constrain the first ratio, the second ratio, and the resource allocation parameters;
[0055] The third constraint condition is used to constrain the transmit power of each link;
[0056] The fourth constraint condition is used to constrain the transmission delay.
[0057] The first, second, third, and fourth constraints mentioned above can be used to constrain different parameters.
[0058] Specifically, the first constraint mentioned above can be addressed by setting a minimum transmission rate, meaning that the transmission rate of each link must be greater than the minimum transmission rate mentioned above, in order to ensure the communication effect of each link.
[0059] The second constraint can set a value range for the first ratio and the second ratio respectively. The range can be determined according to actual needs. For example, the values of the first ratio and the second ratio should both be between 0 and 1. The resource allocation parameters can include parameters for representing the resources of each V2I link. The total resources of all V2I links can be restricted. For example, the total should be less than or equal to the allocable resources.
[0060] The third constraint mentioned above can limit the range of transmit power values for each link. For example, if a maximum transmit power is set, then the transmit power of each link must be less than or equal to that maximum transmit power. Furthermore, different maximum transmit powers can be set for V2I links and V2V links respectively.
[0061] The fourth constraint mentioned above can be limited by restricting the queue overflow probability of each link. For example, the transmission delay of each link in a transmission time slot can be constrained by calculating the probability that the queue length of each link exceeds the maximum length limit of the link.
[0062] In this embodiment, the first constraint is used to constrain the transmission rate of each link; the second constraint is used to constrain the first ratio, the second ratio, and the resource allocation parameters; the third constraint is used to constrain the transmission power of each link; and the fourth constraint is used to constrain the transmission delay. By determining the optimal solution of the first objective function through the above constraints, the resource allocation result can satisfy the above constraints, thereby improving the accuracy of resource allocation.
[0063] Optionally, the method further includes the following steps:
[0064] Obtain the transmission buffer queue for each link;
[0065] Based on the transmission buffer queue, calculate the queue length for each link;
[0066] The transmission delay is calculated based on the queue length.
[0067] In the Internet of Vehicles (IoV), a transmission buffer queue can be configured for each link to analyze the latency of the corresponding link. Specifically, the newly arriving tasks in each communication link within each transmission time slot follow a Poisson distribution. Therefore, the queue length of each link at the beginning of the next transmission time slot is equal to the queue length at the beginning of the current time slot plus the amount of newly arriving data in that time slot minus the amount of data successfully transmitted in that time slot.
[0068] In this embodiment, by obtaining the transmission buffer queue of each link, calculating the queue length of each link based on the transmission buffer queue, and calculating the transmission delay based on the queue length, the transmission delay of each link can be determined, thereby ensuring that the resources allocated to each link can meet the transmission delay requirements during the resource allocation process.
[0069] Optionally, determining the target channel ratio of the communication channel based on the first objective function and the constraints in step 102 specifically includes:
[0070] Based on the constraints, the positions of multiple particles are iteratively updated a preset number of times using the particle swarm optimization algorithm to obtain the target positions of the multiple particles.
[0071] Based on the target positions of the plurality of particles and the first objective function, the target position of the target particle is determined, wherein the target positions of the plurality of particles include the target position of the target particle.
[0072] The target channel ratio of the communication channel is determined based on the target position of the target particle.
[0073] In the particle swarm optimization algorithm, the optimal particle position is determined through iterative updates of multiple particle positions.
[0074] Specifically, in this embodiment, the particle's velocity and position, individual optimal position, and global optimal position are first initialized, where the particle's position must satisfy the aforementioned constraints. Then, the particle's acceleration is updated as an inertia weight factor in each iteration. Next, based on the current particle position and velocity, the particle's next position is updated, along with its velocity, individual optimal position, and global optimal position. By repeating this process for a preset number of iterations, multiple target positions for the particles are obtained. During this process, the first objective function described above can be used to evaluate the position of each particle to determine the optimal position of the target particle.
[0075] In addition, the above-mentioned iterative update process of the positions of multiple particles can be stopped after a preset number of iterations, or the iteration can be stopped by calculating whether the function value of the first objective function corresponding to the positions of the particles in the previous two iterations is less than a preset threshold. If it is less than the preset threshold, it can be considered that the update of the particle position is close to the target position and the iteration can be stopped.
[0076] It should be noted that the position of the aforementioned particle can represent the channel ratio of the aforementioned communication channel, and the target channel ratio can be confirmed by confirming the target position of the aforementioned target particle.
[0077] Optionally, the Nth update of the positions of the plurality of particles includes:
[0078] Based on the constraints, the particle swarm optimization algorithm is used to obtain the Nth position to be updated of the plurality of particles.
[0079] Based on the Nth position to be updated, update the population aggregation degree and similarity of the multiple particles;
[0080] Based on the population aggregation degree and the similarity, the positions of the multiple particles are updated for the Nth time;
[0081] Wherein, N is a positive integer less than or equal to the preset number of times.
[0082] In this embodiment, during the iterative update of particle positions, the positions of the multiple particles can be updated based on their population aggregation degree and similarity. Specifically, the Nth position to be updated for a particle can correspond to a parameter value representing the channel ratio of the communication channel. If this parameter value is less than the product of the population aggregation degree and similarity of the multiple particles, a random value can be selected from the particle's value range as the position for the next iteration. If the parameter value is greater than or equal to the product of the population aggregation degree and similarity of the multiple particles, the aforementioned position to be updated can be used as the position for the next iteration.
[0083] This avoids premature convergence of particle positions during the update process, allowing the target position to be determined over multiple iterations and improving the accuracy of the results.
[0084] Optionally, the step 104, which involves determining the resource allocation parameters for the at least one V2I link based on the first ratio and pre-acquired communication channel parameters, specifically includes:
[0085] Based on the first ratio and the pre-acquired communication channel parameters, the allocatable resources of the at least one V2I link are determined;
[0086] The resource allocation parameters for the at least one V2I link are determined using the knapsack algorithm.
[0087] The available resources of at least one V2I link are used as the capacity of the knapsack, each V2I link represents an item, the number of orthogonal channels required for each V2I link is used as the volume of the corresponding item, and the preset minimum transmission rate of each V2I link is used as the value of the corresponding item.
[0088] The first ratio mentioned above refers to the proportion of orthogonal channels in the communication channel. The pre-acquired communication channel parameters may include the total number of communication channels, channel bandwidth, etc., thereby determining the channel resources of the orthogonal channels in the communication channel, that is, the allocatable resources of at least one V2I link.
[0089] It is understandable that in the knapsack algorithm, the goal is to select items to maximize the total value of the items in the knapsack, thus determining which items to put in the knapsack. In this application, by using the allocable resources of at least one V2I link as the capacity of the knapsack, with each V2I link representing one item, the number of orthogonal channels required for each V2I link being used as the volume of the corresponding item, and the preset minimum transmission rate for each V2I link being used as the value of the corresponding item, resource utilization can be improved while satisfying the instantaneous transmission rate and latency requirements of each V2I link as much as possible.
[0090] Optionally, step 105, which involves determining the target transmit power of the at least one V2I link and each of the at least one V2V links based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function, specifically includes:
[0091] The transmit power of the at least one V2I link and the transmit power of the at least one V2V link are updated using a binary search algorithm to obtain multiple transmit powers for each link;
[0092] Based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function, the target transmission power for each link among the plurality of transmission powers is determined.
[0093] For the transmit power of each link, a maximum transmit power can first be set. A binary search algorithm is then used to continuously search for an intermediate value within the range of 0 to the maximum transmit power. This intermediate value is then substituted into the first objective function to obtain the corresponding function value for confirmation. It can be understood that before using the binary search algorithm to determine the target transmit power for each link, the values of the first ratio, the second ratio, and the resource allocation parameters mentioned above are already determined. These values can be directly or indirectly substituted into the first objective function along with the corresponding transmit power to obtain the corresponding function value.
[0094] It should be noted that the stopping condition of the above binary search algorithm can be a preset number of iterations based on empirical values, or the search can stop when the function value obtained in two consecutive iterations is less than a preset value, thereby quickly obtaining the target transmission power.
[0095] For better understanding, a specific example is as follows:
[0096] This application also provides a dynamic resource allocation method, which specifically includes the following steps:
[0097] Step S1: Build a vehicle-to-everything (V2X) communication system model, which includes one V2X communication link and five V2V communication links;
[0098] Step S2: Based on the vehicle-to-everything (V2I) communication system model built in Step S1, construct the V2I and V2V communication link transmission mechanism and queuing model;
[0099] Specifically, the V2I and V2V communication link transmission mechanism in step S2 is as follows: the number of communication channels in the system is set to M, the bandwidth of each channel is BHz, and the channel resources of the entire system are divided into two parts: orthogonal channels and shared channels. I V2I communication links use orthogonal channel resources for communication, and V V2V communication links use shared channel resources for communication.
[0100] To analyze the latency of V2I and V2V communication links, a data transmission buffer queue is configured on each V2I and V2V communication link. The queuing model for V2I and V2V communication links is as follows:
[0101] In each transmission time slot, the newly arriving tasks in each communication link follow a Poisson distribution. Therefore, the queue length Q(t) of each link at the beginning of the next transmission time slot is equal to the queue length at the beginning of the current time slot plus the amount of newly arriving data in that time slot minus the amount of data successfully transmitted in that time slot.
[0102] Step S3: Based on the communication system model in Step S1 and the transmission mechanism in Step S2, determine the transmission rate of each V2I link and V2V link, as well as the instantaneous total transmission rate of the system.
[0103] The specific steps for determining the link transmission rate and the system's instantaneous total transmission rate in step S3 are as follows:
[0104] Step S31: Based on the transmit power P obtained in the transmission time slot of the Vth link (V2V), v (t) is used to obtain the instantaneous signal-to-interference-plus-noise ratio (SINR) of this link. v (t); Obtain the allocation ratio α of the shared channel on this transmission time slot; According to Shannon's formula, take the logarithm of the signal-to-interference-plus-noise ratio of the v-th V2V link and log(1+SINR).v Multiplying (t) by the shared channel allocation ratio α, the total number of communication channels M, and the bandwidth B of each channel, we obtain the instantaneous transmission rate R of the v-th link. v (t);
[0105] Step S32: Based on the transmit power P obtained by the i-th V2I link in the transmission time slot i (t) is used to obtain the instantaneous signal-to-interference-plus-noise ratio (SINR) of this link. i (t); Obtain the allocation ratio (1-α) of orthogonal channels in this transmission time slot and the allocation scheme β of each orthogonal channel. k,i According to Shannon's formula, the logarithm of the signal-to-interference-plus-noise ratio (SINR) of the i-th V2I link is log(1+SINR). i (t)), orthogonal channel allocation ratio (1-α), orthogonal channel allocation scheme β k,i The instantaneous transmission rate R of the i-th link is obtained by multiplying the total number of communication channels M and the bandwidth B of each channel. i (t);
[0106] Step S33: The total transmission rate of the system in transmission time slot t is the sum of the instantaneous rates of I V2I and V V2V, C(t).
[0107] Step S4: Based on the communication system model in Step S1 and the transmission mechanism and queuing model in Step S2, establish a communication constraint mechanism;
[0108] Specifically, the constraint mechanisms in step S4 include:
[0109] To ensure that each V2I link meets the minimum transmission rate requirement, a first constraint mechanism is designed:
[0110]
[0111] To ensure that each communication link is associated with the channel resource allocation scheme, a second constraint mechanism is designed:
[0112] 0 < α < 1;
[0113]
[0114] To ensure the power allocation scheme that limits the transmit power of each communication link, a third constraint mechanism is designed:
[0115]
[0116]
[0117] To ensure the queuing delay requirements of each communication link, a fourth constraint mechanism for queue overflow probability is designed:
[0118]
[0119] in, This represents the minimum transmission rate requirement for link i. Let Q represent the maximum transmit power allocated to link i and link v, respectively. Pr() represents calculating the probability. i (t) represents the queue length of the t-th transmission slot, L i θ represents the maximum link length limit. i This represents the overflow probability of any queue;
[0120] Step S5: Based on steps S3 and S4, construct the first optimization objective for system resource allocation. This embodiment of the application seeks a resource allocation scheme for long transmission intervals by comprehensively considering the transmission rate requirements and latency requirements of the vehicle-to-everything (V2X) communication link.
[0121] Specifically, the first optimization objective of step S5 can be expressed as:
[0122]
[0123] Among them, P v T represents the maximum tolerable communication latency for the v-th V2V link. v (t) represents the data transmission delay of the v-th V2V link over the transmission interval, γ represents the instantaneous throughput factor of the system, and μ represents the delay factor of the V2V communication link of the system.
[0124] Step S6: Due to the randomness of the first optimization objective and the unpredictability of the amount of data in each transmission link in the future transmission time slot, Lyapunov optimization is introduced to transform the joint optimization objective of maximizing the long-term average system throughput and delay in step S5 into the second optimization objective of minimizing the upper bound of the Lyapunov offset penalty in a single transmission time slot.
[0125] Specifically, the second optimization objective transformed using Lyapunov in step S6 can be expressed as:
[0126]
[0127] Where K represents a non-negative constant that balances the offset with the first optimization objective, C(t) represents the sum of the instantaneous transmission rates of each communication link in the t-th transmission slot, μ represents the delay factor of the system's V2V communication link, and P v T represents the maximum tolerable communication latency for the v-th V2V link. v Q(t) represents the data transmission delay of the v-th V2V link in the t-th transmission time slot. v(t) represents the queue length of the v-th V2V link in the t-th transmission slot, Q i (t) represents the queue length of the i-th V2I link in the t-th transmission slot, Z v Z(t) represents the number of data packets successfully transmitted on the v-th V2V link in the t-th transmission time slot. i (t) represents the number of data packets successfully transmitted on the i-th V2I link in the t-th transmission slot, D v (t) represents the queue vector of the v-th V2V link in the t-th transmission slot, D i (t) represents the queue vector of the i-th V2I link in the t-th transmission slot, R i These represent the expected rates of the i-th V2I link.
[0128] Step S7: Based on step S6, the second optimization objective is split, and the particle swarm algorithm is used to obtain the allocation scheme of the ratio α of V2I orthogonal channels and V2V shared channels.
[0129] In step S7, the particle swarm optimization algorithm is used to obtain the allocation scheme for the ratio of V2I orthogonal channels and V2V shared channels. Specifically, this may include the following steps:
[0130] Step S71: Initialize the particle velocity and position, individual optimal position and overall optimal position, where the particle position needs to satisfy the constraint mechanism of step S4;
[0131] Step S72: Update the inertia weight factor and particle acceleration for each iteration;
[0132] Step S73: Update the particle's next position based on the current particle position and particle velocity; determine whether the particle's new position satisfies the constraint mechanism of step S4. If not, replace the particle's new position with the individual optimal position.
[0133] Step S74: Update the similarity and clustering of each particle. If a particle's position is close to the optimal particle, execute a random mutation strategy.
[0134] The random mutation strategy is specifically as follows:
[0135] If the current particle's position is less than the product of the population's clustering degree and similarity, then a random value is taken from the particle's maximum and minimum value range, and this value is used as the particle's position in the next iteration.
[0136] If the current particle position is greater than or equal to the product of population aggregation degree and similarity, then the particle position from step S73 is used for the next iteration.
[0137] Step S75: Update the particle's velocity, individual optimal position, and global optimal position;
[0138] Step S76: Repeat steps S72-S75 until the maximum number of iterations is reached to obtain the allocation scheme of the ratio α of V2I orthogonal channels and V2V shared channels.
[0139] Step S8: Based on the channel allocation scheme obtained in step S7, use the 0-1 knapsack algorithm to obtain the allocation scheme of orthogonal channel resources for each V2I link access.
[0140] The specific implementation of the 0-1 knapsack algorithm for obtaining the channel allocation scheme for each V2I link in step S8 includes: using the allocable channel resources as the capacity of the knapsack, using the number of channels required by each V2I link as the volume of each item, and using the expected instantaneous transmission rate of each V2I link as the value of each item. A low-complexity dynamic programming method is used to allocate channel resources to each V2I link, where the allocation scheme needs to satisfy the constraint mechanism in step S4. When using the 0-1 knapsack scheduling algorithm to allocate channel resources for V2I, it can satisfy the instantaneous rate and latency requirements of each V2I link as much as possible, while improving resource utilization.
[0141] Step S9: Based on the channel ratio allocation scheme and V2I channel allocation scheme obtained in Steps S7 and S8, the power allocation scheme of each V2I link and V2V link is obtained by using a binary search algorithm.
[0142] The specific steps in step S9, which use a binary search algorithm to obtain the power allocation scheme for each V2I link and V2V link, are as follows:
[0143] Step 91: Initialize the maximum number of iterations and the V2V power allocation matrix. V2I power allocation matrix Based on system tolerance error, the power search range for each V2V link is determined as follows: The power search range for each V2I link is make
[0144] Step 92: [The text appears to be incomplete and contains several grammatical errors. A more accurate translation would require the full context.] Substitute this into the second optimization objective of step S6 to obtain the target value of the current power allocation scheme;
[0145] Step 93: Determine whether the power allocation scheme satisfies the constraint mechanism in step S4. If it does, then let... Conversely, it will be ordered
[0146] Step 94: Repeat steps 92-93 until the maximum number of iterations is reached, or the difference in target value between two consecutive iterations is less than the system tolerance error, and output the power allocation scheme for each communication link.
[0147] In this embodiment, the joint optimization objective of maximizing the long-term average system throughput and latency is transformed into the optimization objective of minimizing the upper bound of the Lyapunov offset penalty on a single transmission slot using the Lyapunov optimization algorithm. The optimization objective is further broken down into three sub-problems: the shared channel resource allocation problem, the V2I link access channel resource allocation problem, and the transmit power allocation problem for each link. Then, the shared channel resource allocation scheme is obtained using the particle swarm optimization algorithm, the V2I link access scheme is obtained using the 0-1 knapsack algorithm, and the transmit power allocation scheme for each link in the system is obtained using the binary search algorithm. This improves the total system throughput while reducing the data transmission latency of the V2V links, thereby improving system performance.
[0148] Furthermore, by configuring a data buffer queue on each V2V and V2I link, the link transmit power, shared channel, and dedicated channel resources can be dynamically allocated in each transmission time slot based on real-time link channel conditions and data buffer queue length, thereby improving network resource utilization.
[0149] See Figure 2 , Figure 2 This is a schematic diagram of a resource allocation device provided in an embodiment of this application. As shown in Figure 2, the resource allocation device 200 includes:
[0150] The first acquisition module 201 is used to acquire a first objective function and the constraints corresponding to the first objective function, wherein the first objective function is associated with the total throughput and transmission delay of the communication channel.
[0151] The first determining module 202 is used to determine the target channel ratio of the communication channel based on the first objective function and the constraint conditions.
[0152] The second determining module 203 is used to determine a first proportion of orthogonal channels and a second proportion of shared channels in the communication channels based on the target channel proportion. The orthogonal channels are used for communication of at least one vehicle-to-base station facility V2I link, and the shared channels are used for communication of at least one vehicle-to-vehicle V2V link.
[0153] The third determining module 204 is used to determine the resource allocation parameters of the at least one V2I link based on the first ratio and the pre-acquired communication channel parameters.
[0154] The fourth determining module 205 is used to determine the target transmit power of each of the at least one V2I link and the at least one V2V link based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function, so as to minimize the value of the first objective function under the target channel ratio, the resource allocation parameters, and the target transmit power.
[0155] Optionally, the constraint conditions include at least one of the following:
[0156] The first constraint condition is used to constrain the transmission rate of each link, and the total throughput is determined based on the transmission rate of the links within the communication channel.
[0157] The second constraint condition is used to constrain the first ratio, the second ratio, and the resource allocation parameters;
[0158] The third constraint condition is used to constrain the transmit power of each link;
[0159] The fourth constraint condition is used to constrain the transmission delay.
[0160] Optionally, the resource allocation device 200 further includes:
[0161] The second acquisition module is used to acquire the transmission buffer queue of each link;
[0162] The first calculation module is used to calculate the queue length of each link based on the transmission buffer queue;
[0163] The second calculation module is used to calculate the transmission delay based on the queue length.
[0164] Optionally, the first acquisition module 201 includes:
[0165] A setup unit is used to establish a second objective function, which is associated with the total throughput and transmission delay of the communication channel within a preset time period;
[0166] The transformation unit is used to transform the second objective function into the first objective function based on the Lyapunov optimization algorithm;
[0167] The acquisition unit is used to acquire the constraint conditions corresponding to the first objective function based on the first objective function.
[0168] Optionally, the first determining module 202 includes:
[0169] The first update unit is used to iteratively update the positions of multiple particles a preset number of times based on the constraints, so as to obtain the target positions of the multiple particles.
[0170] The first determining unit is configured to determine the target position of the target particle based on the target positions of the plurality of particles and the first objective function, wherein the target positions of the plurality of particles include the target position of the target particle.
[0171] The second determining unit is used to determine the target channel ratio of the communication channel based on the target position of the target particle.
[0172] Optionally, the Nth update of the positions of the plurality of particles includes:
[0173] Based on the constraints, the particle swarm optimization algorithm is used to obtain the Nth position to be updated of the plurality of particles.
[0174] Based on the Nth position to be updated, update the population aggregation degree and similarity of the multiple particles;
[0175] Based on the population aggregation degree and the similarity, the positions of the multiple particles are updated for the Nth time;
[0176] Wherein, N is a positive integer less than or equal to the preset number of times.
[0177] Optionally, the third determining module 204 includes:
[0178] The third determining unit is used to determine the allocatable resources of the at least one V2I link based on the first ratio and the pre-acquired communication channel parameters.
[0179] The fourth determining unit is used to determine the resource allocation parameters of the at least one V2I link using a knapsack algorithm;
[0180] The available resources of at least one V2I link are used as the capacity of the knapsack, each V2I link represents an item, the number of orthogonal channels required for each V2I link is used as the volume of the corresponding item, and the preset minimum transmission rate of each V2I link is used as the value of the corresponding item.
[0181] Optionally, the fourth determining module 205 includes:
[0182] The second update unit is used to update the transmit power of the at least one V2I link and the transmit power of the at least one V2V link using a binary search algorithm to obtain multiple transmit powers for each link;
[0183] The fifth determining unit is used to determine the target transmission power of each link among the plurality of transmission powers based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function.
[0184] The resource allocation device 200 can realize the embodiments of this application. Figure 1 The various processes in the method embodiments, and the ways to achieve the same beneficial effects, will not be repeated here to avoid repetition.
[0185] This application also provides an electronic device. Because the principle by which the electronic device solves the problem is similar to that in the embodiments of this application... Figure 1 The resource allocation method shown is similar; therefore, the implementation of this electronic device can be found in the implementation of the method, and repeated details will not be elaborated further. For example... Figure 3 As shown, the electronic device in this application embodiment includes a memory 320, a transceiver 310, and a processor 300;
[0186] The memory 320 is used to store computer programs; the transceiver 310 is used to send and receive data under the control of the processor 300; the processor 300 is used to read the computer program in the memory 320 and perform the following operations:
[0187] Obtain the first objective function and the corresponding constraints of the first objective function, wherein the first objective function is related to the total throughput and transmission delay of the communication channel;
[0188] Based on the first objective function and the constraints, the target channel ratio of the communication channel is determined;
[0189] Based on the target channel ratio, a first ratio of orthogonal channels and a second ratio of shared channels are determined in the communication channels. The orthogonal channels are used for communication of at least one vehicle-to-base station facility V2I link, and the shared channels are used for communication of at least one vehicle-to-vehicle V2V link.
[0190] Based on the first ratio and the pre-acquired communication channel parameters, the resource allocation parameters of the at least one V2I link are determined;
[0191] Based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function, the target transmit power of each of the at least one V2I link and the at least one V2V link is determined so that the value of the first objective function is minimized under the target channel ratio, the resource allocation parameters, and the target transmit power.
[0192] Among them, Figure 3In this context, the bus architecture may include any number of interconnected buses and bridges, specifically linking various circuits together, represented by one or more processors (processor 300) and memory (memory 320). The bus architecture may also link together various other circuits such as peripheral devices, voltage regulators, and power management circuits, which are well known in the art and therefore will not be described further herein. A bus interface provides an interface. Transceiver 310 may be multiple elements, including transmitters and transceivers, providing a unit for communicating with various other devices over a transmission medium. Processor 300 is responsible for managing the bus architecture and general processing, and memory 320 may store data used by processor 300 during operation.
[0193] The processor 300 can be a central processing unit (CPU), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or a complex programmable logic device (CPLD). The processor can also adopt a multi-core architecture.
[0194] Optionally, the constraint conditions include at least one of the following:
[0195] The first constraint condition is used to constrain the transmission rate of each link, and the total throughput is determined based on the transmission rate of the links within the communication channel.
[0196] The second constraint condition is used to constrain the first ratio, the second ratio, and the resource allocation parameters;
[0197] The third constraint condition is used to constrain the transmit power of each link;
[0198] The fourth constraint condition is used to constrain the transmission delay.
[0199] Optionally, the processor 300 is also configured to read the computer program in the memory 320 and perform the following operations:
[0200] Obtain the transmission buffer queue for each link;
[0201] Based on the transmission buffer queue, calculate the queue length for each link;
[0202] The transmission delay is calculated based on the queue length.
[0203] Optionally, obtaining the first objective function and the constraints corresponding to the first objective function includes:
[0204] A second objective function is established, which is correlated with the total throughput and transmission delay of the communication channel within a preset time period;
[0205] Based on the Lyapunov optimization algorithm, the second objective function is transformed into the first objective function;
[0206] Based on the first objective function, obtain the constraints corresponding to the first objective function.
[0207] Optionally, determining the target channel ratio of the communication channel based on the first objective function and the constraints includes:
[0208] Based on the constraints, the positions of multiple particles are iteratively updated a preset number of times using the particle swarm optimization algorithm to obtain the target positions of the multiple particles.
[0209] Based on the target positions of the plurality of particles and the first objective function, the target position of the target particle is determined, wherein the target positions of the plurality of particles include the target position of the target particle.
[0210] The target channel ratio of the communication channel is determined based on the target position of the target particle.
[0211] Optionally, the Nth update of the positions of the plurality of particles includes:
[0212] Based on the constraints, the particle swarm optimization algorithm is used to obtain the Nth position to be updated of the plurality of particles.
[0213] Based on the Nth position to be updated, update the population aggregation degree and similarity of the multiple particles;
[0214] Based on the population aggregation degree and the similarity, the positions of the multiple particles are updated for the Nth time;
[0215] Wherein, N is a positive integer less than or equal to the preset number of times.
[0216] Optionally, determining the resource allocation parameters for the at least one V2I link based on the first ratio and pre-acquired communication channel parameters includes:
[0217] Based on the first ratio and the pre-acquired communication channel parameters, the allocatable resources of the at least one V2I link are determined;
[0218] The resource allocation parameters for the at least one V2I link are determined using the knapsack algorithm.
[0219] The available resources of at least one V2I link are used as the capacity of the knapsack, each V2I link represents an item, the number of orthogonal channels required for each V2I link is used as the volume of the corresponding item, and the preset minimum transmission rate of each V2I link is used as the value of the corresponding item.
[0220] Optionally, determining the target transmit power of each of the at least one V2I link and the at least one V2V link based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function includes:
[0221] The transmit power of the at least one V2I link and the transmit power of the at least one V2V link are updated using a binary search algorithm to obtain multiple transmit powers for each link;
[0222] Based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function, the target transmission power for each link among the plurality of transmission powers is determined.
[0223] The electronic device provided in this application embodiment can perform the above-described functions. Figure 1 The method embodiments shown are similar in principle and technical effect, and will not be described again here.
[0224] This application embodiment also provides a readable storage medium storing a program or instructions that, when executed by a processor, implement the above-described functionality. Figure 1 The various processes in the method embodiments described herein can achieve the same technical effect, and will not be repeated here to avoid repetition.
[0225] The processor is the processor in the electronic device described in the above embodiments. The readable storage medium includes computer-readable storage media, such as computer read-only memory (ROM), random access memory (RAM), magnetic disk, or optical disk.
[0226] This application embodiment also provides a chip, the chip including a processor and a communication interface, the communication interface being coupled to the processor, the processor being used to run programs or instructions to implement the above. Figure 1 The various processes in the method embodiments described herein can achieve the same technical effect, and will not be repeated here to avoid repetition.
[0227] It should be understood that the chip mentioned in the embodiments of this application may also be referred to as a system-on-a-chip, system chip, chip system, or system-on-a-chip, etc.
[0228] It should be noted that, in this document, the terms "comprising," "including," or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements includes not only those elements but also other elements not expressly listed, or elements inherent to such a process, method, article, or apparatus. Without further limitations, an element defined by the phrase "comprising one..." does not exclude the presence of other identical elements in the process, method, article, or apparatus that includes that element. Furthermore, it should be noted that the scope of the methods and apparatuses in the embodiments of this application is not limited to performing functions in the order shown or discussed, but may also include performing functions substantially simultaneously or in the reverse order, depending on the functions involved. For example, the described methods may be performed in a different order than described, and various steps may be added, omitted, or combined. Additionally, features described with reference to certain examples may be combined in other examples.
[0229] Through the above description of the embodiments, those skilled in the art can clearly understand that the methods of the above embodiments can be implemented by means of software plus necessary general-purpose hardware platforms. Of course, they can also be implemented by hardware, but in many cases the former is a better implementation method. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, can be embodied in the form of a computer software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk) and includes several instructions to cause a terminal (which may be a mobile phone, computer, server, or network device, etc.) to execute the methods described in the various embodiments of this application.
[0230] The embodiments of this application have been described above with reference to the accompanying drawings. However, this application 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 this application without departing from the spirit and scope of the claims, and all of these forms are within the protection scope of this application.
Claims
1. A resource allocation method, characterized in that, include: Obtain the first objective function and the corresponding constraints of the first objective function, wherein the first objective function is related to the total throughput and transmission delay of the communication channel; Based on the first objective function and the constraints, the target channel ratio of the communication channel is determined; Based on the target channel ratio, a first ratio of orthogonal channels and a second ratio of shared channels are determined in the communication channels. The orthogonal channels are used for communication of at least one vehicle-to-base station facility V2I link, and the shared channels are used for communication of at least one vehicle-to-vehicle V2V link. Based on the first ratio and the pre-acquired communication channel parameters, the resource allocation parameters of the at least one V2I link are determined; Based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function, the target transmit power of each of the at least one V2I link and the at least one V2V link is determined so that the value of the first objective function is minimized under the target channel ratio, the resource allocation parameters, and the target transmit power.
2. The method as described in claim 1, characterized in that, The constraints include at least one of the following: The first constraint condition is used to constrain the transmission rate of each link, and the total throughput is determined based on the transmission rate of the links within the communication channel. The second constraint condition is used to constrain the first ratio, the second ratio, and the resource allocation parameters; The third constraint condition is used to constrain the transmit power of each link; The fourth constraint condition is used to constrain the transmission delay.
3. The method as described in claim 2, characterized in that, The method further includes: Obtain the transmission buffer queue for each link; Based on the transmission buffer queue, calculate the queue length for each link; The transmission delay is calculated based on the queue length.
4. The method as described in claim 1, characterized in that, The process of obtaining the first objective function and the corresponding constraints includes: A second objective function is established, which is correlated with the total throughput and transmission delay of the communication channel within a preset time period; Based on the Lyapunov optimization algorithm, the second objective function is transformed into the first objective function; Based on the first objective function, obtain the constraints corresponding to the first objective function.
5. The method as described in claim 1, characterized in that, Determining the target channel ratio of the communication channel based on the first objective function and the constraints includes: Based on the constraints, the positions of multiple particles are iteratively updated a preset number of times using the particle swarm optimization algorithm to obtain the target positions of the multiple particles. Based on the target positions of the plurality of particles and the first objective function, the target position of the target particle is determined, wherein the target positions of the plurality of particles include the target position of the target particle. The target channel ratio of the communication channel is determined based on the target position of the target particle.
6. The method as described in claim 5, characterized in that, The Nth update of the positions of the plurality of particles includes: Based on the constraints, the particle swarm optimization algorithm is used to obtain the Nth position to be updated of the plurality of particles. Based on the Nth position to be updated, update the population aggregation degree and similarity of the multiple particles; Based on the population aggregation degree and the similarity, the positions of the multiple particles are updated for the Nth time; Wherein, N is a positive integer less than or equal to the preset number of times.
7. The method as described in claim 1, characterized in that, The determination of resource allocation parameters for the at least one V2I link based on the first ratio and pre-acquired communication channel parameters includes: Based on the first ratio and the pre-acquired communication channel parameters, the allocatable resources of the at least one V2I link are determined; The resource allocation parameters for the at least one V2I link are determined using the knapsack algorithm. The available resources of at least one V2I link are used as the capacity of the knapsack, each V2I link represents an item, the number of orthogonal channels required for each V2I link is used as the volume of the corresponding item, and the preset minimum transmission rate of each V2I link is used as the value of the corresponding item.
8. The method according to any one of claims 1 to 7, characterized in that, The step of determining the target transmit power of the at least one V2I link and each of the at least one V2V links based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function includes: The transmit power of the at least one V2I link and the transmit power of the at least one V2V link are updated using a binary search algorithm to obtain multiple transmit powers for each link; Based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function, the target transmission power for each link among the plurality of transmission powers is determined.
9. A resource allocation device, characterized in that, include: The first acquisition module is used to acquire a first objective function and the constraints corresponding to the first objective function, wherein the first objective function is associated with the total throughput and transmission delay of the communication channel. The first determining module is used to determine the target channel ratio of the communication channel based on the first objective function and the constraints. The second determining module is used to determine a first proportion of orthogonal channels and a second proportion of shared channels in the communication channels based on the target channel proportion. The orthogonal channels are used for communication of at least one vehicle-to-base station facility V2I link, and the shared channels are used for communication of at least one vehicle-to-vehicle V2V link. The third determining module is used to determine the resource allocation parameters of the at least one V2I link based on the first ratio and the pre-acquired communication channel parameters. The fourth determining module is used to determine the target transmit power of each of the at least one V2I link and the at least one V2V link based on the first ratio, the second ratio, the resource allocation parameters, and the first objective function, so as to minimize the value of the first objective function under the target channel ratio, the resource allocation parameters, and the target transmit power.
10. An electronic device, characterized in that, It includes a processor and a memory, the memory storing a program or instructions that can run on the processor, the program or instructions being executed by the processor to implement the steps of the resource allocation method as described in any one of claims 1 to 8.
11. A readable storage medium, characterized in that, The readable storage medium stores a program or instructions that, when executed by a processor, implement the steps of the resource allocation method as described in any one of claims 1 to 8.