CN102711211A - 6LoWPAN-based energy-saving data transmitting method for wireless sensor network - Google Patents

Abstract

The invention provides a 6LoWPAN (6Low-power Wireless Personal Area Network)-based energy-saving data transmission method for a wireless sensor network. An optimal TAN (Temporary Assembling Node) needs to be found between an information source and an information sink; firstly, the information source divides an IPv6 (Internet Protocol Version 6) into fragmentations, then transmits the fragmentations to the TAN one by one through a method of MUR, namely Mesh-under Routing, of the 6LoWPAN protocol; and the TAN assembles together the received fragmentations to the original IPv6 data packet, then fragments the IPv6 data packet, and transmits the fragmentations to the information sink node one by one through the MUR. Therefore the total energy consumption of the node transmitting data packet is reduced. The method of finding the TAN is the key of the invention, and the core of the invention is formula (19). By adopting the method provided by the invention, the energy consumption of the node transmitting data packet, the retransmission times of the data packet and the communication delay-time in the wireless sensor network are all reduced.

Description

A kind of wireless transducer network energy saving data transferring method based on 6LoWPAN

Technical field

The present invention relates to a kind of energy-conservation data transferring method, be applicable to wireless sensor network based on 6LoWPAN.

Technical background

Wireless sensor network usually IEEE 802.15.4 as communication standard, it is widely used in fields such as environmental observation, Smart Home, medical treatment and nursing, traffic monitoring.In IEEE 802.15.4 standard, the network equipment has characteristics such as low-power consumption, low data transmission rate, short communication distance, short packages length.For example, this standard code link layer MTU MTU is that the size of Maximum Transmission Unit is 127 bytes; The wireless device maximum data transfer rate that works in the 2.4GHz frequency range is 250kbps; Except global unique extended address of 64, also support 16 short address form.

IPv6 is that IETF is that the IP agreement that is used for alternative current edition 4 that the Internet engineering duty group designs is the IP next generation protocol of IPv4.The address size of IPv6 is 128, and the minimum MTU of IPv6 packet reaches 1280 bytes.Because the MTU of IEEE 802.15.4 data link layer can only reach 127 bytes, so when the IPv6 packet transmits in the wireless sensor network based on IEEE 802.15.4 standard, need be with the packet slicing transmission.On August 1st, 2007, IETF drafts and has issued RFC 4919, has proposed the 6LoWPAN agreement to be supported in based on transmitting the IPv6 packet in the wireless personal area network of IEEE 802.15.4 standard.The main feature of 6LoWPAN has three: packet burst, header suppression and Level 2 Forwarding packet.6LoWPAN adds an adaptation layer between network layer and data link layer be adaptation layer.Like this, route both can be carried out in network layer, also can carry out at newly-increased adaptation layer.The former is called ROR is route-over routing; It is mesh-under routing that the latter is called MUR.

Before the present invention, relevant invention has:

On October 18th, 2010, Changshu Institute of Technology Wang Xiao nanmu has been applied for patent " the nested mobile network routing optimization method of a kind of 6LoWPAN ".In this invention; Mobile network node need not to set up the tunnel through the mobile router agency who belongs to the mobile network and can communicate by letter with communication node; Mobile network node can judge accurately whether this communication node is in the same 6LoWPAN network with mobile network node according to the IPv6 address of purpose communication node; Thereby set up the optimum routed path that arrives the purpose communication node, shorten data transfer delay.

On November 23rd, 2010, Changshu Institute of Technology Wang Xiao nanmu has been applied for patent " a kind of 6LoWPAN wireless sensor network routing method ".This method is divided into two types of global function sensor node and partial function sensor nodes to the node of wireless sensor network, and in addition, also the IPv6 address with sensor node is divided into overall route prefix and sensor node ID two parts.The global function node comprises a routing table, thereby sensor node is set up the path realization data communication that arrives destination node through routing table.When the global function sensor node in the path lost efficacy, can realize the route repair function automatically through routing table.

On January 26th, 2011, the auspicious patent " a kind of tree-shaped method for routing of finding based on 6LoWPAN neighbours " of having applied for of the Hao Jun of Wuhan Research Institute of Posts & Telecommunications.When the 6LoWPAN sensor node added network, this method was set up the root node of tree topology, and to the essential information of their configuration networks.If leaf node takes place to be lost efficacy, left, when moving one of three kinds of situation, then triggered the route repair process.This method need not to send and receive extra routing protocol packet, has reduced the energy consumption and the routing cost of whole network.

On August 10th, 2011, the yellow little red people such as grade of Beijing University of Post & Telecommunication applies for a patent " the 6LoWPAN network is towards the header compressed method of the TCP of http protocol ".This method is compressed the TCP stem according to the mode of header-compressed structure, coding and formation in the compression of adaptation layer elder generation completion IP stem and IP extension header then, has guaranteed the compatibility of compression method and the simplicity of operation realization.The 6LoWPAN datagram that forms is sent to data link layer again, through data link layer and physical layer frame is sent to receiving terminal.This method has reduced the data fragmentation of data link layer, has improved communication efficiency.

As previously mentioned, the 6LoWPAN network has added adaptation layer between the IP of original ICP/IP protocol stack layer and MAC layer.Routing decision is called ROR by what the IP layer was accomplished, and routing decision is adapting to the MUR that is called that accomplishes layer by layer.

Like Fig. 1, when a paths is made up of a plurality of nodes, and the link between the node is during all based on IEEE 802.15.4 standard, in ROR and these two kinds of routing algorithms of MUR, packet from source node A ₀Send to destination node A _nProcess be different.In ROR, packet is at first by source node A ₀Be divided into a plurality of bursts, each burst transmits with the IP agreement, promptly with node A _nThe IP address as the destination address of packet head.Source node A ₀Select node A according to routing table ₁Be next jumping, send to next-hop node A to all bursts ₁Node A ₁After receiving all bursts, be assemblied into original packet to these bursts, give network layer, after the purpose IP address of network layer sense data packet header, make routing decision according to routing table and promptly select A ₂Be next jumping, then,, and pass to next-hop node A to all bursts the packet after assembly unit burst again ₂, node A ₂After receiving all bursts, be assemblied into original packet to these bursts.The rest may be inferred, arrives destination node A up to packet _n

The data transfer of MUR is different with ROR.In MUR, route is carried out at adaptation layer: packet is at first by burst, and all bursts are that Local-link address forwarded hop-by-hop is to destination node A according to the local link address _nIn IPv6, the prefix of local link address is FE80: :/64.Destination node A _nAfter receiving all bursts, these bursts are assemblied into source node A ₀The packet that is sent.

No matter be the ROR routing policy, or the MUR routing policy, if on transmission link, lost the one or more bursts in the packet, all bursts of this packet all need to retransmit so.But the former only retransmits on the link of a jumping, and the latter need retransmit end to end.Therefore, when information source between the stay of two nights path length be number of links number on path when excessive, the packet number of retransmissions of MUR will become very big, thus the energy of waste node.

Summary of the invention

Thereby for the MUR routing policy that overcomes existing wireless sensor network based on 6LoWPAN because information source to excessive excessive this drawback of energy consumption that causes of link hop count between the stay of two nights, the present invention provides a kind of energy consumption of effective reduction node Data transmission bag, the re-transmission successive number that reduces packet and the wireless transducer network energy saving data transferring method based on 6LoWPAN of communication delay.

For the technical scheme that solves the problems of the technologies described above proposition is:

A kind of wireless transducer network energy saving data transferring method based on 6LoWPAN, said wireless transducer network energy saving data transferring method comprises following process:

At first, through between the information source and the stay of two nights, seeking the interim assembly unit node TAN of an optimum, select the method for interim assembly unit node TAN following:

Step 1: with<a _i, A _j>Expression connected node A _iWith node A _jLink, with<a ₀, A ₁..., A _n>Expression is with A ₀Be information source node, A _nFor information destination node and through node A ₁, A ₂, A ₃... and A _N-1Data package transmission path, altogether n jumps.

Step 2: calculate E by formula (19) _AvgAnd get Min_E=E (n), _Avg(n), and the note Best_Pair={ n }.

$E_{\mathrm{avg}}\left(n\right)\&equiv;P_{\mathrm{Succ}}{E}_{\mathrm{Total}}^{\left(S\right)}+(1-P_{\mathrm{Succ}})E_{\mathrm{Total}}^{\left(F\right)}$

$=S_{\mathrm{IP}}\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{[1-{\left(q_i\right)}^N]}^M\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}+(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{[1-{\left(q_i\right)}^N]}^M)$

$\&CenterDot;\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}t[\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}k\left(N\right[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_j^{\mathrm{\&gamma;}}]+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{N{q}_i}^{N+1}}{1-q_i}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}\left]\right)$

$\&CenterDot;{\left(q_j\right)}^N\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N]+(M-t)k\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}]$

$\&CenterDot;{(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N\left]\right)}^t{\left(\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}\right[1-{\left(q_i\right)}^N\left]\right)}^{M-t}---\left(19\right)$

Wherein, S _IPIt is the bit number that the IPv6 packet is comprised; q _iAnd d _iIt is respectively link<a _I-1, A _i>Packet loss and link<a _I-1, A _i>The distance of two-end-point, i=1,2 ..., n; M representes the sheet number that the IPv6 packet is divided into; N representes the maximum retransmission of MAC layer in the one hop link; E _ElecThe power consumption of expression emitter and the every transmission of receiving circuit or recruiting unit's bit; ε _AmpThe expression emission amplifier transmits the energy that every bit consumes at unit square rice; γ is a path loss parameter;

Step 3: get n ₁=1;

Step 4: get n ₂=n-n ₁

Step 5: calculate E by formula (19) _Avg(n ₁) and E _Avg(n ₂);

Step 6: if E _Avg(n ₁)+E _Avg(n ₂)<min_E then gets Min_E=E _Avg(n ₁)+E _Avg(n ₂), and note Best_Pair={ n ₁, n ₂;

Step 7:n ₁=n ₁+ 1, if n ₁<n forwards step 4 to;

Step 8: if Best_Pair has two value n ₁And n ₂, then will be apart from information source n ₁The intermediate node of jumping is chosen for TAN, otherwise, between the information source and the stay of two nights, do not establish TAN;

Then, after TAN chooses, information source node A ₀The packet burst, be that Mesh-under Routing method sends to TAN to all bursts according to the MUR that provides in the 6LoWPAN agreement then; The adaptation layer of the protocol stack of TAN is sent to network layer on all bursts that receive, and it is information source node A that network layer is assembled into source IPv6 packet with all bursts ₀The packet that is sent;

Afterwards, the network layer of TAN is extracted the purpose IP address of IPv6 packet head, searches routing table and obtains the next-hop node address, is routed to information destination node A with IPv6 packet burst and through MUR again _n, then, information destination node is assembled into original IPv6 packet to the data fragmentation that receives.

Technical conceive of the present invention is: through at information source node A ₀With information destination node A _nBetween to choose intermediate node be Temporary Assembling Node as " interim assembly unit node " TAN; Make that on the adaptation layer of TAN, the packet burst that receives being submitted to network layer carries out assembly unit, and then carry out the packet after the assembly unit burst and be forwarded to next-hop node.And on other intermediate node, the packet burst only is submitted to adaptation layer and just transmits processing.

With<a _i, A _j>Expression connected node A _iWith node A _jLink, with<a ₀, A ₁.., A _n>Expression is with A ₀Be information source node, A _nFor information destination node and through node A ₁, A ₂, A ₃... and A _N-1Data package transmission path.In the path<a ₀, A ₁..., A _n>On, select certain intermediate node A _xAs interim assembly unit node TAN.Like this, from source node A ₀To destination node A _nRoute by interim assembly unit node A _xBe divided into two sections: L ₁And L ₂, L wherein ₁=<a ₀, A ₁..., A _x>, L ₂=<a _x, A _X+1..., A _n>See hereinafter for details about choosing of interim assembly unit node TAN.In the data transferring method that the present technique scheme is proposed, during each node of packet process, protocol hierarchy related in the interdependent node protocol stack is as shown in Figure 2.

People such as W.B.Heinzelman in October, 2002 at document 1: international periodical " IEEE Transactions on Wireless Communications " has promptly been delivered paper " An application-specific protocol architecture for wireless microsensor networks " i.e. " a kind of application-specific agreement framework of wireless microsensor network " on " IEEE radio communication transactions " the 1st volume the 4th phase 660-670 page or leaf, in this paper, has proposed following energy consumption model:

With the data packet transmission d rice distance of a k bit, the energy that transmit leg and recipient's radio circuit are consumed is respectively:

E _Tx(k,d)=k[E _elec+ε _ampd ^γ] （1）

E _Rx(k)=kE _elec （2）

Wherein, E _ElecThe power consumption of expression emitter and the every transmission of receiving circuit or recruiting unit's bit; ε _AmpThe expression emission amplifier transmits the energy that every bit consumes at unit square rice; γ is a path loss parameter, and its span is [2,4].Below deserving to be called and stating energy consumption model is " Heinzelman energy consumption model ".Energy consumption when present technique adopts the Heinzelman energy consumption model to weigh data passes.

As everyone knows, the link of wireless sensor network is to be prone to packet loss, insecure.For one from information source A ₀To stay of two nights A _nData package transmission path<a ₀, A ₁..., A _n>, with q _iThe expression link<a _I-1, A _i>Packet loss, p then _i=1-q _iIt is link<a _I-1, A _i>The success rate of Data transmission bag, i=1,2 ..., n; Represent the sheet number that the IPv6 packet is divided into M.In addition, the maximum retransmission of representing MAC layer in the one hop link with N.That is to say that the MAC layer is when transmitting same packet, if N continuous time transmission failure, then the MAC layer just no longer continues to retransmit this packet.Therefore, for a burst, node A _I-1To next-hop node A _iThe probability of bust this is:

P _i ^(F)≡(q _i) ^N，i＝1，2，…，n (3)

So, node A _I-1To next-hop node A _iThe probability of transmission success is:

P _i ^(S)≡1-P _i ^(F)＝1-(q _i) ^N，i＝1，2，…，n (4)

Therefore, under the MUR routing policy, " an IPv6 packet that is divided into M burst is from information source A in chance event ₀Send and by stay of two nights A _nThe assembly unit success " " M burst is all by stay of two nights A to be equivalent to chance event _nReceive ", its probability is:

$P_{\mathrm{Succ}}\&equiv;\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{\left[{P_i}^{\left(S\right)}\right]}^M=\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{[1-{\left(q_i\right)}^N]}^M\text{---}\left(5\right)$

Transmitting under the case of successful, a burst is from node A _I-1To next-hop node A _iAverage transmission number of times be:

$N_i^S\&equiv;\underset{j=1}{\overset{N}{\mathrm{\&Sigma;}}}j\left[{\left(q_i\right)}^{j-1}{p}_i\right]=p_i\frac{d}{d{p}_i}\left(\underset{j=1}{\overset{N}{\mathrm{\&Sigma;}}}{q_i}^j\right)=p_i\frac{d}{d{p}_i}\left(\frac{q_i[1-{q_i}^N]}{1-q_i}\right)$

Promptly

$N_i^S=\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}---\left(6\right)$

