CN104581869A - Multi-hop cooperation communication method and system in cellular network - Google Patents

Abstract

The invention discloses a multi-hop cooperation communication method and system in a cellular network. The number of nodes of node information fused in a sent primary data pack when a first cluster head in the communication system sends first data is (please see the formula in the specification), and 2<=np<=na. The balance between low power consumption and high performance of a wireless multi-hop cooperation communication network is realized, and the requirement of the communication method of balance between low power consumption and high performance of the wireless multi-hop cooperation communication network in the prior art is met.

Description

The communication means of multi-hop cooperation in a kind of cellular network and communication system

Technical field

The present invention relates to the communications field, particularly relate to communication means and the communication system of multi-hop cooperation in a kind of cellular network.

Background technology

The communications industry, as the rich and influential family of energy resource consumption, far above other industry in global wastage in bulk or weight, accounts for 2% of global energy consumption total value, and keeps ascendant trend always.In today that resource is day by day in short supply, how to utilize resource efficiently, reduce energy consumption and seem particularly important in the communications industry.

In mobile cellular network, due to the limited coverage area of base station, the user in community must and base station between maintain a certain distance.But in the wireless network of reality, mobile subscriber is often due to the impact in geographical position, and the meeting of environmental factor etc. produces the phenomenon of decline, and as shadow fading, multipath fading, therefore actual service quality is often also less than theoretic service quality.

At present, in order to reduce energy consumption, improve network performance simultaneously, better communication service is provided to user, industry generally adopts the mode of collaboration communication, namely user terminal is by sharing the antenna using its surrounding user terminal, is formed with multiple-input, multiple-output (English: Multiple-Input Multiple-Output; Be called for short: MIMO) wireless multi-hop cooperative communication network like system class, but, low energy consumption and high-performance can cause this wireless multi-hop cooperative communication network to be in different states respectively, such as low energy consumption may cause network performance poor, good communication service cannot be provided for user, and high-performance may cause energy consumption too high, the requirement reducing energy consumption can not be met.

Therefore, a kind of communication means that can realize balance point between the low-power consumption of wireless multi-hop cooperative communication network and high-performance is needed in prior art badly.

Summary of the invention

The embodiment of the present invention by providing communication means and the communication system of the cooperation of multi-hop in a kind of cellular network, in order to meet the demand to the communication means of the balance point that can realize between the low-power consumption of wireless multi-hop cooperative communication network and high-performance in prior art.

The embodiment of the present invention provides the communication means of multi-hop cooperation in cellular network on the one hand, comprising:

Multiple user terminals in cellular network converge multiple bunches, and each bunch in described multiple bunches comprises a bunch of head and at least one cluster node;

When the first cluster node in described multiple bunches needs to send the first data to the second cluster node, described first data are sent to first bunch of head in first bunch residing for described first cluster node by described first cluster node, described first data are sent to second bunch of head in second bunch residing for described second cluster node by described first bunch of head, described first data are sent to described second cluster node by described second bunch of head, wherein, described first cluster node belongs to different two bunches respectively from described second cluster node;

Further, the number of nodes that described first bunch of head sends a packet institute aggregators information when sending described first data is: 2≤n _p≤ n _a, wherein n _afor the number of all cluster node in described first bunch, n _pfor the cluster node quantity that described first bunch of head merges at transmission packet.

Alternatively, two bunches adjacent in described multiple bunches at least have a bunch of intermediate node, if described first bunch and described second bunch adjacent, then bunch intermediate node that described first bunch of head selects described first bunch and described second cocooning tool to have send described first data to described second bunch of hair; If or described first bunch and described second bunch non-conterminous, then described first bunch of head selects bunch intermediate node that the first adjacent cocooning tool of described first bunch and described first bunch has, the first adjacent cluster hair to described first adjacent cluster send described first data, makes described first adjacent cluster head by described first data retransmission to described second bunch of head;

Wherein, the judgement formula of described first bunch of head selection bunch intermediate node when sending described first data is: $\max U_A=\mathrm{\&alpha;\&Delta;R}-\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{P}_{r_i}{P}_i,{\left\{p_i\right\}}_{i=1}^n\&GreaterEqual;0$ With $\max \underset{P_{r_i}>0}{U_{r_i}}=(P_{r_i}-c_i)(P_{r_1},P_{r_2},...,P_{r_n}),$ Wherein, maxU _abe the maximum return of first bunch of head, for speed gain, α is the coefficient of speed gain, for described first bunch of head uses the price of described bunch intermediate node unit power, P _ibe for bunch intermediate node quote the price oneself expected time, described first bunch of head uses the quantity of power of node i, maxU _rifor the maximum return of bunch intermediate node, c _irepresent the expense of the unit power that cooperation forwarding speed consumes.

