CN106231601A - There is automatic power and obtain the Cell-Radio Network resource allocation methods of base station - Google Patents

Abstract

The invention discloses the Cell-Radio Network resource allocation methods with automatic power acquisition base station, including step: set two base stations as BS₁And BS₂, in two base station ranges, have K user, respectively base station BS₁And BS₂Generate base station selected collection β₁={ η₁,η₂,……,η_KAnd β₂={ 1 η₁,1‑η₂,……,1‑η_K}；To corresponding BS₁And BS₂Channel gain to k user carries out size and compares, if G_1,k>G_2,k, then η_k=1, otherwise η_k=0 choice set β producing all users₁And β₂；Determine user choice set β₁And β₂Select for final；Repeat step S3, until determining user choice set β₁And β₂；By the method for the Stackelberg game of coupling broad sense, find the energy and the frequency spectrum distribution of optimum.Compared with prior art, the cellular network feature that the present invention is directed to have automatic energy acquisition base station carries out resource distribution and the network optimization, uses the energy of cellular network the most efficiently, optimizes the experience of user.

Description

There is automatic power and obtain the Cell-Radio Network resource allocation methods of base station

Technical field

The present invention relates to radiocommunication cellular network optimization and resource management techniques, particularly relate to that there is automatic power and obtain The Cell-Radio Network resource allocation methods of base station.

Background technology

In the place with abundant green regenerative energy sources resource (such as solar energy and wind energy), there is automatic power and obtain Base station the most step by step, dispose more and more.Such as, at Tibet, China, solar energy base station group maximum in the world by China Mobile sets up in Tibet.Divide accordingly, it would be desirable to carry out resource for the cellular network feature with automatic energy acquisition base station Join and the network optimization, use the energy of cellular network the most efficiently, and optimize the experience of user.

Paper " Autonomous Energy Harvesting Base Stations with Minimum Storage Requirements " describe existing resource and energy allocative decision, it is for single base station system, proposes a kind of resource and energy The allocative decision in source, it is therefore an objective to go to maximize utility function and the base station income of the user of association.

But, above-mentioned paper and existing technology only carry out resource distribution in the case of a base station, do not account for phase The situation of the resource distribution in the case of the edge customer of adjacent base station.And for adjacent base station, between adjacent base station, have signal Overlapping covered, thus there is edge customer, and the distribution which base station edge customer selects carry out resource is uncertain, And how edge customer selects base station will affect the utility function of user and the base station income of association, so, only with a base It is inappropriate that station carries out the situation of resource distribution.

Summary of the invention

For overcoming the deficiencies in the prior art, the present invention proposes have automatic power and obtains the Cell-Radio Network of base station Resource allocation methods.

The technical scheme is that and be achieved in that:

There is automatic power and obtain the Cell-Radio Network resource allocation methods of base station, including step

S1: set two base stations as BS₁And BS₂, in two base station ranges, have K user, respectively base station BS₁And BS₂ Generate base station selected collection β₁={ η₁,η₂,......,η_KAnd β₂={ 1-η₁,1-η₂,......,1-η_K, wherein η_kIt is only 1 or 0, Work as η_kWhen=1, represent that k user selects BS₁, work as η_kWhen=0, represent that k user selects BS₂；

S2: to corresponding BS₁And BS₂Channel gain to k user is G_1,kAnd G_2,kCarry out size to compare, if G_1,k>G_2,k, So η_k=1, otherwise η_k=0 choice set β producing all users₁And β₂；

S3: determine user choice set β₁And β₂Select for final:

Calculate BS₁And BS₂User's number F=| β₁| and S=| β₂|, if F=S or F=(K-1)/2 or S=(K- 1)/2, user choice set β the most now₁And β₂Select for final；, if F > S, finds out choice set β₁Middle η_kThe institute of=1 is useful Family, calculates η_kEach user first base station of=1 and the channel gain ratio of the second base stationFind minimum thatValue, records corresponding k value, if G_2,kValue more than minimum communicating requirement value, then make η_k=0 updates choice set β₁And β₂, If G_2,kValue less than minimum communicating requirement value, user choice set β the most now₁And β₂Select for final；If F < S, find out choosing Select collection β₁Middle η_kAll users of=0, calculate η_kEach user first base station of=0 and the channel gain ratio of the second base stationFind maximum thatValue, records corresponding k value, if G_1,kValue more than minimum communicating requirement value σ, makes η_k=1, update choice set β₁And β₂If, G_1,kValue less than minimum communicating requirement value, user choice set β the most now₁And β₂ Select for final；

S4: repeat step S3, until determining user choice set β₁And β₂；

S5: by the method for the Stackelberg game of coupling broad sense, find the energy and the frequency spectrum distribution of optimum.

Further, step S3 is found out minimum or maximumThe method of value is ranking method.

Further, step S5 farther includes step:

S51: define the total revenue function Ω of two base stations, utility function u of each user_k；

S52: remove to find the Nash Equilibrium point of Stackelberg game by the method for change inequality；

S53: go to solve resource and the bandwidth optimal solution distributing to each user by the method for Lagrange multiplierOrObtain BS₁And BS₂Each self-corresponding best priceWith

The beneficial effects of the present invention is, compared with prior art, the present invention is directed to that there is automatic energy and obtain base station Cellular network feature carries out resource distribution and the network optimization, uses the energy of cellular network the most efficiently, optimizes user's Experience.

Accompanying drawing explanation

Fig. 1 is the Cell-Radio Network resource allocation methods flow chart that the present invention has automatic power acquisition base station.

Detailed description of the invention

Below in conjunction with the accompanying drawing in the embodiment of the present invention, the technical scheme in the embodiment of the present invention is carried out clear, complete Describe, it is clear that described embodiment is only a part of embodiment of the present invention rather than whole embodiments wholely.Based on Embodiment in the present invention, it is every other that those of ordinary skill in the art are obtained under not making creative work premise Embodiment, broadly falls into the scope of protection of the invention.

The present invention proposes a kind of Cell-Radio Network resource allocation methods with automatic power acquisition base station, for The resource distribution of two neighbor cells provides the Resource Allocation Formula of the Stackelberg game of a kind of broad sense taking into account justice. For providing more preferable communication service to all users in two adjacent cells, base station is which honeycomb all users select carry Yes-no decision, thus improve the effectiveness of calculating.

In two adjacent cells, each user has two kinds of selections, goes to add honeycomb 1 or honeycomb 2, then optimum The energy and frequency spectrum distribution can by the method for poor search all honeycombs of user select may in find.But, the method for exhaustion Algorithm complex be 2ⁿ, wherein n represents number of users, and when user is a lot, the algorithm of the method for exhaustion is the longest.

Referring to Fig. 1, the present invention has automatic power and obtains the Cell-Radio Network resource allocation methods of base station, bag Include step

S1: set two base stations as BS₁And BS₂, in two base station ranges, have K user, respectively base station BS₁And BS₂ Generate base station selected collection β₁={ η₁,η₂,......,η_KAnd β₂={ 1-η₁,1-η₂,......,1-η_K, wherein η_kIt is only 1 or 0, Work as η_kWhen=1, represent that k user selects BS₁, work as η_kWhen=0, represent that k user selects BS₂；

S2: to corresponding BS₁And BS₂Channel gain to k user is G_1,kAnd G_2,kCarry out size to compare, if G_1,k>G_2,k, So η_k=1, otherwise η_k=0 choice set β producing all users₁And β₂；

S3: calculate BS₁And BS₂User's number F=| β₁| and S=| β₂|, if F=S or F=(K-1)/2 or S= (K-1)/2, user choice set β the most now₁And β₂Select for final；, if F > S, finds out choice set β₁Middle η_k=1 own User, calculates η_kEach user first base station of=1 and the channel gain ratio of the second base stationFind minimum that IndividualValue, records corresponding k value, if G₂,_kValue more than minimum communicating requirement value, then make η_k=0 updates choice set β₁With β₂If, G_2,kValue less than minimum communicating requirement value, user choice set β the most now₁And β₂Select for final；If F < S, find out Choice set β₁Middle η_kAll users of=0, calculate η_kEach user first base station of=0 and the channel gain ratio of the second base stationFind maximum thatValue, records corresponding k value, if G₁,_kValue more than minimum communicating requirement value σ, makes η_k=1, update choice set β₁And β₂If, G_1,kValue less than minimum communicating requirement value, user choice set β the most now₁And β₂ Select for final；Wherein, minimum or maximum are found outThe method of value is ranking method, it is also possible to additive method；

S4: repeat step S3, until determining user choice set β₁And β₂；

S5: by the method for the Stackelberg game of coupling broad sense, find the energy and the frequency spectrum distribution of optimum.

If the total revenue of two base stations is Ω, utility function u of each user_k, it is therefore an objective to maximize the user's of association Utility function and the total revenue of two base stations, when user selects the situation adding honeycomb 1 or honeycomb 2 to determine, solve Stackelberg game needs to find Nash Equilibrium point, and we first use the method for change inequality, then use Lagrange multiplier Method, go to solve resource and the bandwidth optimal solution distributing to each user OrWith obtain BS₁And BS₂ Each self-corresponding best priceWithJust can find the utility function of the user of optimum and the total of two base stations Income.

Resource distribution be exactly base station be BS₁, BS₂During with K user, the system of two base stations is divided into time frame in time, And each time frame duration T, BS₁, BS₂At R time frame, use respectively and collect ENERGY E at R-1 time frame₁And E₂, and be assigned to Bandwidth W₁And W₂Carry out resource distribution.

In the step S5 method by the Stackelberg game of coupling broad sense, find the energy and the frequency spectrum distribution of optimum Farther include step:

S51: define the total revenue function Ω of two base stations, utility function u of each user_k；

S52: remove to find the Nash Equilibrium point of Stackelberg game by the method for change inequality；

S53: go to solve resource and the bandwidth optimal solution distributing to each user by the method for Lagrange multiplier OrWith obtain BS₁And BS₂Each self-corresponding best priceWith

According to the formula principle that comes and go, broad sense Nash Equilibrium problem can be described solved by the coupling formula problem that comes and go Certainly, broad sense Nash Equilibrium has a lot of solution, even unlimited solves more, but be not each solution be the solution of change inequality, and change not The solution of equation is change equilibrium, the most most likely Nash Equilibrium point of Stackelberg game method.

By to each user utility function u_kCarry out seeking hessian matrix, draw u_kThere is negative eigenvalue, it may be determined that u^kRight In variableOrThe most recessed function, so that it is determined that change inequality change equilibrium be exist and only One, it is the Nash Equilibrium point of Stackelberg game method.

The above is the preferred embodiment of the present invention, it is noted that for those skilled in the art For, under the premise without departing from the principles of the invention, it is also possible to make some improvements and modifications, these improvements and modifications are also considered as Protection scope of the present invention.

Claims (3)

1. there is automatic power and obtain the Cell-Radio Network resource allocation methods of base station, it is characterised in that include step

S1: set two base stations as BS₁And BS₂, in two base station ranges, have K user, respectively base station BS₁And BS₂Generate Base station selected collection β₁={ η₁,η₂,......,η_KAnd β₂={ 1-η₁,1-η₂,......,1-η_K, wherein η_kIt is only 1 or 0, works as η_k When=1, represent that k user selects BS₁, work as η_kWhen=0, represent that k user selects BS₂；

S2: to corresponding BS₁And BS₂Channel gain to k user is G_1,kAnd G_2,kCarry out size to compare, if G_1,k>G_2,k, then η_k=1, otherwise η_k=0 choice set β producing all users₁And β₂；

S3: calculate BS₁And BS₂User's number F=| β₁| and S=| β₂|, if F=S or F=(K-1)/2 or S=(K-1)/ 2, user choice set β the most now₁And β₂Select for final；If F > S, find out choice set β₁Middle η_kAll users of=1, meter Calculate η_kEach user first base station of=1 and the channel gain ratio of the second base stationFind minimum that Value, records corresponding k value, if G_2,kValue more than minimum communicating requirement value, then make η_k=0 updates choice set β₁And β₂If, G_2,kValue less than minimum communicating requirement value, user choice set β the most now₁And β₂Select for final；If F < S, find out selection Collection β₁Middle η_kAll users of=0, calculate η_kEach user first base station of=0 and the channel gain ratio of the second base stationFind maximum thatValue, records corresponding k value, if G_1,kValue more than minimum communicating requirement value σ, makes η_k=1, update choice set β₁And β₂If, G_1,kValue less than minimum communicating requirement value, user choice set β the most now₁And β₂ Select for final；

S4: repeat step S3, until determining user choice set β₁And β₂；

S5: by the method for the Stackelberg game of coupling broad sense, find the energy and the frequency spectrum distribution of optimum.

There is automatic power the most as claimed in claim 1 and obtain the Cell-Radio Network resource allocation methods of base station, its It is characterised by, step S3 is found out minimum or maximumThe method of value is ranking method.

There is automatic power the most as claimed in claim 1 and obtain the Cell-Radio Network resource allocation methods of base station, its Being characterised by, step S5 farther includes step:

S51: define the total revenue function Ω of two base stations, utility function u of each user_k；

S52: remove to find the Nash Equilibrium point of Stackelberg game by the method for change inequality；

S53: go to solve resource and the bandwidth optimal solution distributing to each user by the method for Lagrange multiplierOrObtain BS₁And BS₂Each self-corresponding best priceWith