CN111465054A - D2D communication resource allocation method based on utility fairness - Google Patents

D2D communication resource allocation method based on utility fairness Download PDF

Info

Publication number
CN111465054A
CN111465054A CN202010122669.3A CN202010122669A CN111465054A CN 111465054 A CN111465054 A CN 111465054A CN 202010122669 A CN202010122669 A CN 202010122669A CN 111465054 A CN111465054 A CN 111465054A
Authority
CN
China
Prior art keywords
user
users
cellular
channel
utility
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202010122669.3A
Other languages
Chinese (zh)
Inventor
张晶
马维鑫
姜鸿强
刘金鑫
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Nanjing University of Posts and Telecommunications
Original Assignee
Nanjing University of Posts and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Nanjing University of Posts and Telecommunications filed Critical Nanjing University of Posts and Telecommunications
Priority to CN202010122669.3A priority Critical patent/CN111465054A/en
Publication of CN111465054A publication Critical patent/CN111465054A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0215—Traffic management, e.g. flow control or congestion control based on user or device properties, e.g. MTC-capable devices
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0268—Traffic management, e.g. flow control or congestion control using specific QoS parameters for wireless networks, e.g. QoS class identifier [QCI] or guaranteed bit rate [GBR]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—TPC
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/24—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/241—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account channel quality metrics, e.g. SIR, SNR, CIR, Eb/lo
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—TPC
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/24—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters
    • H04W52/243—TPC being performed according to specific parameters using SIR [Signal to Interference Ratio] or other wireless path parameters taking into account interferences
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—TPC
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/26—TPC being performed according to specific parameters using transmission rate or quality of service QoS [Quality of Service]
    • H04W52/265—TPC being performed according to specific parameters using transmission rate or quality of service QoS [Quality of Service] taking into account the quality of service QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—TPC
    • H04W52/18—TPC being performed according to specific parameters
    • H04W52/26—TPC being performed according to specific parameters using transmission rate or quality of service QoS [Quality of Service]
    • H04W52/267—TPC being performed according to specific parameters using transmission rate or quality of service QoS [Quality of Service] taking into account the information rate
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W52/00—Power management, e.g. TPC [Transmission Power Control], power saving or power classes
    • H04W52/04—TPC
    • H04W52/30—TPC using constraints in the total amount of available transmission power
    • H04W52/36—TPC using constraints in the total amount of available transmission power with a discrete range or set of values, e.g. step size, ramping or offsets
    • H04W52/367—Power values between minimum and maximum limits, e.g. dynamic range

Abstract

The invention provides a D2D communication resource allocation method based on utility fairness, a system model is constructed based on the maximization of the utility of a D2D user, under the condition that the lowest QoS requirement of a cellular user is ensured and the power of all users is limited, a decomposition method is used for dividing a main problem into two sub-problems, a Lagrangian dual method can be used for solving the sub-problems to obtain the optimal transmission power of all users, the optimal channel allocation strategy of the D2D user is solved at the same time, the main problem is solved iteratively by adopting a secondary gradient method, and therefore the D2D communication in a cellular network is achieved. The method jointly optimizes the channel allocation and power control of all users, allocates the optimal transmission power for cellular users and D2D users in the system, and distributes channel resources to the optimal D2D users, thereby reducing the energy loss of the cellular users and the D2D users and improving the system performance. Due to the characteristics of the utility function, the method can further improve the fairness of the D2D users on the basis of ensuring the capacity of the D2D users.

Description

