D2D communication resource reuse method, system, terminal and medium based on STACKELBERG game

Abstract

The present invention discloses a D2D communication resource reuse method, system, terminal and medium based on STACKELBERG game, relates to the field of wireless communication technology, solves the problem of low spectrum resource utilization in the prior art, and the key points of the technical solution are: pricing is performed based on the maximum number of times a channel can be reused and the number of times a D2D pair actually reuses the channel, and the levels of different channels are distinguished, so as to achieve the purpose of incentivizing D2D users to use resource blocks with a large number of reuse times as much as possible to improve the network spectrum efficiency. In the STACKELBERG game, the game between cellular users and D2D users is a non-cooperative game. When the game reaches Nash equilibrium, the utility of the base station and the utility of the D2D pair are both maximized. The centralized decision-making of the D2D pair uses a genetic algorithm, which greatly reduces the algorithm complexity of the number of decisions for reusing channel resources.

Description

Technical Field

[0001] The present invention relates to the field of wireless communication technology, and more specifically, to a D2D communication resource multiplexing method, system, terminal and medium based on STACKELBERG game. Background Art

[0002] In D2D communication in cellular networks, two mobile users can communicate directly without going through a base station or core network.

[0003] The reused cellular frequency bands for in-band D2D communication include one-to-many (the spectrum of a cellular user is reused by multiple D2D pairs) and one-to-one (the spectrum of a cellular user is reused by one D2D pair) modes. In the one-to-many spectrum reuse mode, the base station wants to make a resource block reused by multiple D2D pairs as much as possible to improve spectrum utilization. Due to different user requirements for throughput, if a resource block is reused by multiple D2D pairs, too narrow transmission bandwidth may cause its transmission throughput to fail to meet the minimum requirements, resulting in users being unwilling to use the resource block or even unwilling to join the D2D network, which in turn leads to low spectrum resource utilization. Summary of the invention

[0004] The purpose of the present invention is to provide a D2D communication resource reuse method, system, terminal and medium based on STACKELBERG game, so as to encourage more and more D2D users to reuse the channel resources of lower-level cellular users to increase spectrum efficiency and maximize the utility of base stations and D2D users.

[0005] The above technical objectives of the present invention are achieved through the following technical solutions:

[0006] A D2D communication resource reuse method based on STACKELBERG game, comprising the following steps:

[0007] S1. The base station determines the initial pricing of each channel in the spectrum resource based on the maximum reuse times and the current number of times each channel is used in the spectrum resource;

[0008] S2. The D2D pair obtains the channel reused when the D2D pair has the maximum utility based on the initial pricing of each channel in the spectrum resources and its own throughput requirements through a genetic algorithm, and pays a fee corresponding to the initial pricing of the channel to the base station;

[0009] S3. After receiving the fee paid by the D2D pair, the base station allocates the channel to the corresponding D2D pair for communication transmission, and counts the number of times each channel in the spectrum resource is used after allocation, the throughput of the D2D pair, and the throughput of cellular users; and based on the fee paid by the D2D pair, the throughput of the D2D pair, the throughput of cellular users, and the sum of the bandwidths of each channel, obtains the utility of the base station itself;

[0010] S4. Use the allocated usage count to update the current usage count, and repeat S2 and S3 until the utility of the base station itself shows a downward trend.

[0011] Furthermore, the initial pricing of the channels in the spectrum resources includes a basic channel pricing and a channel surcharge;

[0012] Wherein, the channel basic pricing is calculated based on the maximum number of multiplexing times of the channel;

[0013] The channel surcharge is calculated based on the current number of times the channel is used.

[0014] Furthermore, the calculation formula of the channel basic pricing is:

[0015]

[0016] Among them, P k is the base price for channel k, n k is the maximum number of multiplexing times of channel k, and c is a constant.

[0017] Furthermore, the calculation formula of the channel surcharge is:

[0018]

[0019] Among them, Q k is the markup for channel k, is the current number of times channel k is used, and a and b are constants.

[0020] Furthermore, the utility of the D2D pair is calculated based on the throughput of the D2D pair and the paid fee.

[0021] Furthermore, the base station utility is calculated based on the spectrum efficiency and the fees received from the D2D pair payments;

[0022] The spectrum efficiency is calculated by the throughput of cellular users in the spectrum resources, the throughput of D2D pairs and the total bandwidth of each channel.

[0023] Furthermore, the calculation formula of the base station utility is:

[0024]

[0025] Among them, α is the normalization factor, x k，j is the D2D selection strategy for user j for channel k, C k，j is the throughput of cellular user i on channel k, B k The bandwidth of channel k, θ k is the initial pricing of channel k in the spectrum resource, is the number of times channel k is multiplexed by a D2D pair.

[0026] A D2D communication resource reuse system based on STACKELBERG game, comprising:

[0027] A first calculation module is used for the base station to determine the initial pricing of each channel in the spectrum resources based on the maximum reuse times and the current usage times of each channel in the spectrum resources;

[0028] The second calculation module, the D2D pair obtains the channel reused when the D2D pair has the maximum utility based on the initial pricing of each channel in the spectrum resources and its own throughput requirements through a genetic algorithm, and pays a fee corresponding to the initial pricing of the channel to the base station;

[0029] The third calculation module is used for the base station to allocate the channel to the corresponding D2D pair for communication transmission after receiving the fee paid by the D2D pair, and to count the number of times each channel in the spectrum resource is used after allocation, the throughput of the D2D pair and the throughput of the cellular user; and to obtain the utility of the base station itself based on the fee paid by the D2D pair, the throughput of the D2D pair, the throughput of the cellular user and the sum of the bandwidth of each channel;

[0030] The fourth calculation module is used to update the current usage count by using the allocated usage count, and repeat S2 and S3 until the utility of the base station itself shows a downward trend.

[0031] An electronic terminal, comprising:

[0032] A memory, the memory being used to store a computer program;

[0033] A processor is used to execute the computer program stored in the memory so that the electronic terminal executes a D2D communication resource multiplexing method based on STACKELBERG game.

[0034] A computer-readable storage medium stores a computer program, wherein the computer-readable storage medium is characterized in that when the program is executed by a processor, a D2D communication resource multiplexing method based on STACKELBERG game is implemented.

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

[0036] ① Pricing is performed based on the maximum number of times a channel can be reused and the number of times a D2D pair actually reuses the channel, and the levels of different channels are differentiated to encourage D2D users to use resource blocks with the highest number of reuses as much as possible, thereby improving the network spectrum efficiency.

[0037] ② In the STACKELBERG game, the game between cellular users and D2D users is a non-cooperative game. When the game reaches the Nash equilibrium, the utility of the base station and the utility of the D2D pair are both maximized.

[0038] ③The centralized decision-making of D2D pairs uses a genetic algorithm, which greatly reduces the algorithm complexity of the number of decisions for multiplexing channel resources.

[0039] ④Through genetic algorithms, we can obtain the number of times each channel is actually reused. BRIEF DESCRIPTION OF THE DRAWINGS

[0040] The drawings described herein are used to provide a further understanding of the embodiments of the present invention, constitute a part of this application, and do not constitute a limitation of the embodiments of the present invention. In the drawings:

[0041] Figure 1 This is a schematic diagram of the process of a base station leasing cellular user spectrum resources to a D2D pair in the embodiment:

[0042] Figure 2 A system model for multiplexing uplink cellular network resources for D2D communication in an embodiment;

[0043] Figure 3 This is a diagram of the game process between the base station and the D2D in the embodiment;

[0044] Figure 4 It is a flow chart of the genetic algorithm used in the embodiment;

[0045] Figure 5 is the relationship between the number of times the channel is actually used and the price increase;

[0046] Figure 6 Schematic diagram of three cellular channels in the embodiment;

[0047] Figure 7 is a trend graph of the utility of the base station changing with the number of D2D pairs;

[0048] Figure 8 This is a graph showing the utility of D2D pairs changing with the number of D2D pairs. DETAILED DESCRIPTION

[0049] In order to make the objectives, technical solutions and advantages of the present invention more clearly understood, the present invention is further described in detail below in conjunction with embodiments and drawings. The exemplary embodiments of the present invention and their description are only used to explain the present invention and are not intended to limit the present invention.

