CN105163378A - Heterogeneous network transmission method and system based on cooperative crowdsourcing - Google Patents

Abstract

The invention provides a heterogeneous network transmission method and system based on cooperative crowdsourcing. The method comprises a base station and a plurality of relays, wherein the base station issues transmission tasks and incentives, and the relays adjust a transmission power of the base station according to the incentives of the base station. The invention has the following beneficial effects: in conclusion, the invention aims to design an incentive mechanism under a cooperative communication mode; by designing the incentive mechanism based on a game theory and giving appropriate benefits to the relays, the relays are encouraged to be participated in cooperative transmission, so that the spectrum efficiency of the system can be improved as well as the interests of both a user and the base station, and a win-win state between one base station and one relay can be achieved.

Description

Based on the heterogeneous network transmission method and system of cooperation mass-rent

Technical field

The present invention relates to electronics and communication technical field, particularly relate to the heterogeneous network transmission method and system based on cooperation mass-rent.

Background technology

Universal along with the development of the communication technology and radio communication and its application, common carrier, in raising message transmission rate, is being faced with unprecedented challenge.In order to tackle the requirement of radio communication two-forty, flexible and changeable multitiered network framework, i.e. heterogeneous network, has been introduced in existing cellular network.But, highdensity network design can cause the cost of operator to increase (equipment investment, operation and maintenance cost etc.), network management difficulty increases (number of the distributed deployment of base station, equipment increases) and base station deployment difficulty large (restrictions of the selecting of base station location, policies and regulations), and therefore heterogeneous network economy in some cases and feasibility need to consider.

Summary of the invention

In order to solve the problems of the prior art, the invention provides a kind of heterogeneous network transmission method based on cooperation mass-rent.

The invention provides a kind of heterogeneous network transmission method based on cooperation mass-rent, the method comprises base station and multiple relaying, and transformation task and excitation are issued in base station, and relaying adjusts its through-put power according to the excitation of base station.

As a further improvement on the present invention, the object of relaying maximizes it at the utility function u amplified and under decoding forwarding _i,

${\mathrm{maxu}}_i^{AF}\left(p_i^R\right)=\underset{m=1}{\overset{M}{\Σ}}(\frac{f_{i,m}^{AF}\left(p_{i,m}^r\right)}{\underset{j=1}{\overset{N}{\Σ}}{f}_{j,m}^{AF}\left(p_{j,m}^r\right)}{R}_m-c_i{p}_{i,m}^r)$

$\left(c1\right)---f_{i,m}^{AF}\left(p_{i,m}^r\right)\≥T_{0}n$

$\left(c2\right)---\underset{m=1}{\overset{M}{\Σ}}{p}_{i,m}^r\≤P_i^{ur}$

Then say in each, it needs the excitation according to base station, determines that the through-put power of its optimum is to reach the object maximizing its utility function.

As a further improvement on the present invention, relaying can obtain decoding the optimal transmit power in forwarding situation

$p_{i,m}^{r\left(DF\right)}={\[{\left(\frac{SNR(-i,m)R_m}{{\mathrm{\γ}}_{i,m}^{RD}(c_k+{\mathrm{\λ}}_{i,m}{\mathrm{\γ}}_{i,m}^{RD}+{\mathrm{\μ}}_i-{\mathrm{\η}}_{i,m}{\mathrm{\γ}}_{i,m}^{RD})}\right)}^{1/2}-\frac{SNR(-i)}{{\mathrm{\γ}}_{i,m}^{RD}}\]}^{+}.$

Present invention also offers a kind of heterogeneous network transmission system based on cooperation mass-rent, this system comprises base station and multiple relaying, and transformation task and excitation are issued in base station, and relaying adjusts its through-put power according to the excitation of base station.

As a further improvement on the present invention, the object of relaying maximizes it at the utility function u amplified and under decoding forwarding _i,

${\mathrm{maxu}}_i^{AF}\left(p_i^R\right)=\underset{m=1}{\overset{M}{\Σ}}(\frac{f_{i,m}^{AF}\left(p_{i,m}^r\right)}{\underset{j=1}{\overset{N}{\Σ}}{f}_{j,m}^{AF}\left(p_{j,m}^r\right)}{R}_m-c_i{p}_{i,m}^r)$