D2D communication resource allocation method based on utility fairness
Technical Field
The invention relates to the technical field of communication, in particular to a D2D communication resource allocation method based on utility fairness.
Background
With the development of mobile communications, D2D communications have been developed, with the demand for high data rate proximity services being driven by more and more mobile users, and the priority spectrum resources being significantly insufficient, which drives the generation of efficient resource allocation methods. The D2D communication technology is different from the traditional cellular communication, D2D is a device coexisting in the cellular network, and can directly perform communication between devices without forwarding through a base station, and the D2D users are receiving more and more attention at present because they reuse the channel resources of cellular users and save limited spectrum resources. Device-to-device (D2D) communication has become a promising technology for optimizing spectral efficiency in future cellular networks, and is one of the most important key technologies for fifth generation mobile communications (5G).
D2D communication in the cellular network may not pass through the base station, which is equivalent to relieving the pressure of the base station, and because there is a delay through forwarding of the base station, D2D communication does not pass through the base station, which reduces part of the delay, and the interference caused by the communication becomes acceptable as long as reasonable processing is used to control the interference within a controllable range, compared with the communication advantage caused by D2D, the conventional cellular user exclusively uses AN orthogonal sub-channel, while D2D communication occupies half of the spectrum resource to perform communication, which is AN inherent advantage, D2D communication is performed within a cell coverage range, which is a short-range communication method, because the communication distance is shorter, D2D only needs lower transmission power, which is equivalent to increasing the endurance time of the mobile phone, unlike the communication methods of the distances of the bluetooth and W L AN, the former is operated in AN unlicensed frequency band, D2D is a communication method with the cellular network, which has a better reliability than the bluetooth 2D communication method, and the communication method provides more convenient data access.
In a D2D heterogeneous cellular network, users can communicate using three communication modes, cellular mode, dedicated mode, and multiplexed mode. The cellular mode is a traditional communication mode of forwarding through a base station because D2D can not be carried out; the dedicated mode is an independent cellular mode, and like the cellular mode, a section of spectrum is specially allocated to D2D for communication, which has no mutual interference and the best communication quality, but because allocating individual spectrum resources cannot achieve the purpose of saving spectrum resources, the current multiplexing mode is receiving wide attention due to its higher spectrum efficiency, in the multiplexing mode, D2D users multiplex the channel resources of cellular users for communication, and because D2D multiplexes the resources, the problem of interference becomes more complex, and many efficient methods and interference processing means for resource multiplexing appear. Therefore, allocating reasonable resources to users to reduce interference between users and improving the overall performance of the system is a major research hotspot at present.
Disclosure of Invention
The invention aims to provide a D2D communication resource allocation method based on utility fairness, which saves user energy by optimizing the sending power of cellular users and D2D users; reasonable channel resources are distributed for D2D users, the interference of multiplexing channel resources among users is reduced, on the basis of simultaneously considering the speed and the user fairness, the utility function is maximized, the satisfaction degree of the users is improved, and the system performance of D2D communication in a cellular network is improved.
The invention provides a D2D communication resource allocation method based on utility fairness, which comprises the following steps:
the method comprises the following steps: assuming that there are M cellular users and N D2D pairs of users, denoted by C ═ 1, 2.., M } and D ═ 1, 2.., N, respectively; assuming that M independent orthogonal channels are provided, the assumption of the occupation of the channels by the cellular user is already distributed, and the calculation is not influenced, so that the k-th channel resource is assumed to be occupied by the cellular user k;
step two: the signal-to-interference-and-noise ratios of D2D user i (1 ≦ i ≦ N) and cellular user K (1 ≦ K ≦ M) on channel K (1 ≦ K ≦ K) are calculatedAre respectively as
Figure BDA0002393321020000031
Figure BDA0002393321020000032
Formula (II)
Figure BDA0002393321020000033
And
Figure BDA0002393321020000034
are respectively CkAnd DiTransmission power on channel k, in gk,B、hk,i、gi,iAnd hi.BIs represented by CkTo the base station, CkTo DiReceiver of (1), DiTo DiAnd DiChannel gain, N, from transmitter to base station0Representing the noise power;
step three: according to the signal-to-interference-and-noise ratios of the users in the second step, the rates of cellular users K (K is more than or equal to 1 and less than or equal to M) and D2D users i (i is more than or equal to 1 and less than or equal to N) on a channel K (K is more than or equal to 1 and less than or equal to K) are respectively calculated to be
Figure BDA0002393321020000035
Wherein W represents the bandwidth of the channel;
step four: according to cellular subscriber CkMinimum QoS requirement of
Figure BDA0002393321020000036
Firstly, the optimum transmission power of the cellular user equipment is determined
Figure BDA0002393321020000037
Figure BDA0002393321020000038
Is the minimum requirement to represent the Qos of a cellular user;
step five: solving the optimal transmission power of the D2D user and the occupation strategy of the channel resource by using a Lagrange method, wherein the optimal transmission power is
Figure BDA0002393321020000041
Formula (II)
Figure BDA0002393321020000042
Figure BDA0002393321020000043
The channel allocation strategy is
Figure BDA0002393321020000044
In the formula
Figure BDA0002393321020000045
ρi,k∈ {0,1} is a binary indicator function of the channel occupancy of the D2D user if DiMultiplexing CkChannel resources of (1), then pi,k=1, if not multiplexed, ρi,k＝0；
Step six: power iteration factor l is 0 and lagrange multiplier
Figure BDA0002393321020000046
Performing an initialization operation while iterating the rate by a factor t of 0 and D2D for the user
Figure BDA0002393321020000047
Initializing operation is also carried out;
step seven: respectively calculating the transmission power of the cellular users according to the step 4) and the step 5)
Figure BDA0002393321020000048
And D2D user transmission power
Figure BDA0002393321020000049
Value and substitute for
Figure BDA00023933210200000410
The rate of the D2D user is determined. And according to
Figure BDA00023933210200000411
Allocating occupied channels to D2D user pairsA resource;
step eight: put l +1 and update
Figure BDA00023933210200000412
Where l means the number of iterations, αi(l) The meaning of (1) is the iteration step size. Repeating the step seven one until the transmission power of the D2D user meets the limiting condition;
step nine: t is t +1, according to the formula
Figure BDA00023933210200000413
Updating
Figure BDA00023933210200000414
Where t denotes the number of iterations βi(t) is the iteration step size of D2D user i; repeating the fourth step and the fifth step until the rate of the D2D user is converged;
step ten: finally substituting the result of resource allocation
Figure BDA0002393321020000051
The transmit power of the cellular user is obtained.
The further improvement lies in that: the objective function solved by the method is a utility function defined based on the speed of D2D users, and the fairness principle among the users is considered, so that the selection of the utility function meets two requirements: firstly, the utility function of the D2D user is increased along with the transmission rate; secondly, the marginal utility function of the D2D user shows a descending trend along with the transmission rate, and the mapping relation of the utility of the D2D user and the transmission rate forms an ascending concave function.
The further improvement lies in that: the method selects and adopts an arctan function as a mapping relation,
Figure BDA0002393321020000052
as an objective function, the optimization objective is to optimize the overall utility function.
The further improvement lies in that: in the second step, the channel allocation of the constraint condition D2D user is an integer constraint, the whole problem is non-convex, and the method for converting the whole problem into the convex optimization method is as follows: now thatDiscrete variable rhoi,kRelaxation into continuous variables with the aim of changing the feasible domain of the objective function into a convex set, i.e.
Figure BDA0002393321020000053
By passing
Figure BDA0002393321020000054
To pair
Figure BDA0002393321020000055
The solution of the second derivative of (a) yields:
Figure BDA0002393321020000056
the derivative value is not greater than zero and the effect function is related to
Figure BDA0002393321020000057
Increasing concave function, so the objective function is about the transmit power of the D2D user pair
Figure BDA0002393321020000058
A convex function of (a).
The invention has the beneficial effects that: and the optimization target of maximizing the utility of the D2D users is used for optimizing the transmission power of the cellular users and the D2D users, compared with the equal power distribution method, the energy distribution is more optimized and reasonable, and the energy waste of the cellular users and the D2D users is avoided. The joint optimization channel allocation and power control method can allocate the optimal resources for the users, thereby greatly improving the frequency spectrum utilization rate and improving the network performance. Under the condition of guaranteeing the QoS of cellular users, the channel allocation and power control method can improve the D2D user capacity under different cellular user numbers, reduce the power consumption and cost of users, and thus provide better service for the users. While ensuring the capacity of the D2D users, the fairness among the D2D users can be ensured.
Drawings
FIG. 1 is a schematic flow diagram of the process of the present invention.
Fig. 2 is a schematic diagram of a network model of the present invention.
Fig. 3 is a comparison diagram of the utility of D2D user under different resource allocation schemes.
Fig. 4 is a comparison diagram of D2D user fairness indexes under different resource allocation schemes according to the present invention.
Detailed Description
For the purpose of enhancing understanding of the present invention, the present invention will be further described in detail with reference to the following examples, which are provided for illustration only and are not to be construed as limiting the scope of the present invention. As shown in fig. 1 to 4, the present embodiment provides a D2D communication resource allocation method based on utility fairness, the allocation method includes the following steps:
the method comprises the following steps: assuming that there are M cellular users and N D2D pairs of users, denoted by C ═ 1, 2.., M } and D ═ 1, 2.., N, respectively; assuming that M independent orthogonal channels are provided, the assumption of the occupation of the channels by the cellular user is already distributed, and the calculation is not influenced, so that the k-th channel resource is assumed to be occupied by the cellular user k;
step two: calculating the signal-to-interference-and-noise ratio of the D2D user i (1 ≦ i ≦ N) and the cellular user K (1 ≦ K ≦ M) on the channel K (1 ≦ K ≦ K), which are
Figure BDA0002393321020000061
Figure BDA0002393321020000071
Formula (II)
Figure BDA0002393321020000072
And
Figure BDA0002393321020000073
are respectively CkAnd DiTransmission power on channel k, in gk,B、hk,i、gi,iAnd hi.BIs represented by CkTo the base station, CkTo DiReceiver of (1), DiTo DiAnd DiChannel gain, N, from transmitter to base station0Representing the noise power;
step three: calculating the honeycomb according to the signal-to-interference-and-noise ratio of the users in the second stepThe rates of user K (1 ≦ K ≦ M) and D2D user i (1 ≦ i ≦ N) on channel K (1 ≦ K ≦ K) are respectively
Figure BDA0002393321020000074
Wherein W represents the bandwidth of the channel;
step four: according to cellular subscriber CkMinimum QoS requirement of
Figure BDA0002393321020000075
Firstly, the optimum transmission power of the cellular user equipment is determined
Figure BDA0002393321020000076
Figure BDA0002393321020000077
Is the minimum requirement to represent the Qos of a cellular user;
step five: solving the optimal transmission power of the D2D user and the occupation strategy of the channel resource by using a Lagrange method, wherein the optimal transmission power is
Figure BDA0002393321020000078
Formula (II)
Figure BDA0002393321020000079
Figure BDA00023933210200000710
The channel allocation strategy is
Figure BDA00023933210200000711
In the formula
Figure BDA00023933210200000712
ρi,k∈ {0,1} is a binary indicator function of the channel occupancy of the D2D user if DiMultiplexing CkChannel resources of (1), then pi,kWhen not multiplexed, ρ is 1i,k＝0；
Step six: power iteration factor l is 0 and lagrange multiplier
Figure BDA00023933210200000713
Performing an initialization operation while iterating the rate by a factor t of 0 and D2D for the user
Figure BDA0002393321020000081
Initializing operation is also carried out;
step seven: respectively calculating the transmission power of the cellular users according to the step 4) and the step 5)
Figure BDA0002393321020000082
And D2D user transmission power
Figure BDA0002393321020000083
Value and substitute for
Figure BDA0002393321020000084
The rate of the D2D user is determined. And according to
Figure BDA0002393321020000085
Allocating occupied channel resources to the D2D user pairs;
step eight: put l +1 and update
Figure BDA0002393321020000086
Where l means the number of iterations, αi(l) The meaning of (1) is the iteration step size. Repeating the step seven one until the transmission power of the D2D user meets the limiting condition;
step nine: t is t +1, according to the formula
Figure BDA0002393321020000087
Updating
Figure BDA0002393321020000088
Where t denotes the number of iterations βi(t) is the iteration step size of D2D user i; repeating the fourth step and the fifth step until the rate of the D2D user is converged;
step ten: finally substituting the result of resource allocation
Figure BDA0002393321020000089
The transmit power of the cellular user is obtained.
The objective function solved by the method is a utility function defined based on the speed of D2D users, and the fairness principle among the users is considered, so that the selection of the utility function meets two requirements: firstly, the utility function of the D2D user is increased along with the transmission rate; secondly, the marginal utility function of the D2D user shows a descending trend along with the transmission rate, and the mapping relation of the utility of the D2D user and the transmission rate forms an ascending concave function.
The method selects and adopts an arctan function as a mapping relation,
Figure BDA0002393321020000091
as an objective function, the optimization objective is to optimize the overall utility function.
In the second step, the channel allocation of the constraint condition D2D user is an integer constraint, the whole problem is non-convex, and the method for converting the whole problem into the convex optimization method is as follows: now discrete variable ρi,kRelaxation into continuous variables with the aim of changing the feasible domain of the objective function into a convex set, i.e.
Figure BDA0002393321020000092
By passing
Figure BDA0002393321020000093
To pair
Figure BDA0002393321020000094
The solution of the second derivative of (a) yields:
Figure BDA0002393321020000095
the derivative value is not greater than zero and the effect function is related to
Figure BDA0002393321020000096
Increasing concave function, so the objective function is about the transmit power of the D2D user pair
Figure BDA0002393321020000097
A convex function of (a).
As shown in fig. 2, the research system model of this embodiment is considered as a deployment scenario of a single cell, where the cell is a circular area with a radius of R and a base station as a center of circle, and N pairs of D2D users and M cellular users are randomly distributed in the circular area with the base station as a center of circle, where the D2D user multiplexes uplink resources of the cellular users. C is a set of cellular users, C ═ C1,C2,…,Ck,…,CMIn which C iskRepresents a cellular user k; d represents a D2D user set, D ═ D1,D2,…,Di,…,DNIn which D isiRepresenting D2D user pair i.
Cellular users and D2D users have different communication modes, the cellular users use the allocated orthogonal channel resources to perform the conventional communication mode through the base station, and the D2D users multiplex the channel resources of the cellular users to perform communication, which will generate unavoidable interference to the cellular users due to the multiplexing of the D2D users. Assume that the base station has a perfect user SCI. Since the channels of cellular user are assumed to be already allocated, for simplicity of representation, cellular user k can be considered to use the kth channel. Meanwhile, the channel resources of one cellular user are guaranteed to be reused by at most one pair of D2D users, so the interference is the problem of mutual interference between the cellular users and the D2D users caused by the reuse of the D2D users to the cellular user channels.
If cellular user k and D2D user i share channel k, cellular user k is received at the base station from DiThe received SINR is:
Figure BDA0002393321020000101
D2D user i receives input from CkThe received SINR is:
Figure BDA0002393321020000102
wherein
Figure BDA0002393321020000103
And
Figure BDA0002393321020000104
are respectively CkAnd DiThe transmission power on channel k is respectively gk,B、hk,i、gi,iAnd hi.BIs represented by CkTo the base station, CkTo DiReceiver of (1), DiTo DiAnd DiChannel gain, N, from transmitter to base station0Is the received noise power.
The rate (bit/s) of cellular user k on channel k is:
Figure BDA0002393321020000105
the rate (bit/s) of D2D user i on channel k is:
Figure BDA0002393321020000106
where W represents the bandwidth of the orthogonal sub-channel.
The total rate of D2D user i is:
Figure BDA0002393321020000107
where ρ isi,k∈ {0,1} is a binary variable of channel assignment indicating the channel occupancy details if DiMultiplexing CkOf (c) is then pi,k=1, ρ if it does not multiplex the channels of the cellular users i,k0. The objective function is a utility function defined based on the rate of the D2D users, and considering the fairness principle among users, the selection of the utility function should satisfy two requirements: the utility function of the D2D user should increase with the transmission rate according to the actual user's requirement for rate; the marginal utility function of the D2D user shows a decreasing trend along with the transmission rate, and the users with good channel conditions can avoid distributing more informationDue to the resources, fairness among the D2D users can be considered, and therefore a mapping relation of an increasing concave function is formed between the utility of the D2D users and the transmission rate. The reason that the arctan function is adopted as the mapping relation and the ln logarithmic function is not used as the utility function is that the fairness of the users cannot be guaranteed to the maximum extent, and due to the characteristics of the arctan function, the arctan function pays more attention to the fairness factor than the ln function, namely
Figure BDA0002393321020000111
As an objective function, the optimization objective is to optimize the total utility function, so as to establish the optimization objective function, considering the requirement of users on the speed and the fairness among users, and the optimization problem is as follows:
Figure BDA0002393321020000112
Figure BDA0002393321020000113
Figure BDA0002393321020000114
Figure BDA0002393321020000115
Figure BDA0002393321020000116
equations (7) and (9) represent the limits of the transmission power for cellular users and D2D users, where
Figure BDA0002393321020000117
Represents the maximum transmission power value for the cellular user,
Figure BDA0002393321020000118
represents the maximum transmission power of the D2D user; equation (8) is the lowest SINR requirement for the cellular user,ensuring the Qos; equation (10) indicates that the channel of the cellular user can be reused only by one D2D user.
The utility function of the D2D user in the objective function decreases with increasing cellular user transmission power, combining equations (1), (7), and (8) as:
Figure BDA0002393321020000121
Figure BDA0002393321020000122
wherein, [ x ]]+Max (0, x), the optimal transmission power for the cellular user should be:
Figure BDA0002393321020000123
substituting the formula (13) into the formula (6), and arranging the original optimization problem (OP1) as follows:
Figure BDA0002393321020000124
s.t.(9)(10)(12)
wherein
Figure BDA0002393321020000125
Since the optimization problem (OP2) is a mixed integer nonlinear programming problem, it is not easy to solve, and the best approach is to convert it into convex optimization. The binary variables of the constraint (10) are mainly discrete, so the problem is not a convex optimization problem. Now the discrete binary variable ρi,kThe relaxation is a continuous variable, and takes a continuous value between 0 and 1, that is, the formula (10) becomes:
Figure BDA0002393321020000126
the feasible domain of (OP2) thus becomes the convex set. By calculation
Figure BDA0002393321020000127
To pair
Figure BDA0002393321020000128
Second derivative of (d):
Figure BDA0002393321020000131
not greater than zero, and utility function is with
Figure BDA0002393321020000132
So that the overall derivative is followed by a larger than zero, i.e. the objective function is with respect to
Figure BDA0002393321020000133
The integer programming problem is transformed into a convex optimization problem that is easier to handle.
The dual interval of the convex optimization problem is zero, that is, the dual problem has the same solution property as the original problem, so the convex optimization problem is solved by adopting a lagrangian dual method, and the lagrangian equation is as follows:
Figure BDA0002393321020000134
multiplier λ in the formulaiAnd mukCorresponding to the power constraint and conditional constraint of the channel resource allocation for D2D user i, respectively. Its dual function is:
Figure BDA0002393321020000135
the corresponding dual problems are:
Figure BDA0002393321020000136
the whole problem is decomposed by using a dual decomposition method, the dual problem (19) can be decomposed into 1 main problem and N sub-problems, and the ith sub-problem is as follows:
Figure BDA0002393321020000141
the requirements for knowing the optimal solution according to the KKT condition are as follows:
Figure BDA0002393321020000142
Figure BDA0002393321020000143
by making use of a compound of formula (21)
Figure BDA0002393321020000144
D2D user i available for zero when using subchannel k (p)i,kThe optimal transmit power of 1) is:
Figure BDA0002393321020000145
wherein the content of the first and second substances,
Figure BDA0002393321020000146
Figure BDA0002393321020000147
as can be seen from equation (22), if D2D user i does not multiplex the channel (ρ) of cellular user ki,k0), then
Figure BDA0002393321020000148
If the D2D user i multiplexes the channel (p) of the cellular user ki,k> 0), then
Figure BDA0002393321020000149
Therefore, the channel resource allocation method is as follows:
Figure BDA0002393321020000151
i.e., D2D user i occupies channel k.
The solution of the main problem can be iteratively solved by a secondary gradient method:
Figure BDA0002393321020000152
where l denotes the number of iterations αi(l) The iteration step size is indicated.
As can be seen from equations (23) and (24), the solving of the D2D user power and the allocation of the channel resources are both equal to the D2D user rate
Figure BDA0002393321020000153
In connection with, at the same time
Figure BDA0002393321020000154
Also the variable pi,kAnd
Figure BDA0002393321020000155
is used, and therefore also the velocity for the D2D user is required
Figure BDA0002393321020000156
Performing iterative updating, namely:
Figure BDA0002393321020000157
where t denotes the number of iterations βi(t) is the iteration step size of D2D user i.
The specific flow of the D2D resource allocation method based on utility fairness in this embodiment is shown in fig. 1.
In summary, the present invention optimizes the transmit power of the cellular users and the D2D users and allocates reasonable channels to the D2D users with the optimization goal of maximizing the utility of the D2D users under the conditions of considering the QoS requirements of the cellular users, the limited cellular user power and the limited total power of the D2D users. Fig. 3 is a graph showing the comparison between the utility of D2D in the proposed method and the traditional method of maximizing the capacity of D2D as an objective function. It can be seen from the figure that the method of the present invention can obtain better system performance, the D2D of the present invention has higher utility and higher user satisfaction; as shown in fig. 4, the fairness index of D2D users proposed by the present invention is shown in an effect diagram compared with other resource allocation methods, and it can be seen from the diagram that the method has a higher fairness index and can ensure fairness among D2D users.

