CN101945341B - Point-to-point transmission protocol of wireless sensor network - Google Patents
Point-to-point transmission protocol of wireless sensor network Download PDFInfo
- Publication number
- CN101945341B CN101945341B CN2010102827330A CN201010282733A CN101945341B CN 101945341 B CN101945341 B CN 101945341B CN 2010102827330 A CN2010102827330 A CN 2010102827330A CN 201010282733 A CN201010282733 A CN 201010282733A CN 101945341 B CN101945341 B CN 101945341B
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- logical transport
- data
- bag
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Abstract
The invention discloses a point-to-point transmission protocol of a wireless sensor network. The protocol supports bidirectional reliable data transmission between a base station and a node, and comprises establishment of a logic transmission channel between the base station and the node, data transmission, removing of the logic transmission channel and link abnormity processing; and because a logic transmission channel-based idea is introduced in the protocol, the base station can establish the logic transmission channel between the base station and the node by only needing broadcasting once. The node on the logic transmission channel caches unreceived ACK data packets by a specific strategy, so that end-to-end retransmission upon failed transmission of the data packet is reduced, the retransmission distance and the number of the data packets are reduced, and energy consumption of the network and complexity of the protocol are reduced.
Description
Technical field
The present invention relates to wireless sensor network (Wireless Sensor Network, WSN) transmission, more specifically say the point-to-point host-host protocol of a kind of wireless sensor network.
Background technology
Wireless sensor network is higher to reliability requirement in station code remote update, querying node, network configuration etc. are used.In code update was used, the base station by being wirelessly transmitted to remote node, needed lot of energy to guarantee the absolute integrality of code data program.In the querying node, the base station sends to network with search request, destination node is with Query Result, comprise that residue energy of node, node location, node ambient data etc. beam back the base station, because query requests and response all are to transmit in the multi-hop mode, any one loss of data of jumping will cause the query script failure on the path; In the network configuration, the base station sends to destination node with configuration order and configuration parameter, and " link " inefficacy can cause configuration failure.
The transport network layer major function is to guarantee the reliability transmission quality of data from the source node to the destination node, supports multiple application layer protocol.For WSN, owing to adopt the low quality wireless channel, often cause data-bag lost, therefore must guarantee the transmitting of packet.In the TCP/IP of conventional internet, it unsuccessfully mainly is to be caused by congested institute that the transport layer data bag is paid, and TCP uses the mechanism packets such as three-way handshake, sliding window, end-to-end re-transmission to be transferred to reliably destination host from source host.But it unsuccessfully mainly is because the transmission of data packet loss requires for WSN finite energy and lightweight transport that the packet of radio communication is paid, these mechanism and inapplicable, and especially end-to-end re-transmission is consumed energy the most.Because WSN hop-by-hop bursts dropping ratio is higher than legacy network, a large amount of end-to-end re-transmissions can affect throughput, delay and the energy consumption of transmission.
Abroad since 2002 with regard to there being the researcher to pay close attention to the transmitting problem of sensor network, obtained certain achievement.Yet different application backgrounds have different to reliability requirement, and existing most host-host protocol is to develop for application-specific, does not have general sensor network reliable transport protocol.According to the demand of wireless network convergence trend and administration configuration in recent years, independent and do not rely on the host-host protocol of specific route and MAC mechanism, can be different application unified Reliability Assurance is provided.
PSFQ is first host-host protocol, and its basic thought is that the upper hop node sends grouped data with slower speed in hop-by-hop when grouping transmission, after next-hop node is found packet data loss, and upper hop node request retransmission immediately.Use for code update, the base station sends to the whole network with refresh routine, and node upgrades after receiving the program code of finishing.PSFQ guarantees to minimize loss detection in adverse circumstances and obliterated data sends needed volume of transmitted data.It is a kind of one-to-many downlink data distribution host-host protocol, but because employing is machine-processed based on the affirmation of simple NACK, the PSQF agreement can not be found the situation that all grouped datas are all lost.
ESRT uses for emergency reporting, realizes at the base station end, based on reliability requirement and network congestion situation, uses the congestion control assembly to reduce the reliability of energy consumption and raising event report, and it is a kind of many-one upstream data aggregate transmission agreement.RMST provides the reliability of data packet transmission on orientation diffusion route basis, and use and select buffer memory and reparation in the NACK configuration net, be a kind of one to one reliable transport protocol.
The DTC intention is applied to WSN with TCP/IP, introduces caching mechanism, uses partial cache, partial retransmission to replace arm and a leg end-to-end re-transmission.There is one " chain " formula topology in this agreement hypothesis between sending node, receiving node, packet is transferred to receiving node by " chain " upper node hop-by-hop, uses spatial IP address that the route support is provided.In transmission course, intermediate node replys to judge whether a packet successfully is forwarded to down hop by the ACK that relies on the MAC layer, if retransmission failure, then at this packet of present node buffer memory.The recipient confiscates packet in specifying time delay, adopt packet-by-packet hop-by-hop request repeat of negative response mode, after via node is received repeat requests, if find that the burst of request retransmission is at this buffer memory, then start partial retransmission, send packet to receiving node, otherwise repeat requests is transmitted to last hop node, if packet is not by intermediate nodes cache, then repeat requests starts end to end re-transmission after arriving source.DTC is at burst of each via node on buffer memory, has n-1 the bag can't buffer memory if n data wrap in same via node bust this, can only take end-to-end re-transmission; And the buffer memory of DTC depends on replying of MAC layer, and agreement independence is bad.
GARUDA considered the base station to the node data distribution by the property problem, a kind of base station has been proposed to network authentic data distribution protocol framework.From in essence, the reliability of GARUDA definition is to select the node set that expectation receives the grouping of sink node data, but the node in this set all needs to receive all groupings of sink node transmission, and GARUDA adopts high-octane WFP pulse, and sensor node has been proposed higher requirement.ERTP is mainly the design of data flow transmitting, guarantees that with reliability of statistics a plurality of sensor nodes send to the base station with data flow.
Summary of the invention
For node updates in the sensor network, the certain applications such as administration configuration are to the demand of reliability transmission, the invention provides (the A Reliable Point-to-point Transport Protocol of Wireless Sensor Network of reliable point-to-point wireless sensor network host-host protocol between a kind of base station and net interior nodes, hereinafter to be referred as RPTP), this agreement is supported two-way reliable transfer of data between base station and node, repeatedly broadcast the asymmetric offered load increasing that causes of the communication uplink and downlink that cause in base station-node data transmission to reduce, make the data packet transmission amount, ACK quantity minimizes.Experimental result shows, adopts the solution of the present invention, and when RPTP surpassed 10% at link packet drop rate, the transmission quantity of packet and ACK bag all was lower than DTC.
In order to realize above-mentioned technical assignment, the present invention is achieved by the following technical solutions:
A kind of wireless sensor network point-to-point transmission agreement, this agreement are introduced the logical transport passage between base station and node, the base station only needs once broadcasting by this logical transport passage, and each node startup on the logical transport passage enters the buffer type transmission, specifically comprises:
(1) between base station and node, set up the logical transport passage:
At first source node initiates to set up the logical transport passage, when selecting the source node judgement to be the base station, sends broadcasting interest bag to other node; Non-destination node receive behind the broadcasting interest bag according to self maintained to base station distance, select to transmit broadcasting interest bag to the node farther from the base station, guarantee that the interest bag arrives each node in the net;
When destination node is received broadcasting interest bag, send logical transport Path Setup packet, certain node is received logical transport Path Setup packet, carries out different disposal according to node type:
If the base station, the logical transport Path Setup is complete, and the base station sends a special logical transport Path Setup packet to destination node, and namely the jumping figure of packet is 255, and notice node logical transport Path Setup is complete, enters transfer of data;
If intermediate node, then the node maintenance timer is set as 2 times of the round RTT of prolonging that estimates in the logical transport Path Setup packet, set up logical transport passage LTC information, record this information, and the upper hop address of logical transport passage LTC information down link is arranged to the current address, jumping figure with current logical transport passage adds 1 simultaneously, and then the forwarding logic transmission channel is set up packet, starts the timer maintenance process; If the jumping figure of logical transport Path Setup packet is 255, namely receive the packet of base station affirmation Path Setup, the timer of then resetting is directly transmitted.After the timer maintenance process starts, if in timing cycle, the packet process is arranged, the timer of then resetting is if until timer expiry and do not receive any packet thinks that then the logical transport passage breaks down, then remove all logical channel relevant informations.
If initiate to set up logical channel by non-base-station node, then from the above-mentioned purpose node sends logical transport Path Setup packet step, between node and base station, set up the logical transport passage.
(2) transfer of data:
When the destination node starter node was safeguarded timer and send active ACK bag in the round-trip delay of setting, request sent packet receive window is filled, when source node receives that initiatively ACK wraps, and the packet that transmission will be transmitted; Packet transmits along the logical transport passage hop-by-hop of setting up, when the node of receiving packet is via node, via node checks that whether current data packet is by the nodal cache on the logical transport passage, be the whether set of buffer memory sign, when this buffer memory sign has been confirmed set, extract the address information in the packet, and carry out XOR with the logical transport channel information and obtain forwarding address, the forwarding data bag; When the buffer memory sign does not have set, this packet is carried out local cache to set probability r, then set buffer memory sign carries out XOR to this logical transport channel information and obtains forwarding data bag behind the forwarding address; When destination node is received packet, judge packet receive window filling situation, fill up or overtime and in the situation that window is sequentially filled at the data receiver window, check the END sign of maximum sequence number packet, if END is set, indicate that then current data packet is last packet for current sequence number, transfer of data is complete, destination node need send a special ACK response packet, namely send the cache request that empties on the intermediate node, and the notice transmit leg correctly receives all packet informations; Otherwise, work as timer expiry, destination node sends active ACK bag step and repeats to judge;
When the relaying node receives that initiatively ACK wraps, judge whether this via node has the initiatively data pack buffer of the entrained sequence number of ACK, if initiatively the packet of request then empties the packet in the local cache not at local cache in the ACK bag, send out initiatively ACK bag to last redirect; If initiatively the packet of the contained sequence number of ACK is by local cache, with this sequence number deletion that comprises among the ACK, if also ask the packet of other sequence number, then transmit the packet after upgrading; Then after the ACK request data package buffer memory sign in the local cache being resetted, initiate the forwarding data bag with present node as new source node; Be not source node and this via node when not having buffer memory when receiving that initiatively the node of ACK bag is judged, directly transmitting initiatively, ACK wraps.
(3) remove the logical transport passage:
After transfer of data was finished, the base station sends removed logical transport passage interest bag, after node is received, if receive when the node of removing the interest bag is destination node, showed that the dismounting of logical transport passage is complete; When receiving that the node of removing logical transport passage interest bag is not destination node, jumping figure in the logical transport channel information is subtracted 1, transmit dismounting logical transport passage interest bag according to logical channel information to the interior next-hop node of net, and removing logical transport passage LTC information, until destination node is received the interest bag, the logical transport passage is removed complete.
The present invention compared with prior art has the following advantages:
The present invention has introduced the logical transport passage of similar virtual circuit, and the base station only need once be broadcasted and set up the logical transport passage between base station and node; By the logical transport channel information, can simplify routing operations.Node on the logical transport passage is got the packet of not receiving ACK with the probability access vector cache, and the end-to-end re-transmission when reducing the data packet transmission failure reduces retransmitting distance and data packet number, thereby reduces the network energy consumption.This scheme only requires that lower floor possesses the routing capabilities from the node to the base station, but does not need to understand route that lower floor adopts and MAC mechanism, has good independence.
Description of drawings
Fig. 1 is the transmission of data general illustration of RPTP of the present invention.
Fig. 2 is the logical transport Path Setup flow chart of RPTP of the present invention.
Fig. 3 is packet head-coating structure schematic diagram involved in the present invention.Wherein, Fig. 3 a presentation logic transmission channel packet and initiatively ACK bag head-coating structure schematic diagram; Fig. 3 b express interest bag and dismounting logical transport passage interest bag head-coating structure schematic diagram; Fig. 3 c presentation logic transmission channel is set up bag head-coating structure schematic diagram.
Src_addr represents to send the source address of data among the figure; Dest_addr represents to send the destination address of data; Pre_addr represents the upper hop address of down link, as the addr2 of logical transport channel information; Sequence represents transport layer burst sequence number; Offset represents the side-play amount of packet in the transport layer data burst; END represents to indicate whether current data packet is last packet of current sequence number; Cached represents to indicate that whether current data packet is by the nodal cache on the logical transport passage; During size represented that initiatively ACK wraps, the data packet number Reserved that this request sends was expressed as reserved place; DATA represents data; Hops represents the jumping figure of current logical transport passage; Type represents type of data packet.
Fig. 4 is logical transport passage buffer memory flow chart of the present invention.
Fig. 5 is that logical transport passage of the present invention is removed flow chart.
Fig. 6 is timeout mode overhaul flow chart of the present invention.
Fig. 7 is that the different data pack buffer probability r of the present invention, receive window size s are to data packet transmission number affects schematic diagram.
Fig. 8 is that different pieces of information bag buffer memory probability r of the present invention, receive window size s are to ACK transmission number affects schematic diagram.
Fig. 9 is the message transmitting procedure schematic diagram of embodiments of the invention.
Figure 10 is that the conventional transmission agreement is compared effect contrast figure aspect end-to-end re-transmission with the present invention.
Figure 11 is that the conventional transmission agreement is compared effect contrast figure aspect the transmission data packet number with the present invention.
Below in conjunction with accompanying drawing the present invention is described in further detail.
Embodiment
Have " network information asymmetry " in the wireless sensor network, nodes knows that how data communication device being crossed down hop is forwarded to the base station, and base station and do not know any nodal information in the network.Can only communicate by letter with nodes by the forms of broadcasting in the base station, even need the node of communication to only have one, also need to be broadcast to whole network.The network service up-downgoing is also asymmetric, has caused the asymmetric of uplink and downlink Data Transport Protocols, and application-specific is definitely reliable to the wireless sensor network data transmission requirement, loses efficacy causing using because partial data is lost.
Lose and to cause using the problem of inefficacy in order to solve the partial data that causes owing to " network information asymmetry " in the wireless sensor network, the present invention introduces the logical transport passage that is similar to virtual circuit, the base station only needs once broadcasting by setting up the logical transport passage between base station and the node, and each node startup enters the buffer type transmission.Node on the logical transport passage is not received the packet of ACK with the probability access vector cache, and the end-to-end re-transmission when reducing the data packet transmission failure reduces retransmitting distance and data packet number, thereby reduces the network energy consumption.The present invention only requires that lower floor possesses the routing capabilities from the node to the base station, but does not need to understand route and the MAC mechanism that lower-layer protocols adopts, and has good independence.
As shown in Figure 1, RPTP is positioned on the network layer, and the hypothesis node has been maintained into the next hop information of base station.Transmit leg is packed large data fragmentation, then send packet at the logical transport passage of setting up through via node, utilize affirmation and retransmission mechanism finally successfully to transfer to destination node, destination node is sent to transport layer with the packet data delivery that receives, finish IP fragmentation and reassembly, intermediate node is not recombinated to packet, has reduced complexity.
RPTP sets up the logical transport passage between base station and node, the node maintenance logical transport channel information on the logical transport passage.Be applicable to two kinds of transmission modes of uplink and downlink, wherein set up the logical transport passage between base station and the node and defer to following assumed conditions:
Suppose N node deployment in finite region, and have following character:
Base station deployment is in the outside of network, can only with a small amount of node direct communication;
Node is maintenance of neighbor information, and preserve the optimum next hop information that arrives the base station;
Two internodal wireless communication link packet loss of arbitrary neighborhood are identical, constant in a long time;
Referring to Fig. 2, when setting up base station-node logical transport passage, base station broadcast interest bag, Packt
Interest(src_addr, dest_addr, hops), hops initial value are-1, and this broadcasting interest bag content comprises: need to set up source address, the destination address of empty logical transport passage, the jumping figure of forwarding interest packet node.When the node of receiving broadcasting interest bag was not destination node, node need to be maintained into base station jumping figure my_hops, and only the hops in the interesting bag satisfies hops＜my_hops-1, and node adds 1 with hops, then broadcasts the interest bag and just is forwarded.
When the node of receiving broadcasting interest bag is destination node, send logical transport Path Setup packet Packet
Establish(src_addr, dest_addr, pre_addr, hops, RTT) is to set up the logical transport passage.RTT is the round-trip delay that source node is estimated, intermediate node is with 2 times the RTT timer Timer as the logical transport passage
pInitial value, then start the timing processing procedure, this process is safeguarded by each node oneself, and is parallel with follow-up data transmission procedure; The hops initial value is 0, after intermediate node is received and is set up bag, formation logic transmission channel information LTC (src_addr, dest_addr, addr1, addr2), use every logical transport passage of src_addr and dest_addr sign, addr1 among the LTC is next hop address, and addr2 is the pre_addr in the logical transport Path Setup packet, with logical transport Path Setup packet Packet
EstablishMiddle pre_addr is revised as the current address, simultaneously the hops in the logical transport Path Setup packet is added 1 rear forwarding logic transmission channel and sets up bag; When the node of receiving logical transport Path Setup bag was judged as the base station, it is complete that the logical transport passage is set up in expression, and the base station sends a special logical transport Path Setup packet Packet to node
Establish(src_addr, dest_addr, pre_addr, hops, RTT), notification target node logical transport Path Setup is complete, the logical transport passage transmitting data bag that can set up; Hops=255 wherein, the RTT value is the round trip delay time that the base station is estimated, all descendant nodes are with Timer
pBe updated to 2 times of current RTT.
When setting up node-base station logical transport passage, because how each node know from selecting next-hop node to arrive the base station, so node only need to send logical transport Path Setup bag Packet
Establish(src_addr, dest_addr, pre_addr, hops, RTT) just can set up node to the logical transport passage of base station.Compare to the logical transport Path Setup of node with the base station, lacked the broadcasting of base station to node.
Fig. 3 is packet head-coating structure signal involved in the present invention, the contained content in each packet header and position relationship as scheme clear shown in, the function of each field and defined all can obtain the reliability transmission function that this agreement provides among the figure as long as possess, and each field size can be adjusted according to actual conditions.Because this agreement does not have dependence to route and the MAC of lower floor, only require that lower floor has machine-processed the getting final product of certain stable routing that support node arrives the base station, the address field size can be adjusted according to actual conditions definite in the data packet head.Especially, based on present multiple networks fusion trend, to adopt the current popular Generation Internet WSN is carried out telemanagement and information inquiry as example, use the IP address as the routing address structure each head-coating structure and function to be described.For example, this agreement can adopt the data packet head of following form and size:
Fig. 3 a is logical transport channel data bag and active ACK bag head-coating structure schematic diagram, and wherein: src_addr represents to send the source address of data, with logical transport passage of sign, accounts for 32bit, namely from 0bit to 31bit; Dest_addr represents to send the destination address of data, accounts for 32bit, namely from 32bit to 63bit; Prt_addr represents the upper hop address of down link, as the logical transport channel information, account for 32bit, namely from 64bit to 95bit; Sequence represents transport layer burst sequence number, accounts for 7bit, namely from 96bit to 102bit; Whether CA sign current data packet accounts for 1bit, i.e. 103bit by the nodal cache on the logical transport passage; Offset represents the side-play amount of packet in the transport layer data burst, accounts for 15bit, namely from 104bit to 118bit; Whether END sign current data packet is last packet of current sequence number, accounts for 1bit, i.e. 119bit; ACK indicates that this bag is packet or active request ACK bag, when ACK is 1, represents that this bag is that initiatively ACK wraps, and when ACK is 0, represents this bag logical transport channel data bag; Account for 1bit, i.e. 120bit; During size represented that initiatively ACK wraps, the data packet number that this request sends accounted for 3bit, and namely from 121bit to 123bit, when type of data packet was logical transport channel data bag, size was empty; Reserved is reserved place, accounts for 4bit, namely from 124bit to 127bit; DATA represents data, and size is optional, but is no more than 20M.
Fig. 3 b is the interest bag and removes logical transport passage interest bag head-coating structure schematic diagram.Wherein Type represents type of data packet, accounts for 3bit; When type is 0, be expressed as the interest bag; When type is 10, be expressed as logical transport Path Setup bag; When type is 110, is expressed as the logical transport passage and removes bag; Reserved is reserved place, accounts for 5bit; Hops represents the jumping figure of current logical transport passage, accounts for 8bit; Src_addr represents to send the source address of data, identifies a logical transport passage with destination address, accounts for 32bit; Dest_addr represents to send the destination address of data, accounts for 32bit.
Fig. 3 c is logical transport Path Setup bag head-coating structure schematic diagram.Wherein Type represents type of data packet, accounts for 3bit; When type is 0, be expressed as the interest bag; When type is 10, be expressed as logical transport Path Setup bag; When type is 110, is expressed as the logical transport passage and removes bag; Reserved is reserved place, accounts for 5bit; Hops represents the jumping figure of current logical transport passage, accounts for 8bit; Src_addr represents to send the source address of data, with logical transport passage of sign, accounts for 32bit; Dest_addr represents to send the destination address of data, accounts for 32bit; Pre_addr represents the upper hop address, accounts for 32bit.
Referring to Fig. 4, be the process of caching of logical transport passage of the present invention, packet the probability to set of the node on the logical transport passage to receiving
r Carry out buffer memory.Destination node is used window receive data bag, orderly packet is submitted transport layer recombinates, content according to receive window sends initiatively ACK bag within the round-trip delay RTT time of setting, ACK(size, sequence}) and wherein size be data packet number that this request sends, the sequence of data packet number set that sequences sends for request.ACK{0, (null) } representing that the purpose joint needs the special ACK response packet that sends, this response packet request intermediate node empties buffer memory, and the notice transmit leg correctly receives all packet informations.What last packet had been received replys.Via node checks the sequence number of asking among the ACK, partial retransmission missing data bag.Source node retransmits and to send unsuccessfully and not by the packet of intermediate nodes cache.
The data transmission procedure of this agreement mainly comprises following three phases: (1) destination node initiatively sends the ACK bag: destination node safeguards that size is the receive window of s, sequence by packet is filled into window, complete when the filling of window left data bag, window slides to the right.Destination node is filled situation according to current window, initiate initiatively ACK (size, sequence}) (size is data packet number that this request sends, the sequence of data packet number set that sequences sends for request) request data package fills receive window.Destination node to the packet of request be unsuccessfully retransmit or new the transmission of data bag transparent.Under the worst case, initiatively the ACK bag sends to the source node request, and the time interval of therefore setting destination node transmission ACK is
, τ is that n is the number of node according to the time delay of bag transmission through a node.When the transmission of last time request initiatively the ACK bag be transferred to destination node or when the via node transmission is lost, have a kind of special circumstances herein: namely the packet of ACK request last time is all lost when via node transmits and all at via node buffer memory, warp
After time, again send initiatively ACK bag, because the packet of this request all carries out partial retransmission, packet exists so
After will filling up receive window in time receive window is slided to the right, the time of ACK bag does not arrive if send this moment initiatively, should send immediately initiatively ACK bag, to improve efficiency of transmission.When the END sign that receives packet is set, represent end of transmission of all packets, stop to send initiatively ACK bag, finish transmission.
In a word, destination node only has following two kinds of situations just to send initiatively ACK bag:
1,
Time arrives, and periodically sends initiatively ACK bag;
2, sending initiatively in last time, ACK wraps
In time, the receive window size is initial size S, sends initiatively ACK bag.The condition that destination node sends last active ACK bag is to receive the packet that END is set, and namely receives last packet.
(2) data pack buffer: S packet of source node initialization, via node is successfully received and is checked that whether current data packet is checked namely that by the nodal cache on the logical transport passage (Cached) indicates whether set behind the logical transport channel information packet, (Cached) indicated the logical transport channel information packet of not set is to set probability r at local cache, revise simultaneously this Cached sign, then forwarding data bag.Pass-through mode is: src_addr, dest_addr, pre_addr in the extraction logic transmission channel packet, src_addr and dest_addr carry out unique identification to the logical transport passage, and the addr1 among the logical transport channel information LTC of sign and addr2 are carried out obtaining forwarding address after the XOR operation.The packet of set of Cached only is forwarded to next-hop node.
(3) partial retransmission:
This locality has the via node of buffering to receive initiatively ACK bag, whether the sequence of data packet that checks local cache number is asked by ACK, if the packet of initiatively asking in the ACK bag is not at local cache, the packet of expression local cache successfully has been transferred to destination node or by the descendant node buffer memory, can remove local cache, transmit initiatively ACK bag.If initiatively the ACK bag is by local cache, to initiate to retransmit as new source node with present node, step is:
(a), the logical transport channel data bag Cached sign that retransmits is removed the data cached bag so that descendant node is had an opportunity;
(b), forwarding logic transmission channel packet.Certainly, new source node is not removed buffer memory, until ACK no longer comprises this packet next time.
More than analyze and to find out, behind the node i cache logic transmission channel packet, the task that re-transmission is buffered packet only is responsible for by j node (j〉i), all descendant nodes of worst case i node when retransmitting logical transport channel data bag are the logical transport channel data bag that retransmits of buffer memory not all, and the bust this of logical transport channel data bag, the end-to-end re-transmission of this moment is finished by the i node.
Be that logical transport passage of the present invention is removed flow process referring to Fig. 5, the base station sends removes logical transport passage interest bag, Pack
Tear down(src_addr, dest_addr, hops), after node was received, addr1 transmitted and removes logical transport passage interest bag, and remove addr1 and addr2 as next hop address in the logical transport passage LTC, simultaneously hops is subtracted 1.Until destination node is received the interest bag, the logical transport passage is removed complete.
(4) link abnormality processing: when physical link breaks down, will cause the logical transport passage to set up, perhaps various packets can't transmit.Unusual for the reply link, at source node and each node maintenance timer, the timing processing procedure of timer is as follows:
Initiate the logical transport Path Setup when source node, start a timer Timer at source node
pIf the Path Setup of the initiation of broadcasting foundation is initiated in the base station, its initial value is 2 times according to the round-trip delay RTT of hops estimation in the broadcasting interest bag, otherwise getting a default definite value (can estimate to set in program according to network size, larger RTT value can be guaranteed the logical transport Path Setup), then send and set up logical transport channel data bag Packet
Establish(src_addr, dest_addr, pre_addr, hops, RTT).Via node is received and is set up logical transport channel data bag Packet
Establish(src_addr, dest_addr, pre_addr, hops, RTT) also sets up after the logical transport channel information LTC, starts timer Timer
p, initial value is 2 times of RTT, at the Packet that receives the hops=255 that send the base station
EstablishAfter (src_addr, dest_addr, pre_addr, hops, RTT), with Timer
pBe updated to 2 times of RTT in the bag.After timing started, node was whenever received any one bag, then with Timer
pReset, if at Timer
pOvertime and do not receive any packet, then think the logical transport channel failure, remove all information relevant with the logical transport passage, the first process of timing inspection and packet walks abreast.
(5)
r ,
S Selection
r Hour, it is more even that buffer memory is distributed in intermediate node, but the probability that packet is buffered is lower, causes end-to-end retransmission number to increase.As shown in Figure 7,
r Hour, the data packet transmission amount is larger.
r Increase, expression has the data cached bag of high probability near the intermediate node of source node, and simultaneously, packet is larger by the intermediate nodes cache probability, that is to say that the packet of end-to-end re-transmission reduces.But, when
r When excessive, packet is almost by the intermediate nodes cache near source node, and near the intermediate node of the destination node data cached bag of having no chance, when data packet transmission is lost, initiated to retransmit by the node of data cached bag, and the intermediate node of data cached bag is relatively far away apart from destination node near source node.Therefore, as shown in Figure 7, when
r When excessive, increased on the contrary the transmission quantity of packet.When
r When larger, data pack buffer is near source node, and after data packet transmission was lost, ACK will be transferred to the intermediate node that is cached with packet near source node from destination node always, as shown in Figure 8, has increased the quantity of ACK transmission.
SLess to the data packet transmission number affects, mainly be the transmission quantity that affects ACK.
S During increase, each ACK that sends can ask more packet.But, when
S When arriving certain value, on the almost not impact of ACK transmission quantity, bursts dropping ratio limits on the logical transport passage because be subjected to, and packet that at every turn can transmission success is also restricted.Such as Fig. 8,
S From 2 to 5 when increasing gradually, and ACK transmission quantity reduces comparatively obvious, but works as
S Surpass after 5, the amplitude that ACK reduces is comparatively mild.
Therefore, selecting
r ,
S The time, should integrated data bag transmission quantity and the ACK transmission quantity carry out integral body and consider.
Below be the embodiment that the inventor provides:
Embodiment 1, and this example is to be 15% in the link error rate, and receive window size S is 4, and buffer memory probability r is that this agreement has preferably performance under 0.5 the situation.Set up the logical transport passage in 11 paths of jumping, source node sends 500 packets continuously, and receive window fills up emulation experiment process once:
Referring to Fig. 9, Fig. 9 is RPTP distributed caching, partial retransmission, the whole process schematic diagram of end-to-end re-transmission.Source node sends four packets, 1,2,3 number bags are respectively at 3,4, No. 5 nodal caches, and 1 number wraps in No. 5 to No. 6 node bust thiss, 4 number Bao Wei are buffered, after destination node receives minute 2,3 number bags, send 1, the 4 number bags that lacked on the ACK request receiving window.
4, after No. 5 nodes receive ACK, find the packet of local cache not in ACK, represent that this packet is successfully received, the deletion local cache; After No. 3 node receives ACK, find 1 number bag bust this of local cache, initiate the new round transmitting take No. 3 nodes as source node, the CA sign is removed, so that descendant node can this packet of buffer memory, data packet transmission to 7 node is buffered again; Source node receives ACK, and 4 number bags are carried out end-to-end re-transmission; After destination node receives 1,2,3,4 number bags, window sliding, request 5,6,7,8 number bags are until receive till the packet that END is set.
The present invention's Heterosis relative and the conventional transmission agreement exists:
(1) end-to-end re-transmission aspect:
In Transmission Control Protocol, because the packet loss of wire link is usually very low, when TCP has detected data-bag lost, directly carry out end-to-end re-transmission by source node.As shown in figure 10, when link packet drop rate increased, the data packet number of the end-to-end re-transmission of TCP increased with exponential.DTC and RPTP utilize partial cache to avoid the end-to-end re-transmission of packet, but to some extent difference.The strategy of the data cached bag of DTC is the high lost data packets of buffer memory sequence number, receives the packet that sequence number is low near the node expectation of receiving node.And if RPTP not yet is buffered before the packet of receiving, so with probability r buffer memory.Purpose is data cached bag so that the back node is had an opportunity, so that packet distributed caching on the path.Through emulation experiment, as shown in figure 10, the end-to-end retransmission number of RPTP is lower than DTC, has avoided energy dissipation.
(2) situation of data packet transmission:
Referring to Figure 11, after packet sent from source node, intermediate node was transmitted packet, if data-bag lost, the intermediate node of data cached bag is to data packet retransmission, and follow-up node continues this package forward.As seen when link packet drop rate is higher, frequently to data packet retransmission.TCP directly carries out end-to-end re-transmission when link packet drop rate is higher, and DTC and RPTP use the partial cache strategy, when detecting data-bag lost, only need to initiate to retransmit from the node of data cached bag, has reduced total data packet transmission quantity.As shown in figure 11, TCP the transmission of data bag quantity is exponential growth when link packet drop rate increases.When link packet drop rate increased, RPTP showed the better performance than DTC, when packet loss greater than 10% the time, the quantity that RPTP sends packet obviously is less than DTC.
RPTP uses initiatively ACK mechanism, per interval is initiated initiatively ACK by destination node, until harvest all packets, sends ACK and gathers way and send data packet number certain relation that gathered way, as shown in figure 11, the RPTP data packet transmission is almost parallel with the ACK transmission curve.Compare with DTC, obviously reduced ACK transmission quantity.But along with packet loss increases, the ACK quantity of transmission is linear growth.
Claims (1)
1. wireless sensor network point-to-point transmission method, it is characterized in that the method is introduced the logical transport passage between base station and node, the base station only needs once broadcasting by this logical transport passage, each node startup on the logical transport passage enters the buffer type transmission, specifically comprises:
(1) between base station and node, set up the logical transport passage:
At first source node initiates to set up the logical transport passage, when source node judges that selection is the base station, sends broadcasting interest bag to other node; Non-destination node receive behind the broadcasting interest bag according to self maintained to base station distance, select to transmit broadcasting interest bag to the node farther from the base station, guarantee that the interest bag arrives each node in the net;
When destination node is received broadcasting interest bag, send logical transport Path Setup packet, certain node is received logical transport Path Setup packet, carries out different disposal according to node type:
If the base station, the logical transport Path Setup is complete, and the base station sends a special logical transport Path Setup packet to destination node, and namely the jumping figure of packet is 255, and notice node logical transport Path Setup is complete, enters transfer of data;
If intermediate node, then the node maintenance timer is set as 2 times of the round RTT of prolonging that estimates in the logical transport Path Setup packet, set up logical transport passage LTC information, record this information, and the upper hop address of logical transport passage LTC information down link is arranged to the current address, jumping figure with current logical transport passage adds 1 simultaneously, and then the forwarding logic transmission channel is set up packet, starts the timer maintenance process; If the jumping figure of logical transport Path Setup packet is 255, namely receive the packet of base station affirmation Path Setup, the timer of then resetting is directly transmitted; After the timer maintenance process starts, if in timing cycle, the packet process is arranged, the timer of then resetting is if until timer expiry and do not receive any packet thinks that then the logical transport passage breaks down, then remove all logical channel relevant informations;
If initiate to set up logical channel by non-base-station node, then from the above-mentioned purpose node sends logical transport Path Setup packet step, between node and base station, set up the logical transport passage;
(2) transfer of data:
When the destination node starter node was safeguarded timer and send active ACK bag in the round-trip delay of setting, request sent packet receive window is filled, when source node receives that initiatively ACK wraps, and the packet that transmission will be transmitted; Packet transmits along the logical transport passage hop-by-hop of setting up, when the node of receiving packet is via node, via node checks that whether current data packet is by the nodal cache on the logical transport passage, be the whether set of buffer memory sign, when this buffer memory sign has been confirmed set, extract the address information in the packet, and carry out XOR with the logical transport channel information and obtain forwarding address, the forwarding data bag; When the buffer memory sign does not have set, this packet is carried out local cache to set probability r, then set buffer memory sign carries out XOR to this logical transport channel information and obtains forwarding data bag behind the forwarding address; When destination node is received packet, judge packet receive window filling situation, fill up or overtime and in the situation that window is sequentially filled at the data receiver window, check the END sign of maximum sequence number packet, if END is set, indicate that then current data packet is last packet for current sequence number, transfer of data is complete, destination node need send a special ACK response packet, namely send the cache request that empties on the intermediate node, and the notice transmit leg correctly receives all packet informations; Otherwise, work as timer expiry, destination node sends active ACK bag step and repeats to judge;
When the relaying node receives that initiatively ACK wraps, judge whether this via node has the initiatively data pack buffer of the entrained sequence number of ACK, if initiatively the packet of request then empties the packet in the local cache not at local cache in the ACK bag, send out initiatively ACK bag to last redirect; If initiatively the packet of the contained sequence number of ACK is by local cache, with this sequence number deletion that comprises among the ACK, if also ask the packet of other sequence number, then transmit the packet after upgrading; Then after the ACK request data package buffer memory sign in the local cache being resetted, initiate the forwarding data bag with present node as new source node; Be not source node and this via node when not having buffer memory when receiving that initiatively the node of ACK bag is judged, directly transmitting initiatively, ACK wraps;
(3) remove the logical transport passage:
After transfer of data was finished, the base station sends removed logical transport passage interest bag, after node is received, if receive when the node of removing the interest bag is destination node, showed that the dismounting of logical transport passage is complete; When receiving that the node of removing logical transport passage interest bag is not destination node, jumping figure in the logical transport channel information is subtracted 1, transmit dismounting logical transport passage interest bag according to logical channel information to the interior next-hop node of net, and removing logical transport passage LTC information, until destination node is received the interest bag, the logical transport passage is removed complete.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102827330A CN101945341B (en) | 2010-09-16 | 2010-09-16 | Point-to-point transmission protocol of wireless sensor network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102827330A CN101945341B (en) | 2010-09-16 | 2010-09-16 | Point-to-point transmission protocol of wireless sensor network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101945341A CN101945341A (en) | 2011-01-12 |
| CN101945341B true CN101945341B (en) | 2013-01-23 |
Family
ID=43437044
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102827330A Active CN101945341B (en) | 2010-09-16 | 2010-09-16 | Point-to-point transmission protocol of wireless sensor network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101945341B (en) |
Families Citing this family (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9838089B2 (en) | 2011-10-07 | 2017-12-05 | Futurewei Technologies, Inc. | System and method for multiple point transmission in a communications system |
| US20130088960A1 (en) * | 2011-10-07 | 2013-04-11 | Futurewei Technologies, Inc. | System and Method for Information Delivery with Multiple Point Transmission |
| WO2013071478A1 (en) * | 2011-11-14 | 2013-05-23 | Renesas Mobile Corporation | A method and an apparatus for assisting operation of a wireless sensor network |
| CN103532845B (en) * | 2013-10-17 | 2017-03-15 | 西北大学 | Method for routing for intermittent connection wireless sensor network |
| CN103973423A (en) * | 2014-05-27 | 2014-08-06 | 中南大学 | Automatic single-data multi-confirmation send-and-wait repeat-request method of wireless sensor network |
| CN105208553B (en) * | 2015-08-25 | 2019-07-12 | 中国科学院信息工程研究所 | The guard method and system of CCMANET requesting node retrieval privacy |
| CN106712908B (en) * | 2015-11-13 | 2020-01-14 | 富士通株式会社 | Data transmission method, device and system |
| CN110213167A (en) * | 2018-02-28 | 2019-09-06 | 吴瑞 | A kind for the treatment of method and apparatus of transmission control protocol in network congestion |
| CN109408257B (en) * | 2018-11-09 | 2021-04-13 | 北京灵汐科技有限公司 | Data transmission method and device for Network On Chip (NOC) and electronic equipment |
| CN109743143B (en) * | 2018-11-16 | 2021-07-30 | 深圳证券交易所 | Data retransmission method, device and computer readable storage medium |
| CN110809032B (en) * | 2019-10-22 | 2020-10-20 | 北京邮电大学 | Network resource caching method and communication system |
| CN111279729A (en) * | 2019-11-12 | 2020-06-12 | 深圳市汇顶科技股份有限公司 | Data transmission method and BLE equipment |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1953378A (en) * | 2006-11-20 | 2007-04-25 | 清华大学 | A communication device for wireless sensor network communication base station |
| CN101388732A (en) * | 2008-10-21 | 2009-03-18 | 北京科技大学 | In-situ test system and method oriented to water sound sensor network |
-
2010
- 2010-09-16 CN CN2010102827330A patent/CN101945341B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1953378A (en) * | 2006-11-20 | 2007-04-25 | 清华大学 | A communication device for wireless sensor network communication base station |
| CN101388732A (en) * | 2008-10-21 | 2009-03-18 | 北京科技大学 | In-situ test system and method oriented to water sound sensor network |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101945341A (en) | 2011-01-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101945341B (en) | Point-to-point transmission protocol of wireless sensor network | |
| CN106878191B (en) | A kind of data transferring method, sending node, receiving node and data communication system | |
| US10237153B2 (en) | Packet retransmission method and apparatus | |
| CN108270682A (en) | A kind of message transmitting method, terminal, the network equipment and communication system | |
| Dunkels et al. | Distributed TCP caching for wireless sensor networks | |
| US8189536B2 (en) | Delivery of data packets via aggregated spatial distribution overlay on a mesh network | |
| CN106559739B (en) | Lightweight data transmission method suitable for Bluetooth low-power wireless communication system | |
| CN101494652B (en) | Method for reinforcing TCP protocol performance in satellite communication system | |
| CN101626597B (en) | Hop to hop transmission method based on satellite network | |
| TW201216651A (en) | Device and method for scheduling data packet transmissions in wireless networks | |
| US8194679B2 (en) | System for data transfer in a wireless network | |
| CN102340391B (en) | Segmented ARQ (automatic repeat request) automatic retransmission method | |
| CN103188716B (en) | RUDP periodic line fault location methods and device | |
| Zhou et al. | Reliable transport with memory consideration in wireless sensor networks | |
| JP5569452B2 (en) | Wireless communication apparatus, method and program | |
| CN103825689A (en) | Delay determinacy message retransmission method with local cache | |
| Ayadi et al. | Improving distributed TCP caching for wireless sensor networks | |
| Braun et al. | Energy-efficient TCP operation in wireless sensor networks | |
| CN100471197C (en) | Method of efficiently transmitting/receiving data using transport layer in a mobile ad hoc network, and network device using the method | |
| CN100550891C (en) | Improve the method for wireless network transmissions performance | |
| JP4520350B2 (en) | Wireless device | |
| Anastasi et al. | Experimental analysis of a transport protocol for ad hoc networks (TPA) | |
| EP4102753A1 (en) | Method and device for updating the number of retransmissions in a wireless mesh network | |
| Mirhosseini et al. | ADHOCTCP: Improving TCP Performance in Ad Hoc Networks | |
| Nashiry et al. | Evaluation of TCP performance over mobile IP wired-cum-wireless networks |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C53 | Correction of patent for invention or patent application | ||
| CB03 | Change of inventor or designer information |
Inventor after: Chen Xiaojiang Inventor after: He Lu Inventor after: Chen Feng Inventor after: Fang Dingyi Inventor after: Duan Ren Inventor after: Liu Chen Inventor after: Wang Ju Inventor after: Huang Xueqing Inventor after: Xing Tianzhang Inventor after: Gao Baojian Inventor after: Zhang Yuan Inventor before: Fang Dingyi Inventor before: He Lu Inventor before: Chen Feng Inventor before: Duan Ren Inventor before: Liu Chen Inventor before: Chen Xiaojiang Inventor before: Wang Ju Inventor before: Huang Xueqing Inventor before: Xing Tianzhang Inventor before: Gao Baojian Inventor before: Zhang Yuan |
|
| COR | Change of bibliographic data |
Free format text: CORRECT: INVENTOR; FROM: FANG DINGYI DUAN REN LIU CHEN CHEN XIAOJIANG WANG JU HUANG XUEQING XING TIANZHANG GAO BAOJIAN ZHANG YUAN HE LU CHEN FENG TO: CHEN XIAOJIANG FANG DINGYI DUAN REN LIU CHEN WANG JU HUANG XUEQING XING TIANZHANG GAO BAOJIAN ZHANG YUAN HE LU CHEN FENG |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |