CN108337058A - Resource allocation methods based on combinational auction in a kind of heterogeneous network - Google Patents

Resource allocation methods based on combinational auction in a kind of heterogeneous network Download PDF

Info

Publication number
CN108337058A
CN108337058A CN201810010717.2A CN201810010717A CN108337058A CN 108337058 A CN108337058 A CN 108337058A CN 201810010717 A CN201810010717 A CN 201810010717A CN 108337058 A CN108337058 A CN 108337058A
Authority
CN
China
Prior art keywords
user
resource
channel
indicate
phone
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN201810010717.2A
Other languages
Chinese (zh)
Inventor
黄旭
李方伟
张海波
刘开健
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing University of Post and Telecommunications
Original Assignee
Chongqing University of Post and Telecommunications
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chongqing University of Post and Telecommunications filed Critical Chongqing University of Post and Telecommunications
Priority to CN201810010717.2A priority Critical patent/CN108337058A/en
Publication of CN108337058A publication Critical patent/CN108337058A/en
Pending legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04B—TRANSMISSION
    • H04B17/00—Monitoring; Testing
    • H04B17/30—Monitoring; Testing of propagation channels
    • H04B17/382—Monitoring; Testing of propagation channels for resource allocation, admission control or handover
    • 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/0215—Traffic management, e.g. flow control or congestion control based on user or device properties, e.g. MTC-capable devices
    • H04W28/0221—Traffic management, e.g. flow control or congestion control based on user or device properties, e.g. MTC-capable devices power availability or consumption
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/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)
  • Physics & Mathematics (AREA)
  • Electromagnetism (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention discloses the resource allocation methods based on combinational auction in a kind of heterogeneous network, the multiplexing criterion based on distance is used to find reusable channel resource for D2D user；In order to make D2D link throughputs maximize, use water-filling algorithm for D2D user's distribution power；Use auction algorithm for D2D user's optimal scheme channel resource.The present invention can effectively inhibit the cross-layer interference between phone user and D2D user, effectively improve the handling capacity of D2D links in the case where meeting QoS of customer requirement.

Description

Resource allocation methods based on combinational auction in a kind of heterogeneous network
Technical field
The present invention relates to wireless communication technology fields, more particularly in the heterogeneous network of phone user and D2D user's composition Resource allocation methods based on combinational auction.
Background technology
GreenNet is as current international energy is in short supply, and what is proposed under the present situation that CO2 emissions persistently increase is new Type research topic.Research in terms of 21 century, green wireless communication is just largely unfolded, and includes mainly mobile network The side such as energy consumption analysis, base station overlay management, GreenNet Energy efficiency evaluation, energy saving exploited in communication and adaptive power control Face.However, the research about this respect can not reduce mainly using the energy consumption for saving base station and core network device as target Network transmission service efficiency is improved while network infrastructure energy consumption, and improves the lasting usage time etc. of mobile terminal.
With flourishing for recent media stream media business and intelligent mobile terminal, people are taking cellular network Business quality requirement and handling capacity propose unprecedented challenge.The high speed brought for reply network-intensive and differentiation Flow increases and bulk device access, then just needing significantly to improve cellular network architecture.Because of any communications network system A wide range of, expeditiously each end user device in commander and dispatching communication network can not possibly be carried out by central apparatus, Problem above can be improved very well by the D2D communication technologys being introduced into traditional cellular network.
By by phone user and end-to-end (Device-to-Device, D2D) user composition heterogeneous network in, D2D The communication technology can improve frequency spectrum resource profit under the control of cell base station by being multiplexed the frequency spectrum resource of normal cellular cell With rate.D2D communications allow two and directly establish communication link between relatively small user, without passing through base first Distance is opposite between two users for standing and arriving receiving terminal again, therefore can effectively mitigate load of base station, and communicated due to D2D Shorter, channel condition is fine, therefore can reduce the transmission power of D2D user, improves the battery durable ability of terminal user. But since the D2D communication technologys have been multiplexed the frequency spectrum resource of cellular cell, D2D user and phone user on the same channel into Row communication can seriously reduce the communication quality of the two, drop so will produce co-channel interference therebetween in the case of serious interference The performance of low system.Therefore how to reduce the influence of interference fringe is to need urgently to study and solve the problems, such as.
Some methods for reducing co-channel interference have been proposed in presently relevant document, wherein centralized interference management side Case is effective using being interfered in the heterogeneous network that partial frequency multiplexing and power control are inhibition phone user and D2D user's composition Means.In addition, it is thus proposed that a kind of packet-based interference management scheme, specific method are：Group technology is divided into group just Orthogonal grouping between grouping and group is handed over, interior orthogonal group technology is organized and divides the D2D user of serious interference in identical group, identical group D2D user uses different channels, and different groups can be multiplexed identical subchannel；On the contrary, orthogonal group technology is that will not have between group There is interference or interferes D2D user of the D2D user point of very little in identical group, identical group that can be multiplexed identical channel, it is different Group distributes different channels.
It has been investigated that in the prior art, centralized interference management scheme is with the increase of D2D numbers of users, meter Calculating complexity can also sharply increase so that this method is difficult to apply in the scene of D2D user's dense deployment；Meanwhile it being based on dividing Orthogonal group technology is grouped from each D2D user's itself in being organized in the interference management scheme of group, it is difficult to be found complete Office is preferably grouped scheme, meanwhile, the D2D number of users in this grouping scheme obtain each group is very unbalanced so that one Part D2D user cannot be assigned to enough subchannels, to be difficult to ensure the service quality QoS requirements of D2D user.
Invention content
For the deficiency of the above technology now, the present invention invents the heterogeneous network that phone user and D2D user's composition are discussed Middle resource allocation problem, it is proposed that a kind of resource allocation algorithm based on D2D user's sub-clustering, can effectively inhibit cross-layer interference and Same layer is interfered, under the qos requirement for meeting user, the effective handling capacity for promoting D2D links.
Resource allocation methods based on combinational auction in a kind of heterogeneous network of the present invention, include the following steps：
Step 101：The multiplexing criterion based on distance is used to find reusable channel resource for D2D user；
Step 102：In order to make D2D link throughputs maximize, use water-filling algorithm for D2D user's distribution power；
Step 103：Use auction algorithm for D2D user's optimal scheme channel resource.
Preferably, the step 101 uses the multiplexing criterion based on distance to find reusable channel resource packet for D2D user It includes：
When D2D user and phone user use identical ascending resource, phone user can generate D2D user's receiving terminal Interference, and the nearlyr interference of distance is bigger.Under normal conditions, the number of users that D2D communications are carried out at the same time in cell is much smaller than honeycomb User, therefore D2D user generally has multiple potential multiplexing honeycomb objects.In order to ensure the QoS demand of D2D user, only When phone user is less than certain thresholding to the interference of D2D user, base station just allows D2D user to be multiplexed the channel resource.Therefore In order to reduce interference, reduce algorithm complexity, delimit phone user becomes particularly significant by the region of limitation multiplexing：
Pc,maxhcd≤Ic,d
Wherein Pc,maxIndicate the maximum transmission power of phone user, Ic,dIndicate phone user to D2D user's maximum interference door Limit, hcdChannel gain of the expression phone user to D2D user's receiving terminal.AgainSo can obtain：
Wherein, k and α indicates path loss constant coefficient and path loss index, d respectivelyctdIndicate that phone user and D2D use The distance between family receiving terminal, δctdAnd ζctdIt indicates to obey the rapid fading factor of exponential distribution and obey logarithm respectively to be just distributed very much The slow fading factor.Therefore phone user is using D2D user as the center of circle by the region of limitation multiplexing, and R is the circle of radius Domain.Phone user within this region will not become the potential multiplexing object of the D2D user.
Simultaneously in order to ensure the QoS of phone user, the SINR of phone user is set hereinminThreshold value.If D2D is used The channel resource of family multiplexing phone user i causesThen base station would not distribute to the cell resource this D2D use Family uses.Wherein,Indicate the Signal to Interference plus Noise Ratio of phone user i.
Preferably, the step 102 uses water-filling algorithm for D2D user point to make D2D link throughputs maximize Include with power：
After the resource collection for determining multiplexing, the transmission power by optimizing D2D user and phone user is to maximize The handling capacity of system, modeling optimization equation are as follows：
Wherein,WithThe transmission power of D2D user d and phone user k are indicated respectively；hcdAnd hddIndicate that honeycomb is used respectively Family to D2D user's receiving terminal channel gain and D2D user transmitting terminals to receiving terminal channel gain； N0Indicate Gauss white noise Sound；SkIndicate kth channel resource packet；Indicate the handling capacity that D2D user d is wrapped in k-th of resource；Pc,maxIndicate user most Big transmission rate；Indicate D2D user d the sum of transmission powers in k-th of resource packet.The present invention is solved using water-filling algorithm This problem.
Preferably, the step 103 uses the auction algorithm to include for D2D user's optimal scheme channel resource：
When learning that D2D user is multiplexed any cost set under the premise of maximum handling capacity, most for each D2D user distribution Good channel combination, to maximize D2D link throughputs as optimization aim, modeling optimization equation：
Wherein, χd(k) binary variable is indicated, value can only be 0 and 1；Ud(k) d pairs of k-th of resource packet of D2D user is indicated Satisfaction；Indicate that a bidder can at most obtain an article；Indicate an article It is at most assigned primary；C, D and SkPhone user's quantity, D2D numbers of users and channel resource packet quantity are indicated respectively.
The beneficial effects of the present invention are：Money in the heterogeneous network that the present invention is formed for phone user and D2D user Source assignment problem is completed under the premise of each user QoS in meeting system using the resource allocation algorithm based on combinational auction The distribution of D2D subscriber channels and power, and cross-layer interference and same layer interference are restrained effectively, effectively improve D2D links Handling capacity.
Description of the drawings
Resource allocation methods preferred embodiment flow chart in Fig. 1 heterogeneous networks of the present invention；
Fig. 2 present invention and the prior art figure compared with D2D user throughputs at different phone user SINR；
Fig. 3 present invention and the prior art figure compared with D2D user throughputs under different phone user's quantity；
Figure is compared in overall system capacity emulation to Fig. 4 present invention under phone user's quantity unlike the prior art；
Specific implementation mode
To make the object, technical solutions and advantages of the present invention express to be more clearly understood, below in conjunction with the accompanying drawings and specifically Case study on implementation is described in further details the present invention.
The resource allocation methods that Fig. 1 is shown in the heterogeneous network that the present invention is formed for phone user and D2D user are excellent Embodiment flow chart is selected, this approach includes the following steps：
Step 101：The multiplexing criterion based on distance is used to find reusable channel resource for D2D user；
Step 102：In order to make D2D link throughputs maximize, use water-filling algorithm for D2D user's distribution power；
Step 103：Use auction algorithm for D2D user's optimal scheme channel resource.
Step 101：It is that D2D user finds the detailed process of reusable channel resource such as using the multiplexing criterion based on distance Under：
When D2D user and phone user use identical ascending resource, phone user can generate D2D user's receiving terminal Interference, and the nearlyr interference of distance is bigger.Under normal conditions, the number of users that D2D communications are carried out at the same time in cell is much smaller than honeycomb User, therefore D2D user generally has multiple potential multiplexing honeycomb objects.In order to ensure the QoS demand of D2D user, only When phone user is less than certain thresholding to the interference of D2D user, base station just allows D2D user to be multiplexed the channel resource.Therefore In order to reduce interference, reduce algorithm complexity, delimit phone user becomes particularly significant by the region of limitation multiplexing：
Pc,maxhcd≤Ic,d (1)
Wherein Pc,maxIndicate the maximum transmission power of phone user, Ic,dIndicate phone user to D2D user's maximum interference door Limit, hcdChannel gain of the expression phone user to D2D user's receiving terminal.AgainSo can obtain：
Wherein, k and α indicates path loss constant coefficient and path loss index, d respectivelyctdIndicate that phone user and D2D use The distance between family receiving terminal, δctdAnd ζctdIt indicates to obey the rapid fading factor of exponential distribution and obey logarithm respectively to be just distributed very much The slow fading factor.Therefore phone user is using D2D user as the center of circle by the region of limitation multiplexing, and R is the circle of radius Domain.Phone user within this region will not become the potential multiplexing object of the D2D user.
Simultaneously in order to ensure the QoS of phone user, the SINR of phone user is set hereinminThreshold value.If D2D is used The channel resource of family multiplexing phone user i causesThen base station would not distribute to the cell resource this D2D use Family uses.Wherein,Indicate the Signal to Interference plus Noise Ratio of phone user i.
Step 102 is as follows using the detailed process that water-filling algorithm is D2D user's distribution power：
Power control part is after the resource collection for determining multiplexing, by the transmitting for optimizing D2D user and phone user Power maximizes the handling capacity of system.By previous step, we can determine whether the reusable potential letters of any one D2D user Road resource.There are k to without loss of generality, assume that D2D user d is potentially multiplexed object herein, this k channel can be combined into N number of resource packet at least contains a channel resource in each resource packet, uses SkIt indicates.Limitation D2D user is multiplexed herein The number of channel is no more than min (C/D, Nthreshold), the resource that part D2D user occupancies can be prevented excessive is done so, ensures system Fairness, while algorithm complexity can also be reduced.Therefore optimization aim can be expressed as：
Wherein,WithThe transmission power of D2D user d and phone user k are indicated respectively；hcdAnd hddHoneycomb is indicated respectively User to D2D user's receiving terminal channel gain and D2D user transmitting terminals to receiving terminal channel gain；N0Indicate Gauss white noise Sound；SkIndicate kth channel resource packet；Indicate the handling capacity that D2D user d is wrapped in k-th of resource；Pc,maxIndicate user most Big transmission rate；Indicate D2D user d the sum of transmission powers in k-th of resource packet.According to optimization aim and constraint item Part uses water-filling algorithm to distribute distribution power for D2D user, can be obtained by KKT conditions：
Wherein, α and β is Lagrange factor, is constant.Calculate local derviation：
Wherein,Obviously the power distribution of D2D user is multistage water injection power Distribution, δ=1/ (alpha+beta) ln2 are water line.Therefore, we can acquire arbitrary D2D user and be multiplexed any cost set SkWhen it is maximum Handling capacity and its corresponding transmission power
Step 103 uses auction algorithm for D2D user's optimal scheme channel resource, and detailed process is as follows：
By the power control of previous step, it can be seen that D2D user is multiplexed any cost set SkWhen maximum gulp down The amount of spitting and its corresponding transmission powerThe main target of channel resource allocation is distributed most for each D2D user Good channel combination, makes the throughput-maximized of its system.Meanwhile the power that this process will be acquired according to power control part Allocation plan completes corresponding power distribution.
This paper presents a kind of channel allocation mechanisms based on combinational auction, and using XOR bid language, i.e. permission one is competing Bat person can multiple articles of competitive bidding simultaneously, but at most obtain one of them.In this model, D2D user is considered as bidder, letter Road set SkIt is considered as the article being auctioned.On the basis of power control, we are by D2D user on particular channel set Privately owned appraisal of the maximum throughput as the user：
Wherein,Indicate that D2D user d wraps a handling capacity in k-th of resource.In auction, D2D user passes through shared letter Road resource improves the handling capacity of system, but it can also pay certain cost, such as co-channel interference.In order to embody the justice of auction Property, linear anonymous price is used herein.Therefore the cost of bidder is expressed as
Wherein, θ indicates the price of unit power,It is optimal power of the D2D user in multipling channel resource collection k Distribution, Pd(k) cost when D2D user d uses resource collection k is indicated.Therefore the income of bidder, i.e. its satisfaction to channel Degree can be expressed as：
Ud(k)=V (i, k)-Pd(k) (8)
We define a binary variable χd(k) channel distribution is indicated as a result, given bidder is to the utility function of article, Then object function is：
Wherein, χd(k) binary variable is indicated, value can only be 0 and 1；Ud(k) d pairs of k-th of resource packet of D2D user is indicated Satisfaction；Indicate that a bidder can at most obtain an article；Indicate an article It is at most assigned primary；C, D and SkPhone user's quantity, D2D numbers of users and channel resource packet quantity are indicated respectively.
Channel allocation algorithm is described in detail as follows：
Initialization：Setting auction round pointer t=0, the initial prices P of each article0(c), regular price decrement Δ ＞ 0 With increment γ ＞ 0.Privately owned appraisal V when arbitrary D2D user is multiplexed arbitrary channel resource set can be obtained by the result of power control (i, k) and auction cost Pd(k)。
Step1：Bidder d according to the utility function of oneself to potential resource collection k submissions of quotation, if utility function Ud(k) 0 ＞, the then quotation submitted are：Otherwise the quotation submitted is：Epicycle is offered Collection is combined into
Step2：Detect whether there is the case where drug on the market.If there is c ∈ Sk, and It then indicates that at least one channel does not receive quotation, enables t=t+1, Pt+1(c)=Pt(c)-Δ returns to step1, otherwise goes to step3.
Step3：Detect whether there is the case where demand exceeds supply.①And d1 ≠ d2, k ∈ (1,2,.N..,；)②AndIf Any one in above-mentioned two situations is set up, then at least one channel receives several parts of quotations simultaneously.Enable t=t+1, Pt+1(c)=Pt (c)+γ returns to step1.
Step4：Step1-3 is repeated, until all D2D users win channel resource or each channel is auctioned out Until going.
In order to verify algorithm validity proposed in this paper, D2D heterogeneous networks are modeled as city as defined in 3GPP standards herein City's deployment scenario.Channel mainly considers path loss, shadow fading and allocating antenna, specific simulation parameter such as 1 institute of table to gain Show.
Simulation parameter Numerical value
Radius of society 350m
RB bandwidth 180kHz
Phone user's quantity 5-20
D2D user is to quantity 5
Phone user's maximum transmission power 23Db
D2D user's maximum transmission power 23Db
Gaussian noise power -174dBm/Hz
It compared 5 kinds of resource allocation algorithms respectively herein：Comparison 1 one D2D users of algorithm can only be multiplexed a channel, and One channel is only multiplexed by a D2D user；Wherein it is a plurality of to algorithm 5 to be all that a D2D user can be multiplexed for comparison algorithm 2 Channel, but a channel is only multiplexed by a D2D user.Comparison algorithm 2 is the transmission power of fixed D2D user, and random The be multiplexed channel resource of distribution；Comparison algorithm 3 is to be randomly assigned to be multiplexed for D2D user on the basis of this paper power controls Channel；Comparison algorithm 4 is the power of fixed D2D user, using the channel allocation algorithm of this paper；Comparison algorithm 5 optimizes herein asks The optimal solution of topic；This paper algorithms are that joint considers power control and channel assignment scheme.It is to embody one to introduce comparison algorithm 1 A D2D user is multiplexed the power system capacity that a plurality of channel strip comes and is promoted, and comparison algorithm 2-4 is to compare combined optimization from many aspects Advantage, comparison algorithm 5 is to verify the validity of this paper algorithms.
As shown in Fig. 2, the fixed cellular number of channel is 8, and when the SINR threshold values of phone user are from 5dB to 20dB, observation The handling capacity of D2D user under algorithms of different.As seen from the figure, with the increase of phone user's SINR threshold values, D2D under all algorithms The handling capacity of user is all gradually reduced.This is because when phone user SINR is bigger, phone user is multiplexed the channel to it D2D user's requirement is higher, and D2D user must reduce transmission power to reduce the interference to phone user, ensure phone user's QoS, therefore D2D user's total throughout is gradually reduced.It will be seen that other algorithms are compared with algorithm 1 from figure, algorithm 1 D2D user throughputs it is minimum, this is because the algorithm only allows D2D user to be multiplexed a channel resource, reduce frequency Compose utilization rate.As the SINR=11 of phone user, the throughput ratio algorithm 1 high 31.3% of D2D user, says under this paper algorithms It is bright to allow an a plurality of channel resource of D2D user's multiplexing effective lifting system handling capacity.Compared with algorithm 2,3,4, calculate herein Method joint Power controls and channel distribution keeps its resource allocation more reasonable, and the handling capacity of D2D user is highly improved.When When SINR=8, D2D user throughputs improve 26.1%, 28.4% and 18.2% than algorithm 2,3,4 respectively under this paper algorithms. Compared with algorithm 5, as SINR=20, algorithm 5 is up to 3.9% than the promotion of this paper algorithm performance.Although algorithm 5 is being promoted Be better than this paper algorithms in the handling capacity of D2D user, but algorithm 5 has higher complexity, this paper algorithms with lower complexity, And close to algorithm 5 in performance, hence it is demonstrated that the validity of this paper distribution mechanisms.
As shown in figure 3, the SINR=14dB of fixed cellular user, with the increase of phone user's quantity, under all algorithms The handling capacity of D2D user is all in rising trend.This is because with the increase of phone user's quantity, D2D user has in system More channels resource can select.This paper algorithm joint Powers control and channel distribution, keep channel distribution more reasonable.With algorithm 4 compare, and this paper algorithms adjust the transmission power of D2D user on each channel according to D2D user's multipling channel resource situation, Cross-layer is interfered in effective reduction system, therefore D2D user handles up higher than algorithm 4 under this paper algorithms.D2D user handles up in algorithm 3 Less than this paper algorithms, it is primarily due to this paper algorithms by inch of candle algorithm, each pair of D2D user can be allowed to obtain optimal multiplexing money Source keeps channel distribution more reasonable.With the growth of phone user's number, D2D user throughputs growth rate is obviously low in algorithm 1 In other algorithms the further promotion of performance is limited the reason is that algorithm 1 allows a pair of of D2D user to be multiplexed a channel.
As shown in figure 4, with the growth of phone user's quantity, handling capacity is continuously improved in system, is on the one hand newly to be added Throughput of system is improved when communicating to the phone user in system, is on the other hand that D2D user is believed by being multiplexed more The advantage in road further improves performance gain.It can be obtained from figure, compared with other algorithms, 1 system growth rate of algorithm It is relatively slow, the reason is that algorithm 1 allows a pair of of D2D user to be multiplexed a channel, cause the cross-layer interference of system centre larger, honeycomb is used Family and D2D user throughputs are promoted smaller.Although algorithm 2 is using constant power and accidental channel allocation algorithm, in algorithm 2 D2D user can utilize the multi channel advantage of multiplexing to promote the performance of D2D user as far as possible and can reduce cross-layer interference, therefore The overall system throughput of algorithm 2 is higher than algorithm 1, has also further demonstrated that multiplexing multichannel being capable of effective lifting system performance.It calculates The power control and channel allocation algorithm of this paper is respectively adopted in method 3 and algorithm 4, has been respectively completed optimal power allocation and channel point Match, therefore system performance is better than algorithm 2.This paper algorithms use joint Power and channel allocation mechanism, the total handling capacity of system to omit Less than algorithm 5, but this paper algorithm complexities are lower.Therefore, by being compared with other several algorithms, verification is multiple in single user herein With the validity of lower the carried algorithm of multichannel.
The present invention can effectively inhibit the interference between phone user and D2D user, and ensure phone user and D2D Under the premise of the QoS of user, the handling capacity of D2D links is effectively improved.
The lifted embodiment of the present invention or embodiment have carried out further the object, technical solutions and advantages of the present invention Detailed description, it should be understood that embodiment provided above or embodiment be only the preferred embodiment of the present invention and , be not intended to limit the invention, all within the spirits and principles of the present invention it is made for the present invention it is any modification, equally replace It changes, improve, should all be included in the protection scope of the present invention.

Claims (5)

1. the resource allocation methods based on combinational auction in a kind of heterogeneous network, which is characterized in that include the following steps：
Step 101：The multiplexing criterion based on distance is used to find reusable channel resource for D2D user；
Step 102：In order to make D2D link throughputs maximize, use water-filling algorithm for D2D user's distribution power；
Step 103：Use auction algorithm for D2D user's optimal scheme channel resource.
2. the resource allocation methods based on combinational auction in heterogeneous network according to claim 1, which is characterized in that described Step 101 uses the multiplexing criterion based on distance to find reusable channel resource for D2D user：
When D2D user and phone user use identical ascending resource, phone user can generate D2D user's receiving terminal dry It disturbs, and the nearlyr interference of distance is bigger；Under normal conditions, the number of users that D2D communications are carried out at the same time in cell is used much smaller than honeycomb Family, therefore D2D user generally has multiple potential multiplexing honeycomb objects.In order to ensure the QoS demand of D2D user, only when When phone user is less than certain thresholding to the interference of D2D user, base station just allows D2D user to be multiplexed the channel resource；Therefore it is Interference is reduced, algorithm complexity is reduced, delimit phone user becomes particularly significant by the region of limitation multiplexing：
Pc,maxhcd≤Ic,d
Wherein, Pc,maxIndicate the maximum transmission power of phone user, Ic,dPhone user is indicated to D2D user's maximum interference threshold, hcdChannel gain of the expression phone user to D2D user's receiving terminal；AgainSo can obtain：
Wherein, k and α indicates path loss constant coefficient and path loss index, d respectivelyctdIndicate that phone user and D2D user connect The distance between receiving end, δctdAnd ζctdIt is slow to indicate that the rapid fading factor for obeying exponential distribution is just being distributed very much with obedience logarithm respectively Fading factor；Therefore phone user is using D2D user as the center of circle by the region of limitation multiplexing, and R is the border circular areas of radius；At this Phone user within a region will not become the potential multiplexing object of the D2D user；
Simultaneously in order to ensure the QoS of phone user, the SINR of phone user is set hereinminThreshold value.If D2D user is multiple Caused with the channel resource of phone user iThen base station would not distribute to the cell resource this D2D user and make With；Wherein,Indicate the Signal to Interference plus Noise Ratio of phone user i.
3. the resource allocation methods based on combinational auction in heterogeneous network according to claim 1, which is characterized in that described Step 102 uses the water-filling algorithm to include for D2D user's distribution power to make D2D link throughputs maximize：
To maximize combination effectiveness as optimization aim：And meet constraints：WithWherein,WithThe transmission power of D2D user d and phone user k are indicated respectively；hcdWith hddRespectively indicate phone user to D2D user's receiving terminal channel gain and D2D user transmitting terminals to receiving terminal channel gain； N0Indicate white Gaussian noise；SkIndicate kth channel resource packet；Indicate the handling capacity that D2D user d is wrapped in k-th of resource； Pc,maxIndicate the maximum transmission rate of user；Indicate D2D user d the sum of transmission powers in k-th of resource packet.
4. the resource allocation methods based on combinational auction in heterogeneous network according to claim 1, which is characterized in that described Step 103 uses the auction algorithm to include for D2D user's optimal scheme channel resource：
The main target of channel resource allocation is that best channel combination is distributed for each D2D user, and Channel Assignment Problems are built Mould is combinational auction problem, is up to optimization aim with D2D link throughputs：And meet constraint item Part：WithWherein, χd(k) binary variable is indicated, value can only It is 0 and 1；Ud(k) satisfaction of d pairs of k-th of resource packet of D2D user is indicated；Indicate that a bidder at most may be used To obtain an article；It is primary to indicate that an article is at most assigned；C, D and SkPhone user is indicated respectively Quantity, D2D numbers of users and channel resource packet quantity.
5. according to the resource allocation methods based on combinational auction in any heterogeneous networks of claim 1-4, which is characterized in that The heterogeneous network is the heterogeneous network that phone user and D2D user form.
CN201810010717.2A 2018-01-05 2018-01-05 Resource allocation methods based on combinational auction in a kind of heterogeneous network Pending CN108337058A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201810010717.2A CN108337058A (en) 2018-01-05 2018-01-05 Resource allocation methods based on combinational auction in a kind of heterogeneous network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201810010717.2A CN108337058A (en) 2018-01-05 2018-01-05 Resource allocation methods based on combinational auction in a kind of heterogeneous network

Publications (1)

Publication Number Publication Date
CN108337058A true CN108337058A (en) 2018-07-27

Family

ID=62924679

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201810010717.2A Pending CN108337058A (en) 2018-01-05 2018-01-05 Resource allocation methods based on combinational auction in a kind of heterogeneous network

Country Status (1)

Country Link
CN (1) CN108337058A (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104796900A (en) * 2015-04-07 2015-07-22 南京邮电大学 Cellular network D2D (device-to-device) communication resource distributing method based on auction theory
CN105554808A (en) * 2016-02-22 2016-05-04 北京邮电大学 D2D (Device-to-Device) resource distribution method and device in cellular network
CN105636213A (en) * 2015-12-30 2016-06-01 哈尔滨工业大学 Heterogeneous C-RAN network and D2D communication mode selection and resource scheduling combined optimization method in network
CN107396448A (en) * 2017-08-15 2017-11-24 重庆邮电大学 A kind of resource allocation methods in heterogeneous network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104796900A (en) * 2015-04-07 2015-07-22 南京邮电大学 Cellular network D2D (device-to-device) communication resource distributing method based on auction theory
CN105636213A (en) * 2015-12-30 2016-06-01 哈尔滨工业大学 Heterogeneous C-RAN network and D2D communication mode selection and resource scheduling combined optimization method in network
CN105554808A (en) * 2016-02-22 2016-05-04 北京邮电大学 D2D (Device-to-Device) resource distribution method and device in cellular network
CN107396448A (en) * 2017-08-15 2017-11-24 重庆邮电大学 A kind of resource allocation methods in heterogeneous network

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
HYUNKEE MIN,: "Capacity Enhancement Using an Interference Limited Area for", 《IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS》 *
廖时雨: "D2D能量与能效技术研究", 《中国优秀硕士学位论文全文数据库 信息科技辑》 *

Similar Documents

Publication Publication Date Title
CN104717755B (en) The down frequency spectrum resources distribution method of D2D technology is introduced in a kind of cellular network
CN107426820B (en) Resource allocation method for improving energy efficiency of multi-user game in cognitive D2D communication system
Gu et al. Exploiting student-project allocation matching for spectrum sharing in LTE-unlicensed
CN107396448A (en) A kind of resource allocation methods in heterogeneous network
CN104796900B (en) D2D communication resource allocation methods in cellular network based on Game Theory
CN104301985B (en) Energy distribution method between power grid and cognitive base station in a kind of mobile communication
CN103281786B (en) The method for optimizing resources of a kind of Home eNodeB double-layer network based on energy efficiency
CN109618351B (en) Resource allocation method in heterogeneous network based on stackelberg game
CN110166987A (en) A kind of D2D communication efficiency optimal method ensureing cell mobile communication systems QoS
CN104796990A (en) Cellular heterogeneous network D2D resource allocation method based on power control
CN107105453A (en) Heterogeneous network selection cut-in method based on analytic hierarchy process (AHP) and evolutionary game theory
CN103582105B (en) A kind of large scale scale heterogeneous cellular network maximizes the optimization method of system benefit
CN104902574B (en) A kind of day line options and power distribution method based on efficiency
CN108990160A (en) A kind of 5G capacity of communication system optimization method based on improvement bat algorithm
CN110139282A (en) A kind of energy acquisition D2D communication resource allocation method neural network based
CN106921998A (en) A kind of energy mix is powered the access control system and method for mobile communications network
Wang et al. A novel resource allocation method in ultra-dense network based on noncooperation game theory
CN108337058A (en) Resource allocation methods based on combinational auction in a kind of heterogeneous network
CN103916862A (en) A method and device for allocating frequency points to cells
CN105516636A (en) Heterogeneous network multi-access resource distribution method based on video communication
Nie et al. Energy efficient cell selection in small cell networks with constrained backhaul links
He et al. Throughput maximization for multiple D2D group communications underlaying cellular networks
CN108601083A (en) Method for managing resource based on non-cooperative game in D2D communications
Yuan Research on network resource optimal allocation algorithm based on game theory
CN109041016B (en) Method for optimizing terminal access number of 5G communication system in dense scene

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
RJ01 Rejection of invention patent application after publication

Application publication date: 20180727

RJ01 Rejection of invention patent application after publication