Claims (4)

1. A D2D communication resource allocation method based on utility fairness is characterized in that: the distribution method comprises the following steps:
the method comprises the following steps: assuming that there are M cellular users and N D2D pairs of users, denoted by C ═ 1, 2.., M } and D ═ 1, 2.., N, respectively; assuming that M independent orthogonal channels are provided, the assumption of the occupation of the channels by the cellular user is already distributed, and the calculation is not influenced, so that the k-th channel resource is assumed to be occupied by the cellular user k;
step two: calculating the signal-to-interference-and-noise ratio of the D2D user i (1 ≦ i ≦ N) and the cellular user K (1 ≦ K ≦ M) on the channel K (1 ≦ K ≦ K), which are
Figure FDA0002393321010000011
Figure FDA0002393321010000012
Formula (II)
Figure FDA0002393321010000013
And
Figure FDA0002393321010000014
are respectively CkAnd DiTransmission power on channel k, in gk,B、hk,i、gi,iAnd hi.BIs represented by CkTo the base station, CkTo DiReceiver of (1), DiTo DiAnd DiChannel gain, N, from transmitter to base station0Representing the noise power;
step three: according to the signal-to-interference-and-noise ratio of the users in the second step, calculating cellular users k (k is more than or equal to 1 and less than or equal to M) and D2D user i (1)I is less than or equal to N) on a channel K (K is less than or equal to 1 and less than or equal to K) are respectively
Figure FDA0002393321010000015
Wherein W represents the bandwidth of the channel;
step four: according to cellular subscriber CkMinimum QoS requirement of
Figure FDA0002393321010000016
Firstly, the optimum transmission power of the cellular user equipment is determined
Figure FDA0002393321010000017
Figure FDA0002393321010000018
Is the minimum requirement to represent the Qos of a cellular user;
step five: solving the optimal transmission power of the D2D user and the occupation strategy of the channel resource by using a Lagrange method, wherein the optimal transmission power is
Figure FDA0002393321010000021
Formula (II)
Figure FDA0002393321010000022
Figure FDA0002393321010000023
The channel allocation strategy is
Figure FDA0002393321010000024
In the formula
Figure FDA0002393321010000025
ρi,k∈ {0,1} is a binary indicator function of the channel occupancy of the D2D user if DiMultiplexing CkChannel resources of (1), then pi,kWhen not multiplexed, ρ is 1i,k＝0；
Step six: power iteration factor l 0 and lagrangeDaily multiplier lambdai(0)＞0,
Figure FDA0002393321010000026
Performing an initialization operation while iterating the rate by a factor t of 0 and D2D for the user
Figure FDA0002393321010000027
Initializing operation is also carried out;
step seven: respectively calculating the transmission power of the cellular users according to the step 4) and the step 5)
Figure FDA0002393321010000028
And D2D user transmission power
Figure FDA0002393321010000029
Value and substitute for
Figure FDA00023933210100000210
The rate of the D2D user is determined. And according to
Figure FDA00023933210100000211
Allocating occupied channel resources to the D2D user pairs;
step eight: set l = l +1 update
Figure FDA00023933210100000212
Where l means the number of iterations, αi(l) The meaning of (1) is the iteration step size. Repeating the step seven one until the transmission power of the D2D user meets the limiting condition;
step nine: t is t +1, according to the formula
Figure FDA00023933210100000213
Updating
Figure FDA00023933210100000214
Where t denotes the number of iterations βi(t) is the iteration step size of D2D user i; repeating the step fourStep five, until the rate of the D2D user is converged;
step ten: finally substituting the result of resource allocation
Figure FDA0002393321010000031
The transmit power of the cellular user is obtained.
2. The utility fairness-based D2D communication resource allocation method of claim 1, wherein: the objective function solved by the method is a utility function defined based on the speed of D2D users, and the fairness principle among the users is considered, so that the selection of the utility function meets two requirements: firstly, the utility function of the D2D user is increased along with the transmission rate; secondly, the marginal utility function of the D2D user shows a descending trend along with the transmission rate, and the mapping relation of the utility of the D2D user and the transmission rate forms an ascending concave function.
3. The utility fairness-based D2D communication resource allocation method of claim 1, wherein: the method selects and adopts an arctan function as a mapping relation,
Figure FDA0002393321010000032
as an objective function, the optimization objective is to optimize the overall utility function.
4. The utility fairness-based D2D communication resource allocation method of claim 1, wherein: in the second step, the channel allocation of the constraint condition D2D user is an integer constraint, the whole problem is non-convex, and the method for converting the whole problem into the convex optimization method is as follows: now discrete variable ρi,kRelaxation into continuous variables with the aim of changing the feasible domain of the objective function into a convex set, i.e.
Figure FDA0002393321010000033
By passing
Figure FDA0002393321010000034
To pair
Figure FDA0002393321010000035
The solution of the second derivative of (a) yields:
Figure FDA0002393321010000036
the derivative value is not greater than zero and the effect function is related to
Figure FDA0002393321010000041
Increasing concave function, so the objective function is about the transmit power of the D2D user pair
Figure FDA0002393321010000042
A convex function of (a).
CN202010122669.3A 2020-02-27 2020-02-27 D2D communication resource allocation method based on utility fairness Pending CN111465054A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202010122669.3A CN111465054A (en) 2020-02-27 2020-02-27 D2D communication resource allocation method based on utility fairness

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010122669.3A CN111465054A (en) 2020-02-27 2020-02-27 D2D communication resource allocation method based on utility fairness

