CN103415040A - Wireless heterogeneous network multi-node optimal relay alliance cooperation exciting method - Google Patents

Abstract

The invention provides a wireless heterogeneous network multi-node optimal relay alliance cooperation exciting method. According to the method, an alliance earning model in a wireless heterogeneous network is firstly constructed; a cost function is set up by fully considering a practical channel environment; an optimization model is solved with perfect mathematical derivation, a theory optical solution of the optimization model can be obtained, and an optimal relay alliance is obtained by optimizing an alliance. Thus, nodes are effectively excited to participate in cooperation. The produced heterogeneous network multi-node optimal relay alliance cooperation exciting mechanism manner is quite easy to achieve and good in application prospect.

Description

The optimum relaying of Wireless Heterogeneous Networks multinode alliance cooperation motivational techniques

Technical field

The invention belongs to wireless communication technology field, particularly the optimum relaying of Wireless Heterogeneous Networks multinode alliance cooperation motivational techniques.

Background technology

Wireless mobile telecommunication technology has been obtained significant progress in recent years, the systems such as WLAN, UMTS and WiMAX are in the continuation operation of global introducing and existing various two third generation mobile communication networks, this has just brought the polytype communication network to coexist, be WHN Wireless Heterogeneous Networks (Wireless Heterogeneous Network, Wireless Heterogeneous Networks).WHN merges by multiple technologies, multiple network, multiple business the aggregate formed mutually, and it not only can greatly promote the performance of single network, also for introducing new service, has created condition when supporting traditional business; It also can provide for following mobile communication system higher message transmission rate, wider signal cover, and supports the mobility of higher rate.In typical honeycomb and Ad-hoc isomery UNE, self-organization and multi-hop relay ability by the Mobile Ad-hoc network network, can alleviate bottleneck effect, the balance service traffics of cellular network base station and improve the spatial multiplex ratio of network, also improve accordingly the capacity of network.But some selfish node of the existence in network also can affect the performance of whole network for fear of the consumption refusal participation relay forwarding of own resource.Certainly, relaying alliance encourages as new investigative technique, still has many problems to have to be solved, and its core difficult point is: the How to choose node alliance participates in cooperation and how to carry out the cooperation in alliance.Therefore, the optimum relaying of node in heterogeneous wireless UNE alliance cooperation incentive study is paid close attention to widely.

At present, for the research of the poorest Ad-hoc nodes Cooperation Incentive Mechanism of fail safe in heterogeneous wireless network, mainly be based on the incentive mechanism of reputation value, the incentive program that mechanism is selected and based on game theoretic analytical method.There is following shortcoming in above incentive mechanism: (1) only considers situations single or two via nodes, single or two node alliances are too simple, and the cooperation between via node is influenced each other and considers not; (2) incentive program is realized more complicated, as more complicated and unreliable as maintenance and the mechanism of transmission of reputation value, causes the inconsistence problems of reputation value etc.; (3) most of research has only proved the existence of Nash Equilibrium based on the game theory incentive mechanism, does not promote scheme but propose concrete cooperation.

Summary of the invention

In order to overcome the deficiencies in the prior art, for multinode relaying alliance cooperation excitation problem in Wireless Heterogeneous Networks, the present invention proposes the optimum relaying of Wireless Heterogeneous Networks multinode alliance cooperation motivational techniques especially.Described method be take Wireless Heterogeneous Networks and is model, and the nodes income is analyzed, and carries out combined optimization by multinode relaying alliance effectiveness income and alliance are forwarded to cost function.

The present invention, for solving the problems of the technologies described above, adopts following technical scheme:

The optimum relaying of Wireless Heterogeneous Networks multinode alliance cooperation motivational techniques, described method adopts multinode relaying alliance model, obtains the optimum node number of multinode relaying alliance; Comprise step as follows:

Steps A, setting relaying alliance collection is τ wherein _kMean multinode alliance arbitrarily,

For natural number; By maximizing alliance's effectiveness income and minimizing alliance's node cost function, realize maximum total revenue, the relaying alliance model is:

$\max z=\max (a_{{\mathrm{\τ}}_k}-c_{{\mathrm{\τ}}_k})$

$s.t.a_{{\mathrm{\τ}}_k}=\frac{n(n-1)}{2}(2p-2c+{2m}_r-{2m}_p)$

p>m _p

m _r>c

$c_{{\mathrm{\τ}}_k}=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}({\mathrm{\λ}}_i{p}_i+{({\mathrm{\γ}}_{\mathrm{tar}}-{\mathrm{\γ}}_i)}^2)$

${\mathrm{\γ}}_i=\frac{h_i{p}_i}{N_{r}W}$

0≤p _i≤p _m

Wherein,

C is that node forwards grouping consumption of natural resource cost, the income of this node when p is successfully forwarded by the another one node for the grouping of this node, m _rFor forwarding, reward m _pFor forwarding price;

Z means alliance's total revenue,

Mean node alliance effectiveness revenue function,

Mean relaying alliance cost function;

N means the node number in any alliance, n >=2;

γ _tarFor target signal interference ratio, γ _iMean that node i receives the signal interference ratio SNR of signal, h _iMean the link gain between other nodes in node i and alliance, λ _iBe proportional to link gain, i.e. λ _i=kh _i, k is greater than zero constant, and i is the natural number that is less than or equal to n;

P _iThe transmitting power that means arbitrary node i, p _mMean the transmitting power maximum of arbitrary node, W means the bandwidth of each node transmitted signal, N _rThe channel additive Gaussian noise power spectral density that means respectively receiving terminal;

Step B, when alliance's effectiveness revenue function

While getting maximum, carry out the power of alliance's interior nodes and control, make the cost function of node get minimum value, the alliance model of relaying described in steps A is reduced to:

$\{p_1^{*},p_2^{*},\·\·\·p_n^{*}\}=\underset{n}{\arg }\min f(p_1,p_2,\·\·\·p_n)$

$=\underset{n}{\arg }\min \left(c_{{\mathrm{\τ}}_k}\right)$

$s.t.c_{{\mathrm{\τ}}_k}=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}({\mathrm{\λ}}_i{p}_i+{({\mathrm{\γ}}_{\mathrm{tar}}-{\mathrm{\γ}}_i)}^2)$

Wherein, f (p ₁, p ₂... p _n) mean that relaying alliance forwards the cost function of grouping;

The optimal power that means respectively alliance's interior nodes, arg mean to meet the variable of Function Extreme value;

Calculate the optimum target value of above-mentioned Optimized model;

Step C, alliance's total revenue that relatively in relaying alliance collection M, different number of nodes form, namely obtain the optimum node number n of relaying alliance ^*:

$n^{*}=\underset{\mathrm{\τ}\∈M,n}{\arg }\max z^{*}$

Wherein, z ^*=max z.

The invention has the beneficial effects as follows: the present invention proposes Wireless Heterogeneous Networks multinode relay cooperative motivational techniques, at first described method has built alliance's earnings pattern in Wireless Heterogeneous Networks, and take into full account actual channel circumstance and set up cost function, by complete mathematical derivation solving-optimizing model, can obtain the theoretical optimal solution of Optimized model, then by optimizing alliance, obtain best relaying alliance, thereby effectively encourage node to participate in cooperation.The optimum relaying of the heterogeneous network multinode that the present invention produces alliance Cooperation Incentive Mechanism mode very simply is easy to realize having good application prospect.

The accompanying drawing explanation

Fig. 1 is the optimum relay cooperative motivational techniques of Wireless Heterogeneous Networks flow charts.

Embodiment

Below in conjunction with accompanying drawing, further illustrate the Wireless Heterogeneous Networks multinode relay cooperative motivational techniques that the present invention proposes.

Typical Dual base stations radio communication topological model, wherein base station BS ₁With BS ₂In independent coverage, adopt the cellular communication pattern, and the via node that exists Ad-hoc to connect so, is worked as base station BS in its superimposed coverage area ₁Node in independent coverage will be accessed BS ₂Base station, must forward by the via node of overlay region relaying alliance collection