Got by formula (1), (2) and (6), transmitting under the case of successful, the packet burst of a k bit is from node A _I-1To next-hop node A _iAverage energy consumption be:

$E_i^S\&equiv;k[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{N{q}_i}^{N+1}}{1-q_i}---\left(7\right)$

Wherein, d _iExpression node A _I-1And A _iBetween distance.

Therefore, at information source A ₀A k bit sliced of sending can arrive stay of two nights A _nThis situation, the path<a ₀, A ₁..., A _n>The total degree of going up all nodes transmission packets does

$N^{\left(S\right)}\&equiv;\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{N}_i^S=\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}---\left(8\right)$

Total energy consumption does

$E^{\left(S\right)}\&equiv;\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{E}_i^S=k\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}---\left(9\right)$

Can get by formula (6), under the MUR routing policy, if an IPv6 packet that is divided into M burst successfully is delivered to stay of two nights A _n, promptly from information source A ₀Send and by stay of two nights A _nAssembly unit success, then path<a ₀, A ₁..., A _n>The total degree of going up all nodes transmission packets does

$N_{\mathrm{Total}}^{\left(S\right)}\&equiv;M\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{N}_i^S=M\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}---\left(10\right)$

Can get by formula (7), if a bit number is S _IPThe IPv6 packet successfully be delivered to stay of two nights A _n, promptly from information source A ₀Send and by stay of two nights A _nThe assembly unit success, the path<a ₀, A ₁..., A _n>The total energy consumption of going up all nodes transmission packets does

$E_{\mathrm{Total}}^{\left(S\right)}\&equiv;S_{\mathrm{IP}}\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}---\left(11\right)$

Because a data pieces is jumped the probability that is dropped at j

(j=1,2 ..., n), its pairing transmission number of times does

Corresponding energy consumption does $N[{2E}_{\mathrm{Elec}}+{\mathrm{\&epsiv;}}_{\mathrm{Amp}}{d}_j^{\mathrm{\&gamma;}}]+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}{N}_i^S[{2E}_{\mathrm{Elec}}+{\mathrm{\&epsiv;}}_{\mathrm{Amp}}{d}_i^{\mathrm{\&gamma;}}].$ Therefore, utilize formula (6) to get: at information source A ₀A k bit sliced of sending fails to arrive stay of two nights A _nThis situation, the path<a ₀, A ₁..., A _n>The total degree of going up all nodes transmission packets does

$N^{\left(F\right)}\&equiv;\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}(N+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}{N}_i^S)\left[P_j^{\left(F\right)}\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}{P}_i^{\left(S\right)}\right]$

$\left(12\right)$

$=\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}(N+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i})\left[P_j^{\left(F\right)}\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}{P}_i^{\left(S\right)}\right]$

The overall average energy consumption does

$E^{\left(F\right)}\&equiv;\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}k\left(N\right[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_j^{\mathrm{\&gamma;}}]+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}{N}_i^S[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}\left]\right)\left[P_j^{\left(F\right)}\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}{P}_i^{\left(S\right)}\right]---\left(13\right)$

By formula (3), (4) and (12):

$N^{\left(F\right)}\&equiv;\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}[N+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}]{\left(q_j\right)}^N\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N]---\left(14\right)$