Publications (1)

Publication Number Publication Date
CN111465054A true CN111465054A (en) 2020-07-28

Family

ID=71682293

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010122669.3A Pending CN111465054A (en) 2020-02-27 2020-02-27 D2D communication resource allocation method based on utility fairness

Country Status (1)

Country Link
CN (1) CN111465054A (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110611902A (en) * 2019-09-19 2019-12-24 哈尔滨工程大学 D2D resource allocation method based on uplink and downlink spectrum joint multiplexing
CN112788563A (en) * 2021-01-12 2021-05-11 华东交通大学 Communication mode selection and resource allocation method in rail transit vehicle-to-vehicle communication
CN113194492A (en) * 2021-04-26 2021-07-30 重庆邮电大学 Safe D2D communication resource allocation method based on alpha fairness
CN113473422A (en) * 2021-07-21 2021-10-01 重庆邮电大学 B5G-oriented wireless energy-carrying D2D network efficient resource allocation method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018120935A1 (en) * 2016-12-31 2018-07-05 山东大学 Resource allocation and energy management method for collaborative cellular network
CN108495332A (en) * 2018-03-28 2018-09-04 山东大学 A kind of federated resource fair allocat method based on honeycomb D2D communication systems
CN110167178A (en) * 2019-05-28 2019-08-23 山东大学 A kind of D2D federated resource fairness distribution method containing collection of energy

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2018120935A1 (en) * 2016-12-31 2018-07-05 山东大学 Resource allocation and energy management method for collaborative cellular network
CN108495332A (en) * 2018-03-28 2018-09-04 山东大学 A kind of federated resource fair allocat method based on honeycomb D2D communication systems
CN110167178A (en) * 2019-05-28 2019-08-23 山东大学 A kind of D2D federated resource fairness distribution method containing collection of energy

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
林尚静: "HetNet系统中无线资源管理技术研究", 《中国优秀博硕士学位论文全文数据库(博士)信息科技辑》 *
石纯子: "D2D通信系统中的信道与功率分配算法", 《中国优秀博硕士学位论文全文数据库(硕士)信息科技辑》 *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110611902A (en) * 2019-09-19 2019-12-24 哈尔滨工程大学 D2D resource allocation method based on uplink and downlink spectrum joint multiplexing
CN110611902B (en) * 2019-09-19 2022-08-02 哈尔滨工程大学 D2D resource allocation method based on uplink and downlink spectrum joint multiplexing
CN112788563A (en) * 2021-01-12 2021-05-11 华东交通大学 Communication mode selection and resource allocation method in rail transit vehicle-to-vehicle communication
CN113194492A (en) * 2021-04-26 2021-07-30 重庆邮电大学 Safe D2D communication resource allocation method based on alpha fairness
CN113194492B (en) * 2021-04-26 2022-11-22 上海精语电子商务有限公司 Safe D2D communication resource allocation method based on alpha fairness
CN113473422A (en) * 2021-07-21 2021-10-01 重庆邮电大学 B5G-oriented wireless energy-carrying D2D network efficient resource allocation method

Similar Documents

Publication Publication Date Title
CN108462950B (en) NOMA-based D2D communication combined sub-channel and power distribution method
CN108737057B (en) Multi-carrier cognitive NOMA resource allocation method based on deep learning
CN111465054A (en) D2D communication resource allocation method based on utility fairness
CN109842931B (en) NOMA-based D2D cellular system resource allocation method
CN112601284B (en) Downlink multi-cell OFDMA resource allocation method based on multi-agent deep reinforcement learning
CN111586646B (en) Resource allocation method for D2D communication combining uplink and downlink channels in cellular network
CN103024921B (en) A kind of dispatching method divided into groups based on CQI feedback parameter and SINR numerical value
CN111314894B (en) NOMA (non-oriented access memory) and energy-carrying D2D fusion network-oriented robust resource allocation method
CN107613556B (en) Full-duplex D2D interference management method based on power control
CN101026444B (en) System downlink multi-user resource distributing method using OFDMA technology
CN111615202B (en) Ultra-dense network wireless resource allocation method based on NOMA and beam forming
CN109788540B (en) Power control and channel allocation method based on energy collection in D2D system
CN104703270B (en) User's access suitable for isomery wireless cellular network and power distribution method
CN101483874A (en) Uplink resource allocation method for distributed antenna MIMO-OFDM/SDMA system
CN101784119A (en) Distribution method of OFDMA (Orthogonal Frequency Division Multiple Access) distributed antenna network resources
CN102378261A (en) Method and device for coordinating downlink interference of long term evolution system
CN103200578A (en) Variable bandwidth channel allocation method based on cognitive wireless local area network (LAN)
CN106851726A (en) A kind of cross-layer resource allocation method based on minimum speed limit constraint
CN106912059B (en) Cognitive relay network joint relay selection and resource allocation method supporting mutual information accumulation
CN102958172A (en) Proportion fairness-based resource allocation algorithm in grouped MIMO-MC-CDMA (Multiple Input Multiple Output-Multicarrier-Code Division Multiple Access) system
CN113055860A (en) D2D many-to-many resource allocation method in cellular network
CN103139800A (en) Node adjustment method, device and system of relay cellular network
CN107613565B (en) Wireless resource management method in full-duplex ultra-dense network
CN107172574B (en) Power distribution method for D2D user to sharing frequency spectrum with cellular user
CN111935833B (en) D2D communication in cellular network frequency spectrum multiplexing method of system

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination