CN103327540A - Energy-saving and anti-interference speed cracking method in cognitive heterogeneous network - Google Patents

Abstract

The invention provides an energy-saving and anti-interference speed cracking method in a cognitive heterogeneous network, which utilizes equivalent deformation of an energy efficiency equation and a cooperative game Nash axiom to carry out iteration on a transmission speed of each sub-network to obtain the optimal speed with high energy efficiency and small interference. A plurality of the sub networks are used for carrying out parallel transmission and parts of carriers of a base station do not need to be closed or blocked so that the base station can work normally. According to the method disclosed by the invention, the normal work of the base station is not changed and the quality of user experiences is guaranteed; not only can small interference be realized, namely the spectrum efficiency is high, but also energy-saving effects are realized, and the condition that iteration and convergence can be carried out in limited times can be strictly ensured.

Description

Energy-conservation jamproof speed splitting method in a kind of cognitive heterogeneous network

Technical field

The present invention relates to wireless communication technology field, relate in particular to energy-conservation jamproof speed splitting method in a kind of cognitive heterogeneous network.Particularly, the present invention relates to utilize game theory to carry out the method for speed division.

Background technology

Wireless communication technology is maked rapid progress, and various service is provided, and these services have brought increasing facility to people.Yet when broadband new business constantly produced, frequency spectrum resource became the key factor of its development of restriction.In the world wide, telecom operators all face a great problem: the shortage of frequency spectrum resource when accelerating to dispose the 4GLTE network.According to authority's prediction, will reach 1035～1455MHz to the year two thousand twenty 4G spectral gaps.Therefore improving the availability of frequency spectrum becomes one of solution route effectively.The generation of cognitive radio technology is for the feasible method that provides of the availability of frequency spectrum is provided.In frequency spectrum resource epitonic today, obtain and science distributes frequency spectrum challenging the wisdom of operator constantly, and determining the LTE development of operator can win the best opportunity and to march globalization smoothly commercial.

In addition, following terminal is inevitable more intelligent, and supports multimode, multifrequency, possesses perception.Main flow cell phone manufacturer wishes that their mobile phone can sell to the whole world, and the LTE chip must compatible FDD/TDD/WCDMA/EVDO, will support tens frequency ranges simultaneously.The variation that terminal inserts makes that (Concurrent Multipath Transfer CMT) becomes possibility to the multipath parallel transmission.And the appearance of HD video, the contour resource consumption business of 3D TV and in vogue cause the resource of single-pathway more and more to be difficult to satisfy the growing demand of user, this makes that the multipath parallel transmission is imperative.The focus that present this field has become scholars to pay close attention to and study.

Simultaneously, mobile communications network is a dynamic network that moves in real time, and along with the development of future network, little base station, femto base station, indoor covering, relay station and Home eNodeB etc. bring huge challenge for the related work of LTE-A.The coexistence of wireless access technologys such as it and WiMAX, mobile 2G/3G network, WLAN (wireless local area network).Therefore can produce a large amount of cell edge region, be subjected to the interference of adjacent base station easily the user of cell edge region, presence of intercell interference becomes the key factor of restricted cell marginal user performance.Thus, the coexistence of various heterogeneous networks needs interference management platform and functional module efficiently to solve the compromise problem that increasingly sophisticated network energy efficiency and spectrum are imitated.And game theory is widely used in wireless network research at present as the important method that the total system state that is produced by non-cooperative game between the rival is discussed.