By formula (3), (4), (6) and (13):

$E^{\left(F\right)}=\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}k\left(N\right[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_j^{\mathrm{\&gamma;}}]+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}\left]\right)---\left(15\right)$

$\&CenterDot;{\left(q_j\right)}^N\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N]$

With P ^(S)Represent that a burst is successfully from information source A ₀Be passed to stay of two nights A _nProbability.Can get by formula (4): $P^{\left(S\right)}=\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{P}_i^{\left(S\right)}=\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N].$ Like this, in M burst, there be t burst to fail to arrive stay of two nights A _nProbability be [1-P ^(S)] t [P ^(S)] ^M-t, at this moment, the path<a ₀, A ₁..., A _n>The total degree of going up all nodes transmission packets is tN ^(F)+ (M-t) N ^(S)So, get by formula (8) and (14): fail successfully to be delivered to stay of two nights A at an IPv6 packet that is divided into M burst _nCondition under, the path<a ₀, A ₁..., A _n>The total degree of going up all nodes transmission packets does

$N_{\mathrm{Total}}^{\left(F\right)}\&equiv;\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}[t{N}^{\left(F\right)}+(M-t)N^{\left(S\right)}]{[1-P^{\left(S\right)}]}^t{\left[P^{\left(S\right)}\right]}^{M-t}$

$=\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}[t{N}^{\left(F\right)}+(M-t)N^{\left(S\right)}]{(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N\left]\right)}^t{\left(\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}\right[1-{\left(q_i\right)}^N\left]\right)}^{M-t}$

$=\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}\left[t\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}\right[N+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}\left]{\left(q_j\right)}^N\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}\right[1-{\left(q_i\right)}^N]---\left(16\right)$

$+(M-t)\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}]{(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N\left]\right)}^t{\left(\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}\right[1-{\left(q_i\right)}^N\left]\right)}^{M-t}$

Got by formula (6), (9) and (15): at a bit number is S _IPThe IPv6 packet fail successfully to be delivered to stay of two nights A _nCondition under, the path<a ₀, A ₁..., A _n>The overall average energy consumption that goes up all nodes transmission packets does

$E_{\mathrm{Total}}^{\left(F\right)}=\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}[t{E}^{\left(F\right)}+(M-t)E^{\left(S\right)}]{[1-P^{\left(S\right)}]}^t{\left[P^{\left(S\right)}\right]}^{M-t}$

$=\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}t[\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}k\left(N\right[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_j^{\mathrm{\&gamma;}}]+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}\left]\right)$

$\left(17\right)$

$\&CenterDot;{\left(q_i\right)}^N\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N]+(M-t)k\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}]$

$\&CenterDot;{(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N\left]\right)}^t{\left(\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}\right[1-{\left(q_i\right)}^N\left]\right)}^{M-t}$

Wherein,

Obtained by formula (5), (10) and (16): under the MUR routing policy, an IPv6 packet is from information source A ₀To stay of two nights A _nAverage degree of transitivity do

$N_{\mathrm{avg}}\left(n\right)\&equiv;P_{\mathrm{Succ}}{N}_{\mathrm{Total}}^{\left(S\right)}+(1-P_{\mathrm{Succ}})N_{\mathrm{Total}}^{\left(F\right)}$

$=M\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{[1-{\left(q_i\right)}^N]}^M\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}+(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{[1-{\left(q_i\right)}^N]}^M)$

$\&CenterDot;\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}\left[t\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}\right[N+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}\left]{\left(q_j\right)}^N\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}\right[1-{\left(q_i\right)}^N]$

$+(M-t)\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}]{(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N\left]\right)}^t{\left(\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}\right[1-{\left(q_i\right)}^N\left]\right)}^{M-t}$

Obtained by formula (5), (11) and (17): under the MUR routing policy, an IPv6 packet is from information source A ₀To stay of two nights A _nAverage energy consumption do

$E_{\mathrm{avg}}\left(n\right)\&equiv;P_{\mathrm{Succ}}{E}_{\mathrm{Total}}^{\left(S\right)}+(1-P_{\mathrm{Succ}})E_{\mathrm{Total}}^{\left(F\right)}$

$=S_{\mathrm{IP}}\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{[1-{\left(q_i\right)}^N]}^M\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}+(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{[1-{\left(q_i\right)}^N]}^M)$

$\&CenterDot;\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}t[\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}k\left(N\right[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_j^{\mathrm{\&gamma;}}]+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{N{q}_i}^{N+1}}{1-q_i}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}\left]\right)$

$\&CenterDot;{\left(q_j\right)}^N\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N]+(M-t)k\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}]$

