CN112367644A - D2D-based method for optimizing system throughput in wireless cache network - Google Patents

D2D-based method for optimizing system throughput in wireless cache network Download PDF

Info

Publication number
CN112367644A
CN112367644A CN202011176152.9A CN202011176152A CN112367644A CN 112367644 A CN112367644 A CN 112367644A CN 202011176152 A CN202011176152 A CN 202011176152A CN 112367644 A CN112367644 A CN 112367644A
Authority
CN
China
Prior art keywords
user
cellular
users
model
power control
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.)
Granted
Application number
CN202011176152.9A
Other languages
Chinese (zh)
Other versions
CN112367644B (en
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.)
Shandong Chaoyue CNC Electronics Co Ltd
Original Assignee
Shandong Chaoyue CNC Electronics Co Ltd
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 Shandong Chaoyue CNC Electronics Co Ltd filed Critical Shandong Chaoyue CNC Electronics Co Ltd
Priority to CN202011176152.9A priority Critical patent/CN112367644B/en
Publication of CN112367644A publication Critical patent/CN112367644A/en
Application granted granted Critical
Publication of CN112367644B publication Critical patent/CN112367644B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/70—Services for machine-to-machine communication [M2M] or machine type communication [MTC]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/02—Resource partitioning among network components, e.g. reuse partitioning
    • H04W16/10—Dynamic resource partitioning
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
    • H04W16/18—Network planning tools
    • 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/08—Load balancing or load distribution
    • 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/10—Flow control between communication endpoints
    • H04W28/14—Flow control between communication endpoints using intermediate storage
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

A D2D-based wireless cache network system throughput optimization method comprises the following steps: establishing a system throughput optimization model of the wireless cache network under a constraint condition; decomposing a wireless cache network system throughput optimization model into an access selection and distribution model and a power control model; providing access service and channel allocation for the D2D requesting user according to the access selection and allocation model; judging and maintaining feasibility of power control of channels allocated by D2D users; and responding to the feasibility of power control, converting the power control model into a DC plan, solving a solution of the DC plan, and carrying out throughput optimization based on the solution of the DC plan. The method provided by the invention effectively improves the system throughput of the D2D wireless cache network, provides the lowest transmission power selection for the D2D user, greatly improves the frequency spectrum multiplexing rate of the cellular user, and provides a better solution for the application of the D2D-based wireless cache network system.

Description