$\left(c1\right)---f_{i,m}^{AF}\left(p_{i,m}^r\right)\≥T_{0}n$

$\left(c2\right)---\underset{m=1}{\overset{M}{\Σ}}{p}_{i,m}^r\≤P_i^{ur}$

Then say in each, it needs the excitation according to base station, determines that the through-put power of its optimum is to reach the object maximizing its utility function.

As a further improvement on the present invention, relaying can obtain decoding the optimal transmit power in forwarding situation

$p_{i,m}^{r\left(DF\right)}={\[{\left(\frac{SNR(-i,m)R_m}{{\mathrm{\γ}}_{i,m}^{RD}(c_k+{\mathrm{\λ}}_{i,m}{\mathrm{\γ}}_{i,m}^{RD}+{\mathrm{\μ}}_i-{\mathrm{\η}}_{i,m}{\mathrm{\γ}}_{i,m}^{RD})}\right)}^{1/2}-\frac{SNR(-i)}{{\mathrm{\γ}}_{i,m}^{RD}}\]}^{+}.$

The invention has the beneficial effects as follows: in sum, the object of the invention is to the incentive mechanism under design collaboration communication pattern, by designing one based on game theoretic incentive mechanism, by giving relaying suitable interests, relaying is encouraged to participate in cooperation transmission, the availability of frequency spectrum that can improve system can improve again the interests of user and base station both sides, reaches the state of a base station and relaying doulbe-sides' victory.

Accompanying drawing explanation

Fig. 1 is system model figure of the present invention.

Fig. 2 is the utility function figure of base station of the present invention and relaying.

Embodiment

The invention discloses a kind of heterogeneous network transmission method and system based on cooperation mass-rent, along with the appearance of the antenna equipment of a series of small size, powerful multifrequency, many standards, such as, the novel radio access network planning device lightRadio that Alcatel Lucent is released, in the near future, operator may with third party's interest group, namely the owner of micro radio access point realizes the deployment of base station jointly.That is, the Successful transmissions of data needs the cooperation of operator and third party's interest group.On the one hand, this kind of cooperative mechanism effectively can reduce equipment operation and maintenance cost and reduce the difficulty of system maintenance; On the other hand, relaying, i.e. WAP (wireless access point), can obtain rational remuneration from cooperation transmission.When this doulbe-sides' victory, we have proposed a kind of heterogeneous network data files based on " cooperation mass-rent " theory and transmit, that is, operator recruits idle WAP (wireless access point) participation cooperation transmission by paying the rational interests of third party's interest organizations.

But, need operator and third party's advantage mechanism jointly to solve in the extensive use of this cooperation transmission means based on " cooperation mass-rent " theory.From the angle of operator, the problem first solved is exactly how to select and encourage the via node of recruitment to participate in cooperation transmission the coverage of the throughput of network and network can effectively be improved, and ensures small configuration and maintenance cost.For via node, in view of it belongs to different interest groups, they need enough profits measurement to participate in cooperation transmission.One of the object participating in cooperation transmission is under the resource of limited transmission and system consumption, from cooperation transmission, obtain larger interests.From the viewpoint of operator and relaying two, the present invention is intended to the wireless network of the effective cooperation transmission of design one.

But, the maximization of the cooperative network most spectrum efficiency Network Based of transmission that existing heterogeneous network is wireless or energy efficiency.In this network configuration, typical high power base station and relaying belong to operator, and unconditional the trying one's best of relaying participates in cooperation transmission, and meanwhile, operator does not need to pay any expense of the third-party institution.In order to solve problems, the present invention aims to provide a kind of scheme solving this type of transmission.

In this invention, we design a kind of cooperation transmission mechanism based on " cooperation mass-rent ", this transmission mechanism needs base station and relaying to coact, namely the operator representated by base station issues transformation task and excitation, and the third party's advantage mechanism representated by relaying adjusts its through-put power according to the excitation of operator.In order to make full use of Internet resources, we devise a kind of incentive mechanism based on Stackelberg game, in host-guest architecture, base station as main and relaying as from.Each relaying participated in all is at war with other relayings the profit obtained in cooperation is transmitted.In order to ensure the validity of system, we demonstrate Nash Equilibrium between relaying and to exist and unique.In order to transmission policy stable between relaying can be obtained, we illustrate a kind of algorithm that can obtain Stackelberg equilibrium.Namely base station can maximize its utility function, and relaying can reach unique optimal policy in the constant situation of other repetition policy.

As shown in Figure 1, supposing the system is by a base station, and M (M >=1) individual user, and the base station composition of N (N >=2) individual recruitment, each base station is all user's services.Suppose that a set of transceiver is equipped with in each base station, refer to select in transmission and reception a time period, namely relaying is in half-duplex state.Here we suppose, time frame of each transmission is divided into two stages, and first transmit stage, base station is to relay transmission, and at second stage, relay forwarding is to user.We suppose the frequency orthogonal between user, such as, adopt OFDMA technology, and adopted existing mode to carry out allocation of carriers.All use carries out Maximal ratio combiner at its receiving terminal per family.

From base station to the channel parameter of relaying i with from relaying i to user m, channel parameter use respectively with represent, with represent Signal to Interference plus Noise Ratio respectively, σ ²represent the variance of additive white Gaussian noise.Here suppose that channel is declined by large scale and multipath fading forms,

$h_{i,m}^{SR\left(RD\right)}=g_{i,m}^{SR\left(RD\right)}{w}_{i,m}^{SR\left(RD\right)}$

Here represent independent identically distributed multipath fading, its average is 0, and variance is σ _sh, represent large scale decline, its expression formula is

$w_{i,m}^{SR\left(RD\right)}=\sqrt{\frac{{\mathrm{cs}}_{i,m}^{SR\left(RD\right)}}{{\left(d_{i,m}^{SR\left(RD\right)}\right)}^{\mathrm{\α}}}}$

C represents distance and exists time, the intermediate value of channel fading, α is distance loss, and its scope is 2 ~ 5, for transmission range.In addition, for the shadow fading parameter of logarithm normal distribution, be 0 intermediate value, σ _shfor the Gaussian distributed random variable of variance.

P ^drepresent base station transmitting power vector, use represent the transmitting power of base station to user m.With $P^r=(p_1^r,p_2^r,...,p_N^r)$ Represent the transmitting power of all matrixes, $p_i^r(p_i^r=(p_{i1}^r,p_{i2}^r,...,p_{iM}^r))$ Represent the transmitting power vector of relaying to all users, for relaying is used for the transmitting power that the transmission of user m consumes.With represent beyond all out-trunk i, the transmitting power of all relayings.For the ease of hereafter stating, we also use represent repeat transmitted power matrix.We use with after representing the forwarding by relaying i respectively, the signal to noise ratio of user m after amplification forwarding and decoding forward, its expression formula is

$f_{i,m}^{AF}\left(p_{i,m}^r\right)={\mathrm{SNR}}_{i,m}^{AF}=\frac{{\mathrm{\γ}}_{i,m}^{SR}{p}_m^d{\mathrm{\γ}}_{i,m}^{RD}{p}_{i,m}^r}{{\mathrm{\γ}}_{i,m}^{SR}{p}_m^d+{\mathrm{\γ}}_{i,m}^{RD}{p}_{i,m}^r+1}$

$f_{i,m}^{DF}\left(p_{i,m}^r\right)={\mathrm{SNR}}_{i,m}^{DF}=min\{{\mathrm{\γ}}_{i,m}^{SR}{p}_m^d,{\mathrm{\γ}}_{i,m}^{RD}{p}_{i,m}^r\}$

Each relaying participating in cooperation can obtain income based on its signal to noise ratio, and its cost function is consumed transmitting and rated output.Consider income and expenditure, each relaying determines its transmission policy, i.e. optimal transmission power, and its utility function namely can be made to obtain the optimal transmit power of maximum simultaneously.Base station, also according to income and expenditure, determines the utility function of its optimum, namely gives the excitation of relaying.Because relaying belongs to different interest groups, we suppose that all relayings are all reason and selfishness here.In the present invention, we devise a kind of cooperative mechanism based on cooperation mass-rent, and other problems is safety problem such as, are also the problems needing in network to pay close attention to, put aside in this invention.