τ wherein _kMean two node alliances arbitrarily,

For natural number, and the node number in each alliance means with variable n.The method can effectively be alleviated bottleneck effect, the balance service traffics of cellular network base station and improve the spatial multiplex ratio of network, has also improved accordingly mobile network's communication quality.

Consider actual network environment, in network, exist some node can take to refuse cooperation policy for the resource of saving self, but the ideal money amount of each node is certain, in order to ensure each node, can obtain the service that network provides, the ideal money amount that must meet self is greater than zero, supposes that now node accepts packet count n _r, abandon packet count n _dWith node, forward the packet count n oneself produced _g, must meet:

(n _r-n _d) m _r+ V-n _gm _p>=0 (1) wherein, and V means the ideal money amount of node.

We suppose that all participants reach the game agreement by reliable third party, maximize the income of each node by formation game alliance now.Four kinds of optional set of strategies { (C are arranged between any two participants _i, I _j), (C _i, C _j), (I _i, C _j), (I _i, I _j), the income under Different Strategies is respectively:

U(C _i,C _j)=(p-c-m _p+m _r,p-c-m _p+m _r) （2）

U(I _i,I _j)=(0,0) （3）

$U(C_i,I_j)=\left\{\begin{array}{cc}(-c+m_r,p-m_p)& \mathrm{if}{V}_j>0\\ \left(\mathrm{0,0}\right)& \mathrm{if}{V}_j<0\end{array}\right.---\left(4\right)$

$U(I_i,C_j)=\left\{\begin{array}{cc}(p-m_p,-c+m_r)& \mathrm{if}{V}_i>0\\ \left(\mathrm{0,0}\right)& \mathrm{if}{V}_i<0\end{array}\right.---\left(5\right)$

Wherein, i, j mean respectively the relaying participant, and it is c that node forwards grouping consumption of natural resource cost, are p if the grouping of a node is successfully forwarded the income of this node so by an in addition individual node, reward as m at transmission transaction repeating _r, the forwarding price is m _p, a node can utilize the forwarding of winning to reward and buy the resource forwarding grouping, and we suppose m _r, m _pWith c, p is used identical measurement mechanism.If node i has forwarded the grouping of node j, and the also grouping of forward node i of node j, each node can be received certain forwarding award m so _rWith self, divide into groups be forwarded and obtain corresponding income p, but the forwarding price m that node wants successful forwarding grouping certain forwarding cost c must be arranged and pay cooperative nodes _pIn like manner, work as node i, j all takes to refuse to forward the strategy of grouping, each node does not have payment and can not obtain any compensation yet, but, when in two nodes, there being one to take cooperation and another node while refusing cooperation, due to node i, has forwarded the grouping of node j, but the grouping of self is not forwarded, so the node i income is m _r-c; Simultaneously, because the grouping of node j is forwarded, it should pay certain currency, V _i, V _jMean respectively node i, the amount of money of j, work as V _i<0 or V _j<0 o'clock, between node without any interaction.

In multinode alliance game process, by the interest group that a plurality of participants form, the form with set means usually.Based on three node i, j, k alliance is example, so the alliance that can select of arbitrary node i comprise i}, and i, j}, i, k}, i, j, k}, node j in like manner, k can form respectively four different alliances' collection.

By formula (2) to (5), obtained, when a node is arranged in alliance, the Nash Equilibrium Solution when alliance's income is non-cooperative game; When two nodes were arranged in alliance, two nodes can take to meet the cooperation policy of Pareto optimality, but other participant can take the Nash Equilibrium strategy; When three nodes were arranged in alliance, the node in system all participated in cooperation, alliance's Income Maximum now, and node is all taked cooperation policy in twos.Therefore when n node arranged in alliance, any two nodes were all cooperated with each other, and the cooperative association number is The maximum return that the cooperation that any two nodes form integrates is as 2p-2c+2m _r-2m _p, to sum up the maximum return of n node alliance is:

$a_{{\mathrm{\&tau;}}_k}=\frac{n(n-1)}{2}(2p-2c+2m_r-2m_p)---\left(6\right)$