D2D-based method for optimizing system throughput in wireless cache network
Technical Field
The invention belongs to the field of content sharing and resource allocation in a wireless cache network; in particular to a method for optimizing system throughput in a wireless cache network based on D2D.
Background
The wireless cache network based on D2D is a very promising technology, and by deploying the content in the network in the cache near the D2D user, the backhaul link load of the base station and the time delay for the user to obtain service can be effectively reduced; by multiplexing the spectrum resources of the cellular users, the D2D communication can effectively improve the spectrum utilization rate and the system throughput. However, if the mutual interference between cellular users and D2D users caused by spectrum reuse cannot be effectively handled, the advantages of the D2D-based wireless cache network cannot be fully exploited. Although a lot of important technical achievements have been developed by resource allocation algorithms in current wireless cache networks, most researches only consider that a single D2D user multiplexes a single cellular user spectrum resource, and do not consider the influence of multiple D2D user accesses on resource allocation. Therefore, the research on the resource allocation method combining the D2D user access and the channel allocation can effectively improve the spectrum efficiency of the cellular system and improve the system throughput.
Disclosure of Invention
Aiming at the current situation, the invention designs a D2D-based wireless cache network system throughput optimization method, which comprises the following steps:
establishing a system throughput optimization model of the wireless cache network under a constraint condition;
decomposing a wireless cache network system throughput optimization model into an access selection and distribution model and a power control model;
providing access service and channel allocation for the D2D requesting user according to the access selection and allocation model;
judging and maintaining feasibility of power control of channels allocated by D2D users;
and responding to the feasibility of power control, converting a power control model into a DC plan, solving a solution of the DC plan, and carrying out throughput optimization based on the solution of the DC plan.
In some embodiments, the system throughput optimization model of the wireless cache network under the constraint condition is:
Figure BDA0002748719980000021
wherein, Pi cAnd
Figure BDA0002748719980000022
respectively representing the transmission power of a cellular user i and the transmission power of a service user of a D2D request user j;
ζjindicating that D2D requested user j's local storage whether or not it cached the network content that he requested;
ρm,jindicating whether D2D requests user j to be serviced by D2D service user m;
vi,jindicating that D2D requests user j to reuse the spectrum resource of cellular user i;
Figure BDA0002748719980000023
and represents a set of cellular users;
Figure BDA0002748719980000024
respectively representing a cellular user set and a D2D request user set;
Ncand NrRespectively the number of cellular users in the cell and the number of D2D request users;
Figure BDA00027487199800000211
candidate service representing D2D requesting user jA set of users;
Figure BDA0002748719980000026
and
Figure BDA0002748719980000027
respectively representing the transmission rates of the cellular user and the D2D requesting user;
the constraint conditions are as follows:
Figure BDA0002748719980000028
wherein constraint (a) represents a transmit power constraint for the cellular user and the D2D link,
Figure BDA0002748719980000029
and
Figure BDA00027487199800000210
maximum transmit power for cellular users and D2D serving users, respectively;
constraint (b) represents a transmission rate constraint, R, for the cellular user and D2D linkscAnd RdMinimum rate constraints for cellular users and D2D links, respectively;
constraint (c) indicates that a single D2D requests that a user can only transmit user services by a single D2D;
constraint (D) indicates that a single D2D link can only multiplex the spectrum resources of a single cellular user.
In some embodiments, in a wireless cache network system throughput optimization model
Figure BDA0002748719980000031
And
Figure BDA0002748719980000032
respectively expressed as:
Figure BDA0002748719980000033
Figure BDA0002748719980000034
wherein
Figure BDA0002748719980000035
And
Figure BDA0002748719980000036
representing the noise power of the cellular link and the D2D link, respectively;
Gi,Brespectively representing the channel gains of cellular users i to the base station;
Gi,jshown as the interfering link gain, G, for cellular user i versus D2D requesting user jjChannel gain, G, denoted as D2D request for user jj,iThe interference link gain for cellular user i for the serving user, denoted as D2D requesting user j; gk,jD2D requests the interfering link gain for user j requested by D2D for the serving user of user k.
In some embodiments, the access selection and channel allocation model is represented as:
Figure BDA0002748719980000037
Figure BDA0002748719980000038
in some embodiments, the power control model is:
Figure BDA0002748719980000041
Figure BDA0002748719980000042
wherein, DSiA D2D request set indicating that the ith cellular user spectrum resource is multiplexed.
In some embodiments, providing access services and channel allocation for the D2D requesting user according to the access selection and allocation model comprises:
converting the three-dimensional matching of the access selection and the channel allocation model into two-dimensional bilateral graph matching;
and calculating the service user of the D2D request user according to a bilateral graph matching algorithm.
In some embodiments, providing access services and channel allocation for the D2D requesting user according to the access selection and allocation model further comprises:
and calculating to obtain the cellular user spectrum resource with the minimum sum of the channel allocation co-channel interference of the D2D request user by adopting a heuristic iterative algorithm.
In some embodiments, determining and maintaining feasibility of power control for channels allocated by D2D users includes:
judging the feasibility of power control through a Perron-Frobenius theory;
if not, executing link removing algorithm to remove the request user with maximum interference of co-channel in channel allocation until power control is feasible.
In some embodiments, converting the power control model to a DC plan includes:
converting the power control model into a target function in a DC programming form;
and solving the DC plan by using a continuous convex optimization method through a first-order Taylor expansion to obtain an optimal solution.
In some embodiments, the wireless caching network includes a plurality of D2D requesting users, a plurality of D2D serving users, and a plurality of cellular users; cellular users transmit data on a given authorized channel, D2D serves users to cache network content, and D2D requests users to request network content.
The D2D-based wireless cache network system throughput optimization method provided by the invention provides good access selection and channel matching for D2D users, improves the spectrum utilization rate, provides optimal transmitting power for D2D users, and minimizes co-channel interference, thereby maximizing the throughput of system data transmission and providing a solution for a high-efficiency D2D wireless cache network system.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other embodiments can be obtained by using the drawings without creative efforts.
Figure 1 is a graph comparing the results of system throughput as a function of cell user signal-to-interference ratio constraints for two algorithms of the present invention and the prior art.
Fig. 2 is a graph comparing the number of system access D2D links as a function of cellular user signal-to-interference ratio constraints for the two algorithms of the prior art.
FIG. 3 is a flow chart of the method of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the following embodiments of the present invention are described in further detail with reference to the accompanying drawings.
In the present invention. The wireless cache network model based on undermining-D2D comprises NrD2D requesting user, NsD2D service user and NcA cellular subscriber. The cellular users transmit data on a given authorized channel, D2D service users cache network content according to a certain cache probability distribution, and D2D requests the users to request the network content; when D2D requests the user to request the web content, first checking whether the local storage caches the web content, and if the local storage caches the web content, completing the service; otherwise, service is requested from the nearby D2D service user: if the adjacent D2D service users cache the data requested by the service users and meet the signal to interference and noise ratio condition, the frequency spectrum resources of the multiplexing cellular users are provided with the service by the D2D service users; otherwise, the base station allocates specific frequency spectrum resources for the D2D request userProviding the service.
As shown in fig. 3, the present invention provides a D2D-based method for optimizing throughput of a wireless cache network system, including the following steps:
s1, establishing a system throughput optimization model of the wireless cache network under constraint conditions;
s2, decomposing the wireless cache network system throughput optimization model into an access selection and distribution model and a power control model;
s3, providing access service and channel allocation for the D2D request user according to the access selection and allocation model;
s4, judging and maintaining the feasibility of power control of the channels allocated by the D2D users;
and S5, responding to the feasibility of power control, converting the power control model into a DC plan, solving the solution of the DC plan, and carrying out throughput optimization based on the solution of the DC plan.
In step S1, a wireless cache network model based on undermining-D2D is established, and a system throughput optimization model under constraint conditions based on the undermining-D2D is expressed as:
Figure BDA0002748719980000061
wherein, Pi cAnd
Figure BDA0002748719980000062
respectively representing the transmission power of a cellular user i and the transmission power of a service user of a D2D request user j;
ζjindicating whether the local storage of the user j requested by the D2D caches the requested network content, and if the local storage of the user j requested by the D2D caches the requested network content, ζjWhen it is 1, the opposite is ζj＝0；
ρm,jIndicating whether D2D requests user j to be served by D2D user m, if D2D requests user j to be served by D2D user m, ρm,j1, otherwise ρm,j＝0；
vi,jIndicating that D2D requests user j to multiplex the spectrum resource of cellular user i, if D2D requests user j to multiplex the spectrum resource of cellular user i, vi,j1, and vice versa vi,j＝0；
Figure BDA0002748719980000071
And represents a set of cellular users;
Figure BDA0002748719980000072
representation D2D requests a set of users;
Ncand NrRespectively the number of cellular users in the cell and the number of D2D request users;
Figure BDA00027487199800000712
a set of candidate service users representing D2D requesting user j;
Figure BDA0002748719980000074
and
Figure BDA0002748719980000075
respectively representing the transmission rates of the cellular user and the D2D requesting user;
the constraint conditions are as follows:
Figure BDA0002748719980000076
wherein constraint (a) represents a transmit power constraint for the cellular user and the D2D link,
Figure BDA0002748719980000077
and
Figure BDA0002748719980000078
maximum transmit power for cellular users and D2D serving users, respectively;
constraint (b) represents a transmission rate constraint, R, for the cellular user and D2D linkscAnd RdMinimum rate constraints for cellular users and D2D links, respectively;
constraint (c) indicates that a single D2D requests that a user can only transmit user services by a single D2D;
constraint (D) indicates that a single D2D link can only multiplex the spectrum resources of a single cellular user.
In some embodiments of the present invention, in a wireless cache network system throughput optimization model,
Figure BDA0002748719980000079
and
Figure BDA00027487199800000710
respectively expressed as:
Figure BDA00027487199800000711
Figure BDA0002748719980000081
wherein
Figure BDA0002748719980000082
And
Figure BDA0002748719980000083
representing the noise power of the cellular link and the D2D link, respectively;
Gi,Brespectively representing the channel gains of cellular users i to the base station;
Gi,jshown as the interfering link gain, G, for cellular user i versus D2D requesting user jjChannel gain, G, denoted as D2D request for user jj,iThe interference link gain for cellular user i for the serving user, denoted as D2D requesting user j; gk,jD2D requests the interfering link gain for user j requested by D2D for the serving user of user k.
In step S2, the throughput optimization model of the wireless cache network system is decomposed into an access selection and allocation model and a power control model, after the D2D access selection and channel allocation are determined, the state of each channel is determined, and the throughput optimization is sequentially performed for each channel, so that the total throughput of the system is optimal.
In some embodiments of the present invention, the D2D access selection and channel allocation model is:
Figure BDA0002748719980000084
Figure BDA0002748719980000085
wherein P is compared to the system throughput model of the wireless cache network described abovei cAnd
Figure BDA0002748719980000086
are all fixed transmit frequencies: and is
Figure BDA0002748719980000087
In some embodiments of the invention, the power control model is:
Figure BDA0002748719980000091
Figure BDA0002748719980000092
wherein, DSiA D2D request set indicating that the ith cellular user spectrum resource is multiplexed.
In step S3, the providing of the access service and the channel allocation for the D2D requesting user according to the access selection and allocation model includes: converting the three-dimensional matching of the D2D access selection and the channel allocation model into bilateral graph matching, determining the D2D user access selection by using a bilateral graph matching algorithm, and then obtaining the channel allocation state of the D2D request user by using a heuristic iterative algorithm.
In some embodiments of the present invention, a specific process of the bilateral graph matching algorithm is as follows:
first, initialize the D2D link matrix
Figure BDA0002748719980000093
Then, according to the cache contents of the D2D request user and the D2D service user, a candidate service user matrix of the D2D request user is determined
Figure BDA0002748719980000094
That is, if D2D requests that user j's local store cache the requested web content, then that request is received from the local store
Figure BDA0002748719980000095
Otherwise
If the D2D service user m caches the network content requested by the D2D user j and the communication distance between the D2D users m and j is less than the maximum communication distance R of the D2DdThen DCj,m1, conversely, DCj,m＝0。
Second, calculate popularity for each D2D requesting user
Figure BDA0002748719980000096
If it is not
Figure BDA0002748719980000097
Request the user set from D2D
Figure BDA0002748719980000098
Removing D2D requesting user j.
Third, a user set is requested from D2D
Figure BDA0002748719980000099
In selection
Figure BDA00027487199800000910
Minimum D2D requesting user j, serving user set from D2D
Figure BDA00027487199800000911
Requesting user j to select satisfying DC for D2Dj,m1 and Im,jThe largest candidate D2D serves user m; setting DLj,m＝1。
The fourth step, respectively from
Figure BDA0002748719980000101
And
Figure BDA0002748719980000102
removing D2D requesting j and D2D to service user m;
in the fifth step, if
Figure BDA0002748719980000103
If the set is an empty set, ending the algorithm; otherwise, returning to the third step.
Wherein the content of the first and second substances,
Figure BDA0002748719980000104
preference selection, I, defined as D2D requesting user jm,jA larger signal indicates a larger gain obtained by the requesting user j and thus a larger transmission rate.
In some embodiments of the present invention, the heuristic iterative algorithm for channel allocation specifically includes:
first, inputting cellular user transmitting power PcD2D serving user transmit power PdChannel gain matrix G and D2D link matrix DL;
second, initializing the channel allocation matrix
Figure BDA0002748719980000105
Setting WTiStoring total channel interference in subchannel i for 0, D2D requesting user set multiplexing spectrum resources of cellular user i
Figure BDA0002748719980000106
Initialization j-0 means that D2 is currently presentD, requesting a user j to allocate a channel;
a third step, j equals j + 1; sequentially calculating the co-channel interference of each channel i when the D2D requests the user j to multiplex the frequency spectrum resource of each cellular user i, namely
Figure BDA0002748719980000107
Fourthly, the D2D request user j to multiplex the cellular user i*Of spectrum resources of, wherein
Figure BDA0002748719980000108
Updating
Figure BDA0002748719980000109
Adding D2D requesting user j to a collection
Figure BDA00027487199800001010
Setting up
Figure BDA00027487199800001011
Step five, if j is equal to NrIf yes, ending the algorithm; otherwise, returning to the third step.
Wherein, the service user of each D2D requesting user is obtained according to DL:
1) if it is not
Figure BDA00027487199800001012
Then W isi,jFor co-channel interference W between D2D link and cellular useri,jComprises the following steps:
Figure BDA00027487199800001013
2) if it is not
Figure BDA00027487199800001014
Then W isi,jFor co-channel interference between different D2D links, Wi,jComprises the following steps:
Figure BDA00027487199800001015
SINRcand SINRdSignal to interference and noise ratio thresholds for the cellular user link and the D2D link respectively,
Figure BDA00027487199800001016
is a D2D link set.
In step S4, the determining and maintaining feasibility of power control of the channels allocated by the D2D users includes:
determining feasibility of power control using Perron-Frobenius theory;
if not, a link removal algorithm is executed to remove the D2D requesting user with the highest co-channel interference in the current channel allocation until power control is feasible.
In the embodiment of the invention, the constraint conditions of the power control model are converted into a matrix form:
I-ΓZ P≥Γn
wherein P is the transmission power vector of the cellular user link and the D2D link, and I is | DSiAnd an | + 1-dimensional unit matrix, wherein Γ is a signal-to-interference-and-noise ratio constraint matrix of the cellular user link and the D2D link, Z represents a normalized path gain matrix, and n represents a normalized noise power vector. The specific definition is as follows:
Figure BDA0002748719980000111
Figure BDA0002748719980000121
if the maximum eigenvalue of Γ Z is greater than 1, then the power control has no solution; otherwise, there is one positive power vector such that the cellular user link and the D2D link satisfy the signal to interference plus noise ratio constraint. The minimum emission power Pp is derived from (I- Γ Z) Pq ≧ Γ n*＝(1-ΓZ)-1Γ n; i.e. arbitrary feasible transmission power
Figure BDA0002748719980000124
Satisfy the requirement of
Figure BDA0002748719980000122
If P is*The transmit power constraints of cellular users and D2D service users are met, then power control is feasible; otherwise, the power control has no solution.
DS is removed in turn if power control is not feasibleiWhere the greatest co-channel interference, or Metric, is generated with other linksjThe largest link is achieved until feasible, so that the D2D link can be guaranteed to be accessed to cellular user spectrum resources as much as possible, and the system throughput is improved.
Wherein
Figure BDA0002748719980000123
In some embodiments of the present invention, the specific process of the link removal algorithm is:
in the first step, Γ, Z, and n are calculated based on the channel allocation status and channel gain.
Second, calculate maximum eigenvalue of Γ Z and minimum transmitting power P of power control*。
Thirdly, if the maximum eigenvalue of Γ Z is less than 1 and P*If the transmission power constraints of cellular users and D2D users are met, the problem is feasible, and the algorithm is ended; otherwise, calculate Metric for each D2D requesting user jjRemoval of MetricjThe largest D2D requests the user, returning to the first step.
In step S5, in response to the power control being enabled, converting the power control model to a DC plan and solving the DC plan includes: and converting the power control subproblem model into a DC planning problem, and solving the DC planning by using a continuous convex optimization method through a first-order Taylor expansion.
In some embodiments of the invention, the objective function in the form of a DC plan for power control is: t isi＝gi-hiWherein g isiAnd hiThe mathematical expressions of (a) are respectively:
Figure BDA0002748719980000131
Figure BDA0002748719980000132
then by mixing hiAnd replacing the first-order Taylor expansion, converting the DC planning problem into a convex optimization problem, and solving power control by using a continuous convex optimization method.
The continuous convex optimization method is to use hiIs replaced by
Figure BDA0002748719980000133
First order Taylor expansion as initial point Ii，IiThe definition of (A) is as follows:
Figure BDA0002748719980000134
wherein, P0Is any feasible point of the power control sub-problem,
Figure BDA0002748719980000135
are respectively hiIn respect of Pi cAnd
Figure BDA0002748719980000136
the specific expression of the first partial derivative of (a) is as follows:
Figure BDA0002748719980000137
Figure BDA0002748719980000138
by the approximation, the objective function of power control can be converted into Ti＝gi-IiAnd solving by a continuous convex optimization method.
The continuous convex optimization method comprises the following specific steps:
in the first step, the number of initialization iterations K is 0, and the maximum number of iterations L. Initializing P with any feasible point in feasible domain0。
Second step with hiAt P0First order Taylor expansion formula I of point expansioniSubstitute for hiUpdate K ═ K + 1.
Thirdly, optimizing the problem by using an interior point method to obtain the optimal solution P of the current problemK。
Fourthly, if K is less than or equal to L, updating P0＝PKReturning to the step 2; otherwise, PKI.e. the optimal solution to the problem. Will PKAnd optimizing the wireless cache network as the transmitting power in a system throughput optimization model of the wireless cache network under the constraint condition.
The system throughput obtained by the experiment of the technical scheme of the invention is compared with a multi-user single-cell user spectrum resource multiplexing scheme (algorithm 1) and a single D2D user single-cell user spectrum resource multiplexing scheme (algorithm 2) which do not consider D2D access selection. As shown in fig. 1, the technical solution of the present invention will achieve higher system throughput.
The access number of the D2D link obtained by the experiment carried out by the method provided by the invention is compared with a multi-user single-cell user spectrum resource multiplexing scheme (algorithm 1) and a single D2D user single-cell user spectrum resource multiplexing scheme (algorithm 2) which do not consider the access selection of the D2D. As shown in fig. 2, the number of D2D links accessed by the system in the technical solution of the present invention is more, because we consider the co-channel interference and the effect of the signal to interference and noise ratio of different links at the same time.
Compared with the prior art, the invention has the beneficial effects that: according to the technical scheme, the system throughput is maximized by decomposing the maximization of the system into a D2D access selection submodel and a channel allocation submodel and a power control submodel, and respectively determining the service user, the channel allocation, the optimal transmitting power of a cellular user and the optimal transmitting power of a D2D user of a D2D request user, so that the system throughput is maximized. Wherein the service quality requirements of cellular users and D2D users are guaranteed in the limiting conditions of the system throughput optimization problem; the spectrum resource of a single cellular user can be reused by a plurality of D2D users, and the spectrum efficiency of the system can be effectively improved; meanwhile, the transmitting power of a cellular user and a D2D user is limited, so that the normal work of the equipment is ensured; the problem of optimizing the system throughput is a mixed integer nonlinear programming problem, and the original problem is decomposed into a D2D access selection and channel allocation sub-problem and a power control sub-problem, so that the solving complexity is reduced, and the compromise between the operation complexity and the algorithm performance is realized; the sub-problem of D2D access selection and channel allocation is still an NP-hard problem, and the service user of the D2D request user is determined by converting three-dimensional matching into bilateral matching and using a bilateral graph matching algorithm; and then, minimizing the co-channel interference of each cellular user channel through a heuristic iterative algorithm to determine the spectrum reuse state.
Furthermore, in the technical scheme, a Perron-Frobenius theory is used for determining the feasibility of the power control subproblem. If the problem is not feasible, a link removal algorithm is executed to remove the D2D requesting user with the largest co-channel interference in the current channel allocation until the power control subproblem is feasible, so that more D2D users can be accessed as much as possible.
Furthermore, the power control subproblem model is converted into a DC planning problem, and the solving complexity is reduced by solving a local optimal solution of the DC planning through a first-order Taylor expansion.