The excitation vector of base station is R (R=(R ₁, R ₂..., R _m)), base station is provide be actuated to R in order to the transmission of user m _m, the expenditure of base station is the price of per unit of power is c _i(c _i>0).C _ifor the power price that relaying i decides in its sole discretion, its numerical value is determined by dump energy, battery and chip processing capabilities.The object of relaying i maximizes it at the utility function u amplified and under decoding forwarding _i

${\mathrm{maxu}}_i^{AF}\left(p_i^R\right)=\underset{m=1}{\overset{M}{\Σ}}(\frac{f_{i,m}^{AF}\left(p_{i,m}^r\right)}{\underset{j=1}{\overset{N}{\Σ}}{f}_{j,m}^{AF}\left(p_{j,m}^r\right)}{R}_m-c_i{p}_{i,m}^r)$

$\left(c1\right)---f_{i,m}^{AF}\left(p_{i,m}^r\right)\≥T_{0}n$

$\left(c2\right)---\underset{m=1}{\overset{M}{\Σ}}{p}_{i,m}^r\≤P_i^{ur}$

Then say in each, it needs the excitation (R according to base station _m, ), determine that the through-put power of its optimum is to reach the object maximizing its utility function.Here, T ₀represent each relaying for each user forward time, the restriction of minimum signal to noise ratio, the transmitting power summation of relaying i is not more than when decoding forwarding, the target function of relaying i and restrictive condition.

The introducing of polarization zero-forcing technique:

When first stage and the second stage end of transmission, the information that secondary user's intercoms mutually has been transferred to PR place all respectively, interference is constituted to primary user, in order to eliminate this interference, the Received signal strength of mode to PR that the present invention introduces polarization ZF processes, when the first stage, for PR, Section 2 on the right of equal sign for interference, therefore SUB needs D _bPcarry out estimating and the d that selection one is suitable intelligently _bAmeet:

D _BPd _BA＝0(7)

Thus this is eliminated at PR end.

When second stage, concerning PR, be the interference from SUA, therefore SUA needs D _aPcarry out estimating and select suitable d _aBmake to meet:

${\mathrm{maxu}}_i^{DF}\left(p_i^R\right)=\underset{m=1}{\overset{M}{\Σ}}(\frac{f_{i,m}^{DF}\left(p_{i,m}^r\right)}{\underset{j=1}{\overset{N}{\Σ}}{f}_{j,m}^{DF}\left(p_{j,m}^r\right)}{R}_m-c_i{p}_{i,m}^r)$

$\left(c1\right)---f_{i,m}^{DF}\left(p_{i,m}^r\right)\≥T_0$

$\left(c2\right)---\underset{m=1}{\overset{M}{\Σ}}{p}_{i,m}^r\≤P_i^{ur}$

$\left(c3\right)---{\mathrm{\γ}}_{i,m}^{SR}{p}_m^d\≥{\mathrm{\γ}}_{i,m}^{RD}{p}_{i,m}^r$

The principle of restrictive condition (c3) is, because the throughput of user limits by the poorest channel in two sections of channels, so the relaying of reason will be selected using Article 2 channel as poor channel, namely the second signal to noise ratio of jumping will lower than the signal to noise ratio of the first jumping.

On the other hand, base station goes for optimum excitation R _m, go to maximize its effectiveness.Here, α _m, (α _m>0) for base station is to the income of user m unit of transfer spectrum efficiency.The object of base station is to maximize its utility function

${\mathrm{maxu}}_0\left(R\right)=\underset{m=1}{\overset{M}{\Σ}}(\frac{{\mathrm{\α}}_m{\log }_2(1+\underset{j=1}{\overset{N}{\Σ}}{f}_{j,m}\left(p_{j,m}^r\right))}{2}-R_m)$

s.t.u ₀(R)≥0

Gaming Model Analysis:

This incentive mechanism is divided into two stages, and at first stage, excitation R is issued in base station, and in second stage, relaying is according to its transmitting power of excitation adjustment.From master cast explain, base station is main, namely encourages the publisher of R, relaying be from, its strategy is optimal transmit power P ^r.The process of power division can be regarded as a non-cooperative game between relaying.

Definition 1: if satisfy condition $u_i(p_i^{r\left(ne\right)},P_{-i}^{r\left(ne\right)})\≥u_i(p_i^r,P_{-i}^{r\left(ne\right)}),\∀i,$ So for the Nash Equilibrium of power division between relaying.

We will prove existence and the uniqueness of the Nash Equilibrium of power division between relaying.The existence of Nash Equilibrium can guarantee to there is at least one stable strategy between relaying, and the uniqueness of Nash Equilibrium can ensure that base station can predict the strategy of relaying.First we prove the existence of Nash Equilibrium.

Theorem 1: if utility function at P ^rin continuously and also be about concave function, at least there is a Nash Equilibrium in the power division so between relaying.

Prove: according to (6) (7), we can determine P ^rcontinuity, for arbitrary user m, we get P ^rright second dervative,

$\frac{{\∂}^2{u}_i\left(P^r\right)}{\∂{\left(p_{i,m}^r\right)}^2}=\frac{(f_{i,m}^{\′\′}\left(\underset{i=1}{\overset{N}{\Σ}}{f}_{i,m}\right)-2{\left(f_{i,m}^{\′}\right)}^2)\underset{j=1,j\≠i}{\overset{N}{\Σ}}{f}_{-j,m}}{{\[\underset{i=1}{\overset{N}{\Σ}}{f}_{i,m}\]}^3}$

Due to be about non-ly subtract concave function, about u _i(P ^r) second dervative always negative, therefore we can guarantee the existence of Nash Equilibrium, and next, we will prove the uniqueness of Nash Equilibrium.

Theorem two: at the relay power apportionment games of non-cooperative game in, Nash Equilibrium is unique.

First we define σ (P ^r, θ) and be u _i(P ^r) weighting sum, θ=(θ ₁, θ ₂..., θ _n) be a series of weighted factor.

