CN101141388B - Method for implementing optimization energy consumption in Ad hoc network - Google Patents

Abstract

The present invention relates to a method for realizing optimized energy consumption in the Ad hoc network. The present invention proposes an energy model with cross-layer design based on the analyzing the characteristics of the Ad hoc network and by combining the condition of the energy consumption on each layer, the model firstly considers the energy consumption of the physical layer, the data link layer and the network layer of the node, thereby to establish the energy model to each node by utilizing the optimized theory, meanwhile, because the communication of the data information in the Ad hoc network is forwarded by multi-hop among the nodes, when a source node operates the forwarding to a target node for the best path, not only the energy consumption of each node on the path is required to be considered, but also the energy consumption of the complete path is required to be considered, finally the optimal path energy model is established according to the principle of least hop and the least energy consumption on the complete one path, thereby, to avoid the network fault and the impact on the rate of the data information transmission caused by the excessive energy consumption.

Description

Realize optimizing the method for energy consumption in a kind of Ad hoc network

Technical field

The invention belongs to field of wireless, realize optimizing the method for energy consumption in particularly a kind of Ad hoc network.

Background technology

In Ad hoc network, at the power delivery situation of a certain node S, within the transmission range of S, mainly be subjected in the influence of the signal transmission that is subjected to neighbor node greatlyyer, so the power delivery distribution situation of node S is as shown in Figure 1.The characteristics of Ad Hoc network are that each node is equal, can move freely, and communicate by wireless channel.Because portable terminal itself is battery-powered, therefore, people wish that generally portable terminal (as notebook computer etc.) can continuous operation 4-6 under the situation of not charging individual hour.At present, reach this target and also have certain difficulty, this mainly is because the cause of the finite capacity of battery.In the period of past 30, the battery manufacturing technology is the progress of making a breakthrough property never.Because be subjected to the restriction of manufacturing technology, the battery capacity of Unit Weight is difficult to be improved largely.Simultaneously,, the demand of electric energy is improved constantly, therefore in Ad Hoc network, adopt various power-saving mechanisms to become a kind of main means that prolong its operating time along with the lifting of mobile terminal performance and the reinforcement of function.Analyze from Ad hoc network hierarchical structure, the energy consumption in the whole network mainly concentrates on physical layer, data link layer and network layer.Physical layer mainly is that each node receives the received power of neighbor node when sending signal and the consumption of some hardware devices (CPU, LCD etc.) of node own.On the basis of the DCF (Distributed Coordination Function) that data link layer mainly is based on the IEEE 802.11 of MAC layer basic access way of sharing wireless channel under network configuration independently.When certain node (being in the Sleep state) will operate as normal, want the monitoring wireless shared channel whether occupied earlier, if occupied then will continue to monitor and wait for several random time fragments, coming with this is that busy channel transmission packet is prepared; Perhaps work as node and be in the Active state, node normally sends packet.Therefore, in this one deck the energy consumption of node mainly to be in the Active state by node still be Sleep state decision.The energy consumption of network layer mainly concentrates on the paths that multi-hop is transmitted, and comprises setting up the path and safeguarding the path process.

Summary of the invention

The objective of the invention is analyzing on Ad hoc network characteristics and the catabiotic basis of network structure at all levels, transmission of wireless signals model in the combining wireless network, take all factors into consideration to set up in a kind of new Ad hoc network and stride the level energy model, realize optimum energy consumption method in a kind of Ad hoc network and provide.

To achieve these goals, step of the present invention is:

First step: source node S is added a data item cost and is preserved energy consumption E (S) in the packet RREQ that will send;

Second step: when neighbor node i received packet RREQ, the content of taking out data item cost was made as cost _Old, and in conjunction with the energy consumption E (i) of this node, more the content of new data item cost is cost _New(cost _New=cost _Old+ E (i)), record preceding paragraph node is S, and transmits packet RREQ to the next neighbor node of i successively, and sets up the reverse path that leads to source node to source node S transmission packet RREP;

Third step: carry out second step successively, when intermediate node j receives from different three neighbor node k, when l, packet RREQ that the m node sends, (establishing corresponding content is cost to take out corresponding data item cost respectively _k, cost _l, cost _m), if these three values have nothing in common with each other, at first judge this three values, obtain the minimum data item cost that is made as _Min, carry out following processes again:

The first step: as data item cost _MinEqual data item cost _kThe time, node j is the data item cost=cost among the new data packets RREQ more _k+ E (j), and record preceding paragraph node k transmit packet RREQ simultaneously and give next node, and upstream nodes k sends packet RREP and set up the path of leading to upstream node, wherein the energy consumption of E (j) expression node j;

Second step: as data item cost _MinEqual data item cost _lThe time, node j is the data item cost=cost among the new data packets RREQ more _l+ E (j), and record preceding paragraph node l transmit packet RREQ simultaneously and give next node, and upstream nodes l transmission packet RREP sets up the path of leading to upstream node;

The 3rd step: as data item cost _MinEqual data item cost _mThe time, node j is the data item cost=cost among the new data packets RREQ more _m+ E (j), and record preceding paragraph node m transmit packet RREQ simultaneously and give next node, and upstream nodes m transmission packet RREP sets up the path of leading to upstream node;

If data item cost _k=cost _l=cost _mThen choose one of them upstream node m as j, record preceding paragraph node m transmits packet RREQ simultaneously and gives next node, and upstream nodes m transmission packet RREP sets up the path of leading to upstream node;

The 4th step: carry out third step successively, when destination node d receives the packet RREQ that neighbor node n sends, the data content in the data item cost is exactly that the whole paths of the preceding paragraph node from the source node S to the destination node consumes is gross energy sum data item cost _D-1, new data item cost=cost more _D-1+ E (d), record preceding paragraph node n, and upstream nodes sends packet RREP and set up the path of leading to upstream node, whole process finishes, the energy consumption of E (d) expression node d wherein, node S sets up successfully then described energy consumption to the path of node d simultaneously

$E\left(S\right)=\mathrm{\α}{E}_{\mathrm{active}}+(1-\mathrm{\α})E_{\mathrm{sleep}}=\mathrm{\α}\×(P_{\mathrm{it}}+\underset{j=1}{\overset{k_i}{\mathrm{\Σ}}}\frac{P_{\mathrm{jt}}{G}_{\mathrm{jt}}{G}_{\mathrm{ir}}{h_{\mathrm{jt}}}^2{h_{\mathrm{ir}}}^2}{{\left(D_{\mathrm{ij}}\right)}^{4}L})\×$

$\frac{8\×\mathrm{packetsize}}{\mathrm{bandwidth}}+P)+(1-\mathrm{\α})\×Q$

The present invention is for can normally sending from the source node to the destination node in the network before the packet, guarantee to set up the path of an optimum, the constraints that satisfy in this path is exactly that the energy consumption of node on this path is less as far as possible, and the overall power consumption in path is minimum, but might not require the jumping figure on the path minimum, therefore, (jumping figure is minimum for the present invention and path establishment method in the past, do not consider energy) difference to some extent, the present invention mainly is based on the routing request packet RREQ that sends to destination node from source node in the network, comprise a field cost in this RREQ bag, write down energy consumption on the entire path with this, when intermediate node will be transmitted this RREQ bag, relatively receive the field cost of RREQ bag one by one from upstream node (adjacent) with this intermediate node, select minimum energy consumption to upgrade this RREQ bag, be established to the path of selected upstream node simultaneously, this process by that analogy, up to destination node, to reach optimum energy consumption.

Description of drawings

Fig. 1 is an Ad hoc network power mode topological diagram.

Embodiment

The present invention is described in further detail below in conjunction with accompanying drawing.

The present invention includes two parts: first sets up energy model to each node, second portion is on the basis of first, sets up a kind of optimum energy consumption model that satisfies energy consumption the jumping figure minimum and path less (satisfying energy consumption jumping figure the minimum minimum and path simultaneously is a np problem) from the source node to the destination node.

Following condition is at first set in the foundation of above-mentioned model:

(1) primary power of each node in the network all equates.

(2) hardware configuration of each node itself is identical with device, thereby thinks that the energy that is consumed is identical (being made as P).

(3) each node is in two states under the situation of whole topology of networks: active state (active) (normal operating conditions) and sleep state (sleep).

(4) when node is in the sleep state, the channel of continue to monitor sharing comes on one's own initiative busy channel to send packet with this and may relate to the consumption of energy, thereby thinks that these energy also are the identical Q that is.

(5) each node sends length of data package packetsize in physical layer, and the bandwidth bandwidth of channel is identical with transmitted power Pt.

(6) in order to guarantee the efficient of communications between node and the node, the distance between adjacent two nodes must not surpass D, if surpass D, thinks that then receiving node obtains the packet that transmits less than sending node.

Model construction:

The transmission of wireless signals model

The transmission of wireless signals model mainly is divided three classes in current Ad hoc network: Free Space model, Two Ray Ground Reflection model and based on the mixed model of above two kinds of model advantages.

1, Free Space model

The assumed condition of this model is: receiving node and sending node are all within the transmission range of correspondence.It is a circle that this model has been represented the transmission range of sending node substantially.If receiving node is within this scope, sending node just receives all packets, otherwise abandons all packets.

$P_r=\frac{P_t\·G_t\·G_r\·{\mathrm{\λ}}^2}{{\left(4\mathrm{\π}\right)}^2{D}^2\·L}...\left(1\right)$

P wherein _t: the transmitted power of sending node, G _t:: the antenna gain of sending node, G _r: the antenna gain of receiving node, λ: the wavelength of wireless transmission medium, D: the distance between sending node and the receiving node, L: the loss parameter of communication system is (according to the difference of transmission medium, the numerical value of L is also inequality, and the numerical value of L elects 1 as in Ad hoc network).

2, Two Ray Reflection model

Situation about also seldom using in the mode is exactly that the point of two nodes is just within the other side's transmission range.Two Ray Reflection model has been considered two kinds of situations in path of direct transmission path and ground return.Use this model can under the situation of very long distance between the node, can dope the received power of receiving node very accurately than Free Space model.

$P_r=\frac{P_t\·G_t\·G_r\·h_t^2\·h_r^2}{D^4\·L}...\left(2\right)$

Parameter meaning in the formula is as (1) formula.H wherein _r, h _tBe respectively the antenna height of receiving node and sending node.

3, mixed model

Take all factors into consideration power consumption aspect, Two Ray Reflection model is confused than comparatively fast than Free Space model.But Two Ray Reflection model is because the influencing each other of the antenna that receives contact and sending node, and does not reach good effect in the short scope of distance between node.Free Space model shows good performance in this case on the contrary.Therefore we are provided with a cross distance d _cRepresent the transition value of distance, thereby obtain a mixed model.

(1) D＜D _cThe time, with (1) formula, the D in the formula is changed into D _c

(2) D＞D _cThe time, with (2) formula

(3) D=D _c=(4 π h _th _rDuring)/λ, can use (1), (2) formula obtains identical value.

The foundation of model:

First: the energy consumption model of node

Suppose that a certain node is i, the energy consumption of this node is E (i), and by at all levels analysis of Ad hoc network, the consumption of each node energy mainly concentrates on three levels.The physical layer neighbor node sends the received power of signal, and data link layer relates generally to the two states sleep and the active of node.When the state of node was sleep, node will be monitored shared channel, and busy channel prepares to active (operate as normal) for the acitve status transition, thereby has consumed energy; When the state of node was acitve, node for data forwarding bag operate as normal was also wanted consumed energy.Network layer is transmitted packet then seeking path (set up path and safeguard path).

Therefore, E (i)=α E _Active+ (1-α) E _Sleep

E wherein _Active=P _t* time+P _r* time+P, E _Sleep=Q, α is the rewards and punishments coefficient.Divide three kinds of energy consumption situations that situation is come analysis-by-synthesis this node at all levels:

(1) when mainly consuming in the route of network layer, the energy of this node of α=1 expression sets up process, the received power of maintenance process and physical layer transmission of wireless signals model.

(2) when being in the sleep state, to monitor main consumption node in data link layer of the energy of this node of α=0 expression the busy extent of Physical Shared Channel.

(3) energy consumption of when 1＞α＞0, representing node at this moment this node be in the active state now, when being about to carry out the transition to the sleep state, physical layer just, the consumption of the gross energy of data link layer and three levels of network layer.

Second portion: a certain source node from network is to the energy consumption model of optimal path the destination node, and this part is based on that the energy consumption model of first proposes.

When exist in the whole Ad hoc network one from a certain source node S when N jumps path r to destination node d (this path is through 1,2 ... j ... during the n node) total power consumption E (r).

$E\left(r\right)=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}E\left(i\right)...\left(3\right)$

Therefore, when the route that exists the R bar from source node S to destination node d in the network,, from remaining path, selecting the less principle of path jumping figure then, selecting the path of an optimum according to the path of at first considering energy consumption minimum in all paths.

$E=\underset{r\∈R}{\min }E\left(i\right)...\left(4\right)$

Finding the solution of model:

First's model is found the solution:

Generally speaking, the energy theorem Energy=Power * time of each node, promptly to send or receive the energy that a bag consumed be by the time decision of this node transmission or received power and pack processing for each node.

Characteristics according to Ad hoc networked physics layer channel draw

The time of pack processing is by the bandwidth decision of the size that sends packet and this packet.

Draw, $E_{\mathrm{active}}=P_{t*}\mathrm{time}+P_{r*}\mathrm{time}+P=(P_t+P_r)\×\mathrm{time}+P=(P_t+P_r)\×\frac{8\×\mathrm{packetsize}}{\mathrm{bandwidth}}+P...\left(5\right)$

P wherein _rAnd P _tCan draw according to front transmission of wireless signals Model Calculation.The result of three kinds of corresponding three kinds of various computing of mode.(the following derivation of equation is an example with two Ray Reflection model) in conjunction with the characteristics of Ad hoc network, each node just can access the received power of this neighbor node signal transmitted as long as within the transmission range D of neighbor node.If the neighbor node of node i is j, i has k _iIndividual neighbor node.Thereby E _ActiveFormula is further revised.Modification draws to (5) formula:

$E_{\mathrm{active}}=(P_t+P_r)\×\frac{8\×\mathrm{packetsize}}{\mathrm{bandwidth}}+P=(P_{\mathrm{it}}+\underset{j=1}{\overset{k_i}{\mathrm{\Σ}}}\frac{P_{\mathrm{jt}}{G}_{\mathrm{jt}}{G}_{\mathrm{ir}}{h_{\mathrm{jt}}}^2{h_{\mathrm{ir}}}^2}{{\left(D_{\mathrm{ij}}\right)}^{4}L})\×$

$\frac{8\&times;\mathrm{packetsize}}{\mathrm{bandwidth}}+P(0<D_{\mathrm{ij}}\&le;D,1\&le;k_i\&le;N)...\left(6\right)$

P wherein _It, G _Ir, h _IrBe the transmitted power of node i, antenna gain and height, D _IjBe the distance of node i and neighbor node j, P _Jt, G _Jt, h _JtBe the transmitted power of neighbor node j, antenna gain and height.Therefore the total energy that draws node i and consumed: E (i)=α E _Active+ (1-α)

$E_{\mathrm{sleep}}=\mathrm{\&alpha;}\&times;(P_{\mathrm{it}}+\underset{j=1}{\overset{k_i}{\mathrm{\&Sigma;}}}\frac{P_{\mathrm{jt}}{G}_{\mathrm{jt}}{G}_{\mathrm{ir}}{h_{\mathrm{it}}}^2{h_{\mathrm{ir}}}^2}{{\left(d{}_{\mathrm{ij}}\right)}^{2}L})\&times;\frac{8\&times;\mathrm{packetsize}}{\mathrm{bandwidth}}+P)+(1-\mathrm{\&alpha;})\&times;Q...\left(7\right)$

0＜D wherein _Ij≤ D, 1≤k _i≤ N.

The second portion model is found the solution:

When path r that N jumps, the energy consumption on this corresponding path $E\left(r\right)=\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}E\left(i\right)$

$=\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}({\mathrm{\&alpha;E}}_{\mathrm{active}}+(1-\mathrm{\&alpha;})E_{\mathrm{sleep}})=\mathrm{\&alpha;}\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{P}_{\mathrm{it}}\&times;\frac{8\&times;\mathrm{packetsize}}{\mathrm{bandwidth}}+\mathrm{\&alpha;}\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}\underset{j=1}{\overset{k_i}{\mathrm{\&Sigma;}}}\frac{P_{\mathrm{jt}}{G}_{\mathrm{jt}}{G}_{\mathrm{ir}}{h_{\mathrm{jt}}}^2{h_{\mathrm{ir}}}^2}{{\left(D_{\mathrm{ij}}\right)}^{4}L}$

$\&times;\frac{8\&times;\mathrm{packetsize}}{\mathrm{bandwidth}}+\mathrm{\&alpha;}\&CenterDot;n\&CenterDot;P+(1-\mathrm{\&alpha;})\&CenterDot;Q$

$(0<D_{\mathrm{ij}}\&le;D,1\&le;k_i\&le;N)...\left(8\right)$

In order to simplify above-mentioned model, the antenna height of supposing each node in Ad hoc network all is h, and the gain of antenna all is G, and the transmitted power of each node all is P _t, then the result that draws of (8) formula is as follows:

$E\left(r\right)=\mathrm{\&alpha;}\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{P}_{\mathrm{it}}\&times;\frac{8\&times;\mathrm{packetsize}}{\mathrm{bandwidth}}+\mathrm{\&alpha;}\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}\underset{j=1}{\overset{k_i}{\mathrm{\&Sigma;}}}\frac{P_{\mathrm{jt}}{G}^2{h}^4}{{\left(D_{\mathrm{ij}}\right)}^{4}L}\&times;$

$\frac{8\&times;\mathrm{packetsize}}{\mathrm{bandwidth}}+\mathrm{\&alpha;nP}+(1-\mathrm{\&alpha;})\&times;Q=\mathrm{\&alpha;}\&CenterDot;n\&CenterDot;P_t\&times;\frac{8\&times;\mathrm{packetsize}}{\mathrm{bandwidth}}+\mathrm{\&alpha;}\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}\underset{j=1}{\overset{k_i}{\mathrm{\&Sigma;}}}\frac{P_t{G}^2{h}^4}{{\left(D_{\mathrm{ij}}\right)}^{4}L}\&times;$

$\frac{8\&times;\mathrm{packetsize}}{\mathrm{bandwidth}}+\mathrm{\&alpha;}\&CenterDot;n\&CenterDot;P+(1-\mathrm{\&alpha;})\&CenterDot;Q(0<D_{\mathrm{ij}}\&le;D,1\&le;k_i\&le;N)...\left(9\right)$

Simultaneously can be according to (9) formula, the result of (4) formula is transformed, derive the minimum and fewer optimal path of jumping figure of the energy consumption that satisfies the path, as follows:

$E=\underset{r\&Element;R}{\min }E\left(i\right)=\underset{r\&Element;R}{\min }\{\mathrm{\&alpha;}\&CenterDot;n\&CenterDot;P_t\&times;\frac{8\&times;\mathrm{packetsize}}{\mathrm{bandwidth}}+\mathrm{\&alpha;}\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}\underset{j=1}{\overset{k_i}{\mathrm{\&Sigma;}}}\frac{P_t{G}^2{h}^4}{{\left(D_{\mathrm{ij}}\right)}^{4}L}\&times;$

$\frac{8\&times;\mathrm{packetsize}}{\mathrm{bandwidth}}+\mathrm{\&alpha;}\&CenterDot;n\&CenterDot;P+(1-\mathrm{\&alpha;})\&CenterDot;Q\}(0<D_{\mathrm{ij}}\&le;D,1\&le;k_i\&le;N)...\left(10\right)$

Thereby optimal path finds the solution mainly that number by node and neighbor node around node transmission range and the node determines as can be seen.Because it is more frequent that Ad hoc topology of networks changes, all to analyze and calculate according to the topological structure of real network at the number of the transmission range neighbor node of node and node.Free Space model and mixed model in this way also can draw the energy model of first and second portion respectively.

The present invention in conjunction with the situation that goes up energy consumption at all levels in the network, has proposed a kind of energy model of striding layer design on the basis of the characteristics of analyzing Ad hoc network, realize optimum energy consumption method in a kind of Ad hoc network and provide.This model has been considered earlier the physical layer of node emphatically, the energy consumption of data link layer and network layer, thereby utilize Optimum Theory to come each node is set up energy model, simultaneously since in the Ad hoc network communication of data message all carry out multi-hop and transmit by node and node, therefore transmit when seeking best path to destination node at source node, not only to consider simultaneously the energy consumption of each node on the path, and to consider energy consumption on the entire path, therefore finally according to minimum of the energy consumption on the whole paths and the less principle of jumping figure, set up the optimal path energy model, thereby avoid energy too much to consume the efficient that the network that is brought ruptures and influences transmitting data information.