Claims (10)

1. A wireless cache network system throughput optimization method based on D2D is characterized by comprising the following steps:
establishing a system throughput optimization model of the wireless cache network under a constraint condition;
decomposing a wireless cache network system throughput optimization model into an access selection and distribution model and a power control model;
providing access service and channel allocation for the D2D requesting user according to the access selection and allocation model;
judging and maintaining feasibility of power control of channels allocated by D2D users;
and responding to the feasibility of power control, converting a power control model into a DC plan, solving a solution of the DC plan, and carrying out throughput optimization based on the solution of the DC plan.
2. The throughput optimization method of claim 1, wherein the system throughput optimization model of the wireless cache network under the constraint condition is:
Figure FDA0002748719970000011
wherein, Pi cAnd
Figure FDA0002748719970000012
respectively representing the transmission power of a cellular user i and the transmission power of a service user of a D2D request user j;
ζjindicating that D2D requested user j's local storage whether or not it cached the network content that he requested;
ρm,jindicating whether D2D requests user j to be serviced by D2D service user m;
vi,jindicating that D2D requests user j to reuse the spectrum resource of cellular user i;
Figure FDA0002748719970000013
and represents a set of cellular users;
Figure FDA0002748719970000014
respectively representing a cellular user set and a D2D request user set;
Ncand NrFor cells in a cell respectivelyThe number of users and the number of users requested by D2D;
Figure FDA0002748719970000015
a set of candidate service users representing D2D requesting user j;
Figure FDA0002748719970000016
and
Figure FDA0002748719970000017
respectively representing the transmission rates of the cellular user and the D2D requesting user;
the constraint conditions are as follows:
Figure FDA0002748719970000021
wherein constraint (a) represents a transmit power constraint for the cellular user and the D2D link,
Figure FDA0002748719970000022
and
Figure FDA0002748719970000023
maximum transmit power for cellular users and D2D serving users, respectively;
constraint (b) represents a transmission rate constraint, R, for the cellular user and D2D linkscAnd RdMinimum rate constraints for cellular users and D2D links, respectively;
constraint (c) indicates that a single D2D requests that a user can only transmit user services by a single D2D;
constraint (D) indicates that a single D2D link can only multiplex the spectrum resources of a single cellular user.
3. The wireless cache network system throughput optimization method of claim 2, wherein in the model
Figure FDA0002748719970000024
And
Figure FDA0002748719970000025
respectively expressed as:
Figure FDA0002748719970000026
Figure FDA0002748719970000027
wherein
Figure FDA0002748719970000028
And
Figure FDA0002748719970000029
representing the noise power of the cellular link and the D2D link, respectively;
Gi,Brespectively representing the channel gains of cellular users i to the base station;
Gi,jshown as the interfering link gain, G, for cellular user i versus D2D requesting user jjChannel gain, G, denoted as D2D request for user jj,iThe interference link gain for cellular user i for the serving user, denoted as D2D requesting user j; gk,jD2D requests the interfering link gain for user j requested by D2D for the serving user of user k.
4. The throughput optimization method of claim 1, wherein the access selection and channel allocation model is expressed as:
Figure FDA0002748719970000031
Figure FDA0002748719970000032
5. the throughput optimization method of claim 1, wherein the power control model is:
Figure FDA0002748719970000033
Figure FDA0002748719970000034
wherein, DSiA D2D request set indicating that the ith cellular user spectrum resource is multiplexed.
6. The throughput optimization method of claim 1, wherein the providing access services and channel assignments for the D2D requesting user according to the access selection and assignment model comprises:
converting the three-dimensional matching of the access selection and the channel allocation model into two-dimensional bilateral graph matching;
and calculating the service user of the D2D request user according to a bilateral graph matching algorithm.
7. The method of optimizing throughput in a wireless cache network system of claim 6, further comprising:
and calculating to obtain the cellular user spectrum resource with the minimum sum of the channel allocation co-channel interference of the D2D request user by adopting a heuristic iterative algorithm.
8. The throughput optimization method of claim 1, wherein the determining and maintaining feasibility of power control of the D2D user-assigned channel comprises:
judging the feasibility of power control through a Perron-Frobenius theory;
if not, executing link removing algorithm to remove the request user with maximum interference of co-channel in channel allocation until power control is feasible.
9. The method of claim 1, wherein converting the power control model into the DC plan comprises:
converting the power control model into a target function in a DC programming form;
and solving the DC plan by using a continuous convex optimization method through a first-order Taylor expansion to obtain an optimal solution.
10. The method of claim 1, wherein the method comprises:
the wireless caching network comprises a plurality of D2D requesting users, a plurality of D2D serving users, and a plurality of cellular users; cellular users transmit data on a given authorized channel, D2D serves users to cache network content, and D2D requests users to request network content.
CN202011176152.9A 2020-10-29 2020-10-29 D2D-based system throughput optimization method in wireless cache network Active CN112367644B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202011176152.9A CN112367644B (en) 2020-10-29 2020-10-29 D2D-based system throughput optimization method in wireless cache network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011176152.9A CN112367644B (en) 2020-10-29 2020-10-29 D2D-based system throughput optimization method in wireless cache network

Publications (2)

Publication Number Publication Date
CN112367644A true CN112367644A (en) 2021-02-12
CN112367644B CN112367644B (en) 2023-04-18

Family

ID=74511314

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011176152.9A Active CN112367644B (en) 2020-10-29 2020-10-29 D2D-based system throughput optimization method in wireless cache network

Country Status (1)

Country Link
CN (1) CN112367644B (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113543085A (en) * 2021-07-22 2021-10-22 河北百亚信息科技有限公司 Time allocation and user scheduling method in D2D communication network based on energy collection technology

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150351089A1 (en) * 2012-12-31 2015-12-03 Nec (China) Co., Ltd. Method and apparatus of resource sharing for device-to-device and cellular communications
CN106912079A (en) * 2017-02-20 2017-06-30 北京邮电大学 Federated user accesses selection and resource allocation methods in one kind caching heterogeneous network
CN108718446A (en) * 2018-05-22 2018-10-30 吉林大学 D2D model selections and resource allocation methods in LTE-A network
CN110611902A (en) * 2019-09-19 2019-12-24 哈尔滨工程大学 D2D resource allocation method based on uplink and downlink spectrum joint multiplexing

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150351089A1 (en) * 2012-12-31 2015-12-03 Nec (China) Co., Ltd. Method and apparatus of resource sharing for device-to-device and cellular communications
CN106912079A (en) * 2017-02-20 2017-06-30 北京邮电大学 Federated user accesses selection and resource allocation methods in one kind caching heterogeneous network
CN108718446A (en) * 2018-05-22 2018-10-30 吉林大学 D2D model selections and resource allocation methods in LTE-A network
CN110611902A (en) * 2019-09-19 2019-12-24 哈尔滨工程大学 D2D resource allocation method based on uplink and downlink spectrum joint multiplexing

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
李雄伟: "基于最优功率分配原则的无线网络D2D用户通信质量分析", 《电子测量技术》 *

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113543085A (en) * 2021-07-22 2021-10-22 河北百亚信息科技有限公司 Time allocation and user scheduling method in D2D communication network based on energy collection technology
CN113543085B (en) * 2021-07-22 2023-04-07 河北百亚信息科技有限公司 Time allocation and user scheduling method in D2D communication network based on energy collection technology

Also Published As

Publication number Publication date
CN112367644B (en) 2023-04-18

Similar Documents

Publication Publication Date Title
CN111447619B (en) Joint task unloading and resource allocation method in mobile edge computing network
CN109413724B (en) MEC-based task unloading and resource allocation scheme
CN111132191B (en) Method for unloading, caching and resource allocation of joint tasks of mobile edge computing server
CN111182570B (en) User association and edge computing unloading method for improving utility of operator
CN111010684B (en) Internet of vehicles resource allocation method based on MEC cache service
CN106912079B (en) Combined user access selection and resource allocation method in cache heterogeneous network
CN109194763B (en) Caching method based on small base station self-organizing cooperation in ultra-dense network
CN109756912B (en) Multi-user multi-base station joint task unloading and resource allocation method
CN107426773B (en) Energy efficiency-oriented distributed resource allocation method and device in wireless heterogeneous network
CN108600999B (en) FD-D2D joint optimization method based on channel allocation and power control
CN107613556B (en) Full-duplex D2D interference management method based on power control
CN109788540B (en) Power control and channel allocation method based on energy collection in D2D system
CN111885147A (en) Dynamic resource pricing method in edge calculation
Zhang et al. DMRA: A decentralized resource allocation scheme for multi-SP mobile edge computing
Lan et al. Execution latency and energy consumption tradeoff in mobile-edge computing systems
Yu et al. Interference coordination strategy based on Nash bargaining for small‐cell networks
CN102752757B (en) Method for optimizing frequency spectrum allocation according to minimal waste criterion in frequency spectrum aggregation process
CN108965034B (en) Method for associating user to network under ultra-dense deployment of small cell base station
CN112367644B (en) D2D-based system throughput optimization method in wireless cache network
Kuang et al. Analysis and optimization of random caching in $ K $-tier multi-antenna multi-user HetNets
Zeng et al. A two-phase power allocation scheme for CRNs employing NOMA
CN113055860A (en) D2D many-to-many resource allocation method in cellular network
CN112235387A (en) Multi-node cooperative computing unloading method based on energy consumption minimization
CN108601083B (en) Resource management method based on non-cooperative game in D2D communication
Yang et al. Resource-efficiency improvement based on BBU/RRH associated scheduling for C-RAN

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
CB02 Change of applicant information
CB02 Change of applicant information

Address after: 250104 No. 2877 Kehang Road, Sun Village Town, Jinan High-tech Zone, Shandong Province

Applicant after: Chaoyue Technology Co.,Ltd.

Address before: 250104 No. 2877 Kehang Road, Sun Village Town, Jinan High-tech Zone, Shandong Province

Applicant before: SHANDONG CHAOYUE DATA CONTROL ELECTRONICS Co.,Ltd.

GR01 Patent grant
GR01 Patent grant