$\&CenterDot;{(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N\left]\right)}^t{\left(\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}\right[1-{\left(q_i\right)}^N\left]\right)}^{M-t}---\left(19\right).$

Beneficial effect of the present invention mainly shows: can reduce the energy consumption of node Data transmission bag, the number of retransmissions and the communication delay of packet.

Description of drawings

The path examples figure that Fig. 1 constitutes for wireless sensor node;

Fig. 2 is the protocol stack level figure that TAN relates to for interim assembly unit node of the present invention, wherein, and 1 expression physical layer, 2 expression MAC layers, 3 expression adaptation layers, 4 expression network layers, 5 expression transport layers, 6 expression application layers;

Fig. 3 is the energy consumption comparison diagram of method of the present invention and MUR.

Embodiment

Below in conjunction with accompanying drawing the present invention is further specified.

With reference to Fig. 2 and Fig. 3, a kind of wireless transducer network energy saving data transferring method based on 6LoWPAN, said wireless transducer network energy saving data transferring method comprises following process:

At first, between the information source and the stay of two nights, seek the interim assembly unit node TAN of an optimum, select the method for interim assembly unit node TAN following through " TAN finding method ":

Step 1: with<a _i, A _j>Expression connected node A _iWith node A _jLink, with<a ₀, A ₁..., A _n>Expression is with A ₀Be information source node, A _nFor information destination node and through node A ₁, A ₂, A ₃... and A _N-1Data package transmission path, altogether n jumps.

Step 2: calculate E by formula (19) _AvgAnd get Min_E=E (n), _Avg(n), and the note Best_Pair={ n }.

$E_{\mathrm{avg}}\left(n\right)\&equiv;P_{\mathrm{Succ}}{E}_{\mathrm{Total}}^{\left(S\right)}+(1-P_{\mathrm{Succ}})E_{\mathrm{Total}}^{\left(F\right)}$

$=S_{\mathrm{IP}}\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{[1-{\left(q_i\right)}^N]}^M\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}+(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{[1-{\left(q_i\right)}^N]}^M)$

$\&CenterDot;\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}t[\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}k\left(N\right[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_j^{\mathrm{\&gamma;}}]+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{N{q}_i}^{N+1}}{1-q_i}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}\left]\right)$

$\&CenterDot;{\left(q_j\right)}^N\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N]+(M-t)k\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}]$

$\&CenterDot;{(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N\left]\right)}^t{\left(\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}\right[1-{\left(q_i\right)}^N\left]\right)}^{M-t}---\left(19\right)$

Wherein, S _IPIt is the bit number that the IPv6 packet is comprised; q _iAnd d _iIt is respectively link<a _I-1, A _i>Packet loss and link<a _I-1, A _i>The distance of two-end-point, i=1,2 ..., n; M representes the sheet number that the IPv6 packet is divided into; N representes the maximum retransmission of MAC layer in the one hop link, that is to say, the MAC layer is when transmitting same packet, if N continuous time transmission failure, then the MAC layer just no longer continues to retransmit this packet; E _ElecThe power consumption of expression emitter and the every transmission of receiving circuit or recruiting unit's bit; ε _AmpThe expression emission amplifier transmits the energy that every bit consumes at unit square rice; γ is a path loss parameter, and its span is [2,4];

Step 3: get n ₁=1;

Step 4: get n ₂=n-n ₁

Step 5: calculate E by formula (19) _Avg(n ₁) and E _Avg(n ₂);