In order to solve above-mentioned energy consumption and spectrum effect problem, existing technology provides multiple scheme.Patent application document " a kind of dynamic cell dormancy method towards green energy conservation " (publication number CN102917446A as Beijing University of Post ﹠ Telecommunication, application number 201210376338.8, applying date 2012.09.29) disclose a kind of according to number of users, customer location and state transition probability in each residential quarter of current period, for next selects a base station to enter the method for dormancy period.This method can realize reducing system capacity consumption, but can improve user's the percent of call lost like this, is cost to sacrifice the user's communications reliability, severe exacerbation user's business experience.Also just like patent application document " multi-access network power-economizing method " (the publication number CN102595580A of Xian Electronics Science and Technology University, application number 201210099827.3, applying date 2012.04.07) a kind of method that improves multi-access network energy service efficiency by concurrent transmission has been proposed.This method can make system energy efficiency reach maximization, yet the deficiency that exists is not consider the effect disturbed.Therefore, how in heterogeneous network, to disturb the purpose that suppresses and reach green energy conservation also to need to be resolved hurrily.

Summary of the invention

Main purpose of the present invention is to design a kind of energy-conservation anti-interference method based on the speed division.This method is under the prerequisite that satisfies the user communication quality demand, information theory view from celestial farming, derive each network through simple operation and imitate the best speed bearing point of existence at efficiency and spectrum, namely make and disturb little (namely the spectrum effect is high), and the big best concurrent transmission rate of efficiency.

In order to realize above-mentioned technical problem, the present invention includes following steps:

(1) the information search module of speed splitter is calculated the lower limit of each network element according to the resource state information of collecting each network, and initiation parameter also is each network element initial option speed carrying, namely $\frac{p_{\mathrm{cst}}}{{\mathrm{\&xi;}}_i}\&CenterDot;\frac{{\mathrm{<figure-callout\; id="1"\; label="B\; i"\; filenames="HDA00003532074900021.png"\; state="\{\{state\}\}">B</figure-callout>}}_i}{1+v}<R_i\&le;R_i^{\max },$ v＞1；

(2) calculate the suffered interference power ξ of network element i _iWith fixing power consumption p _CstDifference

Namely ${\mathrm{\&omega;}}_i^{\left(t\right)}={\mathrm{\&xi;}}_i^{\left(t\right)}-p_{\mathrm{cst}};$

(3) according to described interference power ξ _i, interference power and the fixing difference of power consumption

System bandwidth B _iWith initial bearer rate

The gross power that network element i is consumed Carry out parameter iteration, namely

$X_i\left(R_i^{\left(t\right)}\right)={\mathrm{\&xi;}}_i^{\left(t\right)}\exp \left(\frac{R_i^{\left(t\right)}}{B_i}\right)-{\mathrm{\&omega;}}_i^{\left(t\right)};$

(4) introduce Lagrange multiplier κ _i, and in conjunction with iteration speed

With maximum rate

It is carried out iteration, namely ${\mathrm{\&kappa;}}_i^{(t+1)}={\mathrm{\&kappa;}}_i^{\left(t\right)}+\mathrm{\&mu;}\max \{0,(R_i-R_i^{\max })\},$ 0＜μ＜1；

(5) judge that whether adjacent twice iteration result is less than default threshold values, namely

Wherein ε is default threshold values, if, the optimal transmission speed that derived grid can carry

If not, then return step (2);

(6) utilize described optimal transmission speed

Calculate the optimum shunting ratio φ of subnet _i, namely

R wherein _ReqRate request for the user;

(7) the speed splitter branches to corresponding network with downlink data and carries out concurrent transmission according to the optimum shunting ratio of calculating in the step (6).

On the basis of technique scheme, described network element comprises base station and the access node in the heterogeneous network environment.

On the basis of technique scheme, the resource state information in the wherein said step (1) has comprised available channel bandwidth, suffered interference volume, fixedly power consumption, the bearer rate of network and the peak transfer rate that can carry of network.

On the basis of technique scheme, the establishing method of described each the network element initial option speed carrying in the wherein said step (1) is to get any carrying of satisfying following condition, V＞1; Wherein, p _CstFixedly power consumption for network element i; B _iBe system bandwidth; ξ _iBe the suffered interference volume of network element i; R _iThe speed of carrying for network element i;

The maximum rate that can carry for network element i; V is constant.