[0050] In addition, the terms "first" and "second" are used for descriptive purposes only and should not be understood as indicating or implying relative importance or implicitly indicating the number of the indicated technical features. Therefore, the features defined as "first" and "second" may explicitly or implicitly include one or more of the features. In the description of the present invention, the meaning of "plurality" is two or more, unless otherwise clearly and specifically defined.

[0051] Embodiment: In a cellular network, the base station wants D2D pairs to use resource blocks with a higher number of reuses as much as possible, thereby improving spectrum efficiency, but this also increases the interference of D2D pairs to cellular users. Since users have different requirements for throughput, if a resource block is reused by multiple D2D pairs, a too narrow transmission bandwidth may cause its transmission throughput to fail to meet the minimum requirement, resulting in users being unwilling to use the resource block or even unwilling to join the D2D network. Therefore, the following is provided: Figure 1-Figure 8 The disclosed D2D communication resource reuse method, system, terminal and medium based on STACKELBERG game encourage users to use resource blocks with the most reuse times as much as possible through incentive strategies to improve network spectrum efficiency. The relationship between the base station and the D2D pair is modeled as a STACKELBERG game relationship, and the base station is set as the leader and the D2D pair is set as the follower. In this game, the game between cellular users and D2D users is a non-cooperative game. The base station first initializes the pricing strategy broadcast to the D2D pair, and then after receiving this price strategy, all D2D pairs make decisions collectively, and use genetic algorithms to find the global optimal solution for D2D pairs to select channels, and then calculate this optimal solution, which is the sum of the utilities of all D2D pairs. After receiving the decision feedback from the D2D pair, the base station calculates its own utility: if the utility of the base station has not begun to decline, the base station adjusts the pricing strategy, and the D2D pair makes the optimal decision again based on this pricing strategy, and so on; if the utility of the base station begins to decline, that is, when this game reaches Nash equilibrium, the entire algorithm loop is exited, the algorithm ends, and the utility of the base station and the utility of the D2D pair are both maximized.

[0052] A D2D communication resource reuse method based on STACKELBERG game, comprising the following steps:

[0053] S1. The base station determines the initial pricing of each channel in the spectrum resources based on the maximum reuse times and the current number of times each channel is used in the spectrum resources. The maximum reuse times of each channel in the spectrum resources is the value set by the base station and remains unchanged during the algorithm; the initial value of the current number of times each channel in the spectrum resources is used is the assumed value of the base station (i.e., it is assumed that each channel will be reused by D2D pairs several times), and this value will change during the algorithm, specifically:

[0054] The base station prices the cellular resources as θ k , where θ k =P k +Q k .

[0055] Based on basic pricing.

[0056] Assume that there are channel k, channel k-1, channel k-2, ..., channel 3, channel 2, channel 1.

[0057] Bandwidth: B k =B k-1 =B k-2 =…=B3=B2=B1=B.

[0058] The base station sets the maximum reuse times of channel k to n k times, the maximum number of multiplexing times of channel k-1 is n k-1 times, ..., the maximum number of multiplexing of channel 1 is n1 times. The corresponding pricing is: (where n k >n k-1 >n k-2 >…>n1).

[0059] The principle is that the base station will set a lower basic pricing for a channel with a lower maximum reuse frequency than for a channel with a higher maximum reuse frequency. The basic pricing setting principle reflects the relative fairness of channel pricing.

[0060] is the price added by the base station to the resource block (where a, b, and c are all constants).

[0061] Referring to the demand model in economics, the price increase Q of each resource block k Generally, the total resource demand The linear price response function is: Where a and b are constants greater than zero. The more times a resource block is reused, the lower the price increase of the resource block pricing, that is, The larger the Q k The smaller. Among them, Q k Curve like Figure 5 shown.

[0062] The principle is: the base station wants more D2D users to reuse channels with low pricing and high reuse times, so an incentive strategy is adopted. If D2D users reuse channels with low pricing and high reuse times, the base station will charge a relatively low price for this D2D user pair; otherwise, the base station will charge a relatively high price for this D2D user pair.