Step 6: if E _Avg(n ₁)+E _Avg(n ₂)<min_E then gets Min_E=E _Avg(n ₁)+E _Avg(n ₂), and note Best_Pair={ n ₁, n ₂;

Step 7:n ₁=n ₁+ 1, if n ₁<n forwards step 4 to;

Step 8: if Best_Pair has two value n ₁And n ₂, then will be apart from information source n ₁The intermediate node of jumping is chosen for TAN, otherwise, between the information source and the stay of two nights, do not establish TAN;

Then, after TAN chooses, information source node A ₀The packet burst, be that Mesh-under Routing method sends to TAN to all bursts according to the MUR that provides in the 6LoWPAN agreement then; The adaptation layer of the protocol stack of TAN is sent to network layer on all bursts that receive, and it is information source node A that network layer is assembled into source IPv6 packet with all bursts ₀The packet that is sent;

Afterwards, the network layer of TAN is extracted the purpose IP address of IPv6 packet head, searches routing table and obtains the next-hop node address, is routed to information destination node A with IPv6 packet burst and through MUR again _n, then, information destination node is assembled into original IPv6 packet to the data fragmentation that receives.

Key of the present invention is above-mentioned " TAN finding method ", wherein, calculates E _Avg(n) be that formula (19) is the core of TAN.In formula (19), there is following parameter: S _IPIt is the bit number that the IPv6 packet is comprised; q _iAnd d _iIt is link<a _I-1, A _i>Packet loss and link<a _I-1, A _i>The distance of two-end-point, i=1,2 ..., n; M is the sheet number that the IPv6 packet is divided into; N is the maximum retransmission of MAC layer in the one hop link; E _ElecIt is the power consumption of the every transmission of emitter and receiving circuit or recruiting unit's bit; ε _AmpBe that emission amplifier transmits the energy that every bit consumes at unit square rice; γ is a path loss parameter.

In above-mentioned parameter, SIP is confirmed by the IPv6 packet; M is set to S _IPThe smallest positive integral upper bound of/127 ratios; N is set to the value of attribute macMaxFrameRetries in the IEEE 802.15.4 standard; Reference literature 2:IEEE Computer Society. " IEEE 802.15.4 Standard for Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications for Low-Rate Wireless Personal Area Networks (WPANs) "; 2006; It is IEEE computer society; " IEEE 802.15.4 marks network medium access control of accurate – – low rate wireless personal area and physical layer specification ", 2006.Node is after sending packet, and the ETX that calculates the Radio Link that uses is Expected Transmission Count, gets q then _iBe link<a _I-1, A _i>The inverse of ETX; d _iUtilize location technology or GPS to confirm.In addition, the same with document [1], get E _Elec=50 to receive joule every bit be nJ/bit; When distance is greater than 87 meters between node, get ε _AmpThe every square meter of the every bit of=10 skin joules is pJ/bit/m ², and get γ=2; When distance is not more than 87 meters between node, get ε _Amp=0.0013pJ/bit/m ⁴, and get γ=4.

Provide an example below so that energy-saving effect of the present invention to be described.Packet loss at each link equates to be q ₁=q ₂=...=q _nUnder the condition of=q, formula (18) deformability is:

$N_{\mathrm{avg}}\left(n\right)=M{[1-q^N]}^{\mathrm{nM}}\frac{n[1-(N+1)q^N+{\mathrm{Nq}}^{N+1}]}{1-q}+(1-{[1-q^N]}^{\mathrm{nM}})$

$\&CenterDot;\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}[t\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}(N+\frac{(j-1)[1-(N+1)q^N+{\mathrm{Nq}}^{N+1}]}{1-q})q^N{(1-q^N)}^{j-1}---\left(20\right)$

$+\frac{(M-t)n[1-(N+1)q^N+{\mathrm{Nq}}^{N+1}]}{1-q}]{{(1-{[1-q^N]}^n)}^t[1-q^N]}^{n(M-t)}$

Simultaneously, formula (19) deformability is:

$E_{\mathrm{avg}}\left(n\right)=S_{\mathrm{IP}}{[1-q^N]}^{\mathrm{nM}}\frac{[1-(N+1)q^N+{\mathrm{Nq}}^{N+1}]}{1-q}[{2\mathrm{nE}}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]+(1-{[1-q^N]}^{\mathrm{nM}})$

$\&CenterDot;\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}t[\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}k\left(N\right[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_j^{\mathrm{\&gamma;}}]+\frac{[1-(N+1)q^N+{\mathrm{Nq}}^{N+1}]}{1-q}[2(j-1)E_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}{d}_i^{\mathrm{\&gamma;}}\left]\right)q^N{[1-q^N]}^{j-1}$

$+\frac{(M-t)k[1-(N+1)q^N+{\mathrm{Nq}}^{N+1}]}{1-q}[{2\mathrm{nE}}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{d}_i^{\mathrm{\&gamma;}}]]{(1-{[1-q^N]}^n)}^t{[1-q^N]}^{n(M-t)}---\left(21\right)$

Get E _Elec=50 to receive joule every bit be nJ/bit, and get ε _AmpThe every square meter of the every bit of=10 skin joules is pJ/bit/m ²In addition, get γ=2, d=15, M=10, N=3, and let q=0.3,0.4,0.5. gets n=20, i.e. and the information source and stay of two nights distance is 20 to jump.Given " the TAN finding method " according to the present invention, when q=0.4 and q=0.5, the node of jumping apart from information source 10 is chosen for TAN, and when q=0.3, intermediate node all is not chosen for TAN, result of calculation is as shown in Figure 3.As can beappreciated from fig. 3: method of the present invention is lower than the energy consumption of MUR, and along with the increase of link failure rate q, method of the present invention reduces more obvious than the energy consumption of MUR.When link failure rate q and n got other value, we can obtain similar conclusion.