On the basis of technique scheme, the described interference power of described step (2) and fixedly the computational methods of the difference of power consumption be interference power and fixing power consumption p _CstDifference Namely ${\mathrm{\&omega;}}_i^{\left(t\right)}={\mathrm{\&xi;}}_i^{\left(t\right)}-p_{\mathrm{cst}}.$

On the basis of technique scheme, the gross power that the described network element of step (3) consumes

Iterative formula, namely $X_i\left(R_i^{\left(t\right)}\right)={\mathrm{\&xi;}}_i^{\left(t\right)}\exp \left(\frac{R_i^{\left(t\right)}}{B_i}\right)-{\mathrm{\&omega;}}_i^{\left(t\right)}$

On the basis of technique scheme, the described Lagrange multiplier alternative manner of step (4), namely ${\mathrm{\&kappa;}}_i^{(t+1)}={\mathrm{\&kappa;}}_i^{\left(t\right)}+\mathrm{\&mu;}\max \{0,(R_i-R_i^{\max })\},$ 0＜μ＜1；

On the basis of technique scheme, the described bearer rate in the step (5)

Iterative formula, namely $R_i^{(t+1)}=1+{\mathrm{\&kappa;}}_i^{\left(t\right)}+\frac{{\mathrm{\&omega;}}_i^{\left(t\right)}}{X_i\left(R_i^{\left(t\right)}\right)}.$

With respect to prior art, the present invention has following advantage:

The present invention receives the equivalent deformation of assorted axiom by efficiency equation and cooperative game, and the transmission rate of each sub-network is carried out iteration, obtains making efficiency high and disturb little optimal rate.And utilize a plurality of subnets to carry out parallel transmission, and need not close the part carrier wave of base station or inaccessible base station, make the base station can operate as normal.This method and do not change the operate as normal of base station guarantees user experience quality.

Description of drawings

Fig. 1 is the concrete application scenarios of this method;

Fig. 2 is the flow chart of concurrent transmission power-economizing method;

Fig. 3 is optimal rate iteration diagram provided by the invention;

Fig. 4 is the performance comparison figure that rate-allocation that the present invention proposes is compared Random assignment.

Embodiment

Main purpose of the present invention provides a kind of network energy-saving method, to reduce the energy consumption of base station operation.

Below in conjunction with accompanying drawing, the embodiment of the speed splitting method that the present invention is proposed describes in further detail.

The integration program of the heterogeneous radio access networks network that the present invention carries as shown in Figure 1, wireless access network 1 (WAN1) characterizes the honeycomb mobile cell with large coverage, its wireless access technology that adopts is to support complete mobile honeycomb to move multiple access technique, and wireless access network 2 and 3 (WAN2 and WAN3) expression short-distance radio broadband access network mainly is to cover as a supplement to provide high-speed radio to insert.Scene comprises four multimode terminal MUE, a macro base station MeNB(MacrocelleNB) be two MUE services, one family base station (FemtocelleNB) is its MUE service, a Pico eNB is its MUE service, in addition, also have a speed splitter, link to each other with core net with each base station.Wireless communication system becomes as shown in Figure 1 Macrocell/Femtocell(picocell by single Macrocell coverage mode) the layering coverage mode, thereby also produced a large amount of cell edge region, be subjected to the interference of adjacent base station the user of cell edge region easily.Femtocell(picocell) be arranged in the coverage of Macrocell, it can be with the capacity of the lower a large amount of elevator system of cost and the coverage of extending Macrocell, user MUE can select to communicate with Macrocell, also can select with its under Femtocell(picocell) and all open Femtocell(picocell) communicate.

With reference to Fig. 2, the present invention carries out the speed division in Fig. 1 scene concrete steps are as follows:

The information search module of speed splitter is collected the resource state information of each network, comprised available channel bandwidth in the information, the interference volume that network is suffered, the fixedly power consumption of network, bearer rate and the peak transfer rate that can carry generate stock number and the channel status that can use each residential quarter with these information.

The information search module is put all available volumes of resources and channel status in order according to the resource information that obtains, and calculates the lower limit of each network element according to following formula, initiation parameter and be that each network element initial option speed is carried.