The embodiment of the present invention also provides the communication system of multi-hop cooperation in a kind of cellular network on the other hand, comprising:

Multiple bunches, restrained by the multiple user terminals in cellular network and form, each bunch in described multiple bunches comprises a bunch of head and at least one cluster node; Wherein, when the first cluster node in described multiple bunches sends the first data to the second cluster node, described first data are sent to first bunch of head in first bunch residing for described first cluster node by described first cluster node, described first data are sent to second bunch of head in second bunch residing for described second cluster node by described first bunch of head, described first data are sent to described second cluster node by described second bunch of head, wherein, described first cluster node belongs to different two bunches respectively from described second cluster node;

Further, the number of nodes that described first bunch of head sends a packet institute aggregators information when sending described first data is: 2≤n _p≤ n _a, wherein n _afor the number of all cluster node in described first bunch, n _pfor described first bunch of head is at the number of nodes of a transmission packet institute aggregators information.

Alternatively, two bunches adjacent in described multiple bunches at least have a bunch of intermediate node, and described first data are sent to second bunch of head in second bunch residing for described second cluster node by described first bunch of head, specifically comprise:

If described first bunch and described second bunch adjacent, then bunch intermediate node that described first bunch of head selects described first bunch and described second cocooning tool to have send described first data to described second bunch of hair; Or

If described first bunch and described second bunch non-conterminous, then described first bunch of head selects bunch intermediate node that the first adjacent cocooning tool of described first bunch and described first bunch has, the first adjacent cluster hair to described first adjacent cluster send described first data, makes described first adjacent cluster head by described first data retransmission to described second bunch of head;

Wherein, the judgement formula of described first bunch of head selection bunch intermediate node when sending described first data is: $\max U_A=\mathrm{\&alpha;\&Delta;R}-\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{P}_{r_i}{P}_i,{\left\{p_i\right\}}_{i=1}^n\&GreaterEqual;0$ With $\max \underset{P_{r_i}>0}{U_{r_i}}=(P_{r_i}-c_i)(P_{r_1},P_{r_2},...,P_{r_n}),$ Wherein, maxU _abe the maximum return of first bunch of head, for speed gain, α is the coefficient of speed gain, for described first bunch of head uses the price of described bunch intermediate node unit power, P _ibe for bunch intermediate node quote the price oneself expected time, described first bunch of head uses the quantity of power of node i, maxU _rifor the maximum return of bunch intermediate node, c _irepresent the expense of the unit power that cooperation forwarding speed consumes.

The one or more technical schemes provided in the embodiment of the present invention, at least have following technique effect or advantage:

1, multiple user terminals that the technical scheme provided due to the embodiment of the present invention have employed in cellular network converge multiple bunches, each bunch in multiple bunches comprises a bunch of head and at least one cluster node, when the first cluster node in multiple bunches needs to send the first data to the second cluster node, first data are sent to first bunch of head in first bunch residing for the first cluster node by the first cluster node, first data are sent to second bunch of head in second bunch residing for the second cluster node by first bunch of head, first data are sent to the second cluster node by second bunch of head, wherein, first cluster node belongs to different two bunches respectively from the second cluster node, and first bunch of head sends packet institute aggregators information number of nodes when transmission the first data is: 2≤n _p≤ n _a, wherein n _abe the number of all cluster node in first bunch, n _pfor the technical scheme of the cluster node quantity that first bunch of head merges at transmission packet, achieve the balance between the low-power consumption of wireless multi-hop cooperative communication network and high-performance, meet the demand to the communication means of the balance that can realize between the low-power consumption of wireless multi-hop cooperative communication network and high-performance in prior art.

If 2, adjacent with second bunch owing to have employed first bunch, then bunch intermediate node that first bunch of head selects first bunch and the second cocooning tool to have send the first data to second bunch of hair; If or first bunch and second bunch non-conterminous, then first bunch of head selects bunch intermediate node that the first adjacent cocooning tool of first bunch and first bunch has, the first adjacent cluster hair to the first adjacent cluster send the first data, makes the first adjacent cluster head by the first data retransmission to the second bunch head; Wherein, first bunch of head selects the judgement formula of bunch intermediate node to be when transmission the first data: $\max U_A=\mathrm{\&alpha;\&Delta;R}-\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{P}_{r_i}{P}_i,{\left\{p_i\right\}}_{i=1}^n\&GreaterEqual;0$ With $\max \underset{P_{r_i}>0}{U_{r_i}}=(P_{r_i}-c_i)(P_{r_1},P_{r_2},...,P_{r_n}),$ Wherein, maxU _abe the maximum return of first bunch of head, for speed gain, α is the coefficient of speed gain, be the price that first bunch of head uses bunch intermediate node unit power, P _ibe for bunch intermediate node quote the price oneself expected time, first bunch of head uses the quantity of power of node i, maxU _rifor the maximum return of bunch intermediate node, c _irepresent this technical scheme of expense of the unit power that cooperation forwarding speed consumes, taken into account the income of bunch head and bunch intermediate node simultaneously, so efficiently avoid the problem of selfish node in wireless multi-hop network, thus achieve the technique effect of the performance optimizing whole wireless multi-hop cooperative communication network.