Technology of the present invention can be widely used in the wireless sensor network based on IEEE 802.15.4 standard, makes sensor node transmit the IPv6 packet with low energy consumption.To exempt from license be that the industrial science medical treatment frequency range ISM of License-free is Industrial owing to use based on the wireless sensor network of IEEE 802.15.4 standard; Scientific and Medical frequency range communicates; Along with the propelling of Internet of Things, will be more and more universal based on the wireless sensor network of IEEE 802.15.4 standard.Therefore, the present invention has broad application prospects.

Claims (1)

1. wireless transducer network energy saving data transferring method based on 6LoWPAN, it is characterized in that: said wireless transducer network energy saving data transferring method comprises following process:

At first, through between the information source and the stay of two nights, seeking the interim assembly unit node TAN of an optimum, select the method for interim assembly unit node TAN following:

Step 1: with<a _i, A _j>Expression connected node A _iWith node A _jLink, with<a ₀, A ₁..., A _n>Expression is with A ₀Be information source node, A _nFor information destination node and through node A ₁, A ₂, A ₃... and A _N-1Data package transmission path, altogether n jumps.

Step 2: calculate E by formula (19) _AvgAnd get Min_E=E (n), _Avg(n), and the note Best_Pair={ n }.

$E_{\mathrm{avg}}\left(n\right)\&equiv;P_{\mathrm{Succ}}{E}_{\mathrm{Total}}^{\left(S\right)}+(1-P_{\mathrm{Succ}})E_{\mathrm{Total}}^{\left(F\right)}$

$=S_{\mathrm{IP}}\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{[1-{\left(q_i\right)}^N]}^M\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}+(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}{[1-{\left(q_i\right)}^N]}^M)$

$\&CenterDot;\underset{t=1}{\overset{M}{\mathrm{\&Sigma;}}}t[\underset{j=1}{\overset{n}{\mathrm{\&Sigma;}}}k\left(N\right[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_j^{\mathrm{\&gamma;}}]+\underset{i=1}{\overset{j-1}{\mathrm{\&Sigma;}}}\frac{1-(N+1){q_i}^N+{N{q}_i}^{N+1}}{1-q_i}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}\left]\right)$

$\&CenterDot;{\left(q_j\right)}^N\underset{i=1}{\overset{j-1}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N]+(M-t)k\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}[{2E}_{\mathrm{elec}}+{\mathrm{\&epsiv;}}_{\mathrm{amp}}{d}_i^{\mathrm{\&gamma;}}]\frac{1-(N+1){q_i}^N+{{\mathrm{Nq}}_i}^{N+1}}{1-q_i}]$

$\&CenterDot;{(1-\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}[1-{\left(q_i\right)}^N\left]\right)}^t{\left(\underset{i=1}{\overset{n}{\mathrm{\&Pi;}}}\right[1-{\left(q_i\right)}^N\left]\right)}^{M-t}---\left(19\right)$

Wherein, S _IPIt is the bit number that the IPv6 packet is comprised; q _iAnd d _iIt is respectively link<a _I-1, A _i>Packet loss and link<a _I-1, A _i>The distance of two-end-point, i=1,2 ..., n; M representes the sheet number that the IPv6 packet is divided into; N representes the maximum retransmission of MAC layer in the one hop link; E _ElecThe power consumption of expression emitter and the every transmission of receiving circuit or recruiting unit's bit; ε _AmpThe expression emission amplifier transmits the energy that every bit consumes at unit square rice; γ is a path loss parameter;

Step 3: get n ₁=1;

Step 4: get n ₂=n-n ₁

Step 5: calculate E by formula (19) _Avg(n ₁) and E _Avg(n ₂);

Step 6: if E _Avg(n ₁)+E _Avg(n ₂)<min_E then gets Min_E=E _Avg(n ₁)+E _Avg(n ₂), and note Best_Pair={ n ₁, n ₂;

Step 7:n ₁=n ₁+ 1, if n ₁<n forwards step 4 to;

Step 8: if Best_Pair has two value n ₁And n ₂, then will be apart from information source n ₁The intermediate node of jumping is chosen for TAN, otherwise, between the information source and the stay of two nights, do not establish TAN;

Then, after TAN chooses, information source node A ₀The packet burst, be that Mesh-under Routing method sends to TAN to all bursts according to the MUR that provides in the 6LoWPAN agreement then; The adaptation layer of the protocol stack of TAN is sent to network layer on all bursts that receive, and it is information source node A that network layer is assembled into source IPv6 packet with all bursts ₀The packet that is sent;

Afterwards, the network layer of TAN is extracted the purpose IP address of IPv6 packet head, searches routing table and obtains the next-hop node address, is routed to information destination node A with IPv6 packet burst and through MUR again _n, then, information destination node is assembled into original IPv6 packet to the data fragmentation that receives.

Images