$\frac{p_{\mathrm{cst}}}{{\mathrm{\&xi;}}_i}\&CenterDot;\frac{B_i}{1+v}<R_i\&le;R_i^{\max },v>1;$

Wherein, p _CstFixedly power consumption for the base station; B _iBandwidth for i channel that network provides; ξ _iBe i the interference volume that network is suffered; R _iBe i the speed that network carries;

Be the maximum rate that i network can carry, v is constant.Here we are in order to make interference little, and bearer rate will be subjected to the restriction of speed lower limit, will be subjected to the restriction of network peak transfer rate in addition.In addition, the fixedly power consumption p that also needs the initiation parameter base station _Cst, i the maximum rate that network can carry With constant v.

Because the network energy efficiency η of definition single network i _iBe the ratio of its speed of carrying with the power that consumes, namely

${\mathrm{\&eta;}}_i=\frac{R_i}{p_i^t}=\frac{R_i}{{\mathrm{\&xi;}}_i(2^{\frac{R_i}{B_i}}-1)+p_{\mathrm{cst}}}$

Further, in order to make single net efficiency reach maximum, based on cooperative game, the select target function is

$\max \underset{i=1}{\overset{N}{\mathrm{\&Pi;}}}({\mathrm{\&eta;}}_i-{\mathrm{\&eta;}}_i^{\min })$

$=\underset{i=1}{\overset{N}{\mathrm{\&Pi;}}}\frac{R_i}{{\mathrm{\&xi;}}_i(2^{\frac{R_i}{B_i}}-1)+p_{\mathrm{cst}}}$

$=\underset{i=1}{\overset{N}{\mathrm{\&Sigma;}}}\log \frac{R_i}{{\mathrm{\&xi;}}_i(2^{\frac{R_i}{B_i}}-1)+p_{\mathrm{cst}}}$

Wherein, η _iEfficiency for network i; η _MinBe the minimum efficiency of network, value is 0.

At this moment, the problem model equivalence is

$\max \underset{i=1}{\overset{N}{\mathrm{\&Sigma;}}}\log \frac{R_i}{{\mathrm{\&xi;}}_i(2^{\frac{R_i}{B_i}}-1)+p_{\mathrm{cst}}}$

$s.t.R_{\mathrm{req}}\&le;\underset{i=1}{\overset{N}{\mathrm{\&Sigma;}}}{R}_i$

$R_i\&le;R_i^{\max },i=1,\&CenterDot;\&CenterDot;\&CenterDot;,N$

Here, the sub-network of N cooperation transmission must satisfy rate request R _Req, and the speed that each subnet can carry is less than its physical constraint

Wherein, R _ReqBe user's rate request,

The maximum rate that can carry for network i.

The interference power ξ that we are suffered with network i _iWith fixing power consumption p _CstDifference be designated as Namely

${\mathrm{\&omega;}}_i^{\left(t\right)}={\mathrm{\&xi;}}_i^{\left(t\right)}-p_{\mathrm{cst}}$

Wherein, ξ _iBe the suffered interference from other base station of base station i, p _CstBe the fixedly power consumption of base station, it is the part of gross power that the base station consumes.

And then the gross power that consumes when network i transmitted Carry out parameter iteration, namely

$X_i\left(R_i^{\left(t\right)}\right)={\mathrm{\&xi;}}_i^{\left(t\right)}\exp \left(\frac{R_i^{\left(t\right)}}{B_i}\right)-{\mathrm{\&omega;}}_i^{\left(t\right)}$

Introduce Lagrange multiplier λ and κ then _iWith respect to two constraintss, can derive a constrained optimization problem, and then obtain its KKT condition and be

$\frac{1}{R_i}-\frac{{\mathrm{\&xi;}}_i-p_{\mathrm{cst}}}{X_i\left(R_i\right)}+(\mathrm{\&lambda;}-{\mathrm{\&kappa;}}_i-1)=0$