[0063] S2. The D2D pair obtains the channel reused when the D2D pair has the maximum utility based on the initial pricing of each channel in the spectrum resources and its own throughput requirements through a genetic algorithm, and pays the base station a fee corresponding to the initial pricing of the channel, specifically:

[0064] As a follower, in each round of the game, the D2D pair chooses the spectrum it wants to reuse based on the price of spectrum resources set by the base station to maximize its utility function:

[0065] That is, the throughput of the D2D user minus the cost of the D2D user to purchase spectrum resources. Where β is the normalization factor. k，j is the D2D selection strategy for user j on channel k. If D2D user j reuses channel k, then x k，j =1; if D2D user j does not reuse channel k, then x k，j =0. C k，j is the throughput of D2D pair j on channel k, is the number of times channel k is multiplexed by a D2D pair.

[0066] The constraints are as follows: C6;

[0067] C7:

[0068] C8:

[0069] C9:

[0070] Constraint C6 means that for a D2D pair, at most one channel is allocated to this D2D pair. Constraint C7 means that when D2D reuses cellular resources, it must ensure its minimum transmission rate. Constraint C8 ensures that at most Q D2D pairs are allocated to one channel. Constraint C9 means x k，j and x k，j The value is 0 or 1.

[0071] S3. After receiving the fee paid by the D2D pair (D2D transmitter, D2D receiver), the base station allocates the channel to the corresponding D2D pair for communication transmission, and counts the number of times each channel in the spectrum resource is used after allocation, the throughput of the D2D pair, and the throughput of the cellular user; and based on the fee paid by the D2D pair, the throughput of the D2D pair, the throughput of the cellular user, and the sum of the bandwidths of each channel, the utility of the base station itself is obtained, which is specifically:

[0072] As a leader, the base station hopes to maximize its own utility function:

[0073] That is, the sum of spectrum efficiency and the fees charged to D2D users. Spectral efficiency refers to the sum of the throughput of cellular users and D2D users (the total throughput of the cellular system) divided by the total bandwidth of K channels. The fees charged to D2D users refer to the product of the unit price of channel k and the number of times channel k is actually used.

[0074] Among them, α is the normalization factor, x k，j is the D2D selection strategy for user j for channel k, C k，i is the throughput of cellular user i on channel k, B k The bandwidth of channel k, θ k is the initial pricing of channel k in the spectrum resource, is the number of times channel k is multiplexed by a D2D pair.

[0075] The constraints are as follows: C1:

[0076] C2:

[0077] C3:

[0078] C4:

[0079] C5:

[0080] Constraint C1 guarantees the minimum transmission rate of each cellular user i. Constraint C2 means that D2D must ensure its minimum transmission rate when reusing cellular resources. Constraint C3 means that for a D2D pair, at most one channel is allocated to this D2D pair. Constraint C4 ensures that at most Q D2D pairs are allocated to one channel. Constraint C5 represents x k，i and x k，j The value is 0 or 1.

[0081] As attached Figure 3 As shown, the reused D2D mode in a single cell scenario, where the D2D pair shares the channel with the cellular user operating in the uplink mode. In a cellular cell, there are Z cellular users, Z = {1, 2..., z}, V D2D pairs, V = {1, 2,..., v}, and I cellular users allow their channel resources to be reused by D2D pairs, I = {1, 2,..., i}, There are J D2D pairs that reuse cellular resources, J = {1, 2, ..., j}, There are K orthogonal channels, K = {1, 2, ..., k}, and each channel k is allocated to a cellular user i by a scheduler at the base station.

[0082] The transmission power of cellular user i is P c , the transmission power of the D2D transmitter is p d , the uplink channel power gain from cellular user i to the base station on channel k is h iB (k), the channel power gain from the D2D transmitter to the D2D receiver of D2D pair j on channel k is The uplink channel power gain from the D2D transmitter of D2D pair j on channel k to the base station is g jB (k), the channel power gain from cellular user i to the D2D receiver of D2D pair j on channel k is The channel power gain from the D2D transmitter of D2D pair m to the D2D receiver of D2D pair j on channel k is

[0083] In the communication model, there are two main communication links: one is that the cellular user transmits the uplink signal to the base station, and the other is that the D2D transmitter of the D2D pair sends information to the D2D receiver.

[0084] For cellular users: When cellular users use uplink resources to transmit information to the base station, the interference is mainly caused by the signals transmitted to the base station by the D2D transmitters of the D2D pairs that multiplex the same channel in the same time slot. This interference is represented by I CD Indicates that

[0085] For a D2D pair: When the D2D transmitter of the D2D pair sends information to the D2D receiver, the interference is mainly caused by the cellular users using the same channel transmitting signals to the D2D receiver in the same time slot.

[0086] Then the signal-to-interference-to-noise ratio of cellular user i on channel k is: The signal-to-interference-to-noise ratio of D2D pair j on channel k is:

[0087] C k，i is the throughput of cellular user i on channel k: C k，j is the throughput of D2D pair j on channel k:

[0088] S4. Use the allocated usage count to update the current usage count, and repeat S2 and S3 until the utility of the base station itself shows a downward trend. At this time, the game reaches the Nash equilibrium, which is specifically:

[0089] If the pricing strategy set of base stations in the feasible domain is Θ k , the strategy set of D2D to reuse cellular channels is φ k , if the following conditions are met:

[0090]

[0091]

[0092] but It is the solution of base station and D2D to the optimization problem, and also the solution of Nash equilibrium.

[0093] The relationship between the base station and the D2D pair is modeled as a STACKELBERG game relationship, such as Figure 4 As shown, the base station is set as the leader and the D2D pair is set as the follower.

[0094] The base station prices the cellular resources as θ k ,in As the basic pricing (the higher the level of resource blocks, the lower the pricing, to ensure the fairness of multiplexing channels), is the price added by the base station for resource blocks, where a, b, and c are all constants, and the lower the channel reuse level of the D2D user, the less the price added by the base station for this user, thereby achieving the purpose of incentivizing D2D users to reuse channels with low levels.

[0095] Since the throughput required by each user and the budget for purchasing resource blocks are different, when making decisions on selecting cellular channel resources, they will try to choose the channel that can maximize their throughput under the premise of limited budget.

[0096] Assume that there are 6 D2D user pairs and 3 cellular channels are available for reuse. Assume that the bandwidth of the 3 channels is the same, such as Figure 6 shown.

[0097] The base station first sets the initial price: For channel 1, the initial price of the base station is For channel 2, the initial pricing of the base station is For channel 3, the initial pricing of the base station is The base station first assumes a Then, the initial pricing is made. After receiving the pricing information broadcasted by the base station, the D2D pairs use centralized decision-making to make a unified decision on the reuse of cellular channel resources, with the goal of maximizing the utility of all D2D pairs. The centralized decision of all D2D pairs uses a genetic algorithm, which greatly reduces the algorithm complexity of the number of decisions on the reuse of channel resources. After receiving the centralized decision results of all D2D pairs, the base station makes a unified decision based on the actual Calculate your own utility and adjust your pricing strategy D2D users will make unified decisions based on the pricing of the base station, and so on, which is also a game process. When the base station calculates its own utility and finds that the utility is decreasing, the algorithm will end.

[0098] Figure 7 The utility of the base station varies with the number of D2D pairs. Figure 7 It can be seen that the utility of the base station under the three pricing strategies increases with the increase in the number of D2D pairs. This is because when the number of channels remains unchanged, as the number of D2D pairs increases, the spectrum efficiency of the base station and the fees charged to the D2D pairs increase, so their sum, that is, the utility of the base station, also increases. Finally, because the number of users in each channel tends to saturation, the utility of the base station tends to converge. Comparing the average pricing scheme and the random pricing scheme, it can be found that the utility of the base station in this scheme is greater than that of the two schemes. It is obvious that the base station can better motivate users to reuse resource blocks and maximize its own utility by performing differentiated pricing according to different channels. This fully demonstrates the importance of the base station's incentive strategy for D2D users in improving the utility of the base station.

[0099] Figure 8 The utility of D2D pairs varies with the number of D2D pairs. Figure 8 It can be seen that the utility of D2D pairs under the three pricing strategies increases with the increase in the number of D2D pairs. Comparing the average pricing scheme and the random pricing scheme, it can be found that the utility of D2D pairs in this scheme is greater than that of the two schemes, because for the average pricing scheme and the random pricing scheme, after the base station differentiates the resource blocks in this scheme, D2D pair users can better choose the channels they want to reuse according to their own throughput requirements and the money they have, so as to maximize their own utility. This fully demonstrates that under the base station's incentive strategy for D2D users, D2D pairs can better improve their own utility.

[0100] Through the above simulation comparison, it can be seen that the D2D resource reuse incentive scheme based on STACKELBERG game proposed in the present invention is reasonable and effective. The base station performs basic hierarchical pricing for different resource blocks according to the maximum number of times the resource blocks can be reused, and then gives different incentives to D2D for reuse of different resource blocks according to the price increase, so as to reasonably reuse resource blocks, improve resource utilization, and maximize the utility of base stations and D2D users.

[0101] This embodiment also provides a D2D communication resource reuse system based on STACKELBERG game, including:

[0102] A first calculation module is used for the base station to determine the initial pricing of each channel in the spectrum resources based on the maximum reuse times and the current usage times of each channel in the spectrum resources;

[0103] The second calculation module, based on the initial pricing of each channel in the D2D spectrum resource and its own throughput requirements, obtains the channel reused by the D2D pair when the D2D pair has the maximum utility through a genetic algorithm, and pays the base station a fee corresponding to the initial pricing of the channel;

[0104] The third calculation module is used for the base station to allocate the channel to the corresponding D2D pair for communication transmission after receiving the fee paid by the D2D pair, and to count the number of times each channel in the spectrum resource is used after allocation, the throughput of the D2D pair and the throughput of the cellular user; and to obtain the utility of the base station itself based on the fee paid by the D2D pair, the throughput of the D2D pair, the throughput of the cellular user and the sum of the bandwidth of each channel;

[0105] The fourth calculation module is used to update the current usage count by using the allocated usage count, and repeat S2 and S3 until the utility of the base station itself shows a downward trend.

[0106] This embodiment further provides an electronic terminal, comprising: a memory, the memory being used to store a computer program; and a processor, the processor being used to execute the computer program stored in the memory, so that the electronic terminal executes a D2D communication resource multiplexing method based on the STACKELBERG game.

[0107] This embodiment further provides a computer-readable storage medium, on which a computer program is stored. When the program is executed by a processor, a D2D communication resource multiplexing method based on the STACKELBERG game is implemented.

[0108] The specific implementation methods described above further illustrate the objectives, technical solutions and beneficial effects of the present invention in detail. It should be understood that the above description is only a specific implementation method of the present invention and is not intended to limit the scope of protection of the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present invention should be included in the scope of protection of the present invention.

Claims