In the game of typical alliance, in order to obtain alliance's maximum return, when striving for alliance's maximum profit, always reduce alliance as far as possible and consume.For individual node, signal interference ratio is higher, and service quality, efficiency of transmission are better, but this can increase the consumption of battery, increase the interference to other nodes in alliance, therefore, we carry out the cost function of defined node at foundation based on node transmitting power and signal interference ratio, due to signal interference ratio γ _iBe the function relevant with factors such as transmitted power, link gain and interference powers, we propose a kind of justice that can suitably embody, and the non-linear cost function of relative efficiency is again:

$c_{{\mathrm{\&tau;}}_k}=\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}({\mathrm{\&lambda;}}_i{p}_i+{({\mathrm{\&gamma;}}_{\mathrm{tar}}-{\mathrm{\&gamma;}}_i)}^2)---\left(7\right)$

${\mathrm{\&gamma;}}_i=\frac{h_i{p}_i}{N_{r}W}---\left(8\right)$

0≤p _i≤p _m （9）

Wherein, n means the node number in any alliance, γ _tarFor target signal interference ratio, γ _iThe signal interference ratio (SNR) that means node i, λ _iBe proportional to link gain, i.e. λ _i=kh _i, k is a normal number, h _iMean the link gain between other nodes in node i and alliance, p _iThe transmitting power that means node i, p _mMean the transmitting power maximum of node, W means the bandwidth of each node transmitted signal, N _rThe channel additive Gaussian noise power spectral density that means respectively receiving terminal.

Therefore, in Wireless Heterogeneous Networks multinode relaying alliance collaboration communication, for maximum total revenue, realize by maximizing alliance's effectiveness income and minimizing the node cost function, therefore, set up following relaying alliance Optimized model:

$\max z=\max (a_{{\mathrm{\&tau;}}_k}-c_{{\mathrm{\&tau;}}_k})$

$s.t.a_{{\mathrm{\&tau;}}_k}=\frac{n(n-1)}{2}(2p-2c+{2m}_r-{2m}_p)$

p>m _p

m _r>c

$c_{{\mathrm{\&tau;}}_k}=\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}({\mathrm{\&lambda;}}_i{p}_i+{({\mathrm{\&gamma;}}_{\mathrm{tar}}-{\mathrm{\&gamma;}}_i)}^2)$

${\mathrm{\&gamma;}}_i=\frac{h_i{p}_i}{N_{r}W}$

0≤p _i≤p _m (10)

We can find out by optimization aim, and in order to ask the best coalition interior nodes number, we need to optimize the fixedly power of alliance's interior nodes.Therefore, interior nodes number n gets arbitrary constant when alliance, the effectiveness revenue function

While getting maximum, need to carry out the power optimization of alliance's interior nodes, make the cost function of node get minimum value, the Optimized model of alliance described in steps A is reduced to:

$\{p_1^{*},p_2^{*},\&CenterDot;\&CenterDot;\&CenterDot;p_n^{*}\}=\underset{n}{\arg }\min f(p_1,p_2,\&CenterDot;\&CenterDot;\&CenterDot;p_n)$

$=\underset{n}{\arg }\min \left(c_{{\mathrm{\&tau;}}_k}\right)$

$s.t.c_{{\mathrm{\&tau;}}_k}=\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}({\mathrm{\&lambda;}}_i{p}_i+{({\mathrm{\&gamma;}}_{\mathrm{tar}}-{\mathrm{\&gamma;}}_i)}^2)$

${\mathrm{\&gamma;}}_i=\frac{h_i{p}_i}{N_{r}W}$

0≤p _i≤p _m (11)

Wherein, f (p ₁, p ₂... p _n) mean that relaying alliance forwards the cost function of grouping; The optimal power that means respectively alliance's interior nodes, arg mean to meet the variable of Function Extreme value;

The optimal power that so, how to solve each node in fixing alliance becomes the very corn of a subject.By to formula f (p ₁, p ₂... p _n) ask about the local derviation of each node transmitting power and make that its local derviation is zero can obtain:

$\frac{\&PartialD;f(p_1,p_2,\&CenterDot;\&CenterDot;\&CenterDot;p_n)}{\&PartialD;p_1}={\mathrm{\&lambda;}}_1-2({\mathrm{\&gamma;}}_{\mathrm{tar}}-{\mathrm{\&gamma;}}_1)\frac{h_1}{N_{r}W}=0---\left(12\right)$

In like manner can obtain the local derviation formula of the node n of alliance transmitting power:

$\frac{\&PartialD;f(p_1,p_2,\&CenterDot;\&CenterDot;\&CenterDot;p_n)}{\&PartialD;p_n}={\mathrm{\&lambda;}}_n-2({\mathrm{\&gamma;}}_{\mathrm{tar}}-{\mathrm{\&gamma;}}_n)\frac{h_n}{N_{r}W}=0---\left(13\right)$

The optimal power that arrangement can obtain alliance's interior nodes can be expressed as:

$p_1^{*}=\frac{N_{r}W}{h_1}{\mathrm{\&gamma;}}_{\mathrm{tar}}-\frac{{\mathrm{\&lambda;}}_1{N}_r^{2}W}{2h_1}$

$p_n^{*}=\frac{N_{r}W}{h_n}{\mathrm{\&gamma;}}_{\mathrm{tar}}-\frac{{\mathrm{\&lambda;}}_n{N}_r^{2}W}{2h_n}---\left(14\right)$

As can be known by following formula:

$\min f(p_1,p_2,\&CenterDot;\&CenterDot;\&CenterDot;p_n)=f(\frac{N_{r}W}{h_1}{\mathrm{\&gamma;}}_{\mathrm{tar}}-\frac{{\mathrm{\&lambda;}}_1{N}_r^{2}W}{2h_1},\&CenterDot;\&CenterDot;\&CenterDot;,\frac{N_{r}W}{h_n}{\mathrm{\&gamma;}}_{\mathrm{tar}}-\frac{{\mathrm{\&lambda;}}_n{N}_r^{2}W}{2h_n})---\left(15\right)$

By the fixing optimum total revenue z in alliance's situation of formula (6) and formula (16) ^*:

$z^{*}=\frac{n(n-1)}{2}(2p-2c+2m_r-2m_p)-f(\frac{N_{r}W}{h_1}{\mathrm{\&gamma;}}_{\mathrm{tar}}-\frac{{\mathrm{\&lambda;}}_1{N}_r^{2}W}{2h_1},\&CenterDot;\&CenterDot;\&CenterDot;,\frac{N_{r}W}{h_n}{\mathrm{\&gamma;}}_{\mathrm{tar}}-\frac{{\mathrm{\&lambda;}}_n{N}_r^{2}W}{2h_n})---\left(16\right)$

Alliance's total revenue that relatively in relaying alliance collection M, different number of nodes form, can obtain the optimum node number n of multinode relaying alliance ^*::

$n^{*}=\underset{\mathrm{\&tau;}\&Element;M,n}{\arg }\max z^{*}---\left(17\right)$

Wherein, z ^*=max z.

For optimum relay cooperative motivational techniques in the Wireless Heterogeneous Networks of more detailed description the present invention proposition, the optimum relay cooperative motivational techniques of Wireless Heterogeneous Networks as shown in Figure 1 flow chart illustrates as follows:

The first step: set up network topology, the initialization network environment (as the arbitrary node i in relaying alliance, candidate alliance collection Signal bandwidth W, transmitting power maximum p _m, forward cost c, forward and reward m _r, forward income p, forward price m _p).

Second step: node, by environment perception technology, obtains various channel condition informations: channel gain h _i, channel noise power spectrum density N _i.

The 3rd step: according to formula (6), at first calculate the effectiveness income of any alliance maximum;

The 4th step: according to formula (15), calculate the best power under this alliance; Then according to according to formula (16), calculate alliance's total revenue of the maximum under this power controlled condition.

The 5th step: work as τ _kDuring ∈ M, the income of more different relaying alliances, obtain the optimum node number n of relaying alliance according to formula (17) ^*.Therefore, the optimal node under optimum power control is counted n ^*The alliance formed can obtain maximum total revenue, is the optimal solution of Optimized model (formula (10)).