Proposition 1: if θ is >0, at P ^rin, exist about σ (P ^r, θ) and be that diagonal angle is strictly recessed, so its Nash Equilibrium point is unique.If symmetrical matrix [G (P ^r, θ) and+G'(P ^r, θ)] be negative definite, so σ (P ^r, θ) and be that diagonal angle is strictly recessed.

σ (P ^r, θ) pseudo-gradient vector (length is NM) can be written as

$g(P^r,\mathrm{\θ})={\[{\mathrm{\θ}}_1\frac{\∂u_1\left(P^r\right)}{\∂p_1^r},...,{\mathrm{\θ}}_N\frac{\∂u_N\left(P^r\right)}{\∂p_N^r}\]}^T$

We then define g (P ^r, θ) Jacobian matrix G (P ^r, θ), to be the value of ((i-1) M+m, (j-1) M+m) be the element position wherein in matrix

Lemma 1: for each u _i(P ^r), if it is right recessed, and right be convex, and there is θ >0 and make σ (P ^r, θ) and at P ^rin be recessed, so just can say [G (P ^r, θ) and+G'(P ^r, θ)] be negative definite.

In order to prove u _i(P ^r) right convex.Right ask second dervative

$\frac{{\∂}^2{u}_i\left(P^r\right)}{\∂{\left(p_{j,m}^r\right)}^2}=\frac{-f_{i,m}{f}_{j,m}^{\′\′}(\underset{j=1}{\overset{N}{\Σ}}{f}_{j,m})+2f_{i,m}{\left(f_{j,m}^{\′}\right)}^2}{({\underset{j=1}{\overset{N}{\Σ}}{f}_{j,m})}^3}>0$

Therefore above formula pair strict Convex, because (10) are negative, and σ (P ^r, θ) and to P ^rrecessed, according to lemma 1, [G (P ^r, θ) and+G'(P ^r, θ)] be negative definite.According to proposition 1, σ (P ^r, θ) and be that diagonal angle is strictly recessed, the Nash Equilibrium of the power division existence anduniquess therefore between relaying.Therefore we can prove theorem 2, next, under we will be given in forwarding of amplifying and decode, and the method that relay power distributes.

The method that relay power distributes:

Here, we, by giving the optimal transmit power of out-trunk, namely reach power during Nash Equilibrium.For the ease of calculating, signal to noise ratio restriction (c1) under amplification forwarding pattern is converted to the lower bound of transmitting power by us

$p_{i,m}^r\≥\frac{{\mathrm{\γ}}_{i,m}^{SR}{P}_0{T}_0+T_0}{({\mathrm{\γ}}_{i,m}^{SR}{P}_0-T_0){\mathrm{\γ}}_{i,m}^{RD}}=P_{i,m}^{lr}$

In order to calculate optimal value, we introduce its lagrange duality problem, can be expressed as

$L_i^{AF}=u_i\left(p_i^r\right)+{\mathrm{\λ}}_i(P_{ur}^i-\underset{m=1}{\overset{M}{\Σ}}{p}_{i,m}^r)+\underset{m=1}{\overset{M}{\Σ}}{\mathrm{\μ}}_{i,m}(p_{i,m}^r-P_{i,m}^{lr})$

Here, λ _i, μ _i,m, for the KKT factor of non-negative.Single order local derviation is asked to it, and makes it equal 0.We solve an equation the optimal transmission power in forwarding situation can be amplified

$p_{i,m}^{r\left(AF\right)}={\[\frac{-x_{i,m}+\sqrt{\frac{x_{i,m}{y}_{i,m}{R}_m}{c_i+{\mathrm{\λ}}_i-{\mathrm{\μ}}_{i,m}}}}{2z_{i,m}}\]}^{+}$

[x] ⁺represent the maximum in x and 0, wherein

$x_{i,m}=(1+{\mathrm{\γ}}_{i,m}^{SR}{P}_m)\underset{j=1,j\≠i}{\overset{N}{\Σ}}{f}_{j,m}$

$y_{i,m}={\mathrm{\γ}}_{i,m}^{SR}{P}_m{\mathrm{\γ}}_{i,m}^{RD}$

$z_{i,m}=y_{i,m}+{\mathrm{\γ}}_{i,m}^{RD}\underset{j=1,j\≠i}{\overset{N}{\Σ}}{f}_{j,m}$

Utilize the paired method shown in following process and sub-gradient method, we iteration can go out Lagrange duality operator λ _i, μ _i, numerical value

${\mathrm{\λ}}_i={\[{\mathrm{\λ}}_i+\mathrm{\ω}(\underset{m=1}{\overset{M}{\Σ}}{p}_{i,m}^r-P_{ur}^i)\]}^{+}$

${\mathrm{\μ}}_{i,m}={\[{\mathrm{\μ}}_{i,m}+\mathrm{\ω}(P_{lr}^{i,m}-p_{i,m}^r)\]}^{+}$

Wherein ω is iteration step length.When dual operator convergence, optimal power can be drawn.

In order to calculate the transmitting power in decoding forwarding situation its dual problem can be write as

$L_i^{DF}=u_i\left(p_i^r\right)+{\mathrm{\λ}}_{i,m}({\mathrm{\γ}}_{i,m}^{SR}{p}_m^d-{\mathrm{\γ}}_{i,m}^{RD}{p}_{i,m}^r)+{\mathrm{\μ}}_i(P_{ur}^i-\underset{m=1}{\overset{M}{\Σ}}{p}_{i,m}^r)+{\mathrm{\η}}_{i,m}({\mathrm{\γ}}_{i,m}^{RD}{p}_{i,m}^r-T_0)$

Wherein λ _i,m, μ _i, η _i,m, for the KKT operator of non-negative. right ask with rank local derviation and make it equal 0, we can obtain the optimal transmit power in decoding forwarding situation

$p_{i,m}^{r\left(DF\right)}={\[{\left(\frac{SNR(-i,m)R_m}{{\mathrm{\γ}}_{i,m}^{RD}(c_k+{\mathrm{\λ}}_{i,m}{\mathrm{\γ}}_{i,m}^{RD}+{\mathrm{\μ}}_i-{\mathrm{\η}}_{i,m}{\mathrm{\γ}}_{i,m}^{RD})}\right)}^{1/2}-\frac{SNR(-i)}{{\mathrm{\γ}}_{i,m}^{RD}}\]}^{+}$

The iterative process of its dual operator is:

${\mathrm{\λ}}_{i,m}={\[{\mathrm{\λ}}_{i,m}+\mathrm{\ω}({\mathrm{\γ}}_{i,m}^{RD}{p}_{i,m}^r-{\mathrm{\γ}}_{i,m}^{SR}{p}_m^d)\]}^{+}$

${\mathrm{\μ}}_i={\[{\mathrm{\μ}}_{i,m}+\mathrm{\ω}(\underset{m=1}{\overset{M}{\Σ}}{p}_{i,m}^r-P_i)\]}^{+}$

${\mathrm{\η}}_{i,m}={\[{\mathrm{\η}}_{i,m}+\mathrm{\ω}(T_0-{\mathrm{\γ}}_{i,m}^{SR}{p}_m^d)\]}^{+}$

Theorem 3 is R in the span of excitation _m∈ [0 ,+∞], u ₀(R ^*, P ^*) in this smooth Frederick Colberg equilibrium of game to exist and unique.

First the expression formula of optimal power brings in the expression formula of base station by we, here defines we are at u ₀in to R _m, ask second order local derviation

$\frac{{\&part;}^2{u}_0}{\&part;R_m^2}=\frac{{\mathrm{\&alpha;}}_m\&lsqb;{\left(f_{i,m}^{AF\left(DF\right)}\left(R_m\right)\right)}^{\&prime;\&prime;}-{\left({\left(f_{i,m}^{AF\left(DF\right)}\left(R_m\right)\right)}^{\&prime;}\right)}^2\&rsqb;}{1+\underset{i=1}{\overset{N}{\&Sigma;}}{f}_{i,m}^{AF\left(DF\right)}\left(R_m\right)}<0$

Due to u ₀be the strictly concave function about R, this smooth Frederick Colberg of the optimum of existence anduniquess is balanced, and the numerical value of R can be obtained by iterative algorithm.

Analog simulation and interpretation:

In order to verify the validity of this incentive mechanism, we first contrast the utility function of base station under this incentive mechanism and direct propagation condition.Then the increase along with number of users is given, the excitation of base station and utility function, the change of relaying utility function.In order to embody the characteristic of system further, we also furthermore present the change along with minimum signal to noise ratio, the change of network parameter.In order to verify the validity of incentive mechanism, we compared for base station and the utility function of relaying when fixed value and optimal value are got in excitation.

When Fig. 2 is given in amplification forwarding, when the number of relaying is respectively 2 and 3, and the utility function of base station and relaying when direct transferring.The number of suppose relay is 3, and relaying is distributed on the circular arc of a distance base station 350m, and the distance namely between base station and relaying is 350m.Here, in order to verify the impact of distances different between base station and user on systematic function, the distance of user and base station is set to 100-700m.Due to the existence of multiple relaying, can bring diversity gain to system, as shown in the figure, the utility function value of the present invention's explaination is better than the utility function direct transferred.

The experiment proved that, the change that the excitation of base station and utility function increase along with number of users, along with the increase of number of users, the excitation of user, the utility function of user, and the utility function sum of relaying increases, this is because along with the increase of number of users, the excitation of base station increases, therefore the excitation sum of user increases.

In sum, the object of the invention is to the incentive mechanism under design collaboration communication pattern, by designing one based on game theoretic incentive mechanism, by giving relaying suitable interests, relaying is encouraged to participate in cooperation transmission, the availability of frequency spectrum that can improve system can improve again the interests of user and base station both sides, reaches the state of a base station and relaying doulbe-sides' victory.

Above content is in conjunction with concrete preferred implementation further description made for the present invention, can not assert that specific embodiment of the invention is confined to these explanations.For general technical staff of the technical field of the invention, without departing from the inventive concept of the premise, some simple deduction or replace can also be made, all should be considered as belonging to protection scope of the present invention.

Claims (6)

1. based on a heterogeneous network transmission method for cooperation mass-rent, it is characterized in that, the method comprises base station and multiple relaying, and transformation task and excitation are issued in base station, and relaying adjusts its through-put power according to the excitation of base station.

2. heterogeneous network transmission method according to claim 1, is characterized in that, the object of relaying maximizes it at the utility function u amplified and under decoding forwarding _i,

${\mathrm{maxu}}_i^{AF}\left(p_i^R\right)=\underset{m=1}{\overset{M}{\&Sigma;}}(\frac{f_{i,m}^{AF}\left(p_{i,m}^r\right)}{\underset{j=1}{\overset{N}{\&Sigma;}}{f}_{j,m}^{AF}\left(p_{j,m}^r\right)}{R}_m-c_i{p}_{i,m}^r)$

$\left(c1\right)---f_{i,m}^{AF}\left(p_{i,m}^r\right)\&GreaterEqual;T_{0}n$

$\left(c2\right)---\underset{m=1}{\overset{M}{\&Sigma;}}{p}_{i,m}^r\&le;P_i^{ur}$

Then say in each, it needs the excitation according to base station, determines that the through-put power of its optimum is to reach the object maximizing its utility function.

3. heterogeneous network transmission method according to claim 1, is characterized in that, relaying can obtain the optimal transmit power in decoding forwarding situation

$p_{i,m}^{r\left(DF\right)}={\&lsqb;{\left(\frac{SNR(-i,m)R_m}{{\mathrm{\&gamma;}}_{i,m}^{RD}(c_k+{\mathrm{\&lambda;}}_{i,m}{\mathrm{\&gamma;}}_{i,m}^{RD}+{\mathrm{\&mu;}}_i-{\mathrm{\&eta;}}_{i,m}{\mathrm{\&gamma;}}_{i,m}^{RD})}\right)}^{1/2}-\frac{SNR(-i)}{{\mathrm{\&gamma;}}_{i,m}^{RD}}\&rsqb;}^{+}.$

4. based on a heterogeneous network transmission system for cooperation mass-rent, it is characterized in that, this system comprises base station and multiple relaying, and transformation task and excitation are issued in base station, and relaying adjusts its through-put power according to the excitation of base station.

5. heterogeneous network transmission system according to claim 4, is characterized in that, the object of relaying maximizes it at the utility function u amplified and under decoding forwarding _i,

${\mathrm{maxu}}_i^{AF}\left(p_i^R\right)=\underset{m=1}{\overset{M}{\&Sigma;}}(\frac{f_{i,m}^{AF}\left(p_{i,m}^r\right)}{\underset{j=1}{\overset{N}{\&Sigma;}}{f}_{j,m}^{AF}\left(p_{j,m}^r\right)}{R}_m-c_i{p}_{i,m}^r)$

$\left(c1\right)---f_{i,m}^{AF}\left(p_{i,m}^r\right)\&GreaterEqual;T_{0}n$

$\left(c2\right)---\underset{m=1}{\overset{M}{\&Sigma;}}{p}_{i,m}^r\&le;P_i^{ur}$

Then say in each, it needs the excitation according to base station, determines that the through-put power of its optimum is to reach the object maximizing its utility function.

6. heterogeneous network transmission system according to claim 4, is characterized in that, relaying can obtain the optimal transmit power in decoding forwarding situation

$p_{i,m}^{r\left(DF\right)}={\&lsqb;{\left(\frac{SNR(-i,m)R_m}{{\mathrm{\&gamma;}}_{i,m}^{RD}(c_k+{\mathrm{\&lambda;}}_{i,m}{\mathrm{\&gamma;}}_{i,m}^{RD}+{\mathrm{\&mu;}}_i-{\mathrm{\&eta;}}_{i,m}{\mathrm{\&gamma;}}_{i,m}^{RD})}\right)}^{1/2}-\frac{SNR(-i)}{{\mathrm{\&gamma;}}_{i,m}^{RD}}\&rsqb;}^{+}.$