$\mathrm{\&lambda;}(R_{\mathrm{req}}-\underset{i=1}{\overset{N}{\mathrm{\&Sigma;}}}{R}_i)=0$

$\underset{i=1}{\overset{N}{\mathrm{\&Sigma;}}}{\mathrm{\&kappa;}}_i(R_i-R_i^{\max })=0$

0≤λ

0≤κ _i,i＝1,...,N

Need initialization Lagrange multiplier κ here _i, wherein the Lagrange multiplier iteration is

${\mathrm{\&kappa;}}_i^{(t+1)}={\mathrm{\&kappa;}}_i^{\left(t\right)}+\mathrm{\&mu;}\max \{0,(R_i-R_i^{\max })\},0<\mathrm{\&mu;}<1$

Draw more than the last basis

With

Bearer rate to base station i

Carry out following iteration

$R_i^{(t+1)}=1+{\mathrm{\&kappa;}}_i^{\left(t\right)}+\frac{{\mathrm{\&omega;}}_i^{\left(t\right)}}{X_i\left(R_i^{\left(t\right)}\right)};$

Judge adjacent twice iteration result whether less than default threshold values ε, wherein threshold values ε be infinitely small or default one less constant, namely ought

The time, just derive the optimal transmission speed that efficiency network i big and that disturb hour can be carried

Wherein, Be the iteration speed of i network;

It is the power consumption of i network;

Be Lagrange multiplier.

Then utilize each network optimal transmission speed of calculating in the above-mentioned steps, calculate optimum shunting ratio;

${\mathrm{\&phi;}}_i=\frac{R_i^{*}}{R_{\mathrm{req}}},(\underset{i=1}{\overset{N}{\mathrm{\&Sigma;}}}{\mathrm{\&phi;}}_i=1)$

Wherein, φ _iBe the shunting ratio of i network, the i value is 1 to N;

It is the optimal rate that i network can carry; N is the network number in the multi-access network; R _ReqRate request for the user.

Last speed mitotic apparatus is according to the optimum shunting ratio of calculating, and the downlink data of MUE is branched to corresponding network, finishes concurrent transmission.

The present invention will be further described below in conjunction with concrete application example and Fig. 3.

Suppose in scene as described in Figure 1 the fixedly power consumption P of macro base station _Cst1Be 46dBm, the fixedly power consumption P of Home eNodeB _Cst2Be 20dBm, the maximum rate that Home eNodeB can carry

Be 10Mb/s, bandwidth B _iBe 5MHz, suppose the initial bearer rate R of Home eNodeB _iBe 2Mb/s, constant v, μ get 2 and 0.5 respectively, draw bright day multiplier κ in addition _iInitial value is made as 3.

As shown in Figure 3, abscissa is the algorithm iteration number of times, and ordinate is rate value, and the speed of HeNB begins convergence behind algorithm iteration 7 times as can be seen, and the rate of convergence that draws is 4.6476Mb/s, the limited number of times inner iteration convergence of strict guarantee method.As shown in Figure 4, we contrast the efficiency of optimum allocation proposed by the invention and Random assignment, and abscissa is bandwidth, and ordinate is efficiency, can find out therefrom that speed splitting algorithm proposed by the invention not only realized disturbing little (namely spectrum is imitated high), and realize energy-saving effect.

Claims (8)

1. energy-conservation jamproof speed splitting method in the cognitive heterogeneous network is provided with the speed splitter in the described cognitive heterogeneous network, comprises the steps:

(1) the information search module of speed splitter is calculated the carrying lower limit of each network element according to the resource state information of collecting each network, and initiation parameter also is each network element initial option speed carrying;

(2) calculate the suffered interference power ξ of each network element _i, draw interference power and fixing power consumption p then _CstDifference

Namely ${\mathrm{\&omega;}}_i^{\left(t\right)}={\mathrm{\&xi;}}_i^{\left(t\right)}-p_{\mathrm{cst}};$

(3) according to described interference power ξ _iWith

