CN106455078A - Equilibrium strategy-combined wireless virtual network resource allocation method - Google Patents
Equilibrium strategy-combined wireless virtual network resource allocation method Download PDFInfo
- Publication number
- CN106455078A CN106455078A CN201610927943.8A CN201610927943A CN106455078A CN 106455078 A CN106455078 A CN 106455078A CN 201610927943 A CN201610927943 A CN 201610927943A CN 106455078 A CN106455078 A CN 106455078A
- Authority
- CN
- China
- Prior art keywords
- user
- service provider
- resource allocation
- represent
- function
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/50—Allocation or scheduling criteria for wireless resources
- H04W72/52—Allocation or scheduling criteria for wireless resources based on load
Abstract
The present invention discloses an equilibrium strategy-combined wireless virtual network resource allocation method. Profits of an infrastructure provider and a service provider are taken into account, and the problem is broken down into two sub-problems including user connection and resource allocation, so that resolution of the problem is simplified, and the global profit is maximized. The method is based on an equilibrium strategy, and determines the price according to a user connection scheme and a resource allocation scheme. In addition, the price affects the user connection scheme and the resource allocation scheme. An operator can select a pricing function, a demand function, and a supply function that are related in the present invention according to needs, so that different demands of the operator can be met under different conditions. Benefited by the Lagrangian dual method, the resource allocation scheme is a distributed scheme, can be performed alone in each base station and has high convergence speed, so that a problem of how to design a scheme considering both system throughput and equal allocation of the user resource is solved effectively.
Description
Technical field
The invention belongs to the radio resource management techniques field in mobile communication, and in particular to a kind of in wireless communication system
Based on the resource allocation methods in the wireless dummy network of balance policy between multiple service providers, and the resource of user is divided
Join and connect with base station.
Background technology
Wireless network virtualization (Wireless NetworkVirtualization, WNV) passes through a physical network
It is abstracted into multiple virtual networks so that multiple operators or user's group can share the resource of Same Physical network, and can be in void
Intend meeting certain isolation between network.As infrastructure construction expense and the network operation expense of operator can be reduced
With, reduce the access threshold of operator, and be conducive to accelerating the research of wireless technology and deployment process, wireless network is virtualized
Have become as the focus of research.
Wireless network virtualization needs to realize multiple virtual networks share bottom physical resource, just includes nothing among these
Line resource (power, frequency spectrum etc.), is to realize, to the rationally shared of Radio Resource, needing suitable wireless resource allocation methods.Cause
This, one of research emphasis in radio resource allocation wireless network virtualization always.A kind of effective resource allocation techniques are logical
The radio resource allocation that crosses between adjustment service provider (Service Provider, SP), and then improve the handling capacity of system.
In the assignment procedure, it is also contemplated that user selects the problem of base station, this is a nondeterministic polynomial difficulty (Non-
Deterministic Polynomial hard, NP hard) problem.Existing two kinds of classical wireless resource allocation methods,
Radio resource allocation i.e. based on maximize handling capacity criterion and the radio resource allocation based on equitable proportion criterion.But this point
Formula formula has obvious defect：Resource can be assigned to the good user of channel condition, and the user of bad channel conditions would become hard to
To resource, therefore the fairness of this method of salary distribution is very poor.And definitely fair distribution obviously can seriously reduce system
Handling capacity, therefore should have a kind of scheme for balancing between throughput of system and user resources fairness in distribution.
Content of the invention
Goal of the invention：In order to overcome the deficiencies in the prior art, one kind is provided so that infrastructure provider is maximized,
The benefit of service provider is target, and in the case of the demand of guaranteeing QoS of customer, selects optimal user connection side
Case and Resource Allocation Formula.The present invention can pass through connection scheme and the resource allocation side of user based on a kind of strategy in a balanced way
Case carrys out price determination, while the price can affect connection scheme and the Resource Allocation Formula of user again, be related in the present invention determines
Valency function, demand function, contract of supply, operator can be selected according to the needs of oneself, it is ensured that under different situations
The different demands of operator can be met, meanwhile, having benefited from Lagrange duality method, Resource Allocation Formula is distributed side
Case, can be in each base station isolated operation, and fast convergence rate, efficiently solves how design system handling capacity and use
Scheme between the resource allocation fairness of family.
Technical scheme：For achieving the above object, the present invention is provided in a kind of wireless dummy network of combination balance policy
Resource allocation methods, including step in detail below：
Step 1)：The collection network information, initiation parameter：Service provider's number N, number of base stations M in collection network
And number of users K, Website Hosting is designated as { J0,J1...,Ji, wherein macro station J0Represent, small station { J1,J2,...,JMTable
Show；
Step 2)：In the resource allocation moment, user profile is gathered, by the channel estimation methods that commonly uses, obtain user's
Information, by these information, calculates the SINR of user：
WhereinIt is channel gain, comprising path loss, shade be weak, antenna gain, j represents that base station number, n and k divide
Not Biao Shi service provider numbering and Customs Assigned Number, each time execute resource allocation methods when,One can be regarded as often
Number, PjRepresent the transmission power of the base station j that user present position receives, σ2Represent the power of noise；
Step 3)：Determine unit price and the pay off function of user：When executing each time, need to select unit price and the user of user
Pay off function representing cost that user is consumed, in order to realize the balance between network performance and user fairness, user
Pay off function to have a continuously differentiable, monotonic increase, strict recessed property；On the other hand, the unit price of user is then a constant,
The unit price of each user is possible to identical, it is also possible to different, and the unit price of user is designated as { α1,α2...αK, wherein αkRepresent
The unit price of user k, the unit price of user and the pay off function of user are preset by operator, are configured i.e. when method is run
Can；
Step 4)：Determine the unit price of service provider and the pay off function of service provider, wireless dummy resource can be seen
It is commodity to do, and infrastructure provider provides wireless dummy resource, is considered the supplier of these commodity, and service is provided
Business pays certain cost and obtains wireless dummy resource, is considered consumer, will first confirm that before method operation
The pricing strategy of virtual resource, for different service providers, infrastructure provider takes different charge methods and list
Valency, the unit price of service provider is designated as { β1,β2...βI, βiRepresent the unit price of the service provider that numbering is i, service is provided
The pay off function of business is formulated by service provider and infrastructure provider joint consultation, is pre-entered in system, is being carried out
During resource allocation, different service providers selects corresponding pay off function to execute, and has obtained the unit price of service provider
After the pay off function of service provider, system-computed goes out service provider's price to be paid；
Step 5)：Determine object function：System determines different object functions according to different demands, by adjusting mesh
Scalar functions, the adjustment connection of user and the scheme of the distribution of resource, by step 3) and step 4), obtain user and service is provided
After the unit price of business and pay off function, the income of service provider is deducted equal to the income for obtaining from user and is carried to infrastructure
For the expenditure that business pays, { π is used1,...,πNRepresent, πnThe income that numbering is that n service provider obtains is represented, infrastructure are carried
The income for obtaining for business uses π equal to the expenditure paid to which by service provider0Represent；From economic angle, Ke Yixuan
Pareto optimality is selected as a kind of object function, also referred to as Pareto optimality (Pareto Optimality), Pareto efficiency
(Pareto efficiency), refers to a kind of perfect condition of resource allocation, it is assumed that intrinsic group and assignable money
Source, from a kind of distribution state to the change of another kind of state, on the premise of not making anyone circumstances degenerate so that at least
One people becomes more preferable, and Pareto-optimality is exactly can not possibly have the leeway of more Pareto improvements, in other words, handkerchief again
It is path and the method for reaching Pareto optimality that tired support is improved, and Pareto optimality is fair and efficiency " preferable kingdom ".
According to Pareto optimality theory, problem can be expressed as:
In formulaThe coefficient of connection and base station of expression user and base station is to the resource ratio of user's distribution, bar
Part C1 illustrates that each user at most can only connect to a base station, and condition C 2 illustrates that use connected with him is distributed in each base station
The resource at family is no more than the resource had by base station, and condition C 3 is illustrated if a user is connected to certain base station, then this
Individual base station must be this user resource allocation, and C4 explanation user connects the situation of base station, if user is connected to some
Base station then for value be 1, otherwise, value be 0；
Step 6)：According to problem 2) feature, by problem 2) decompose and be a problem 3) and problem 5) two parts, problem 3) be base
The income of Infrastructure provider, problem 5) be service provider income：First infrastructure offer is improved by resource allocation
The income of business, this some is expressed as：
Wherein n represents the numbering of service provider, βnRepresent the unit price of service provider, VnRepresent that the service that numbering is n is carried
For the resource quantity that business obtains, U () represents the pay off function of service provider, obtains problem 3) a subproblem：
This is the subproblem of infrastructure provider part, and above-mentioned formula (4) is meant that by user-association and resource
Distribution maximize infrastructure provider income, according to problem 4) feature, this some is expressed as：
Here ln (Rn,k) and CnTwo specific pays off function, additionally, problem 2) another subproblem be clothes
The income of business provider：
This is the subproblem of Service Provider part, and above-mentioned formula (5) is meant that by user-association and resource allocation
Maximize the income of service provider；
Step 7)：Solve problems 4)：In problem 4) inWithInterdepend, intercouple, it is difficult to direct solution, lead to
Cross problem 4) resolve into two subproblems and solved, if user-association scheme determines, i.e., all ofIt is known, then
Problem reform into regard toA subproblem, so assuming initially thatAll it has been determined that while the payment of service provider
Function and unit price (assuming the unit price for only having two kinds of service providers) also all determine, then problem is just to solve for
It is exactly the V of above-mentioned formulan,k, whereinRepresent the speed of user, WjRepresent the money had by the base station
Source number, may certify that problem 6) it is strict convex problem, according to convex optimum theory, using KKT (Karush-Kuhn-
Tucker) condition is obtained to solve
Wherein μjIt is a Lagrange coefficient, by μj=max { β1|κn,k|-β2Wj, 0 } obtain, wherein | κn,k| represent
The number of user, after obtaining resource allocation policy, can determine user-association strategy according to Resource Allocation Formula, by obtainedGeneration return problem 4) in obtain
Solve problems 7), obtain the connection scheme of user
Step 8)：After infrastructure provider part subproblem is solved, Service Provider part is next solved
Subproblem：According to Pareto optimality theory
With
Max Ω (α), Ω (α)=ΣnπnProblem 9)
Wherein Ω (α) represents the income sum of all service providers.
Problem 9) with problem 4) similar, by solve problem 4) method, by problem 9) be decomposed into user-association and resource
Two subproblems of distribution, solve resource allocation subproblem using method of Lagrange multipliers, obtain resource allocation by KKT condition
As a result, obtaining after Resource Allocation Formula generation again returns problem 9), obtain the association scheme of user；
Step 9)：Resource Allocation Formula and user-association scheme pass through step 8) determine after, determine that rational service is carried
For the price of business, concrete grammar is as follows：
Result according to Resource Allocation Formula above, it can be seen that if certain βnThan larger, infrastructure provider
Can be more willing to resource allocation to the partial service provider, if instead βnSmaller, infrastructure provider is then more willing to
Resource allocation to other service providers.So can be by adjusting βn, adjust infrastructure and provide in service offer
The ratio of resource allocation between business, can obtain the price of the service provider of optimum, the process of iteration by way of iteration
In need to arrange demand function and contract of supply, use Φ respectivelyD(t) and ΦSDemand function and confession during the t time iteration of (t) expression
Function is answered, infrastructure provider can arrange the two functions according to the actual needs；
Step 10)：Initialization β=βinitAnd t=0, βinitIt is the initial value of price β, iteration step length λ is initialized, can be by transporting
Battalion's business's setting, by step 4) after the price used is set to price β (t), operating procedure 9) method can obtain optimum
Resource Allocation Formula and user-association scheme, after obtaining resource scheme and user-association scheme, recalculate ΦD(t) and ΦS
T (), recycles formula (10) to calculate the Φ of the t time iterationD(t)-ΦS(t) and β (t+1)：
β (t+1)=β (t)+λ (ΦD(t)-ΦS(t)) problem 10)
Price is updated, until | ΦD(t)-ΦS(t) | ＜ ε, ε ＞ 0, ε are the positive numbers of a very little, can be set by operator,
Now price has been stablized, and the price is exactly required most rational service provider unit price；
Step 11)：Terminate：The service provider's unit price of the service provider for finally giving being set to needed for method
Unit price, carries out user's connection and the calculating of resource allocation.
Further, the step 4) in βiPreset by operator.
Beneficial effect：The present invention compared with prior art, while considering the receipts of infrastructure provider and service provider
Benefit, is finally reached the result of Pareto optimality in economics, by being user's connection and two sons of resource allocation by PROBLEM DECOMPOSITION
Problem, simplifies the solution of problem, maximizes global income；The resource allocation methods based on balance policy for proposing pass through true
After determining resource allocation and user's method of attachment, can dynamic go adjust service provider unit price come guarantee infrastructure provide
Business's charge is more reasonable, and is fed back in Resource Allocation Formula using this unit price；Meanwhile, the method is provided in the service of determination
Business unit price after, determine user connection and resource allocation method be distributed, can isolated operation on each base station,
And algorithm the convergence speed is fast, higher system effectiveness can be obtained with lower computation complexity；Have benefited from balance policy, carry
The method for going out effectively can calculate unit price, obtain rational Resource Allocation Formula and user's connection scheme, have benefited from each step
Customization, the method for proposition effectively can be carried out according to actual situation while service quality is ensured self-defined, can
To meet the demand of different operators uniqueness, operator can according to oneself need select different pays off function, supply letter
Number and demand function, are carried out to algorithm in conjunction with the demand of oneself self-defined.
Description of the drawings
Fig. 1 is the schematic flow sheet of the present invention.
Specific embodiment
Below in conjunction with the accompanying drawings and specific embodiment, the present invention is further elucidated with, it should be understood that these embodiments are merely to illustrate
The present invention rather than restriction the scope of the present invention, after the present invention has been read, those skilled in the art are to each of the present invention
The modification for planting the equivalent form of value all falls within the application claims limited range.
As shown in figure 1, the present invention provides the resource allocation methods in a kind of wireless dummy network of combination balance policy, bag
Include step in detail below：
Step 1)：The collection network information, initiation parameter：Service provider's number N, number of base stations M in collection network
And number of users K, Website Hosting is designated as { J0,J1...,Ji, wherein macro station J0Represent, small station { J1,J2,...,JMTable
Show；
Step 2)：In the resource allocation moment, user profile is gathered, by the channel estimation methods that commonly uses, obtain user's
Information, by these information, calculates the SINR of user：
WhereinIt is channel gain, comprising path loss, shade be weak, antenna gain, j represents that base station number, n and k divide
Not Biao Shi service provider numbering and Customs Assigned Number, each time execute resource allocation methods when,One can be regarded as often
Number, PjRepresent the transmission power of the base station j that user present position receives, σ2Represent the power of noise；
Step 3)：Determine unit price and the pay off function of user：When executing each time, need to select unit price and the user of user
Pay off function representing cost that user is consumed, in order to realize the balance between network performance and user fairness, user
Pay off function to have a continuously differentiable, monotonic increase, strict recessed property；On the other hand, the unit price of user is then a constant,
The unit price of each user is possible to identical, it is also possible to different, and the unit price of user is designated as { α1,α2...αK, wherein αkRepresent
The unit price of user k, the unit price of user and the pay off function of user are preset by operator, are configured i.e. when method is run
Can；
Step 4)：Determine the unit price of service provider and the pay off function of service provider, wireless dummy resource can be seen
It is commodity to do, and infrastructure provider provides wireless dummy resource, is considered the supplier of these commodity, and service is provided
Business pays certain cost and obtains wireless dummy resource, is considered consumer, will first confirm that before method operation
The pricing strategy of virtual resource, for different service providers, infrastructure provider takes different charge methods and list
Valency, the unit price of service provider is designated as { β1,β2...βI, βiRepresent the unit price of the service provider that numbering is i, βiBy runing
Business preset or by below the step of be calculated after set again, the pay off function of service provider is by servicing
Provider and infrastructure provider joint consultation are formulated, and are pre-entered in system, when resource allocation is carried out, different clothes
Business provider selects corresponding pay off function to execute, and has obtained the unit price of service provider and the payment letter of service provider
After number, system-computed goes out service provider's price to be paid；
Step 5)：Determine object function：System determines different object functions according to different demands, by adjusting mesh
Scalar functions, the adjustment connection of user and the scheme of the distribution of resource, by step 3) and step 4), obtain user and service is provided
After the unit price of business and pay off function, the income of service provider is deducted equal to the income for obtaining from user and is carried to infrastructure
For the expenditure that business pays, { π is used1,...,πNRepresent, πnThe income that numbering is that n service provider obtains is represented, infrastructure are carried
The income for obtaining for business uses π equal to the expenditure paid to which by service provider0Represent；From economic angle, Ke Yixuan
Pareto optimality is selected as a kind of object function, also referred to as Pareto optimality (Pareto Optimality), Pareto efficiency
(Pareto efficiency), refers to a kind of perfect condition of resource allocation, it is assumed that intrinsic group and assignable money
Source, from a kind of distribution state to the change of another kind of state, on the premise of not making anyone circumstances degenerate so that at least
One people becomes more preferable, and Pareto-optimality is exactly can not possibly have the leeway of more Pareto improvements, in other words, handkerchief again
It is path and the method for reaching Pareto optimality that tired support is improved, and Pareto optimality is fair and efficiency " preferable kingdom ", according to
Pareto optimality theory, problem can be expressed as:
In formulaThe coefficient of connection and base station of expression user and base station is to the resource ratio of user's distribution, bar
Part C1 illustrates that each user at most can only connect to a base station, and condition C 2 illustrates that use connected with him is distributed in each base station
The resource at family is no more than the resource had by base station, and condition C 3 is illustrated if a user is connected to certain base station, then this
Individual base station must be this user resource allocation, and C4 explanation user connects the situation of base station, if user is connected to some
Base station then for value be 1, otherwise, value be 0；
Step 6)：According to problem 2) feature, by problem 2) decompose and be a problem 3) and problem 5) two parts, problem 3) be base
The income of Infrastructure provider, problem 5) be service provider income：First infrastructure offer is improved by resource allocation
The income of business, this some is expressed as：
Wherein n represents the numbering of service provider, βnRepresent the unit price of service provider, VnRepresent that the service that numbering is n is carried
For the resource quantity that business obtains, U () represents the pay off function of service provider, obtains problem 3) a subproblem：
This is the subproblem of infrastructure provider part, and above-mentioned formula (4) is meant that by user-association and resource
Distribution maximize infrastructure provider income, according to problem 4) feature, this some is expressed as：
Here ln (Rn,k) and CnTwo specific pays off function, additionally, problem 2) another subproblem be clothes
The income of business provider：
This is the subproblem of Service Provider part, and above-mentioned formula (5) is meant that by user-association and resource allocation
Maximize the income of service provider；
Step 7)：Solve problems 4)：In problem 4) inWithInterdepend, intercouple, it is difficult to direct solution, lead to
Cross problem 4) resolve into two subproblems and solved, if user-association scheme determines, i.e., all ofIt is known, then
Problem reform into regard toA subproblem, so assuming initially thatAll it has been determined that while the payment of service provider
Function and unit price (assuming the unit price for only having two kinds of service providers) also all determine, then problem is just to solve for
It is exactly the V of above-mentioned formulan,k, whereinRepresent the speed of user, WjRepresent the money had by the base station
Source number, may certify that problem 6) it is strict convex problem, according to convex optimum theory, using KKT (Karush-Kuhn-
Tucker) condition is obtained to solve
Wherein μjIt is a Lagrange coefficient, by μj=max { β1|κn,k|-β2Wj, 0 } obtain, wherein | κn,k| represent
The number of user, after obtaining resource allocation policy, can determine user-association strategy according to Resource Allocation Formula, by obtainedGeneration return problem 4) in obtain
Solve problems 7), obtain the connection scheme of user
Step 8)：After infrastructure provider part subproblem is solved, Service Provider part is next solved
Subproblem：According to Pareto optimality theory
With
Max Ω (α), Ω (α)=ΣnπnProblem 9)
Wherein Ω (α) represents the income sum of all service providers.
Problem 9) with problem 4) similar, by solve problem 4) method, by problem 9) be decomposed into user-association and resource
Two subproblems of distribution, solve resource allocation subproblem using method of Lagrange multipliers, obtain resource allocation by KKT condition
As a result, obtaining after Resource Allocation Formula generation again returns problem 9), obtain the association scheme of user；
Step 9)：Resource Allocation Formula and user-association scheme pass through step 8) determine after, determine that rational service is carried
For the price of business, concrete grammar is as follows：
Result according to Resource Allocation Formula above, it can be seen that if certain βnThan larger, infrastructure provider
Can be more willing to resource allocation to the partial service provider, if instead βnSmaller, infrastructure provider is then more willing to
Resource allocation to other service providers.So can be by adjusting βn, adjust infrastructure and provide in service offer
The ratio of resource allocation between business, can obtain the price of the service provider of optimum, the process of iteration by way of iteration
In need to arrange demand function and contract of supply, use Φ respectivelyD(t) and ΦSDemand function and confession during the t time iteration of (t) expression
Function is answered, infrastructure provider can arrange the two functions according to the actual needs；
Step 10)：Initialization β=βinitAnd t=0, βinitIt is the initial value of price β, iteration step length λ is initialized, can be by transporting
Battalion's business's setting, by step 4) after the price used is set to price β (t), operating procedure 9) method can obtain optimum
Resource Allocation Formula and user-association scheme, after obtaining resource scheme and user-association scheme, recalculate ΦD(t) and ΦS
T (), recycles formula (10) to calculate the Φ of the t time iterationD(t)-ΦS(t) and β (t+1)：
β (t+1)=β (t)+λ (ΦD(t)-ΦS(t)) problem 10)
Price is updated, until | ΦD(t)-ΦS(t) | ＜ ε, ε ＞ 0, ε are the positive numbers of a very little, can be set by operator,
Now price has been stablized, and the price is exactly required most rational service provider unit price；
Step 11)：Terminate：The service provider's unit price of the service provider for finally giving being set to needed for method
Unit price, carries out user's connection and the calculating of resource allocation.
Claims (2)
1. resource allocation methods in a kind of wireless dummy network of combination balance policy, it is characterised in that：Including in detail below
Step：
Step 1)：The collection network information, initiation parameter：Service provider's number N, number of base stations M and use in collection network
Amount mesh K, Website Hosting is designated as { J0,J1...,Ji, wherein macro station J0Represent, small station { J1,J2,...,JMRepresent；
Step 2)：In the resource allocation moment, user profile is gathered, by the channel estimation methods that commonly uses, the information of user is obtained,
By these information, the SINR of user is calculated：
WhereinIt is channel gain, comprising path loss, shade be weak, antenna gain, j represents base station number, n and k table respectively
Show service provider's numbering and Customs Assigned Number, when executing resource allocation methods each time,A constant, P can be regarded asj
Represent the transmission power of the base station j that user present position receives, σ2Represent the power of noise；
Step 3)：Determine unit price and the pay off function of user：When executing each time, the unit price of selection user and propping up for user is needed
Pay function to represent cost that user is consumed, the unit price of user is designated as { α1,α2...αK, wherein αkRepresent the list of user k
Valency, the unit price of user and the pay off function of user are preset by operator, are configured when method is run；
Step 4)：Determine the unit price of service provider and the pay off function of service provider, true first before method operation
Recognize the pricing strategy of virtual resource, for different service providers, infrastructure provider take different charge methods and
Unit price, the unit price of service provider is designated as { β1,β2...βI, βiRepresent the unit price of the service provider that numbering is i, service is carried
Pay off function for business is formulated by service provider and infrastructure provider joint consultation, is pre-entered in system, is being entered
During row resource allocation, different service providers selects corresponding pay off function to execute, and has obtained the list of service provider
After the pay off function of valency and service provider, system-computed goes out service provider's price to be paid；
Step 5)：Determine object function：System determines different object functions according to different demands, by adjusting target letter
Number, the adjustment connection of the user and scheme of the distribution of resource, by step 3) and step 4), obtain user and service provider
After unit price and pay off function, the income of service provider is equal to the income for obtaining from user and deducts to infrastructure provider
The expenditure of payment, uses { π1,...,πNRepresent, πnRepresent the income that numbering is that n service provider obtains, infrastructure provider
The income for obtaining uses π equal to the expenditure paid to which by service provider0Represent；
According to Pareto optimality theory, problem can be expressed as:
In formulaThe coefficient of connection and base station of expression user and base station is to the resource ratio of user's distribution, condition C 1
Illustrate that each user at most can only connect to a base station, condition C 2 illustrates that user's connected with him distributed in each base station
Resource is no more than the resource had by base station, and condition C 3 is illustrated if a user is connected to certain base station, then this base
It must be this user resource allocation to stand, and C4 explanation user connects the situation of base station, if user is connected to some base station
Then for value be 1, otherwise, value be 0；
Step 6)：According to problem 2) feature, by problem 2) decompose and be a problem 3) and problem 5) two parts, problem 3) be that basis sets
Apply the income of provider, problem 5) be service provider income：First infrastructure provider is improved by resource allocation
Income, this some is expressed as：
Wherein n represents the numbering of service provider, βnRepresent the unit price of service provider, VnRepresent the service provider that numbering is n
The resource quantity for obtaining, U () represent service provider pay off function, obtain problem 3) a subproblem：
This is the subproblem of infrastructure provider part, and above-mentioned formula (4) is meant that by user-association and resource allocation
Maximize infrastructure provider income, according to problem 4) feature, this some is expressed as：
Here ln (Rn,k) and CnTwo specific pays off function, additionally, problem 2) another subproblem be that service is carried
Income for business：
This is the subproblem of Service Provider part, and above-mentioned formula (5) is meant that by user-association and resource allocation maximum
Change the income of service provider；
Step 7)：Solve problems 4)：By by problem 4) resolve into two subproblems and solved, it is assumed thatAll it has been determined that
While the pay off function of service provider and unit price also all determine, then problem is just to solve for
It is exactly the V of above-mentioned formulan,k, whereinRepresent the speed of user, WjRepresent the number of resources had by the base station
Mesh, may certify that problem 6) it is strict convex problem, according to convex optimum theory, solved using KKT condition and obtain
Wherein μjIt is a Lagrange coefficient, by μj=max { β1|κn,k|-β2Wj, 0 } obtain, wherein | κn,k| represent user
Number, after obtaining resource allocation policy, user-association strategy can be determined according to Resource Allocation Formula, by obtained
Generation return problem 4) in obtain
Solve problems 7), obtain the connection scheme of user
Step 8)：After infrastructure provider part subproblem is solved, the son for next solving Service Provider part is asked
Topic：According to Pareto optimality theory
With
Wherein Ω (α) represents the income sum of all service providers.
By problem 9) user-association and two subproblems of resource allocation are decomposed into, resource allocation is solved using method of Lagrange multipliers
Subproblem, obtains the result of resource allocation by KKT condition, obtains after Resource Allocation Formula generation again and returns problem 9), obtain
The association scheme of user；
Step 9)：Resource Allocation Formula and user-association scheme pass through step 8) determine after, determine rational service provider
Price, concrete grammar is as follows：
By adjusting βn, the ratio that infrastructure provide resource allocation among service providers is adjusted, iteration can be passed through
Mode needs during obtaining the price of the service provider of optimum, iteration to arrange demand function and contract of supply, uses respectively
ΦD(t) and ΦST the demand function and contract of supply during the t time iteration of () expression, infrastructure provider can be according to reality
Need to arrange the two functions；
Step 10)：Initialization β=βinitAnd t=0, βinitIt is the initial value of price β, iteration step length λ is initialized, can be by operator
Set, by step 4) after the price used is set to price β (t), operating procedure 9) method can obtain the resource of optimum
Allocative decision and user-association scheme, after obtaining resource scheme and user-association scheme, recalculate ΦD(t) and ΦS(t),
Formula (10) is recycled to calculate the Φ of the t time iterationD(t)-ΦS(t) and β (t+1)：
β (t+1)=β (t)+λ (ΦD(t)-ΦS(t)) problem 10)
Price is updated, until | ΦD(t)-ΦS(t) | ＜ ε, ε ＞ 0, ε are the positive numbers of a very little, can be set by operator, now
Price has been stablized, and the price is exactly required most rational service provider unit price；
Step 11)：Terminate：The list of the service provider unit price of the service provider for finally giving being set to needed for method
Valency, carries out user's connection and the calculating of resource allocation.
2. resource allocation methods in a kind of wireless dummy network of combination balance policy according to claim 1, which is special
Levy and be：The step 4) in βiPreset by operator.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610927943.8A CN106455078B (en) | 2016-10-31 | 2016-10-31 | A kind of resource allocation methods in the wireless dummy network of combination balance policy |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610927943.8A CN106455078B (en) | 2016-10-31 | 2016-10-31 | A kind of resource allocation methods in the wireless dummy network of combination balance policy |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106455078A true CN106455078A (en) | 2017-02-22 |
| CN106455078B CN106455078B (en) | 2019-07-12 |
Family
ID=58179014
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610927943.8A Active CN106455078B (en) | 2016-10-31 | 2016-10-31 | A kind of resource allocation methods in the wireless dummy network of combination balance policy |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106455078B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107018528A (en) * | 2017-04-23 | 2017-08-04 | 西安电子科技大学 | Wireless network virtual method based on equivalent capacity in a kind of single cell LTE A systems |
| CN107172606A (en) * | 2017-06-29 | 2017-09-15 | 南京邮电大学 | A kind of distribution method of green energy resource joint spectrum shared in the wireless network |
| CN107172710A (en) * | 2017-04-23 | 2017-09-15 | 西安电子科技大学 | A kind of resource allocation and service access control method based on virtual subnet |
| CN107708214A (en) * | 2017-09-30 | 2018-02-16 | 重庆邮电大学 | Network utility based on Liapunov maximizes virtual resource allocation method |
| CN108365991A (en) * | 2018-02-26 | 2018-08-03 | 重庆邮电大学 | Downlink power resources distribution method towards wireless network virtualized environment |
| CN109272405A (en) * | 2018-09-30 | 2019-01-25 | 大唐碳资产有限公司 | Carbon transaction in assets method and system |
| CN111356141A (en) * | 2020-03-06 | 2020-06-30 | 深圳清华大学研究院 | Distributed resource allocation method for spectrum sharing among operators based on network slices |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040267897A1 (en) * | 2003-06-24 | 2004-12-30 | Sychron Inc. | Distributed System Providing Scalable Methodology for Real-Time Control of Server Pools and Data Centers |
| US20110130150A1 (en) * | 2009-12-01 | 2011-06-02 | Nokia Corporation | Methods and apparatus for service-aware energy saving and load balancing operations |
| CN102333362A (en) * | 2011-10-26 | 2012-01-25 | 北京交通大学 | Distributed-price-algorithm-based cognitive radio power control method |
| CN102917362A (en) * | 2012-10-12 | 2013-02-06 | 南京邮电大学 | Multi-domain resource allocation method based on collaborative optimization in ubiquitous wireless network |
| US20130114569A1 (en) * | 2004-08-12 | 2013-05-09 | Intellectual Ventures Holding 81 Llc | Power control in a wireless network |
| CN103313251A (en) * | 2013-06-04 | 2013-09-18 | 北京邮电大学 | Multi-cell cooperative resource allocation method based on potential game theory |
| CN103781118A (en) * | 2014-01-14 | 2014-05-07 | 西安电子科技大学 | Heterogeneous wireless network access control and resource distribution joint method based on multiple services |
| CN104660394A (en) * | 2015-03-23 | 2015-05-27 | 中国矿业大学 | Spectrum resource allocation method based on utility function and price mechanism |
| CN105959234A (en) * | 2016-06-30 | 2016-09-21 | 南京理工大学 | Load balance resource optimization method under safety perceptive cloud radio access network |
-
2016
- 2016-10-31 CN CN201610927943.8A patent/CN106455078B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20040267897A1 (en) * | 2003-06-24 | 2004-12-30 | Sychron Inc. | Distributed System Providing Scalable Methodology for Real-Time Control of Server Pools and Data Centers |
| US20130114569A1 (en) * | 2004-08-12 | 2013-05-09 | Intellectual Ventures Holding 81 Llc | Power control in a wireless network |
| US20110130150A1 (en) * | 2009-12-01 | 2011-06-02 | Nokia Corporation | Methods and apparatus for service-aware energy saving and load balancing operations |
| CN102333362A (en) * | 2011-10-26 | 2012-01-25 | 北京交通大学 | Distributed-price-algorithm-based cognitive radio power control method |
| CN102917362A (en) * | 2012-10-12 | 2013-02-06 | 南京邮电大学 | Multi-domain resource allocation method based on collaborative optimization in ubiquitous wireless network |
| CN103313251A (en) * | 2013-06-04 | 2013-09-18 | 北京邮电大学 | Multi-cell cooperative resource allocation method based on potential game theory |
| CN103781118A (en) * | 2014-01-14 | 2014-05-07 | 西安电子科技大学 | Heterogeneous wireless network access control and resource distribution joint method based on multiple services |
| CN104660394A (en) * | 2015-03-23 | 2015-05-27 | 中国矿业大学 | Spectrum resource allocation method based on utility function and price mechanism |
| CN105959234A (en) * | 2016-06-30 | 2016-09-21 | 南京理工大学 | Load balance resource optimization method under safety perceptive cloud radio access network |
Non-Patent Citations (2)
| Title |
|---|
| 方彬: ""异构无线网络中用户分配和资源分配研究"", 《中国优秀博士学位论文全文数据库信息科技辑》 * |
| 曾令康: ""基于博弈论的无线资源分配研究"", 《中国优秀博士学位论文全文数据库信息科技辑》 * |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107018528A (en) * | 2017-04-23 | 2017-08-04 | 西安电子科技大学 | Wireless network virtual method based on equivalent capacity in a kind of single cell LTE A systems |
| CN107172710A (en) * | 2017-04-23 | 2017-09-15 | 西安电子科技大学 | A kind of resource allocation and service access control method based on virtual subnet |
| CN107018528B (en) * | 2017-04-23 | 2020-04-03 | 西安电子科技大学 | Equivalent capacity-based wireless network virtualization method in single-cell LTE-A system |
| CN107172606A (en) * | 2017-06-29 | 2017-09-15 | 南京邮电大学 | A kind of distribution method of green energy resource joint spectrum shared in the wireless network |
| CN107172606B (en) * | 2017-06-29 | 2021-02-23 | 南京邮电大学 | Method for distributing sharable green energy combined spectrum in wireless network |
| CN107708214A (en) * | 2017-09-30 | 2018-02-16 | 重庆邮电大学 | Network utility based on Liapunov maximizes virtual resource allocation method |
| CN107708214B (en) * | 2017-09-30 | 2021-02-02 | 重庆邮电大学 | Network utility maximization virtual resource allocation method based on Lyapunov |
| CN108365991A (en) * | 2018-02-26 | 2018-08-03 | 重庆邮电大学 | Downlink power resources distribution method towards wireless network virtualized environment |
| CN108365991B (en) * | 2018-02-26 | 2021-09-07 | 重庆邮电大学 | Downlink power resource allocation method facing wireless network virtualization environment |
| CN109272405A (en) * | 2018-09-30 | 2019-01-25 | 大唐碳资产有限公司 | Carbon transaction in assets method and system |
| CN111356141A (en) * | 2020-03-06 | 2020-06-30 | 深圳清华大学研究院 | Distributed resource allocation method for spectrum sharing among operators based on network slices |
| CN111356141B (en) * | 2020-03-06 | 2022-08-30 | 深圳清华大学研究院 | Distributed resource allocation method for inter-operator spectrum sharing based on network slice |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106455078B (en) | 2019-07-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106455078A (en) | Equilibrium strategy-combined wireless virtual network resource allocation method | |
| Yi et al. | Joint resource allocation for device-to-device communication assisted fog computing | |
| Du et al. | Contract design for traffic offloading and resource allocation in heterogeneous ultra-dense networks | |
| Bahrami et al. | Data center demand response in deregulated electricity markets | |
| Liu et al. | Minimization of offloading delay for two-tier UAV with mobile edge computing | |
| Li et al. | Efficient resource allocation for optimizing objectives of cloud users, IaaS provider and SaaS provider in cloud environment | |
| Gu et al. | Energy-efficient computation offloading for vehicular edge computing networks | |
| CN106954234A (en) | User's connection and virtual resource allocation method in a kind of super-intensive heterogeneous network | |
| CN108990067B (en) | Energy efficiency control method applied to ultra-dense heterogeneous network | |
| CN111405587B (en) | Virtual wireless network resource allocation method based on channel pricing | |
| Zhang et al. | A double auction mechanism for virtual resource allocation in SDN-based cellular network | |
| Cao et al. | An iterative auction mechanism for data trading | |
| Sharghivand et al. | QoS-aware matching of edge computing services to internet of things | |
| Lim et al. | Cooperation-based dynamic spectrum leasing via multi-winner auction of multiple bands | |
| Liu et al. | On spectrum allocation in cognitive radio networks: a double auction-based methodology | |
| Zhang et al. | Virtualization of 5G cellular networks: A combinatorial double auction approach | |
| Kim et al. | Profitable and energy-efficient resource optimization for heterogeneous cloud-based radio access networks | |
| CN117422138A (en) | Hybrid game algorithm for sharing energy storage with participation of multiple micro-grids | |
| Li et al. | Nonlinear online incentive mechanism design in edge computing systems with energy budget | |
| Kim | A new triple bargaining game-based energy management scheme for hierarchical smart grids | |
| US10182433B2 (en) | System and method for overlapping rate region zoning | |
| CN106973030A (en) | A kind of cloud artificial resource dispatching method based on SLA | |
| Liu et al. | Stackelberg game‐based task offloading in vehicular edge computing networks | |
| Le et al. | On a new incentive and market based framework for multi-tier shared spectrum access systems | |
| Kebedew et al. | QoE-Aware Cost-Minimizing Capacity Renting for Satellite-as-a-Service enabled Multiple-Beam SatCom Systems |
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 | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20210326 Address after: 201306 building C, No. 888, Huanhu West 2nd Road, Lingang New Area, Pudong New Area, Shanghai Patentee after: Shanghai Hanxin Industrial Development Partnership (L.P.) Address before: No.6, Dongda Road, Taishan new village, Pukou District, Nanjing City, Jiangsu Province, 210096 Patentee before: SOUTHEAST University |
|
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230920 Address after: 201615 room 301-6, building 6, no.1158, Jiuting Central Road, Jiuting Town, Songjiang District, Shanghai Patentee after: White box (Shanghai) Microelectronics Technology Co.,Ltd. Address before: 201306 building C, No. 888, Huanhu West 2nd Road, Lingang New Area, Pudong New Area, Shanghai Patentee before: Shanghai Hanxin Industrial Development Partnership (L.P.) |