CN106454920B - Resource allocation optimization algorithm based on Delay Guarantee in a kind of LTE and D2D hybrid network - Google Patents
Resource allocation optimization algorithm based on Delay Guarantee in a kind of LTE and D2D hybrid network Download PDFInfo
- Publication number
- CN106454920B CN106454920B CN201610952448.2A CN201610952448A CN106454920B CN 106454920 B CN106454920 B CN 106454920B CN 201610952448 A CN201610952448 A CN 201610952448A CN 106454920 B CN106454920 B CN 106454920B
- Authority
- CN
- China
- Prior art keywords
- user
- particle
- lte
- resource block
- resource allocation
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W24/00—Supervisory, monitoring or testing arrangements
- H04W24/06—Testing, supervising or monitoring using simulated traffic
-
- 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/0226—Traffic management, e.g. flow control or congestion control based on location or mobility
-
- 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
- H04W28/0236—Traffic management, e.g. flow control or congestion control based on communication conditions radio quality, e.g. interference, losses or delay
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses the resource allocation optimization algorithms based on Delay Guarantee in a kind of LTE and D2D hybrid network, belong to wireless communication technology field；Specifically: Step 1: being directed to the mono- cell of LTE, the D2D user and LTE user of pairing are existed simultaneously, communication system is established.Step 2: carrying out resource allocation with LTE user to the D2D user couple in communication system, mathematical modeling is carried out under conditions of maximum system throughput and user's time delay are lower than thresholding time delay；Step 3: obtaining the position that each particle is final when throughput of system maximum to mathematics model solution using the resource allocation algorithm based on particle group optimizing；Step 4: carrying out simulating, verifying to the resource allocation algorithm based on particle group optimizing, Time Delay of Systems is effectively reduced.Advantage is: under LTE network and D2D communication hybrid network framework, under the premise of guaranteeing that user's time delay is no more than time delay thresholding, maximizing system entire throughput；Realize the reasonable distribution and optimization of radio resource.
Description
Technical field
The invention belongs to wireless communication technology field, based on Delay Guarantee in specifically a kind of LTE and D2D hybrid network
Resource allocation optimization algorithm.
Background technique
Currently, terminal direct connection (D2D) communication technology allow two equipment being closer, do not influenced by base station or only by
Direct communication is realized in the case where limited influence, which can significantly improve throughput of system and spectrum efficiency, and user believes
It enables and data requires no core net, directly transmitted between user, there are good Research Prospects.However due to partial movement industry
It is engaged in more sensitive to time delay, such as instant video communication and interactive game, too long time delay will lead to the using experience degree of user
Decline, not can guarantee the QoS of user.
Existing LTE cellular network has also been difficult to meet the growing mobility demand of user.
In view of the above-mentioned problems, the D2D communication technology based on low time delay can effectively meet the needs of user is to real-time,
Communication QoS is promoted, LTE cellular communication is replaced using the D2D that low time delay guarantees under the scene of part, forms LTE and D2D mixing group
Net can effectively improve spectrum efficiency, alleviate the pressure of mobile network.But D2D network is disposed under LTE cellular network and is also deposited
In many challenges, if D2D user is to discovery procedure, the resource management etc. between D2D user and LTE user.It is mixed in LTE and D2D
The problems such as being combined in net, how distributing there are radio resource and interfere with each other to each other.
In existing LTE and D2D mixed networking mode, at present mainly using hybrid networks such as model selection, resource allocations
Radio resource management techniques.
Document [1]: the D2D multicast resource allocation plan with QoS guarantee based on OFDMA system.[C] // it is personal indoor
Wireless communication system, the 24th international symposium of 2013IEEE, 2013:12383-2387. document [2]: under LTE-A network
Model selection // cordless communication network meeting [C] of D2D communication, 2010IEEE.IEEE, 2010:1-6. and document [3]: in bee
The wireless council of resource-sharing prioritization scheme [J] .IEEE under nest network for D2D communication, 2011,10 (8): 2752-
2763. have studied the mode selection problem of D2D user and phone user's share spectrum resources respectively, although mode selection algorithm is examined
The disturbed condition under D2D and cellular link-quality and every kind of possible shared model is considered, has finally selected meeting Cellular Networks
Highest transmission rate is capable of providing under network SINR restrictive condition.But there is no consider on multiplexing honeycomb for the algorithm of the mode
Capable or downlink resource difference, also the influence not by interference to overall performance of network is taken into account.
Document [4]: the interference based on D2D communication under cellular network perceives [C] //IEEE vehicle technology conference .2009:
1-5. propose it is a kind of based on interference perception Resource Allocation Formula, D2D first to uplink carry out Interference Detection, the Later Zhou Dynasty, one of the Five Dynasties
Feed back information to phase property base station, base station is that D2D user distributes resource according to the information received, reduces phone user with this
Interference to D2D user.But the Resource Allocation Formula could not realize the maximization of throughput of system, also failing to realize will provide
The reasonable fairness in source distributes to user.
Document [5] based on the D2D timing communicated and Resource Allocation Formula [C] // wireless communication and network conference,
2013IEEE.IEEE, 2013:134-139. propose resource point that is a kind of while considering throughput of system and the fairness of user
With algorithm, still, which can not perceive link state, cannot achieve the requirement of low time delay.
D2D communication [J] modern science and the communication technology under document [6] LTE-A network, 2010,47 (12): 42-
The D2D Communication Jamming management method that shared model under LTE network is had studied in 49., however, the management method could not equally be distinguished
Consider the uplink and downlink resource of cellular network.
Under document [7] 5G cellular network, D2D communicates facing challenges and following developing direction [J] the .IEEE communication is miscellaneous
Will, 2014,52 (5): although the algorithm that 86-92. is proposed can reach highest speed rates, which does not account for power
Control.
Document [8] is used for resource allocation performance evaluation [C] //GLOBECOM Workshops of D2D communication,
2011IEEE.IEEE, 2011:358-362. propose a kind of flexible resource multiplex for having combined model selection and power distribution
Strategy can minimize whole power consumption, but not make throughput of system maximum as far as possible.
To sum up, resource allocation research algorithm in the prior art does not all account for the influence that time delay communicates D2D, therefore i.e.
It is the QoS that can reach good power control and very high throughput of system, but not can guarantee user, is unable to satisfy i.e.
When the business demand more demanding to time delay such as video.
Summary of the invention
The present invention has studied the resource allocation based on time delay and asks under the framework that LTE cellular network and D2D communication coexist
Topic, by carrying out reasonable resource allocation to LTE user and D2D user come maximum system throughput；By the way that time delay will be based on
The resource allocation of guarantee is abstracted as mixed integer nonlinear programming problem, in order to realize lower complexity, proposes a kind of LTE
With in D2D hybrid network based on the resource allocation optimization algorithm of Delay Guarantee.
Specific step is as follows:
Step 1: being directed to the mono- cell of LTE, the D2D user and LTE user of pairing are existed simultaneously, communication system is established.
Communication system includes: a base station, K1A LTE user and K2To D2D user couple；LTE user and D2D user couple
Share N number of resource block.The downlink resource of communication multiplexing LTE network between D2D user couple, and a D2D user is to occupancy one
Resource block, different D2D users are to cannot be multiplexed identical resource block.
K1A LTE user is using setIt indicates, K2To D2D user to useIt indicates；
Step 2: carrying out resource allocation with LTE user to the D2D user couple in communication system, system throughput is being maximized
Amount and user's time delay carry out mathematical modeling under conditions of being lower than thresholding time delay；
It is as follows by the formula of resource allocation maximum system throughput:
Mathematical modeling is as follows:
The distribution condition for indicating resource block n, whenWhen indicate resource block n be allocated to k-th of user,
When then indicate that resource block n is not allocated to k-th of user.
K-th of LTE user or k-th of D2D user are represented to the transmission rate on resource block n；Formula is as follows:
B represents the bandwidth of resource block n；Γ (Γ≤1) is represented under truth and the gap of Shannon capacity；Indicate kth
The SINR of a LTE user or k-th of D2D user to the receiving end on resource block n；Formula is as follows:
Indicate that the transmission power of k-th of LTE user is distributed in base station on resource block n；Base station is on all resource blocks
The sum of transmission power no more than the maximum transmission power limitation in base station
Represent the channel gain from base station to k-th of LTE user on resource block n；
Indicate to remove k-th of LTE user being assigned to of resource block n or k-th of D2D user to rear, on resource block n
Other all jamming powers caused by user security risk.
Indicate the noise power for k-th of the LTE user or k-th of D2D user couple that resource block n is assigned to；
Indicate k-th of D2D user to the transmission power on resource block n；Any one D2D user is in all resources
The sum of transmission power on block is limited no more than the transmission power of D2D user
It represents on resource block n from the transmitting terminal of k-th of D2D user couple to the channel gain of receiving end；
lkK-th of LTE user or k-th of D2D user are represented to the queue length of transmitting terminal；
Represent the maximum delay thresholding that each user will meet.
Step 3: obtaining throughput of system to mathematics model solution using the resource allocation algorithm based on particle group optimizing
Each particle final position when maximum；
According to the resource allocation problem based on time delay, discrete particle resource allocation is indicated the company for being mapped to resource allocation
On continuous domain, restrictive condition is converted into penalty function, fitness function is proposed and is solved with particle swarm optimization algorithm.
Specific step is as follows:
The position of step 301, each particle of initialization, speed, history optimal solution and globally optimal solution；
Location sets X of i-th of particle on resource blockiIt indicates are as follows:I=1,
2 ..., S, S are the sum of particle；N=1,2 ..., 2N, N are the quantity of resource block.
For i-th of particle, by the position of the particleAnd speedIt is initialized using the random number between 0 and 1,
History optimal solution pbesti0 is initialized to globally optimal solution gbest.
Step 302 is directed to i-th of particle, and speed and the position of the particle are updated in the t times iteration；
More new formula is as follows:
W is the inertia weight factor for controlling Particle velocity；c1And c2It is the normal amount of two Studying factors, r1And r2It is to take
The stochastic variable of value between zero and one.
pbesti(t) i-th of particle is represented in the t times iteration, and throughput of system is made to maximize the position for obtaining optimal value
It sets, i.e. the history optimal solution of the particle；
The history optimal solution pbest of i-th of particlei(t), it is indicated with following formula:
Wherein, τ is the number of iterations, xiIt (t) is the position where i-th of particle；F () is objective function.
Gbest (t) represents the t times iteration in the range of all particles, and so that throughput of system is obtained optimal value must own
The position of particle, i.e. globally optimal solution, are indicated with following formula:
The updated position vector of i-th of particle is divided into two parts by step 303, and every part is all decoded into whole
Number is used as resource block serial number, and corresponding resource block is respectively allocated to LTE user and D2D user couple；
By being decoded to the position vector that particle updates, obtain LTE user's serial number corresponding to each resource block and
D2D pairs of serial number, and then judge that each resource block has been allocated to D2D user or LTE user.
Location sets vector X for i-th of particle, on resource blockiIt is divided into two partsWith
Decoding formula is as follows:
Represent the serial number that resource block n is assigned to LTE user；Value represent resource block n and be assigned to
D2D pairs of serial number；Floor (), which is represented, to be rounded downwards, K1Represent the quantity and K of LTE user2Represent the quantity of D2D user couple.
Value be K1+K2+ 1 expression resource block n is not allocated to D2D user couple.
Step 304, for the D2D user and LTE user for distributing resource block, by base station and D2D pairs of transmitting terminal total work
Rate is evenly distributed on respective occupied resource block, converts resource allocation problem to the maximization system under restrictive condition
Throughput problem.
Restrictive condition are as follows:
Step 305 introduces fitness function to each particle, and the maximization system under restrictive condition in step 304 is gulped down
The amount of spitting problem is converted into non-limiting problem, and calculates the value of fitness function Fitness；
P∈R+It is compensation factor.For penalty function；
Step 306 judges whether the update position of i-th of particle can make fitness function value maximum, if so, entering step
Rapid 307, otherwise, return step 302 updates i-th of particle history optimal solution position pbesti；
Step 307, the history optimal solution according to each particle, finding out makes the maximum all particle positions of fitness function value
It sets, updates globally optimal solution gbest.
Each particle final position when obtaining throughput of system maximum according to globally optimal solution, resource allocation reach most
It is excellent.
Step 4: carrying out simulating, verifying to the resource allocation algorithm based on particle group optimizing, radio resource allocation is realized
Reasonably optimizing.
The present invention has the advantages that
1) a kind of, resource allocation optimization algorithm based on Delay Guarantee in LTE and D2D hybrid network, in LTE network and
D2D is communicated under hybrid network framework, and under the premise of guaranteeing that user's time delay is no more than time delay thresholding, maximization system is integrally handled up
Amount.
2), a kind of LTE and the resource allocation optimization algorithm based on Delay Guarantee in D2D hybrid network, in lower algorithm
Good system performance is obtained in the case where complexity, calculated Resource Allocation Formula and optimal Resource Allocation Formula exist
Only has the gap of very little in performance.
3), a kind of LTE and the resource allocation optimization algorithm based on Delay Guarantee in D2D hybrid network, can effectively improve
The QoS of D2D communication user in LTE network.
Detailed description of the invention
Fig. 1 is the model of communication system figure that the present invention establishes；
Fig. 2 is the resource allocation optimization algorithm process based on Delay Guarantee in a kind of LTE of the present invention and D2D hybrid network
Figure；
Fig. 3 is method flow of the present invention using the resource allocation algorithm based on particle group optimizing to mathematics model solution
Figure；
Fig. 4 is variation diagram of the throughput of system with D2D user to quantity under three kinds of algorithms of the invention；
Fig. 5 is variation diagram of the average user time delay with D2D user to quantity under three kinds of algorithms of the invention；
Fig. 6 be under two kinds of algorithms of the invention average D2D rate with D2D user to the distance between variation diagram；
Fig. 7 be under two kinds of algorithms of the invention average D2D time delay with D2D user to the distance between variation diagram.
Specific embodiment
Specific implementation method of the invention is described in detail with reference to the accompanying drawing.
Resource allocation optimization algorithm based on Delay Guarantee in a kind of LTE and D2D hybrid network, is guaranteeing a fixed response time
In the case of carry out resource reasonable distribution the dynamic to resource block is passed through using the resource allocation policy based on particle group optimizing
The simple distribution of scheduling and power, to achieve the purpose that maximum system throughput；Using time delay as use in being studied a question
The restrictive condition that family need to meet.
As shown in Figure 2, the specific steps are as follows:
Step 1: establishing communication system for the mono- cell of LTE for the D2D user and LTE user for existing simultaneously pairing.
Overall network scene is as shown in Figure 1, the communication system under LTE single-cell environment includes: a base station, K1It is a
LTE user and K2To D2D user couple；D2D user has been completed pairing, and LTE user and D2D user are in a shared mode
Share N number of resource block.
Only consider to D2D to and LTE user distribute the process of resource, between D2D user couple under communication multiplexing LTE network
Row resource, and resource block can only be by a D2D to occupancy, and different D2D users are to cannot be multiplexed identical resource block.In this way
Would not have interference between D2D user couple, in network only base station to the interference of D2D user couple and D2D to using phase
LTE user's bring with resource block is interfered.
K1A LTE user is using setIt indicates, K2To D2D user to useIt indicates；Further, serial number k=1,2 ..., K unifying identifier LTE user and D2D user can be used
It is right, wherein K=K1+K2.Assuming that base station can know all downlink channel condition informations, such base station just can be clever between users
Distribution resource living.
Step 2: carrying out resource allocation with LTE user to the D2D user couple in communication system, system throughput is being maximized
Amount and user's time delay, which are lower than under conditions of thresholding time delay, carries out mathematical modeling to resource allocation problem；
Guarantee user's time delay be lower than thresholding time delay under the premise of, to D2D user to and LTE user carry out resource allocation come
Maximum system throughput, and mathematical modeling is carried out to resource allocation problem.
It is as follows by the formula of resource allocation maximum system throughput:
Mathematical modeling is as follows:
A binary variable is represented, indicates the distribution condition of resource block n, whenWhen indicate resource block n be assigned
K-th of user has been given,When then indicate that resource block n is not allocated to k-th of user, it is nonetheless possible to being allocated to it
Its user.
Assuming that the maximum transmission power in base station isThe transmission power of D2D user couple limits
K-th of LTE user or k-th of D2D user are represented to the transmission rate on resource block n；Formula is as follows:
B represents the bandwidth of resource block n；Γ (Γ≤1) is represented under truth and the gap of Shannon capacity；
If D2D user is assigned to the resource block of LTE user to occupying, D2D user is to will be by coming from base
The interference stood.LTE user shares the interference of the D2D user couple of same resource block by will receive with it.In general, channel capacity
Shannon formula can be used to calculate, but be unable to reach under reality, therefore represent true feelings with Γ (Γ≤1)
Under condition and the gap of Shannon capacity.
Indicate k-th of LTE user or k-th of D2D user to the SINR of the receiving end on resource block n；Formula is as follows:
Indicate that the transmission power of k-th of LTE user is distributed in base station on resource block n；Base station is on all resource blocks
The sum of transmission power no more than the maximum transmission power limitation in base station
Represent the channel gain from base station to k-th of LTE user on resource block n；
Indicate to remove k-th of LTE user being assigned to of resource block n or k-th of D2D user to rear, on resource block n
Other all jamming powers caused by user security risk.
Indicate the noise power for k-th of the LTE user or k-th of D2D user couple that resource block n is assigned to；
Indicate k-th of D2D user to the transmission power on resource block n；Any one D2D user is in all resources
The sum of transmission power on block is limited no more than the transmission power of D2D user
The transmitting terminal of upper k-th of the D2D user couple of resource block n is represented to the channel gain of receiving end；
lkThe arrival rate clothes that k-th of LTE user or k-th of D2D user are represented to the queue length of transmitting terminal, and is wrapped
From Poisson distribution；
Represent the maximum delay thresholding that each user will meet.
Formula (3) is objective function, indicates that asked a question target is maximum system throughput, i.e., by all users all
Transmission rate on resource block is added.Restrictive condition (4), which ensure that each resource block at most, can only be assigned to a LTE use
Family；Restrictive condition (5), which ensure that each resource block at most, can only be assigned to a D2D user couple.Formula (3-6) indicates resource
Whether block n is allocated to k-th of LTE user or k-th of D2D user couple.Restrictive condition (7) limits base station transmitting terminal
Maximum transmission power；Restrictive condition (8) limits D2D user to the maximum transmission power of transmitting terminal.Restrictive condition (9) describes
Each user will meet maximum delay thresholdingAbove optimization problem is that a mixed integer nonlinear programming is asked
Topic, the problem have very big solution space.
Power distribution and resource allocation two parts are contained, in constructed model in order to divide power distribution and resource
With decoupling, it is assumed that the transmitting terminal of D2D user couple and base station distribute power averaging on the resource block used in oneself, this is one
Power distribution strategies a simple and with practicability.Only consider without prejudice to restrictive condition (7) and (8) later
Resource block assignment problem.
Step 3: obtaining throughput of system to mathematics model solution using the resource allocation algorithm based on particle group optimizing
Each particle final position when maximum；
Particle swarm optimization algorithm is initially proposed by J.Kennedy and R.Eberhart, in standard particle colony optimization algorithm,
The position of each particle represents a potential solution of optimization problem, and defines an objective function to assess different solutions
Fitness.The population of shared S particle moves in the solution space that M is tieed up, and objective function can be made to obtain optimum value to find
Globally optimal solution.In each iteration, each particle adjusts the rate of oneself to follow its history optimal solution and current institute
It was found that globally optimal solution, finally particle is enable to reach globally optimal solution.
Standard particle colony optimization algorithm is generally used to solve the optimization problem of continuous solution space, but this is not particularly suited for this calculation
Based on the resource allocation problem of time delay in method, the expression problem of particle of the present invention only considers indicator variableThe variable-value is
Discrete, discrete particle swarm optimization algorithm can be used to solve this problem, therefore according to the resource allocation based on time delay
Problem is mapped to discrete particle resource allocation expression on the continuous domain of resource allocation, restrictive condition is converted into compensation letter
Number proposes fitness function and is solved with particle swarm optimization algorithm.
As shown in Figure 3, the specific steps are as follows:
The position of step 301, each particle of initialization, speed, history optimal solution and globally optimal solution；
The present invention is indicated the position of each particle using one by vector that 2N element forms, wherein each element
Value is between zero and one.The position of particle represents the resource block distribution condition of LTE user and D2D user couple.By LTE user and
The resource block distribution of D2D user couple carries out combined optimization, individually dynamically distributes in the case where fixing with the distribution of LTE user resources block
The resource block of D2D user couple is compared, and better systematic entirety energy can be obtained.
For N number of resource block and S particle, location sets X of i-th of particle on resource blockiIt indicates are as follows:I=1,2 ..., S, S are the sum of particle；N=1,
2 ..., 2N, N are the quantity of resource block.
For i-th of particle, by the position of the particleAnd speedIt is initialized using the random number between 0 and 1,
History optimal solution pbesti0 is initialized to globally optimal solution gbest.
Step 302 is directed to i-th of particle, and speed and the position of the particle are updated in the t times iteration；
More new formula is as follows:
W is the inertia weight factor for controlling Particle velocity；In initial standard particle colony optimization algorithm, inertia weight because
Son be to maintain it is constant, but by further research, it is thus proposed that the inertia weight factor can gradually subtract with the iteration of algorithm
Small, in algorithm, particle falls into locally optimal solution and influences algorithm performance in order to prevent early period, the inertia weight factor can be taken compared with
Big value is to make speed maintain original trend and huge change will not occur, in the algorithm later period in order to make result more steady
A possibility that vibrating in convergence process is rapidly restrained and greatly reduced, the inertia weight factor can be taken lesser
Value is to allow speed to be easier to change and can rapidly adapt to different situations.Decreasing strategy about the inertia weight factor also has
People is studied, and is successively the descending based on concave function from high to low by the performance that many experiments sum up decreasing strategy
Can, it is better than successively decreasing based on linear function, successively decreasing based on linear function and it is better than successively decreasing based on convex function.Since performance is poor
It is not that very greatly, the present invention uses linear function decreasing strategy.
c1And c2It is the normal amount of two Studying factors, usually setting c1=c2=2.r1And r2Be value between zero and one
Stochastic variable.
pbesti(t) i-th of particle is represented in the t times iteration, and throughput of system is made to maximize the position for obtaining optimal value
It sets, i.e. the history optimal solution of the particle；It is indicated with following formula:
Wherein, τ is the number of iterations, xiIt (t) is the position where i-th of particle；F () is objective function.
Gbest (t) is represented in the t times iteration, makes throughput of system maximize acquirement optimal in the range of all particles
It is worth the position of all particles, that is, globally optimal solution；
The updated position vector of i-th of particle is divided into two parts by step 303, and every part is all decoded into whole
Number is used as resource block serial number, and corresponding resource block is respectively allocated to LTE user and D2D user couple；
By being decoded to the position vector that particle updates, obtain LTE user's serial number corresponding to each resource block and
D2D pairs of serial number, and then judge that each resource block has been allocated to D2D user or LTE user.
Location sets vector X for i-th of particle, on resource blockiIt is divided into two partsWithThere are two elements in a vector, i.e.,WithIt is right
It should be in resource block n.The serial number of the LTE user and D2D user couple that obtain resource block n can be by right respectivelyWithDecoding comes
It obtains.
Decoding formula is as follows:
K1Represent the quantity and K of LTE user2Represent the quantity of D2D user couple；
Represent the serial number that resource block n is assigned to LTE user；Value range is from 0 to K1；It is rounded downwards, so taking
Less than K1+ 1, whenValue be 0 be to represent resource block n to be not allocated to LTE user.
Value represent the serial number that resource block n is assigned to D2D pairs；Value range is from K1+ 1 arrives K1+K2+1。
Floor (), which is represented, to be rounded downwards；K1+K2+ 1 be right side boundary extreme value take less than,Value be K1+K2+ 1 table
Show that resource block n is not allocated to D2D user couple.
After the result for having found the method for expression particle and distributing the position decoding of particle at resource block, due to
Power distribution problems use base station and general power is evenly distributed to respective occupied resource block by the transmitting terminal of D2D user couple
On solution, restrictive condition all other than restrictive condition (9) so all meets.The money proposed before final
Source assignment problem becomes the problem of maximum system throughput under restrictive condition (9).
Step 304, for the D2D user and LTE user for distributing resource block, by base station and D2D pairs of transmitting terminal total work
Rate is evenly distributed on respective occupied resource block, converts resource allocation problem to the maximization system under restrictive condition
Throughput problem.
Restrictive condition are as follows:
Step 305 constructs fitness function to each particle, and the maximization system under restrictive condition in step 304 is gulped down
The amount of spitting problem is converted into non-limiting problem, and calculates the value of fitness function Fitness；
Restrictive condition is eliminated by increasing introducing penalty function to objective function, calculates the value of last fitness function just
It is the solution of resource allocation problem.
Penalty function indicates are as follows:
Final fitness function is shown below:
P∈R+It is compensation factor；Penalty function plays very important in terms of guidance particle walks out non-feasible zone as early as possible
Effect, solution feasible for one, the value of penalty function should be 0, then the value of fitness function is exactly resource allocation problem
Solution.
Step 306 judges whether the update position of i-th of particle can make fitness function value maximum, if so, entering step
Rapid 307, otherwise, return step 302 updates i-th of particle history optimal solution position pbesti；
Step 307, the history optimal solution according to each particle, finding out makes the maximum all particle positions of fitness function value
It sets, updates globally optimal solution gbest.
Globally optimal solution gbest, is represented by the following formula:
Each particle final position when obtaining throughput of system maximum according to globally optimal solution, resource allocation reach most
It is excellent.
According to above step, the overall flow of the resource allocation algorithm based on particle group optimizing using following natural language come
Description:
Step 4: carrying out simulating, verifying to the resource allocation algorithm based on particle group optimizing, radio resource allocation is realized
Reasonably optimizing.
By being randomly assigned algorithm and being emulated with ergodic algorithm to the resource allocation algorithm based on particle group optimizing, than
Compared with performance, further verifying resource allocation algorithm of the present invention can be effectively reduced Time Delay of Systems.
Simulating scenes of the invention be set as a radius be 500 meters, system bandwidth be 3MHz LTE cell, have 15
Available resource block.Phone user and D2D user are uniformly distributed in entire cell range, and wherein the quantity of phone user is 3,
The quantity of D2D user couple changes between 2-7 according to different situations.
To the path apart from relevant path loss according to circumstances there are two types of different calculation methods, between base station and user
Loss uses formula L (d)=128.1+37.6log10D is calculated, and the path loss of D2D connection uses formula L (d)=148+
40log10D is calculated, wherein distance d is measured as unit of km.The time delay thresholding of each user is set asThe transmission power maximum of base station is 36dBm, and the maximum transmission power of user equipment is 17dBm.It makes an uproar simultaneously
The power spectral density of sound is set as -174dBm/Hz.Crucial system emulation parameter is as shown in table 1.
Table 1
| Parameter | Value |
| Number of cells | 1 |
| Radius of society | 500m |
| Phone user's number | 3 |
| D2D is to number | 2-7 |
| System bandwidth | 3MHz |
| Base station maximum transmission power | 36dBm |
| User's maximum transmission power | 17dBm |
| Noise power spectral density | -174dBm/Hz |
| User's time delay thresholding | 100ms |
As follows further with regards to the parameter setting of particle swarm optimization algorithm, the number of iterations is set as T=100, the quantity S of particle
=20, two Studying factors are set as c1=c2=2, and inertia weight factor w linear reduction from 0.95 to 0.4.
Next by the present invention is based on the resource allocation algorithm of particle group optimizing and traversal resource allocation algorithm, and it is random
Resource allocation algorithm is compared.Because the resource allocation algorithm the present invention is based on particle group optimizing is likely to be converging on local optimum
Solution, therefore it and traversal resource allocation algorithm are compared, to obtain the performance between locally optimal solution and globally optimal solution
Difference.Traversal resource allocation algorithm calculates each resource distribution mode, selects one and meets time delay in all users
The resource distribution mode of maximum system throughput in the case of restrictive condition.Random resource allocation algorithm is by a resource block
It is randomly assigned to a user, until all resource blocks have all been assigned, this resource allocation algorithm does not consider any restrictions
Condition.
Be respectively compared the throughput of system and average user time delay of three kinds of algorithms, wherein the transmitting terminal of D2D user couple and
The distance of receiving end is 50 meters, and the quantity of D2D user couple increases to 7 from 2.
As shown in Figure 4, it can be seen that the throughput of system of the resource allocation algorithm based on particle group optimizing is than traversal resource
The throughput of system of allocation algorithm is lower, because traversal resource allocation algorithm considers every kind of resource allocation conditions,
Obtained solution is globally optimal solution, and based on the resource allocation algorithm of particle group optimizing in the case where the number of iterations is restricted
What is obtained is locally optimal solution.Furthermore the complexity of resource allocation algorithm is traversed than the resource allocation algorithm based on particle group optimizing
Complexity it is much higher, the mentioned algorithm of the present invention reduces the complexity of algorithm significantly in the case where sacrificial system handling capacity
Degree.
Because the target of this algorithm is maximum system throughput, no matter the quantity of D2D user couple is how many, as far as possible
The resource of system is taken full advantage of, as can be seen from the figure overall system throughput has very big there is no the increase with D2D pairs
Variation, only some increases.And the increase with D2D user to quantity, it can be seen that the resource based on particle group optimizing
The difference of handling capacity is gradually increased between allocation algorithm and traversal resource allocation algorithm, because of the resource allocation when number of users increases
The case where when situation becomes how less with number of users, is compared, and the part that the resource allocation algorithm based on particle group optimizing is solved is most
Excellent solution and globally optimal solution gap can increase.About random resource allocation algorithm, as can be seen from the figure its throughput of system
The all random variation with user's average delay, and its performance is all poorer than other algorithms, because of random resource allocation algorithm
Each resource block is only randomly assigned to a user, guarantees the performance of system without any mechanism.
As shown in figure 5, when the average user of resource allocation algorithm and traversal resource allocation algorithm based on particle group optimizing
Prolong very close to and postponing a meeting or conference when average user and increase with D2D user to the increase of quantity.Because when D2D user is to quantity
When increase, the resource that each user is assigned to reduces compared with before, can be obtained transmission rate while reducing, because at this time
Prolonging correspondingly to increase.Furthermore due to characteristic that it is randomly assigned when using random resource allocation algorithm, it is possible to not
It is that resource block is assigned in each user, especially when the quantity of D2D user couple increases.When a user is not divided
When being fitted on resource block, the handling capacity of the user will be 0, and time delay will be infinitely great.When this happens, will not
The data of this user are included in the calculating of overall system performance, in case time delay occur is infinitely great situation.
Fig. 6 and Fig. 7 illustrate when D2D user to the distance between variation when, D2D user is to Mean Speed and average delay
Variation tendency, wherein the quantity of D2D user couple is set as 3.Random resource allocation algorithm is not because become explicitly herein
Law and do not consider.
As shown in Figure 6, it can be seen that when the distance between the transmitting terminal of D2D user couple and receiving end increase, D2D is used
The Mean Speed at family pair quickly reduces at the beginning, and the rate reduced later gradually becomes slow.When distance in short-term, D2D user
Pair transmitting terminal and receiving end between channel conditions it is fine, in this case resource allocation algorithm of the present invention mainly pass through by
The user that it is good that resource block distributes to channel conditions carrys out maximum system throughput.And when the transmitting terminal of D2D user couple and receiving end
The distance between when gradually increasing, due to deteriorated channel conditions, the resource for distributing to D2D user couple can be reduced, so D2D user
Mean Speed can be reduced.On the other hand, since each user has to the limitation thresholding for meeting time delay, so distributing to
The resource of D2D user must provide enough transmission rates to guarantee that user's time delay does not exceed threshold value, although therefore later
Channel situation between D2D user couple continues to be deteriorated, and D2D user can be than more gentle to the trend of Mean Speed reduction.And work as
D2D user to the distance between increase when, between resource allocation algorithm based on particle group optimizing and traversal resource allocation algorithm
D2D user Mean Speed gap can be reduced because when D2D user to the distance between it is bigger when, be to maximize
System handling capacity, the resource that can distribute to D2D user couple can be reduced accordingly, only maintain enough transmission rates, flexibility is due to money
Source is reduced and is reduced, the gap between such globally optimal solution and locally optimal solution and D2D user to the distance between it is smaller when
Compared to will be smaller.
As shown in Figure 7, it can be seen that the average delay of D2D user couple increases with the increase of distance, is based on population
The gap of average delay gradually increases with the growth of distance between the resource allocation algorithm and traversal resource allocation algorithm of optimization
Add, this is because D2D user is being gradually reduced the attainable rate of institute.
The present invention introduces the resource allocation policy based on particle group optimizing, the strategy in the hybrid network of LTE and D2D
Under the premise of guaranteeing throughput of system, resource allocation solution the resource allocation based on particle group optimizing is mapped to and has been calculated
Method, the algorithm realize the dynamic dispatching of resource and the simple distribution of power, so that throughput of system maximizes, are effectively reduced logical
Believe the purpose of D2D time delay.
Claims (2)
1. the resource allocation optimization algorithm based on Delay Guarantee in a kind of LTE and D2D hybrid network, which is characterized in that including such as
Lower step:
Step 1: being directed to the mono- cell of LTE, the D2D user and LTE user of pairing are existed simultaneously, communication system is established；
Communication system includes: a base station, K1A LTE user and K2To D2D user couple；K1A LTE user is using setIt indicates, K2To D2D user to useIt indicates；
LTE user and D2D user are to sharing N number of resource block；The downlink resource of communication multiplexing LTE network between D2D user couple, and
One D2D user is to a resource block is occupied, and different D2D users are to cannot be multiplexed identical resource block；
Step 2: in communication system D2D user couple and LTE user carry out resource allocation, in maximum system throughput and
User's time delay carries out mathematical modeling under conditions of being lower than thresholding time delay；
It is as follows by the formula of resource allocation maximum system throughput:
Mathematical modeling is as follows:
The distribution condition for indicating resource block n, whenWhen indicate resource block n be allocated to k-th of user,Shi Zebiao
Show that resource block n is not allocated to k-th of user；
K-th of LTE user or k-th of D2D user are represented to the transmission rate on resource block n；
Indicate that the transmission power of k-th of LTE user is distributed in base station on resource block n；Hair of the base station on all resource blocks
The sum of power is penetrated no more than the maximum transmission power limitation in base station
Indicate k-th of D2D user to the transmission power on resource block n；Any one D2D user is on all resource blocks
The sum of transmission power limited no more than the transmission power of D2D user
lkK-th of LTE user or k-th of D2D user are represented to the queue length of transmitting terminal；
Represent the maximum delay thresholding that each user will meet；
Step 3: obtaining throughput of system maximum to mathematics model solution using the resource allocation algorithm based on particle group optimizing
When the final position of each particle；
Specific step is as follows:
The position of step 301, each particle of initialization, speed, history optimal solution and globally optimal solution；
Location sets X of i-th of particle on resource blockiIt indicates are as follows:S
For the sum of particle；N=1,2 ..., 2N, N are the quantity of resource block；
For i-th of particle, by the position of the particleAnd speedIt is initialized using the random number between 0 and 1, history
Optimal solution pbesti0 is initialized to globally optimal solution gbest；
Step 302 is directed to i-th of particle, and speed and the position of the particle are updated in the t times iteration；
More new formula is as follows:
W is the inertia weight factor for controlling Particle velocity；c1And c2It is the normal amount of two Studying factors, c1=c2=2, r1And r2
It is the stochastic variable of value between zero and one；
pbesti(t) i-th of particle is represented in the t times iteration, so that throughput of system is maximized the position for obtaining optimal value, i.e.,
The history optimal solution of the particle；
The history optimal solution pbest of i-th of particlei(t), it is indicated with following formula:
Wherein, τ is the number of iterations, xiIt (t) is the position where i-th of particle；F () is objective function；
Gbest (t) represents the t times iteration in the range of all particles, so that throughput of system is obtained optimal value and obtains all particles
Position, i.e. globally optimal solution indicates with following formula:
The updated position vector of i-th of particle is divided into two parts, and every part is all decoded into integer and is made by step 303
For resource block serial number, corresponding resource block is respectively allocated to LTE user and D2D user couple；
Location sets vector X for i-th of particle, on resource blockiIt is divided into two partsWith
Decoding formula is as follows:
Represent the serial number that resource block n is assigned to LTE user；Value represent resource block n and be assigned to D2D pairs
Serial number；Floor (), which is represented, to be rounded downwards, K1Represent the quantity and K of LTE user2Represent the quantity of D2D user couple；
Value be K1+K2+ 1 expression resource block n is not allocated to D2D user couple；
Step 304, for the D2D user and LTE user for distributing resource block, the transmitting terminal general power of base station and D2D pairs is put down
It is assigned on respective occupied resource block, converts resource allocation problem to the maximization system throughput under restrictive condition
Amount problem；
Restrictive condition are as follows:
Step 305 introduces fitness function to each particle, by the maximum system throughput problem under restrictive condition, conversion
For non-limiting problem, and calculate the value of fitness function Fitness；
P∈R+It is compensation factor；For penalty function；
Step 306 judges whether the update position of i-th of particle can make fitness function value maximum, if so, entering step
307, otherwise, return step 302 updates i-th of particle history optimal solution position pbesti；
Step 307, the history optimal solution according to each particle, finding out makes the maximum all particle positions of fitness function value, more
New globally optimal solution gbest；
Step 4: carrying out simulating, verifying to the resource allocation algorithm based on particle group optimizing, the conjunction of radio resource allocation is realized
Reason optimization.
2. the resource allocation optimization algorithm based on Delay Guarantee in a kind of LTE as described in claim 1 and D2D hybrid network,
It is characterized in that, described in step 2:
B represents the bandwidth of resource block n；Γ is represented under truth and the gap of Shannon capacity；Γ≤1；Indicate k-th of LTE
The SINR of user or k-th of D2D user to the receiving end on resource block n；Formula is as follows:
Represent the channel gain from base station to k-th of LTE user on resource block n；
Indicate to remove k-th of LTE user being assigned to of resource block n or k-th of D2D user to rear, on resource block n other
All jamming powers caused by user security risk；
Indicate the noise power for k-th of the LTE user or k-th of D2D user couple that resource block n is assigned to；
It represents on resource block n from the transmitting terminal of k-th of D2D user couple to the channel gain of receiving end.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610952448.2A CN106454920B (en) | 2016-11-02 | 2016-11-02 | Resource allocation optimization algorithm based on Delay Guarantee in a kind of LTE and D2D hybrid network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610952448.2A CN106454920B (en) | 2016-11-02 | 2016-11-02 | Resource allocation optimization algorithm based on Delay Guarantee in a kind of LTE and D2D hybrid network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106454920A CN106454920A (en) | 2017-02-22 |
| CN106454920B true CN106454920B (en) | 2019-10-08 |
Family
ID=58180798
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610952448.2A Active CN106454920B (en) | 2016-11-02 | 2016-11-02 | Resource allocation optimization algorithm based on Delay Guarantee in a kind of LTE and D2D hybrid network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106454920B (en) |
Families Citing this family (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108024196A (en) * | 2017-11-27 | 2018-05-11 | 上海电机学院 | A kind of channel capacity maximum resource distribution method based on D2D technologies |
| CN108964981B (en) * | 2018-06-12 | 2021-09-14 | 南京邮电大学 | Method for establishing interference analysis model based on mMTC under sudden scene |
| CN108932216B (en) * | 2018-06-22 | 2022-06-21 | 上海工程技术大学 | Robot inverse kinematics solving method based on particle swarm optimization algorithm |
| CN110233755B (en) * | 2019-06-03 | 2022-02-25 | 哈尔滨工程大学 | Computing resource and frequency spectrum resource allocation method for fog computing in Internet of things |
| CN110611902B (en) * | 2019-09-19 | 2022-08-02 | 哈尔滨工程大学 | D2D resource allocation method based on uplink and downlink spectrum joint multiplexing |
| CN110839227B (en) * | 2019-11-25 | 2022-05-10 | 重庆邮电大学 | D2D resource allocation method and device for densely distributed user groups of cellular system |
| CN112990418B (en) * | 2019-12-02 | 2024-05-07 | 国网能源研究院有限公司 | Multi-energy cross-region optimal configuration method based on particle swarm-linear programming algorithm |
| CN111127139B (en) * | 2019-12-06 | 2023-06-27 | 成都理工大学 | Mixed recommendation algorithm based on ProbS and HeatS calculation mode improvement |
| CN114501644A (en) * | 2021-12-17 | 2022-05-13 | 北京邮电大学 | Time domain resource configuration method and device, electronic equipment and storage medium |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729430A (en) * | 2010-01-15 | 2010-06-09 | 西安电子科技大学 | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty |
| JP2014216873A (en) * | 2013-04-26 | 2014-11-17 | 株式会社日立製作所 | Base station having packet analysis function and radio communication system |
-
2016
- 2016-11-02 CN CN201610952448.2A patent/CN106454920B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101729430A (en) * | 2010-01-15 | 2010-06-09 | 西安电子科技大学 | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty |
| JP2014216873A (en) * | 2013-04-26 | 2014-11-17 | 株式会社日立製作所 | Base station having packet analysis function and radio communication system |
Non-Patent Citations (2)
| Title |
|---|
| "Delay-aware cross-layer design for device-to-device communications in future cellular systems";Wang W;《Communicaitons Magazine IEEE》;20140617;全文 * |
| "Resource control in network assisted device-to-device communicaitons:solutions and challenges";Lei L;《Communications Magazine IEEE》;20140617;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106454920A (en) | 2017-02-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106454920B (en) | Resource allocation optimization algorithm based on Delay Guarantee in a kind of LTE and D2D hybrid network | |
| Wen et al. | QoS-aware mode selection and resource allocation scheme for device-to-device (D2D) communication in cellular networks | |
| CN112601284B (en) | Downlink multi-cell OFDMA resource allocation method based on multi-agent deep reinforcement learning | |
| Zhou et al. | Low complexity cross-layer design with packet dependent scheduling for heterogeneous traffic in multiuser OFDM systems | |
| JP2012182792A (en) | Mobile communication system and remote wireless unit clustering method therefor | |
| Rodrigues et al. | Control of the trade-off between resource efficiency and user fairness in wireless networks using utility-based adaptive resource allocation | |
| Jiang et al. | Base station association game in multi-cell wireless networks (special paper) | |
| Badia et al. | On the impact of physical layer awareness on scheduling and resource allocation in broadband multicellular IEEE 802.16 systems [Radio Resource Management and Protocol Engineering for IEEE 802.16] | |
| Erpek et al. | Application-aware resource block and power allocation for LTE | |
| Fathi et al. | Utility-based resource allocation in orthogonal frequency division multiple access networks | |
| Li et al. | Multi-service resource allocation in future network with wireless virtualization | |
| Tsiropoulou et al. | Resource allocation in visible light communication networks: NOMA vs OFDMA transmission techniques | |
| Zhang et al. | Dynamic user-centric clustering for uplink cooperation in multi-cell wireless networks | |
| Gatti et al. | Optimal resource scheduling algorithm for cell boundaries users in heterogenous 5G networks | |
| Li et al. | Joint mode selection and proportional fair scheduling for D2D communication | |
| Labana et al. | Joint user association and resource allocation in CoMP-enabled heterogeneous CRAN | |
| Chuang et al. | SDN-based resource allocation scheme in ultra-dense OFDMA smallcell networks | |
| Islam et al. | A Proportional Scheduling Protocol for the OFDMA-Based Future Wi-Fi Network. | |
| Jabeen et al. | A benchmark for joint channel allocation and user scheduling in flexible heterogeneous networks | |
| CN104581910B (en) | Small base station asynchronous Poewr control method in towards the cooperative cluster of the amorphous covering of cell | |
| Elsayed et al. | Learning-based resource allocation for data-intensive and immersive tactile applications | |
| Chen et al. | Fairness and QoS guarantees of WiMAX OFDMA scheduling with fuzzy controls | |
| Chayon et al. | Downlink Radio Resource Management Through CoMP and Carrier Aggregation for LTE-Advanced Network | |
| Tsai et al. | QoE-aware Q-learning based approach to dynamic TDD uplink-downlink reconfiguration in indoor small cell networks | |
| Gong et al. | PSO-based resource allocation in software-defined heterogeneous cellular networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |