A resource allocation method for C-V2X vehicle-to-everything (V2X) network with optimal energy efficiency
By separating the power control and spectrum reuse sub-problems in C-V2X vehicle networking and optimizing resource allocation using iterative and Hungarian algorithms, the problem of insufficient system energy efficiency was solved, achieving maximum energy efficiency and guaranteed user quality.
Patent Information
- Application Number
- CN202410068474.3
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2024-01-16
- Publication Date
- 2026-11-10
- Estimated Expiration
- 2044-01-16
AI Technical Summary
In C-V2X vehicle-to-everything (V2X) scenarios, existing technologies have failed to effectively maximize system energy efficiency and jointly consider power allocation and spectrum reuse for all users, resulting in a persistent conflict between the battery capacity requirements of mobile terminal devices and current battery technology.
A resource allocation method based on mixed-integer nonlinear programming is proposed. By splitting power control and spectrum reuse into two subproblems, it optimizes the transmission power and spectrum reuse of two types of users using iterative power control algorithm and Hungarian algorithm, and combines statistical channel state information to maximize system energy efficiency.
It effectively improved system energy efficiency, ensured user service quality, optimized resource allocation, and reduced energy consumption.
Smart Images

Figure CN117858242B_ABST
Abstract
Description
Technical Field
[0001] This invention relates to the field of communication technology, and more specifically, to a C-V2X vehicle-to-everything (V2X) resource allocation method for optimal energy efficiency. Background Technology
[0002] Vehicle-to-Everything (V2X) enables information interaction with the external environment and is a crucial technology for realizing autonomous driving and intelligent transportation systems. It encompasses Vehicle-to-Infrastructure (V2I), Vehicle-to-Vehicle (V2V), Vehicle-to-Pedestrian (V2P), and Vehicle-to-Network (V2N) communication. Cellular-Vehicle-to-Everything (C-V2X), using base stations as infrastructure, leverages the resources and advantages of current cellular networks to achieve low-latency, high-reliability, and high-throughput communication between nodes in the vehicle network, showing immense development potential. Furthermore, to meet safety requirements, vehicles need to periodically transmit cooperative perception messages and distributed environmental notification messages to surrounding vehicles. Short-range, high-gain D2D communication perfectly meets the reliability and timeliness requirements of V2V links. Despite its many advantages, C-V2X inevitably interferes with the existing cellular network because vehicles reuse cellular network resources. Therefore, proper resource allocation is essential to ensure system performance by coordinating interference between links.
[0003] In recent years, with the rapid growth in the number of vehicles, modern transportation systems need to frequently exchange large amounts of data, leading to high energy consumption. Current C-V2X resource allocation research mainly focuses on improving spectrum efficiency. Compared with many technologies that improve spectrum efficiency, resource allocation technologies centered on optimizing energy efficiency have lagged behind, resulting in a continuous conflict between the battery capacity requirements of mobile terminal devices and current battery technology. Therefore, the high energy efficiency requirement in vehicle communication has become a hot topic in vehicle communication.
[0004] In recent years, researchers have conducted extensive research on resource allocation technology in cellular vehicle-to-everything (V2X) scenarios. The paper "Resource Allocation for D2D-Enabled Vehicular Communications" [L. Liang, GY Li, and W. Xu, IEEE Trans. Commun., vol. 65, no. 7, pp. 3186–3197, Jul. 2017.] proposes a new resource allocation strategy for practical highway C-V2X scenarios. The paper "Energy-efficiencymaximization in D2D-enabled vehicular communications with consideration of dynamic channel information and fairness" [Z. Liu, X. Han, Y. Xie, Y. Yuan, and K. Y. Chan, Peer-to-Peer Netw. Appl., vol. 14, no. 1, pp. 164–176, Jan. 2021.] outlines an optimization problem to maximize the energy efficiency of V2I links and proposes a resource allocation method that jointly considers the transmit power of cellular users in V2X and the fairness-based spectrum sharing problem. However, in the context of high-speed C-V2X scenarios that meet practical applications, there is currently no precedent for a resource allocation method that maximizes system energy efficiency (SEE) and jointly considers power allocation and spectrum reuse for all users. Summary of the Invention
[0005] This invention addresses the problem of maximizing system energy efficiency in high-speed C-V2X scenarios. Based on the practical application of heterogeneous V2I and V2V links in communication, it comprehensively considers the Quality of Service (QoS) of both D2D and cellular users, aiming to maximize system energy efficiency in a more realistic way. It jointly optimizes the transmission power and spectrum reuse for both types of users. Facing the challenge of obtaining instantaneous Channel State Information (CSI) in high-speed scenarios, it proposes a joint resource allocation method utilizing only statistical CSI. This method decomposes the proposed Mixed Integer Nonlinear Programming (MINLP) problem into two sub-problems: power control and spectrum reuse. In the first sub-problem, a fast-converging and low-complexity iterative power control algorithm is developed based on the transformed optimization problem. In the second sub-problem, the spectrum reuse problem is transformed into a bipartite graph matching problem and solved using the Hungarian algorithm. This invention ultimately returns the optimal transmit power, optimal spectrum reuse factor, and maximum SEE for both types of users. This resource allocation method can guarantee user service quality and effectively improve SEE.
[0006] To achieve the above objectives, the technical solution of the present invention is as follows:
[0007] A resource allocation method for C-V2X vehicle-to-everything (V2X) networks with optimal energy efficiency, characterized by the following steps:
[0008] S1: Calculate four types of channel gains using the location information and channel characteristics of the two types of vehicle users, thereby obtaining the signal-to-interference-plus-noise ratio and V2I link transmission rate for the two types of users;
[0009] S2: Define SEE as the ratio of V2I link rate to the power consumption of the two types of users in the scenario. Under constraints, construct a total optimization problem of joint power control and spectrum reuse with the optimization objective of maximizing SEE.
[0010] S3: Break down the MINLP problem into two sub-problems: success rate control and spectrum reuse;
[0011] S4: For the power control subproblem, the optimal transmit power under fixed spectrum reuse is solved based on an iterative power control algorithm;
[0012] S5: Obtain the corresponding energy efficiency based on the optimal transmit power. Then, according to the minimum rate constraint of the V2I link, eliminate multiplexing pairs that do not meet the constraint to obtain the SEE matrix;
[0013] S6: In the spectrum reuse subproblem, the spectrum reuse problem is transformed into a maximum weighted bipartite graph matching problem. The spectrum reuse factor that maximizes SEE is obtained by using the Hungarian algorithm based on the system energy efficiency matrix.
[0014] S7: Returns the optimal power, spectrum reuse factor, and maximum SEE for both types of vehicle users.
[0015] Preferably, the calculation of signal interference-to-noise ratio and transmission rate in step S1 is specifically as follows:
[0016] S1.1: Define the set of M cellular users (CUEs) that communicate with the base station via a cellular link, i.e., a V2I link, as... The set of K pairs of vehicle users (DUEs) communicating via D2D, i.e., V2V links, is defined as... The four channel gains are the channel gain h from the m-th CUE to the BS. m,B The channel gain h between the k-th pair of D2D users k The channel gain h from the k-th DUE to the BS k,B The channel gain h from the m-th CUE to the k-th DUE m,k The channel gain calculation formula of this invention is as follows: Where g is the small-scale fading component, which follows an exponential distribution with a mean of 1; α is the large-scale fading component; L is the transmission distance; γ is the path loss factor; A is the path loss constant; and β is the shadowing fading. All four types of gains can be calculated using the above formula.
[0017] S1.2: The long-term SINR expression for the m-th CUE received at the BS is:
[0018]
[0019] The SINR expression for the k-th DUE received at the BS is:
[0020]
[0021] in, For CUE transmit power, This refers to the transmit power of the DUE. λ m,B , λ k,B Let λ be the mean of the small-scale fading component g. m,B =λ k,B =1. ρ m,k ρ is the spectrum reuse factor. m,k =1 indicates that the k-th DUE reuses the spectrum of the m-th CUE, forming a spectrum reuse pair, ρ m,k=0 means that the k-th DUE will not reuse the spectrum of the m-th CUE.
[0022] S1.3: The expression for the traversal rate of the V2I link, obtained from the long-term SINR of the CUE user, is as follows:
[0023]
[0024] Preferably, in step S2, an optimization problem is constructed with the objective of maximizing the system's energy efficiency, specifically as follows:
[0025] S2.1: SEE is defined as the ratio of the rate of the V2I link requiring high transmission rates to the sum of the energy consumption of the two types of users, as expressed below:
[0026]
[0027] Where P0 is the fixed circuit power loss, and ω is the reciprocal of the user power amplifier efficiency and feeder loss, satisfying ω>1. S2.2: The resource allocation problem oriented towards maximizing SEE is described as follows:
[0028]
[0029]
[0030]
[0031]
[0032]
[0033]
[0034]
[0035] Where p0 is the maximum probability of V2V link failure, which occurs when the SINR in the V2V link is lower than the minimum SINR threshold required to establish a reliable link. At that time, the V2V link was disconnected. This represents the minimum capacity requirement for the CUE. Constraints C1 and C2 represent the minimum QoS requirements for each DUE and CUE, respectively. C3 and C4 limit the maximum transmit power for the CUE and DUE. C5 and C6 constrain that each V2I channel can only be multiplexed by one V2V link, and each V2V link can only multiplex one V2I channel.
[0036] Preferably, in step S3, the MINLP problem is split into two sub-problems, specifically as follows:
[0037] S3.1: The first power control subproblem derived from the decomposition is represented as:
[0038]
[0039]
[0040]
[0041]
[0042] S3.2: The second spectrum reuse subproblem derived from the split is represented as:
[0043]
[0044]
[0045]
[0046]
[0047] Preferably, step S4 proposes an iterative power control algorithm to solve for the optimal transmit power in the power control sub-problem decomposed in step S3, specifically as follows:
[0048] S4.1: First, regarding constraint C1, the small-scale fading component h follows an exponential distribution with a mean of 1. k with h m,k Integrating, we obtain the transmit power under constraint C1. and satisfy And because make make get Minimum feasible value
[0049] S4.2: Considering the maximum power constraints in C3 and C4, two power feasible regions are generated. The monotonicity of the objective function SEE is analyzed, and it can be seen that if the power is fixed... SEEη ee Follow The maximum SEE can only be obtained within the upper bound of the power feasible region, thus further narrowing the optimal solution of the power control problem to the upper bound of the feasible region, i.e., the curve. This transforms a bivariate optimization problem into a problem about... The transformed univariate optimization problem is expressed as follows:
[0050]
[0051] S4.3: Due to It is a function One of them, and this item is important to... and The relationship between them has almost no effect, so we replace this term with a constant u, and then... and Rewrite the relation as The nonlinear fractional programming problem can be transformed into the following expression:
[0052]
[0053] S4.4: Transform the nonlinear fractional programming problem into an easier-to-solve equivalent subtraction form, and find the optimal solution before and after the transformation. and optimal Same, η ee As the iterations proceed, the system converges unidirectionally to the optimal value. The transformed expression is as follows:
[0054]
[0055] S4.5: Update the inner convex optimization problem The solution is obtained by using the closed-form expression of the solution. From the two solutions, the solution that satisfies the power constraint and has the larger corresponding function value is selected. The closed expression is as follows:
[0056]
[0057] S4.6: Based on the solution of the inner convex optimization problem Update parameter η in the outer loop ee The optimal transmit power of DUE under the current multiplexing pair is obtained until the equivalent subtraction form of the objective function converges to 0. and the corresponding optimal and through and By establishing a one-to-one correspondence, the optimal transmit power of the CUE can be obtained. This yields the optimal solution to the power control subproblem.
[0058] Preferably, the method for calculating the system energy efficiency matrix in step S5 is as follows:
[0059] S5.1: Based on the corresponding multiplexing pair in the power control subproblem Determine the V2I link rate of the multiplexing pair. Can the rate requirements of the V2I link be met? If not, the multiplexing pair is blocked by setting the corresponding element in the SEE matrix to negative infinity. After traversing all multiplexing pairs, a preliminary SEE matrix is obtained. The process can be expressed as follows:
[0060]
[0061] Preferably, the solution to the spectrum reuse subproblem based on the Hungarian algorithm in step S6 is as follows:
[0062] S6.1: Transform the spectrum reuse problem into a maximum weighted bipartite graph matching problem, and design the bipartite graph using the elements in the system energy efficiency matrix as weights;
[0063] S6.2: Solve for the spectrum reuse factor that maximizes the SEE and the final SEE using the Hungarian algorithm. Attached Figure Description
[0064] Figure 1 This is a schematic diagram of the method flow of the present invention.
[0065] Figure 2 This is a schematic diagram provided for an embodiment, comparing the SEE achievable by the method of the present invention with that of other algorithms as the interruption probability p0 increases, for the power allocator problem.
[0066] Figure 3 As provided in the embodiments, for the spectrum reuse sub-problem, with the SINR threshold... The diagram illustrates the comparison of the SEE achieved by the method of this invention with other algorithms as the SEE increases.
[0067] Figure 4 This is a schematic diagram showing the comparison of the SEE achieved by the method of the present invention with that of other algorithms as the vehicle speed v increases, provided as an example. Detailed Implementation
[0068] The accompanying drawings are for illustrative purposes only and should not be construed as limiting the scope of this patent.
[0069] To better illustrate this embodiment, some parts in the accompanying drawings may be omitted, enlarged, or reduced, and do not represent the actual product dimensions;
[0070] It will be understood by those skilled in the art that certain well-known structures and their descriptions may be omitted in the accompanying drawings.
[0071] The technical solution of the present invention will be further described below with reference to the accompanying drawings and embodiments.
[0072] Example 1
[0073] This example provides a resource allocation method for C-V2X vehicle-to-everything (V2X) networks aimed at optimal energy efficiency, characterized by the following steps:
[0074] S1: Calculate four types of channel gains using the location information and channel characteristics of the two types of vehicle users, thereby obtaining the signal-to-interference-plus-noise ratio and V2I link transmission rate for the two types of users;
[0075] S2: Define SEE as the ratio of V2I link rate to the power consumption of the two types of users in the scenario. Under constraints, construct a total optimization problem of joint power control and spectrum reuse with the optimization objective of maximizing SEE.
[0076] S3: Break down the MINLP problem into two sub-problems: success rate control and spectrum reuse;
[0077] S4: For the power control subproblem, the optimal transmit power under fixed spectrum reuse is solved based on an iterative power control algorithm;
[0078] S5: Obtain the corresponding energy efficiency based on the optimal transmit power. Then, according to the minimum rate constraint of the V2I link, eliminate multiplexing pairs that do not meet the constraint to obtain the SEE matrix;
[0079] S6: In the spectrum reuse subproblem, the spectrum reuse problem is transformed into a maximum weighted bipartite graph matching problem. The spectrum reuse factor that maximizes SEE is obtained by using the Hungarian algorithm based on the system energy efficiency matrix.
[0080] S7: Returns the optimal power, spectrum reuse factor, and maximum SEE for both types of vehicle users.
[0081] Example 2
[0082] This embodiment, based on Embodiment 1, continues to disclose the following content:
[0083] The calculation of signal interference-to-noise ratio and transmission rate in step S1 is as follows:
[0084] S1.1: Define the set of M cellular users (CUEs) that communicate with the base station via a cellular link, i.e., a V2I link, as... The set of K pairs of vehicle users (DUEs) communicating via D2D, i.e., V2V links, is defined as... The four channel gains are the channel gain h from the m-th CUE to the BS. m,B The channel gain h between the k-th pair of D2D users k The channel gain h from the k-th DUE to the BS k,B The channel gain h from the m-th CUE to the k-th DUE m,kThe channel gain calculation formula of this invention is as follows: Where g is the small-scale fading component, which follows an exponential distribution with a mean of 1; α is the large-scale fading component; L is the transmission distance; γ is the path loss factor; A is the path loss constant; and β is the shadowing fading. All four types of gains can be calculated using the above formula.
[0085] S1.2: The long-term SINR expression for the m-th CUE received at the BS is:
[0086]
[0087] The SINR expression for the k-th DUE received at the BS is:
[0088]
[0089] in, For CUE transmit power, For DUE transmit power, λ m,B Let λ be the mean of the small-scale fading component g. m,B =1. ρ m,k ρ is the spectrum reuse factor. m,k =1 indicates that the k-th DUE reuses the spectrum of the m-th CUE, forming a spectrum reuse pair, ρ m,k =0 means that the k-th DUE will not reuse the spectrum of the m-th CUE.
[0090] S1.3: The expression for the traversal rate of the V2I link, obtained from the long-term SINR of the CUE user, is as follows:
[0091]
[0092] Step S2 constructs an optimization problem with the objective of maximizing SEE, specifically as follows:
[0093] S2.1: SEE is defined as the ratio of the rate of the V2I link requiring high transmission rates to the sum of the energy consumption of the two types of users, as expressed below:
[0094]
[0095] Where P0 represents the power loss of the fixed circuit, and ω is the reciprocal of the user's power amplifier efficiency and feeder loss, satisfying ω>1.
[0096] S2.2: The resource allocation problem aimed at maximizing SEE is described as follows:
[0097]
[0098]
[0099]
[0100]
[0101]
[0102]
[0103]
[0104] Where p0 is the maximum probability of V2V link failure, which occurs when the SINR in the V2V link is lower than the minimum SINR threshold required to establish a reliable link. At that time, the V2V link was disconnected. This represents the minimum capacity requirement for the CUE. Constraints C1 and C2 represent the minimum QoS requirements for each DUE and CUE, respectively. C3 and C4 limit the maximum transmit power for the CUE and DUE. C5 and C6 constrain that each V2I channel can only be multiplexed by one V2V link, and each V2V link can only multiplex one V2I channel.
[0105] In step S3, the MINLP problem is broken down into two subproblems, specifically:
[0106] S3.1: The first power control subproblem derived from the decomposition is represented as:
[0107]
[0108]
[0109]
[0110]
[0111] S3.2: The second spectrum reuse subproblem derived from the split is represented as:
[0112]
[0113]
[0114]
[0115]
[0116] Step S4 proposes an iterative power control algorithm to solve for the optimal transmit power in the power control sub-problem extracted in step S3, specifically as follows:
[0117] S4.1: First, regarding constraint C1, the small-scale fading component h follows an exponential distribution with a mean of 1. k with h m,k Integrating, we obtain the transmit power under constraint C1. and satisfy And because make make get Minimum feasible value
[0118] S4.2: Considering the maximum power constraints in C3 and C4, two power feasible regions are generated. The monotonicity of the objective function SEE is analyzed, and it can be seen that if the power is fixed... SEEη ee Follow The maximum SEE can only be obtained within the upper bound of the power feasible region, thus further narrowing the optimal solution of the power control problem to the upper bound of the feasible region, i.e., the curve. This transforms a bivariate optimization problem into a problem about... The transformed univariate optimization problem is expressed as follows:
[0119]
[0120] S4.3: Due to It is a function One of them, and this item is important to... and The relationship between them has almost no effect, so we replace this term with a constant u, and then... and Rewrite the relation as The nonlinear fractional programming problem is transformed into...
[0121]
[0122] S4.4: Transform the nonlinear fractional programming problem into an easier-to-solve equivalent subtraction form, and find the optimal solution before and after the transformation. and optimal Same, η ee As the iterations proceed, the system converges unidirectionally to the optimal value. The transformed expression is as follows:
[0123]
[0124] S4.5: Update the inner convex optimization problem The solution is obtained by using the closed-form expression of the solution. From the two solutions, the solution that satisfies the power constraint and has the larger corresponding function value is selected. The closed expression is as follows:
[0125]
[0126] S4.6: Based on the solution of the inner convex optimization problem Update parameter η in the outer loop ee The optimal transmit power of DUE under the current multiplexing pair is obtained until the equivalent subtraction form of the objective function converges to 0. and the corresponding optimal and through and By establishing a one-to-one correspondence, the optimal transmit power of the CUE can be obtained. This yields the optimal solution to the power control subproblem. With the corresponding
[0127] The method for calculating the system energy efficiency matrix in step S5 is as follows:
[0128] S5.1: Based on the corresponding multiplexing pair in the power control subproblem Determine the V2I link rate of the multiplexing pair. Can the rate requirements of the V2I link be met? If not, the multiplexing pair is blocked by setting the corresponding element in the SEE matrix to negative infinity. After traversing all multiplexing pairs, a preliminary SEE matrix is obtained. The process can be expressed as follows:
[0129]
[0130] In step S6, the subproblem of spectrum reuse based on the Hungarian algorithm is solved as follows:
[0131] S6.1: Transform the spectrum reuse problem into a maximum weighted bipartite graph matching problem, and design the bipartite graph using the elements in the system energy efficiency matrix as weights;
[0132] S6.2: Solve for the spectrum reuse factor that maximizes the SEE and the final SEE using the Hungarian algorithm.
[0133] Example 3
[0134] Based on Embodiments 1 and 2, this embodiment provides the following specific embodiments:
[0135] In the specific implementation process, random geometry is used to model vehicle positions. The vehicle distribution in each lane follows a spatial Poisson process. Given a vehicle speed of v, the average vehicle distance is... And the vehicle density is M vehicles are randomly selected from the generated vehicles as CUE users, and K pairs of vehicles are selected as DUE users. The simulation parameters are set as follows: cell radius is 500m, number of CUE users M=10, number of DUE users K=10, vehicle speed is 60 and 80km / h, shadow fading of V2I link follows a log-normal distribution with mean 0 and standard deviation 8dB, shadow fading of V2V link follows a log-normal distribution with mean 0 and standard deviation 3dB, outage probability threshold p0 is 0.001, and SINR threshold is... The V2I link rate threshold is 0.5 bps / Hz, the power limit is 17 dBm, the circuit loss P0 is 40 dBm, and the noise power is -114 dBm.
[0136] Figure 2 In this paper, the relationship between the total energy efficiency of the system and the V2V link outage probability threshold p0 is shown for the power control subproblem. All curves show an upward trend. This is because a higher outage probability threshold for the V2V link indicates that the link can tolerate greater interference, allowing CUE users to increase transmit power and transmission rate, thus improving SEE. Comparison between methods shows that the proposed method outperforms the maximum power method and the total individual energy efficiency (TIEE) power control method, indicating that the proposed method can effectively improve SEE and achieve energy-saving communication. Numerical results show that when the outage probability threshold p0 is 10... -4 At that time, the SEE achieved by the proposed algorithm was 83% and 4.9% higher than that of the maximum power method and the maximum TIEE power control method, respectively.
[0137] Figure 3 In this paper, the overall energy efficiency of the system relative to the SINR threshold is demonstrated for the spectrum reuse subproblem. The relationship shows that all curves exhibit a downward trend. This is because as the minimum QoS requirement of the DUE increases, the tolerance for interference in the V2V link decreases, leading to a decrease in the CUE's transmit power, which reduces the overall transmission rate and energy efficiency of the system. Comparing the methods, the proposed method outperforms the Max-min, Greedy, and Random algorithms in terms of SEE performance. Numerical results show that... In terms of overall energy efficiency, the proposed method outperforms MaxMin, random, and greedy algorithms by approximately 29.2%, 20.0%, and 2.9%, respectively.
[0138] Figure 4In this paper, the relationship between the overall system energy efficiency and vehicle speed *v* is presented for the entire resource allocation problem, showing that all curves exhibit a downward trend. This decrease is attributed to the fact that increased vehicle speed leads to a larger average distance between vehicles, resulting in a sparser vehicle distribution. This, in turn, negatively impacts the reliability of the V2V link. To maintain the reliability constraints of the V2V link, the CUE (Continuous User Experience) reduces transmission power, thus affecting the SEE (Self-Efficiency Optimization). Comparing simulation results under different algorithms, it can be concluded that the resource allocation method proposed in this invention can effectively improve the system energy efficiency at all vehicle speeds compared to other resource allocation methods.
[0139] The same or similar labels correspond to the same or similar parts;
[0140] The positional relationships depicted in the accompanying drawings are for illustrative purposes only and should not be construed as limiting this patent.
[0141] Obviously, the above examples of the present invention are merely illustrative of the invention and are not intended to limit the implementation of the invention. Those skilled in the art will recognize that other variations or modifications can be made based on the above description. It is neither necessary nor possible to exhaustively describe all embodiments here. Any modifications, equivalent substitutions, and improvements made within the spirit and principles of the present invention should be included within the scope of protection of the claims of the present invention.
Claims
1. A method for energy efficiency oriented C-V2X vehicle networking resource allocation, characterized in that, Comprise the following steps: S1: two kinds of vehicle user position information and channel characteristics are used to calculate four kinds of channel gain, so as to obtain the two kinds of user signal to interference and noise ratio and V2I link transmission rate; S2: the system energy efficiency (System Energy Efficiency, SEE) is defined as the ratio of V2I link rate to the power consumption of two users in the scene, and the joint power control and spectrum reuse total optimization problem is constructed under the constraint condition, and the optimization target is to maximize the SEE; S3: the MINLP problem is divided into power control and spectrum reuse two sub problems; S4: for the power control sub problem, an iterative power control algorithm is used to solve the optimal transmission power under fixed spectrum reuse; S5: based on the optimal transmission power, the corresponding energy efficiency is obtained, and according to the minimum rate constraint of V2I link, the multiplexing pair not meeting the constraint is removed to obtain the SEE matrix; S6: in the spectrum reuse sub problem, the spectrum reuse problem is transformed into the maximum weight bipartite graph matching problem, and the spectrum reuse factor which makes the SEE maximum is solved by Hungarian algorithm based on the system energy efficiency matrix; S7: the optimal power, spectrum reuse factor and maximum SEE of the two kinds of vehicle users are returned.
2. The energy efficiency oriented C-V2X vehicular networking resource allocation method of claim 1, wherein, The calculation of signal to interference and noise ratio and transmission rate in step S1 is as follows: S1.1: define a set of M cellular vehicle users (CUEs) communicating with the base station over a cellular link, i.e. a V2I link, as define a set of K pairs of D2D users (DUEs) communicating with each other over a D2D link, i.e. a V2V link, as The four channel gains are the channel gain h m,B from the mth CUE to the base station (BS), the channel gain h k between the kth pair of D2D users, the channel gain h k,B from the kth DUE to the BS, and the channel gain h m,k from the mth CUE to the kth DUE. where g is a small-scale fading component, g follows an exponential distribution with mean 1, a is a large-scale fading component, L is the transmission distance, g is a path loss factor, A is a path loss constant, and b is a shadow fading. The four gains can be calculated according to the above formula. S1.2: the long-term SINR expression of the mth CUE received at the BS is: The SINR expression of the kth DUE received at the BS is: wherein Pc is the CUE transmit power, Pd is the DUE transmit power, λ m,B , λ k,B is the mean of the small-scale fading component g, i.e. λ m,B = λ k,B = 1, ρ m,k is the spectrum reuse factor, ρ m,k = 1 means that the k-th DUE reuses the spectrum of the m-th CUE, forming a spectrum reuse pair, ρ m,k = 0 means that the k-th DUE does not reuse the spectrum of the m-th CUE, S1.3: the expression of the V2I link traversal rate obtained from the long-term SINR of the CUE user is as follows:
3. The energy efficiency oriented C-V2X vehicular networking resource allocation method of claim 2, wherein, In step S2, the optimization problem with SEE maximization as the target is constructed, which is as follows: S2.1: the SEE is defined as the ratio of the rate of V2I link requiring high transmission rate to the sum of the energy consumption of two users, and the expression is as follows: Wherein, P0 represents the fixed circuit power loss, ω is the inverse of the user's power amplifier efficiency and feeder loss, ω>1, S2.2: the resource allocation problem facing SEE maximization is described as follows: where p0is the maximum outage probability of the V2V link, when the SINR in the V2V link is lower than the minimum SINR threshold required to establish a reliable link , the V2V link is disconnected, is the minimum rate requirement of the CUE, and C1and C2represent the minimum QoS requirements of each DUE and CUE, respectively, C3and C4limit the maximum transmit power of the CUE and DUE, and C5and C6constrain that each V2I channel can be multiplexed by only one V2V link, and each V2V link can be multiplexed by only one V2I channel.
4. The energy efficiency oriented C-V2X vehicular networking resource allocation method of claim 3, wherein, In step S3, the MINLP problem is divided into two sub problems, which are as follows: S3.1: the first power control sub problem after splitting is expressed as: S3.2: the second spectrum reuse sub problem after splitting is expressed as:
5. The energy efficiency oriented C-V2X vehicular networking resource allocation method of claim 4, wherein, In step S4, an iterative power control algorithm is proposed to solve the optimal transmission power for the power control sub problem split in step S3, which is as follows: S4.1: First, regarding constraint C1, the small-scale fading component h follows an exponential distribution with a mean of 1. k with h m,k Integrating, we obtain the transmit power under constraint C1. and satisfy And because make make get Minimum feasible value S4.2: Considering the maximum power constraint in C3 and C4, two power feasible regions are generated, and the monotonicity of the objective function SEE is analyzed. It can be known that if the power of the transmitter is fixed SEEη ee With monotonically decreasing, so the maximum SEE can only be obtained in the upper bound of the power feasible region, thereby further narrowing the optimal solution of the power control problem to the upper bound of the feasible region, i.e. the curve The two-variable optimization problem is converted into a single-variable optimization problem about The expression of the converted single-variable optimization problem is as follows: S4.3: Due to being a function one of the terms, and this term has almost no influence on the relation between and is replaced by a constant u, and the relation between and is rewritten as The nonlinear fractional programming problem is transformed into the following expression: S4.4: Transform the converted non-linear fractional programming problem into an equivalent subtraction form that is easier to solve, the optimal solution before and after the problem transformation The same as the optimal SEE η ee With the iteration, the single direction converges to the optimal value The converted expression is as follows: S4.5: update the inner convex optimization problem using the closed-form expression of the solution, select the solution that satisfies the power constraint and corresponds to a larger function value among the two solutions, and let The closed-form expression is as follows: S4.6: the solution of the inner-layer convex optimization problem updating the parameter η in the outer-loop ee until the equivalent subtraction form of the objective function converges to 0, obtaining the optimal transmission power of the DUE under the current multiplexing pair and the corresponding optimal and obtaining the optimal transmission power of the CUE through the one-to-one correspondence between and Thus, the optimal solution of the power control sub-problem is obtained and the corresponding 6. The energy efficiency oriented C-V2X vehicular networking resource allocation method of claim 5, wherein, In step S5, the method for solving the system energy efficiency matrix is as follows: S5.1: Based on each multiplexing pair in the power control sub-problem, the corresponding judging the V2I link rate of the multiplexing pair whether the rate requirement of the V2I link can be met, if not, blocking the multiplexing pair by setting the element at the corresponding position of the SEE matrix to negative infinity, and after traversing all multiplexing pairs, obtaining the preliminary SEE matrix, the process can be represented as the following formula:
7. The energy efficiency oriented C-V2X vehicular networking resource allocation method of claim 6, wherein, In step S6, the spectrum reuse sub problem is solved based on Hungarian algorithm, which is as follows: S6.1: the spectrum reuse problem is transformed into the maximum weight bipartite graph matching problem, and the elements in the system energy efficiency matrix are designed as the weight of the bipartite graph; S6.2: the spectrum reuse factor which makes the SEE maximum and the final SEE are solved by Hungarian algorithm.