The content that is not described in detail in this specification belongs to this area professional and technical personnel's known prior art.

Claims (1)

1. realize optimizing the method for energy consumption in the Ad hoc network, the step that is adopted is:

First step: source node S is added a data item cost and is preserved energy consumption E (S) in the packet RREQ that will send;

Second step: when neighbor node i received packet RREQ, the content of taking out data item cost was made as cost _Old, and in conjunction with the energy consumption E (i) of this node, more the content of new data item cost is cost _New=cost _Old+ E (i), record preceding paragraph node is S, and transmits packet RREQ to the next neighbor node of i successively, and sets up the reverse path that leads to source node to source node S transmission packet RREP;

Third step: carry out second step successively, when intermediate node j receives from different three neighbor node k, when l, packet RREQ that the m node sends, taking out corresponding data item respectively is cost _k, cost _l, cost _mIf these three values have nothing in common with each other, at first judge this three values, obtain the minimum data item cost that is made as _Min, carry out following processes again:

The first step: as data item cost _MinEqual data item cost _kThe time, node j is the data item cost=cost among the new data packets RREQ more _k+ E (j), and record preceding paragraph node k transmit packet RREQ simultaneously and give next node, and upstream nodes k sends packet RREP and set up the path of leading to upstream node, wherein the energy consumption of E (j) expression node j;

Second step: as data item cost _MinEqual data item cost _lThe time, node j is the data item cost=cost among the new data packets RREQ more _l+ E (j), and record preceding paragraph node l transmit packet RREQ simultaneously and give next node, and upstream nodes l transmission packet RREP sets up the path of leading to upstream node;

The 3rd step: as data item cost _MinEqual data item cost _mThe time, node j is the data item cost=cost among the new data packets RREQ more _m+ E (j), and record preceding paragraph node m transmit packet RREQ simultaneously and give next node, and upstream nodes m transmission packet RREP sets up the path of leading to upstream node;

If data item cost _k=cost _l=cost _mChoose one of them upstream node m as j, record preceding paragraph node m transmits packet RREQ simultaneously and gives next node, and upstream nodes m transmission packet RREP sets up the path of leading to upstream node;

The 4th step: carry out third step successively, when destination node d receives the packet RREQ that neighbor node n sends, the data content in the data item cost is exactly the gross energy sum data item cost that the whole paths of the preceding paragraph node from the source node S to the destination node is consumed _D-l, new data item cost=cost more _D-l+ E (d), record preceding paragraph node n, and upstream nodes sends packet RREP and set up the path of leading to upstream node, whole process finishes, the energy consumption of E (d) expression node d wherein, node S sets up successfully then described energy consumption to the path of node d simultaneously

$E\left(S\right)=\mathrm{\&alpha;}{E}_{\mathrm{active}}+(1-\mathrm{\&alpha;})E_{\mathrm{sleep}}=\mathrm{\&alpha;}\&times;(P_{\mathrm{it}}+\underset{j=1}{\overset{k_i}{\mathrm{\&Sigma;}}}\frac{P_{\mathrm{jt}}{G}_{\mathrm{jt}}{G}_{\mathrm{ir}}{h_{\mathrm{jt}}}^2{h_{\mathrm{ir}}}^2}{{\left(D_{\mathrm{ij}}\right)}^{4}L})\&times;$

$\frac{8\&times;\mathrm{packetsize}}{\mathrm{bandwidth}}+P)+(1-\mathrm{\&alpha;})\&times;Q$

Wherein: α is rewards and punishments coefficient, E _ActiveBe the energy consumption of node normal operating conditions, E _SleepBe the energy consumption of node sleep state, P _It, G _Ir, h _IrBe the transmitted power of node i, antenna gain and height, D _IjBe the distance of node i and neighbor node j, P _Jt, G _Jt, h _JtBe the transmitted power of neighbor node j, antenna gain and height, L is the loss parameter of communication system, packetsize is a length of data package, bandwidth is the bandwidth of channel, and P is the energy consumption of the hardware configuration of node own, and Q is the energy consumption that node originally is in sleeping dormancy state; 0≤α≤1,0＜D _Ij≤ D, 1≤k _i≤ N, D represent the longer transmission distance between the adjacent node, and N represents the jumping figure of node on this path.

Images