Accompanying drawing explanation

In the cellular network that Fig. 1 provides for the embodiment of the present invention, multiple user terminal converges the schematic diagram of multiple bunches;

Bunch intermediate node that Fig. 2 provides for the embodiment of the present invention is as the schematic diagram of relaying.

Embodiment

The embodiment of the present invention by providing communication means and the communication system of the cooperation of multi-hop in a kind of cellular network, in order to meet the demand to the communication means of the balance point that can realize between the low-power consumption of wireless multi-hop cooperative communication network and high-performance in prior art.

Please refer to Fig. 1, Fig. 1 is that in the cellular network that provides of the embodiment of the present invention, multiple user terminal converges the schematic diagram of multiple bunches, as shown in Figure 1, in the present embodiment, have 22 user terminals in setting cellular network, these 22 user terminals converge 3 bunches, in actual applications, these 22 user terminals can be undertaken restraining the action of cluster by Clustering Routing, formed meet Poisson's point distribution bunch, do not repeat them here.

As shown in Figure 1, these 22 user terminals converge a, b and c these 3 bunches, and wherein, a bunch a comprises user terminal 1-7, and wherein user terminal 5 is bunch head of bunch a, and user terminal 1-4 and user terminal 6,7 are the cluster node of bunch a; Bunch b comprises user terminal 6-14, and wherein user terminal 9 is bunch head of bunch b, and user terminal 6-8 and user terminal 10-14 is the cluster node of bunch b; Bunch c comprises user terminal 13-22, and wherein, user terminal 18 is the cluster node of bunch c, and user terminal 13-17 and user terminal 19-22 is the cluster node of bunch c; Meanwhile, as can be seen from Figure 1, user terminal 6 and user terminal 7 are bunch intermediate node of bunch a and bunch b, and user terminal 13 and user terminal 14 are bunch intermediate node of bunch b and bunch c.

In the ensuing part of the present embodiment, be the first cluster node with user terminal 1, user terminal 5 is first bunch of head, and user terminal 22 is the second cluster node, and user terminal 18 is second bunch of head is example, carries out detailed citing and describes.

When first cluster node of bunch a sends the first data to second cluster node of bunch c, first data are sent to first bunch of head in first bunch residing for the first cluster node by the first cluster node, first data are sent to second bunch of head in second bunch residing for the second cluster node by first bunch of head, first data are sent to the second cluster node by second bunch of head, wherein, first cluster node belongs to different two bunches respectively from the second cluster node, can find out, first data are sent to the second cluster node process by the first cluster node participates in without the need to the base station in cellular network, base station can be in be closed or standby state, like this, the energy consumption of base station saving is greater than user in this period and serves as the energy consumption that via node pays, thus achieve the technique effect of low energy consumption.

Meanwhile, the number of nodes that first bunch of head sends a packet institute aggregators information when transmission the first data is: 2≤n _p≤ n _a, wherein n _abe the number of all cluster node in first bunch, n _pfor the cluster node quantity that first bunch of head merges at transmission packet.

User terminal 1-22 shown in Fig. 1 is set to the node in wireless multi-hop cooperative communication network, can derive send network node data report needed for energy consumption be

E _all=n _a(ι E _gvb+ ι ε d ^r), wherein, n _afor organizing interior all node member's numbers, ι is the length bits of a packet, E _gvbfor sending the energy that a Bit data altogether consumes on transtation mission circuit and receiving circuit, ε is channel model coefficient; If channel model adopts free space transmission model, then r value is 2; When employing channel model is multipath fading model, then the value of r is 4.

If a mat of hair send the number of nodes of a packet time institute aggregators information to be n _p, n _p≤ n _aand n _p>=2, n in real network _abe greater than the energy that then bunch head consumes is:

E _par＝(n _a-n _p+1)·(ιE _gvb+ιεd ^r)。

The energy then adopting the data receiver formula after merging to save is: wherein E _sAVfor leader cluster node is by merging the energy saving sending and obtain, cause the cost that the time delay of user data transmission sends as data fusion simultaneously.

By above-mentioned analysis, we can define the utility function of leader cluster node, wherein n _p≤ n _a, and n _a>=2.If n in real network _abe greater than then for the n taking the energy being conducive to saving oneself first bunch of head _amerge.But for user terminal, n _abe worth larger, the time delay namely merged is larger, then the interests loss of user terminal is larger.Therefore can carry out the aggregators quantity of about fascicle head with the punishment postponed, to avoid time delay larger, the dynamics of punishment is then according to the larger corresponding increase of time delay.

To sum up, the utility function of first bunch of head can be expressed as: and n _pvalue should obtain by first bunch of head effectiveness maximum time n _pvalue, therefore n _poptimal value can be expressed as: wherein 2≤n _p≤ n _a.Can find out, when a mat of hair send the first data, a mat of hair send the number of nodes of a packet institute aggregators information to be n _p, so the effectiveness that first bunch of head can be made to obtain is maximum, achieve high performance technique effect.

To sum up, the multiple user terminals that have employed in cellular network due to the communication means of multi-hop cooperation in the cellular network that the embodiment of the present invention provides converge multiple bunches, each bunch in multiple bunches comprises a bunch of head and at least one cluster node, when the first cluster node in multiple bunches needs to send the first data to the second cluster node, first data are sent to first bunch of head in first bunch residing for the first cluster node by the first cluster node, first data are sent to second bunch of head in second bunch residing for the second cluster node by first bunch of head, first data are sent to the second cluster node by second bunch of head, wherein, first cluster node belongs to different two bunches respectively from the second cluster node, and first bunch of head sends packet institute aggregators information number of nodes when transmission the first data is: 2≤n _p≤ n _a, wherein n _abe the number of all cluster node in first bunch, n _pfor the technical scheme of the cluster node quantity that first bunch of head merges at transmission packet, achieve the balance between the low-power consumption of wireless multi-hop cooperative communication network and high-performance, meet the demand to the communication means of the balance that can realize between the low-power consumption of wireless multi-hop cooperative communication network and high-performance in prior art.

Above-mentioned introduction first bunch of head sends the detailed process of the number of nodes of a packet institute aggregators information when transmission the first data, in ensuing part, send introducing a mat of hair the process how selecting relaying during the first data.

In specific implementation process, the first data sent in the process of second bunch of head at first bunch of head, if first bunch adjacent with second bunch, then first bunch of head selects bunch intermediate node between first bunch and second bunch to give this first data to second bunch of hair; If first bunch adjacent with second bunch, then first bunch of head, bunch intermediate node that first bunch and first adjacent the first adjacent cocooning tool can be selected to have, the first adjacent cluster hair to this first adjacent cluster gives this first data, make the first adjacent cluster head by the first data retransmission to the second bunch head, bunch intermediate node between being also about to two bunches sends the first data as relaying.

Please refer to Fig. 2, Fig. 2 is the schematic diagram of bunch intermediate node that provides of the embodiment of the present invention as relaying, as shown in Figure 2, namely be a bunch head A with bunch head of a bunch a (also first bunch) (also i.e. first bunch of head), bunch head of bunch b (also i.e. the first adjacent cluster) sends the first data instance for (also i.e. the first adjacent cluster head) for a bunch head B, is described in detail.

When bunch head A sends the first data to a bunch head B, its bunch intermediate node that can have by two cocooning tools to serve as relaying, to realize improving the technique effect of transmission bandwidth.

Transmission channel between setting bunch head A and bunch head B is the Gaussian white noise channel with distribution, and adopt the mode of amplification forward collaboration, from Shannon's theorems, the direct transmission rate from A to B is p _afor the through-put power of leader cluster node A, G _a,Brepresent the channel gain between two nodes, δ ²for noise power, Γ is then a constant.

If by bunch between n relay node cooperation to B send information time, the transmission rate of the relay cooperative so from A to B can be expressed as: $R_{A,r,B}^{\mathrm{AF}}={B\log }_2[1+\frac{P_A{G}_{A,B}}{\mathrm{\&Gamma;}{\mathrm{\&delta;}}^2}+\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}\frac{P_i{P}_A{G}_{r_i,B}{G}_{A,r_i}}{\mathrm{\&Gamma;}{\mathrm{\&delta;}}^2(P_i{G}_{r_i,B}+P_A{G}_{A,r_i}+{\mathrm{\&delta;}}^2)}]$ (2), P _ifor the power of via node i, for A is to the channel gain of this via node i, for the transmission channel gain of via node i to B.