For those skilled in the art, can be easy to other advantage and distortion of association according to above implementation type.Therefore, the present invention is not limited to above-mentioned instantiation, and it carries out detailed, exemplary explanation as just example to a kind of form of the present invention.In the scope that does not deviate from aim of the present invention, those of ordinary skills replace resulting technical scheme according to above-mentioned instantiation by various being equal to, within all should being included in claim scope of the present invention and equivalency range thereof.

Claims (1)

1. the optimum relaying of Wireless Heterogeneous Networks multinode alliance cooperation motivational techniques, is characterized in that, described method adopts multinode relaying alliance model, obtains the optimum node number of multinode relaying alliance; Comprise step as follows:

Steps A, setting relaying alliance collection is

τ wherein _kMean multinode alliance arbitrarily, For natural number; By maximizing alliance's effectiveness income and minimizing alliance's node cost function, realize maximum total revenue, the relaying alliance model is:

$\max z=\max (a_{{\mathrm{\&tau;}}_k}-c_{{\mathrm{\&tau;}}_k})$

$s.t.a_{{\mathrm{\&tau;}}_k}=\frac{n(n-1)}{2}(2p-2c+{2m}_r-{2m}_p)$

p>m _p

m _r>c

$c_{{\mathrm{\&tau;}}_k}=\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}({\mathrm{\&lambda;}}_i{p}_i+{({\mathrm{\&gamma;}}_{\mathrm{tar}}-{\mathrm{\&gamma;}}_i)}^2)$

${\mathrm{\&gamma;}}_i=\frac{h_i{p}_i}{N_{r}W}$

0≤p _i≤p _m

Wherein,

C is that node forwards grouping consumption of natural resource cost, the income of this node when p is successfully forwarded by the another one node for the grouping of this node, m _rFor forwarding, reward m _pFor forwarding price;

Z means alliance's total revenue,

Mean node alliance effectiveness revenue function,

Mean relaying alliance cost function;

N means the node number in any alliance, n >=2;

γ _tarFor target signal interference ratio, γ _iMean that node i receives the signal interference ratio SNR of signal, h _iMean the link gain between other nodes in node i and alliance, λ _iBe proportional to link gain, i.e. λ _i=kh _i, k is greater than zero constant, and i is the natural number that is less than or equal to n;

P _iThe transmitting power that means arbitrary node i, p _mMean the transmitting power maximum of arbitrary node, W means the bandwidth of each node transmitted signal, N _rThe channel additive Gaussian noise power spectral density that means respectively receiving terminal;

Step B, when alliance's effectiveness revenue function

While getting maximum, carry out the power of alliance's interior nodes and control, make the cost function of node get minimum value, the alliance model of relaying described in steps A is reduced to:

$\{p_1^{*},p_2^{*},\&CenterDot;\&CenterDot;\&CenterDot;p_n^{*}\}=\underset{n}{\arg }\min f(p_1,p_2,\&CenterDot;\&CenterDot;\&CenterDot;p_n)$

$=\underset{n}{\arg }\min \left(c_{{\mathrm{\&tau;}}_k}\right)$

$s.t.c_{{\mathrm{\&tau;}}_k}=\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}({\mathrm{\&lambda;}}_i{p}_i+{({\mathrm{\&gamma;}}_{\mathrm{tar}}-{\mathrm{\&gamma;}}_i)}^2)$

Wherein, f (p ₁, p ₂... p _n) mean that relaying alliance forwards the cost function of grouping;

The optimal power that means respectively alliance's interior nodes, arg mean to meet the variable of Function Extreme value;

Calculate the optimum target value of above-mentioned Optimized model;

Step C, alliance's total revenue that relatively in relaying alliance collection M, different number of nodes form, namely obtain the optimum node number n of relaying alliance ^*:

$n^{*}=\underset{\mathrm{\&tau;}\&Element;M,n}{\arg }\max z^{*}$

Wherein, z ^*=max z.

Images