1. A D2D communication resource reuse method based on STACKELBERG game, characterized in that: The following steps are involved: S1. The base station determines the initial pricing of each channel in the spectrum resource based on the maximum reuse times and the current number of times each channel is used in the spectrum resource; Among them, the base station’s pricing for cellular resources is θ k , where θ k =P k +Q k ; The base price for channel k; is the price added by the base station for the resource block; n k is the maximum number of multiplexing times of channel k; Q k is the markup for channel k, is the current number of times channel k is used; a, b, c are all constants; S2. The D2D pair obtains the channel reused when the D2D pair has the maximum utility based on the initial pricing of each channel in the spectrum resources and its own throughput requirements through a genetic algorithm, and pays a fee corresponding to the initial pricing of the channel to the base station; Among them, D2D pairs, as followers, choose the spectrum they want to reuse according to the price of spectrum resources set by the base station in each round of the game to maximize their utility function: That is, the throughput of D2D users minus the cost of D2D users purchasing spectrum resources; β is the normalization factor; x k,j is the D2D selection strategy for user j on channel k. If D2D user j reuses channel k, then x k,j =1; if D2D user j does not reuse channel k, then x k,j =0; C k,j is the throughput of D2D pair j on channel k, is the number of times channel k is multiplexed by a D2D pair; S3. After receiving the fee paid by the D2D pair, the base station allocates the channel to the corresponding D2D pair for communication transmission, and counts the number of times each channel in the spectrum resource is used after allocation, the throughput of the D2D pair, and the throughput of cellular users; and based on the fee paid by the D2D pair, the throughput of the D2D pair, the throughput of cellular users, and the sum of the bandwidths of each channel, obtains the utility of the base station itself; Among them, the base station, as a leader, hopes to maximize its own utility function: That is, the sum of spectrum efficiency and the fees charged to D2D users. Spectral efficiency refers to the sum of the throughput of cellular users and D2D users divided by the total bandwidth of K channels. The fees charged to D2D users refer to the product of the unit price of channel k and the number of times channel k is actually used. Among them, α is the normalization factor, x k,j is the D2D selection strategy for user j for channel k, C k,i is the throughput of cellular user i on channel k, B k The bandwidth of channel k, θ k is the initial pricing of channel k in the spectrum resource, is the number of times channel k is multiplexed by a D2D pair; S4. Use the allocated usage count to update the current usage count, and repeat S2 and S3 until the utility of the base station itself shows a downward trend.

2. A D2D communication resource reuse system based on STACKELBERG game, characterized in that: include: A first calculation module is used for the base station to determine the initial pricing of each channel in the spectrum resources based on the maximum reuse times and the current usage times of each channel in the spectrum resources; Among them, the base station’s pricing for cellular resources is θ k , where θ k =P k +Q k ; The base price for channel k; is the price added by the base station for the resource block; n k is the maximum number of multiplexing times of channel k; Q k is the markup for channel k, is the current number of times channel k is used; a, b, c are all constants; The second calculation module, the D2D pair obtains the channel reused when the D2D pair has the maximum utility based on the initial pricing of each channel in the spectrum resources and its own throughput requirements through a genetic algorithm, and pays a fee corresponding to the initial pricing of the channel to the base station; Among them, D2D pairs, as followers, choose the spectrum they want to reuse according to the price of spectrum resources set by the base station in each round of the game to maximize their utility function: That is, the throughput of D2D users minus the cost of D2D users purchasing spectrum resources; β is the normalization factor; x k,j is the D2D selection strategy for user j on channel k. If D2D user j reuses channel k, then x k,j =1; if D2D user j does not reuse channel k, then x k,j =0; C k,j is the throughput of D2D pair j on channel k, is the number of times channel k is multiplexed by a D2D pair; The third calculation module is used for the base station to allocate the channel to the corresponding D2D pair for communication transmission after receiving the fee paid by the D2D pair, and to count the number of times each channel in the spectrum resource is used after allocation, the throughput of the D2D pair and the throughput of the cellular user; and to obtain the utility of the base station itself based on the fee paid by the D2D pair, the throughput of the D2D pair, the throughput of the cellular user and the sum of the bandwidth of each channel; Among them, the base station, as a leader, hopes to maximize its own utility function: That is, the sum of spectrum efficiency and the fees charged to D2D users. Spectral efficiency refers to the sum of the throughput of cellular users and D2D users divided by the total bandwidth of K channels. The fees charged to D2D users refer to the product of the unit price of channel k and the number of times channel k is actually used. Among them, α is the normalization factor, x k,j is the D2D selection strategy for user j for channel k, C k,i is the throughput of cellular user i on channel k, B k The bandwidth of channel k, θ k is the initial pricing of channel k in the spectrum resource, is the number of times channel k is multiplexed by a D2D pair; The fourth calculation module is used to update the current usage count by using the allocated usage count, and repeat S2 and S3 until the utility of the base station itself shows a downward trend.

3. An electronic terminal, characterized in that: include: A memory, the memory being used to store a computer program; A processor, wherein the processor is used to execute the computer program stored in the memory so that the electronic terminal executes the D2D communication resource multiplexing method based on STACKELBERG game according to claim 1.

4. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, a D2D communication resource multiplexing method based on STACKELBERG game according to claim 1 is implemented.

Images