The certain compensation of forward node is paid by source node (leader cluster node), solve the phenomenon of the selfishness of node, namely certain customers' terminal pursues the maximization of the resource utilization of self, when after being compensated and compensate be greater than the resource of its loss, just can as via node assist forwarding this information.

In order to ensure low-power consumption and the high-performance of wireless multi-hop cooperative communication network further, need a bunch head A to pay minimum cost and successfully forward the first data, by the gain of n bar collaborative path speed as a comparison, the i.e. income of bunch head itself, and due to the resource-constrained of via node self, the compensation that via node obtains is greater than the resource that its cooperation forwards institute's loss, and via node just can assist forwarding information, compensates and comes from leader cluster node.Therefore, the income of demand fulfillment leader cluster node is optimum, and the income that simultaneously also will meet via node is optimum, namely realizes the Nash Equilibrium of wireless multi-hop cooperative communication network.

Can be determined by above-mentioned part, the compensation of via node is paid in revenue function i.e. its gain removing obtained of bunch head A: U _a=α Δ R-M (3), wherein for speed gain, represent the speed obtained by relay node cooperation, as long as when its gain utilizing via node to obtain is greater than 0 time, just can cooperate, otherwise without the necessity cooperated; α is the coefficient of speed gain, and representative uses via node to carry out the power that cooperates, and its value is larger, and it is more that leader cluster node obtains the power that via node carries out cooperating, otherwise fewer.

All bunch heads of can releasing are paid all of via node and are compensated for as: $M=P_{r_1}{p}_1+P_{r_2}{p}_2+P_{r_3}{p}_3+...+P_{r_i}{p}_i---\left(4\right),$ Be total compensation that node uses i node to pay, wherein, represent the price that leader cluster node uses via node unit power.P _irepresent, when via node quotes the price oneself expected, leader cluster node is ready to use how many power of node i.

The revenue function of via node is its compensation obtaining leader cluster node and deducts the resource that oneself cooperation forwards institute's loss, the remaining income being oneself.When income is greater than 0, via node just can be ready that accepting cooperation forwards.Be defined as follows: c wherein _irepresent the expense of the unit power that cooperation forwarding speed consumes, i.e. the cost price of power.

Ensure low-power consumption and the high-performance of wireless multi-hop cooperative communication network, be also participant's income simultaneously for time maximum, namely ask solution when reaching Nash Equilibrium.The maximum return of leader cluster node game can be expressed as $\max U_A=\mathrm{\&alpha;\&Delta;R}-\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{P}_{r_i}{P}_i,{\left\{p_i\right\}}_{i=1}^n\&GreaterEqual;0---\left(6\right),$ This income is P _ifunction, so the unit power price that bunch head income is reported by via node decides.When the power that bunch head A uses via node considerably less, this value levels off to 0; Otherwise, work as P _iwhen becoming large, show that leader cluster node uses more via node power, therefore income can become large.But along with P _iraising, a bunch head income growth rate can be more and more slower.The expense growth rate of paying via node is then fast.

Suppose quoted by via node, we can obtain the maximum of income by differentiate, that is: as the value P obtained _iduring for negative, corresponding node can not participate in relay cooperative as via node.