And system bandwidth B _iWith initial bearer rate

The gross power that network element is consumed

Carry out parameter iteration, namely $X_i\left(R_i^{\left(t\right)}\right)={\mathrm{\&xi;}}_i^{\left(t\right)}\exp \left(\frac{R_i^{\left(t\right)}}{B_i}\right)-{\mathrm{\&omega;}}_i^{\left(t\right)};$

(4) introduce Lagrange multiplier κ _i, and in conjunction with iteration speed

With maximum rate It is carried out iteration, namely ${\mathrm{\&kappa;}}_i^{(t+1)}={\mathrm{\&kappa;}}_i^{\left(t\right)}+\mathrm{\&mu;}\max \{0,(R_i-R_i^{\max })\},$ 0＜μ＜1；

(5) judge that whether adjacent twice iteration result is less than default threshold values, namely

Wherein ε is default threshold values, if, the optimal transmission speed that derived grid can carry

If not, then return step (2);

(6) utilize described optimal transmission speed Calculate the optimum shunting ratio φ of subnet _i, namely

R wherein _ReqRate request for the user;

(7) the speed splitter branches to corresponding network with downlink data and carries out concurrent transmission according to the optimum shunting ratio of calculating in the step (6).

2. energy-conservation jamproof speed splitting method in a kind of cognitive heterogeneous network as claimed in claim 1, it is characterized in that: described network element comprises base station and the access node in the heterogeneous network environment.

3. energy-conservation jamproof speed splitting method in a kind of cognitive heterogeneous network according to claim 1, it is characterized in that: the resource state information in the wherein said step (1) has comprised available channel bandwidth, suffered interference volume, fixedly power consumption, the bearer rate of network and the peak transfer rate that can carry of network.

4. energy-conservation jamproof speed splitting method in a kind of cognitive heterogeneous network according to claim 1, it is characterized in that: the establishing method of described each the network element initial option speed carrying in the wherein said step (1) is to get any carrying of satisfying following condition

V＞1; Wherein, p _CstFixedly power consumption for network element i; B _iBe system bandwidth; ξ _iBe the suffered interference volume of network element i; R _iThe speed of carrying for network element i;

The maximum rate that can carry for network element i; V is constant.

5. energy-conservation jamproof speed splitting method in a kind of cognitive heterogeneous network according to claim 1 is characterized in that: the described interference power of described step (2) and fixedly the computational methods of the difference of power consumption be interference power and fixing power consumption p _CstDifference

Namely ${\mathrm{\&omega;}}_i^{\left(t\right)}={\mathrm{\&xi;}}_i^{\left(t\right)}-p_{\mathrm{cst}}.$

6. energy-conservation jamproof speed splitting method in a kind of cognitive heterogeneous network according to claim 1 is characterized in that: the gross power that the described network element of step (3) consumes Iterative formula, namely $X_i\left(R_i^{\left(t\right)}\right)={\mathrm{\&xi;}}_i^{\left(t\right)}\exp \left(\frac{R_i^{\left(t\right)}}{B_i}\right)-{\mathrm{\&omega;}}_i^{\left(t\right)}.$

7. energy-conservation jamproof speed splitting method in a kind of cognitive heterogeneous network according to claim 1 is characterized in that: the described Lagrange multiplier alternative manner of step (4), namely ${\mathrm{\&kappa;}}_i^{(t+1)}={\mathrm{\&kappa;}}_i^{\left(t\right)}+\mathrm{\&mu;}\max \{0,(R_i-R_i^{\max })\},$ 0＜μ＜1。

8. energy-conservation jamproof speed splitting method in a kind of cognitive heterogeneous network according to claim 1 is characterized in that: the described bearer rate in the step (5)

Iterative formula, namely $R_i^{(t+1)}=1+{\mathrm{\&kappa;}}_i^{\left(t\right)}+\frac{{\mathrm{\&omega;}}_i^{\left(t\right)}}{X_i\left(R_i^{\left(t\right)}\right)}.$

Images