Now, then one group of n solution p obtained with n equation can be obtained ^*={ p ₁, p ₂, p ₃..., p _nit is the set of optimal solution.

Solution being updated in (5) the optimum revenue function that can obtain via node is: $\max \underset{P_{r_i}>0}{U_{r_i}}=(P_{r_i}-c_i)(P_{r_1},P_{r_2},...,P_{r_n})---\left(8\right),$ In the process of a non-cooperative game, via node needs the income taking into account oneself while considering self unit power price.If the unit power price reported when via node is lower, leader cluster node can tend to the power using this nodes more, and therefore the income of relaying can increase.But when being increased to certain degree, income can arrive a maximum, and income can slowly reduce thereafter, the p that leader cluster node uses _ialso can reduce simultaneously, finally cause the decline of its income, namely decline., also namely there is this Nash Equilibrium Solution in the price that therefore existence one is optimum among this process.

By (8) formula, we can obtain we are by (8) formula be used as unknown number, differentiate is carried out to it, and establish derivative results to equal 0, can obtain that is: $P^{*}(P_{r_1},P_{r_2},P_{r_3},...,P_{r_n})+(P_r-c_i)\frac{\&PartialD;P^{*}(P_{r_1},P_{r_2},P_{r_3},...,P_{r_n})}{\&PartialD;P_{r_i}}=0,i=\mathrm{1,2},...,n---\left(9\right),$ In order to solve n unknown number in above formula, Ke Yiling $P_{r_i}^{*}=P_{r_i}^{*}({\mathrm{\&delta;}}^2,\{G_{S,r_i}\},\{G_{r_i,D}\},i=\mathrm{1,2},...n)---\left(10\right),$ Wherein δ ²for noise power, for bunch head source node is to the gain of via node, for via node is to the gain of destination node.

Formula (10) is updated in (7) and judges P _ibe worth positive and negative.If value is negative, so bunch head can not select this node as via node.On the contrary, if P _ifor just, then using the power of this via node.Therefore the set that is applicable to participating in relay cooperative can be obtained.Again this set generation time (7) formula is recalculated, each P can be calculated _icorresponding then obtained P is carefully being checked _ivalue, with the P that iterative numerical rule is all _iit is all positive number.

Like this, we just can obtain the optimum Nash Equilibrium Solution of the revenue function of bunch head and via node, in actual applications, the optimum Nash Equilibrium Solution of wireless multi-hop cooperative communication network passes through said process, substitute into the numerical value that the parameter of all kinds of needs is corresponding, as the isoparametric numerical value of power of a bunch through-put power of head A, bunch intermediate node i, we just can determine node and the number of nodes of participating in relaying, also have its corresponding optimal power.

Certainly, said process only describes bunch head A sends process from the first data to bunch head B, after a bunch head B receives the first data, bunch head B also can send the first data to a bunch head C, when selecting bunch intermediate node between bunch a and bunch b as relaying, can select according to the scheme of above-mentioned introduction equally, just repeat no more at this.

Like this, because first bunch of head selects when transmission the first data the mode of bunch intermediate node to take into account the income of bunch head and bunch intermediate node simultaneously, so efficiently avoid the problem of selfish node in wireless multi-hop network, thus achieve the technique effect of the performance optimizing whole wireless multi-hop cooperative communication network.

Based on same inventive concept, the embodiment of the present invention also provides the communication system of multi-hop cooperation in a kind of cellular network, comprising:

Multiple bunches, restrained by the multiple user terminals in cellular network and form, each bunch in multiple bunches comprises a bunch of head and at least one cluster node; Wherein, when the first cluster node in multiple bunches sends the first data to the second cluster node, first data are sent to first bunch of head in first bunch residing for the first cluster node by the first cluster node, first data are sent to second bunch of head in second bunch residing for the second cluster node by first bunch of head, first data are sent to the second cluster node by second bunch of head, wherein, the first cluster node belongs to different two bunches respectively from the second cluster node;

Further, the number of nodes that first bunch of head sends a packet institute aggregators information when transmission the first data is: 2≤n _p≤ n _a, wherein n _abe the number of all cluster node in first bunch, n _pfor first bunch of head is at the number of nodes of a transmission packet institute aggregators information.

In specific implementation process, two bunches adjacent in multiple bunches at least have a bunch of intermediate node, and the first data are sent to second bunch of head in second bunch residing for the second cluster node by first bunch of head, specifically comprise:

If first bunch adjacent with second bunch, then bunch intermediate node that first bunch of head selects first bunch and the second cocooning tool to have send the first data to second bunch of hair; Or

If first bunch and second bunch non-conterminous, then first bunch of head selects bunch intermediate node that the first adjacent cocooning tool of first bunch and first bunch has, and the first adjacent cluster hair to the first adjacent cluster send the first data, makes the first adjacent cluster head by the first data retransmission to the second bunch head;

Wherein, first bunch of head selects the judgement formula of bunch intermediate node to be when transmission the first data: $\max U_A=\mathrm{\&alpha;\&Delta;R}-\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{P}_{r_i}{P}_i,{\left\{p_i\right\}}_{i=1}^n\&GreaterEqual;0$ With $\max \underset{P_{r_i}>0}{U_{r_i}}=(P_{r_i}-c_i)(P_{r_1},P_{r_2},...,P_{r_n}),$ Wherein, maxU _abe the maximum return of first bunch of head, for speed gain, α is the coefficient of speed gain, be the price that first bunch of head uses bunch intermediate node unit power, P _ibe for bunch intermediate node quote the price oneself expected time, first bunch of head uses the quantity of power of node i, maxU _rifor the maximum return of bunch intermediate node, c _irepresent the expense of the unit power that cooperation forwarding speed consumes.

Technical scheme in the invention described above embodiment, at least has following technique effect or advantage:

1, multiple user terminals that the technical scheme provided due to the embodiment of the present invention have employed in cellular network converge multiple bunches, each bunch in multiple bunches comprises a bunch of head and at least one cluster node, when the first cluster node in multiple bunches needs to send the first data to the second cluster node, first data are sent to first bunch of head in first bunch residing for the first cluster node by the first cluster node, first data are sent to second bunch of head in second bunch residing for the second cluster node by first bunch of head, first data are sent to the second cluster node by second bunch of head, wherein, first cluster node belongs to different two bunches respectively from the second cluster node, and first bunch of head sends packet institute aggregators information number of nodes when transmission the first data is: 2≤n _p≤ n _a, wherein n _abe the number of all cluster node in first bunch, n _pfor the technical scheme of the cluster node quantity that first bunch of head merges at transmission packet, achieve the balance between the low-power consumption of wireless multi-hop cooperative communication network and high-performance, meet the demand to the communication means of the balance that can realize between the low-power consumption of wireless multi-hop cooperative communication network and high-performance in prior art.

If 2, adjacent with second bunch owing to have employed first bunch, then bunch intermediate node that first bunch of head selects first bunch and the second cocooning tool to have send the first data to second bunch of hair; If or first bunch and second bunch non-conterminous, then first bunch of head selects bunch intermediate node that the first adjacent cocooning tool of first bunch and first bunch has, the first adjacent cluster hair to the first adjacent cluster send the first data, makes the first adjacent cluster head by the first data retransmission to the second bunch head; Wherein, first bunch of head selects the judgement formula of bunch intermediate node to be when transmission the first data: $\max U_A=\mathrm{\&alpha;\&Delta;R}-\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{P}_{r_i}{P}_i,{\left\{p_i\right\}}_{i=1}^n\&GreaterEqual;0$ With $\max \underset{P_{r_i}>0}{U_{r_i}}=(P_{r_i}-c_i)(P_{r_1},P_{r_2},...,P_{r_n}),$ Wherein, maxU _abe the maximum return of first bunch of head, for speed gain, α is the coefficient of speed gain, be the price that first bunch of head uses bunch intermediate node unit power, P _ibe for bunch intermediate node quote the price oneself expected time, first bunch of head uses the quantity of power of node i, maxU _rifor the maximum return of bunch intermediate node, c _irepresent this technical scheme of expense of the unit power that cooperation forwarding speed consumes, taken into account the income of bunch head and bunch intermediate node simultaneously, so efficiently avoid the problem of selfish node in wireless multi-hop network, thus achieve the technique effect of the performance optimizing whole wireless multi-hop cooperative communication network.

Those skilled in the art should understand, embodiments of the invention can be provided as method, system or computer program.Therefore, the present invention can adopt the form of complete hardware embodiment, completely software implementation or the embodiment in conjunction with software and hardware aspect.And the present invention can adopt in one or more form wherein including the upper computer program implemented of computer-usable storage medium (including but not limited to magnetic disc store, CD-ROM, optical memory etc.) of computer usable program code.

The present invention describes with reference to according to the flow chart of the method for the embodiment of the present invention, equipment (system) and computer program and/or block diagram.Should understand can by the combination of the flow process in each flow process in computer program instructions realization flow figure and/or block diagram and/or square frame and flow chart and/or block diagram and/or square frame.These computer program instructions can being provided to the processor of all-purpose computer, special-purpose computer, Embedded Processor or other programmable data processing device to produce a machine, making the instruction performed by the processor of computer or other programmable data processing device produce device for realizing the function of specifying in flow chart flow process or multiple flow process and/or block diagram square frame or multiple square frame.

These computer program instructions also can be stored in can in the computer-readable memory that works in a specific way of vectoring computer or other programmable data processing device, the instruction making to be stored in this computer-readable memory produces the manufacture comprising command device, and this command device realizes the function of specifying in flow chart flow process or multiple flow process and/or block diagram square frame or multiple square frame.

These computer program instructions also can be loaded in computer or other programmable data processing device, make on computer or other programmable devices, to perform sequence of operations step to produce computer implemented process, thus the instruction performed on computer or other programmable devices is provided for the step realizing the function of specifying in flow chart flow process or multiple flow process and/or block diagram square frame or multiple square frame.

Obviously, those skilled in the art can carry out various change and modification to the present invention and not depart from the spirit and scope of the present invention.Like this, if these amendments of the present invention and modification belong within the scope of the claims in the present invention and equivalent technologies thereof, then the present invention is also intended to comprise these change and modification.

Claims (4)

1. a communication means for multi-hop cooperation in cellular network, is characterized in that, comprising:

Multiple user terminals in cellular network converge multiple bunches, and each bunch in described multiple bunches comprises a bunch of head and at least one cluster node;

When the first cluster node in described multiple bunches needs to send the first data to the second cluster node, described first data are sent to first bunch of head in first bunch residing for described first cluster node by described first cluster node, described first data are sent to second bunch of head in second bunch residing for described second cluster node by described first bunch of head, described first data are sent to described second cluster node by described second bunch of head, wherein, described first cluster node belongs to different two bunches respectively from described second cluster node;

Further, the number of nodes that described first bunch of head sends a packet institute aggregators information when sending described first data is: 2≤n _p≤ n _a, wherein n _afor the number of all cluster node in described first bunch, n _pfor the cluster node quantity that described first bunch of head merges at transmission packet.

2. the method for claim 1, it is characterized in that, two bunches adjacent in described multiple bunches at least have a bunch of intermediate node, and described first data are sent to second bunch of head in second bunch residing for described second cluster node by described first bunch of head, specifically comprise:

If described first bunch and described second bunch adjacent, then bunch intermediate node that described first bunch of head selects described first bunch and described second cocooning tool to have send described first data to described second bunch of hair; Or

If described first bunch and described second bunch non-conterminous, then described first bunch of head selects bunch intermediate node that the first adjacent cocooning tool of described first bunch and described first bunch has, the first adjacent cluster hair to described first adjacent cluster send described first data, makes described first adjacent cluster head by described first data retransmission to described second bunch of head;

Wherein, the judgement formula of described first bunch of head selection bunch intermediate node when sending described first data is: $\max U_A=\mathrm{\&alpha;\&Delta;R}-\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{P}_{r_i}{P}_i,{\left\{p_i\right\}}_{i=1}^n\&GreaterEqual;0$ With $\max \underset{P_{r_i}>0}{U_{r_i}}=(P_{r_i}-c_i)(P_{r_1},P_{r_2},...,P_{r_n}),$ Wherein, maxU _abe the maximum return of first bunch of head, for speed gain, α is the coefficient of speed gain, for described first bunch of head uses the price of described bunch intermediate node unit power, P _ifor first bunch of head described in when described bunch of intermediate node quotes the price oneself expected uses the quantity of power of node i, maxU _rifor the maximum return of bunch intermediate node, c _irepresent the expense of the unit power that cooperation forwarding speed consumes.

3. a communication system for multi-hop cooperation in cellular network, is characterized in that, comprising:

Multiple bunches, restrained by the multiple user terminals in cellular network and form, each bunch in described multiple bunches comprises a bunch of head and at least one cluster node; Wherein, when the first cluster node in described multiple bunches sends the first data to the second cluster node, described first data are sent to first bunch of head in first bunch residing for described first cluster node by described first cluster node, described first data are sent to second bunch of head in second bunch residing for described second cluster node by described first bunch of head, described first data are sent to described second cluster node by described second bunch of head, wherein, described first cluster node belongs to different two bunches respectively from described second cluster node;

Further, the number of nodes that described first bunch of head sends a packet institute aggregators information when sending described first data is: 2≤n _p≤ n _a, wherein n _afor the number of all cluster node in described first bunch, n _pfor described first bunch of head is at the number of nodes of a transmission packet institute aggregators information.

4. system as claimed in claim 3, it is characterized in that, two bunches adjacent in described multiple bunches at least have a bunch of intermediate node, if described first bunch and described second bunch adjacent, then bunch intermediate node that described first bunch of head selects described first bunch and described second cocooning tool to have send described first data to described second bunch of hair; If or described first bunch and described second bunch non-conterminous, then described first bunch of head selects bunch intermediate node that the first adjacent cocooning tool of described first bunch and described first bunch has, the first adjacent cluster hair to described first adjacent cluster send described first data, makes described first adjacent cluster head by described first data retransmission to described second bunch of head;

Wherein, the judgement formula of described first bunch of head selection bunch intermediate node when sending described first data is: $\max U_A=\mathrm{\&alpha;\&Delta;R}-\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{P}_{r_i}{P}_i,{\left\{p_i\right\}}_{i=1}^n\&GreaterEqual;0$ With $\max \underset{P_{r_i}>0}{U_{r_i}}=(P_{r_i}-c_i)(P_{r_1},P_{r_2},...,P_{r_n}),$ Wherein, maxU _abe the maximum return of first bunch of head, for speed gain, α is the coefficient of speed gain, for described first bunch of head uses the price of described bunch intermediate node unit power, P _ibe for bunch intermediate node quote the price oneself expected time, described first bunch of head uses the quantity of power of node i, maxU _rifor the maximum return of bunch intermediate node, c _irepresent the expense of the unit power that cooperation forwarding speed consumes.