CN101945341A - Point-to-point transmission protocol of wireless sensor network - Google Patents
Point-to-point transmission protocol of wireless sensor network Download PDFInfo
- Publication number
- CN101945341A CN101945341A CN2010102827330A CN201010282733A CN101945341A CN 101945341 A CN101945341 A CN 101945341A CN 2010102827330 A CN2010102827330 A CN 2010102827330A CN 201010282733 A CN201010282733 A CN 201010282733A CN 101945341 A CN101945341 A CN 101945341A
- Authority
- CN
- China
- Prior art keywords
- node
- packet
- logical transport
- transport passage
- data
- 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.)
- Granted
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
Landscapes
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
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, the point-to-point host-host protocol of a kind of wireless sensor network of more specifically saying so.
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 to consume the absolute integrality that big energy guarantees code data with 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 reliable transmission of packet.In the TCP/IP of traditional the Internet, it mainly is to be caused by congested institute that the transport layer data bag is paid failure, and TCP uses mechanism such as three-way handshake, sliding window, end-to-end re-transmission to guarantee that packet is transferred to destination host reliably from source host.But it mainly is because transmits data packets is lost that the packet of radio communication is paid failure, require for WSN finite energy and lightweight transport, and these mechanism and inapplicable, especially end-to-end re-transmission is consumed energy the most.Because WSN hop-by-hop data-bag lost rate is higher than legacy network, a large amount of end-to-end re-transmissions can influence throughput, delay and the energy consumption of transmission.
Abroad since 2002 with regard to there being the researcher to pay close attention to the reliable transmission problem of sensor network, obtained certain achievement.Yet different application backgrounds has certain difference to reliability requirement, and existing most host-host protocol is to develop at 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 provides unified reliability to guarantee.
PSFQ is first host-host protocol, and its basic thought is that a last hop node sends grouped data with slower speed when hop-by-hop transmission grouping, and after next-hop node was found packet data loss, a hop node request retransmission immediately made progress.Use at 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 owing to the affirmation mechanism that adopts based on simple NACK, the PSQF agreement can not be found the situation that all grouped datas are all lost.
ESRT uses at emergency reporting, realizes at the base station end, based on reliability requirement and network congestion situation, uses congested control assembly to cut down the consumption of energy and improves the reliability of 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 reliable transport protocol one to one.
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 gone up the node hop-by-hop by " chain " and is transferred to receiving node, 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 next jumping 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 negative response mode hop-by-hop request repeat packet-by-packet, after via node is received repeat requests, if the burst of finding 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 re-transmission end to end after arriving the source end.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 reliable transmission, uses reliability of statistics to guarantee that a plurality of sensor nodes send to the base station with data flow.
Summary of the invention
At node updates in the sensor network, 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 RPTP surpasses at 10% o'clock at link packet drop rate, and the transmission quantity of packet and ACK bag all is 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 and give 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 the logical transport passage and set up packet, certain node receives that the logical transport passage sets up packet, carries out different disposal according to node type:
If the base station, the logical transport passage is set up and is finished, and the base station sends a special logical transport passage to destination node and sets up packet, and promptly the jumping figure of packet is 255, and notice node logical transport passage is set up and finished, and enters transfer of data;
If intermediate node, then the node maintenance timer is set at the logical transport passage and sets up 2 times of the round RTT of prolonging that estimates in the packet, set up logical transport passage LTC information, write down this information, and last one of logical transport passage LTC information down link is jumped address setting become the current address, jumping figure with current logical transport passage adds 1 simultaneously, and the forwarding logic transmission channel is set up packet then, starts the timer maintenance process; If it is 255 that the logical transport passage is set up the jumping figure of packet, promptly receive the packet that base station affirmation passage is set up, 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 if do not receive any packet up to timer expiry, thinks that then the logical transport passage breaks down, and then removes all logical channel relevant informations.
If initiate to set up logical channel by non-base-station node, then send the logical transport passage and set up the packet step from the above-mentioned purpose node, between node and base station, set up the logical transport passage.
(2) transfer of data:
When destination node started the node maintenance timer and send active ACK bag in the round-trip delay of setting, request sent packet receive window is filled, and when source node receives that initiatively ACK wraps, sent and wanted data packets for transmission; 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, transmit packet; When the buffer memory sign does not have set, this packet is carried out local cache to set probability r, set buffer memory sign carries out XOR to this logical transport channel information then and obtains transmitting packet behind the forwarding address; When destination node is received packet, judgment data bag receive window is filled situation, fill up or overtime and under the situation that window is filled in proper order at the Data Receiving 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 finishes, destination node need send a special ACK response packet, promptly 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 requested packets 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,,, then transmit the packet after upgrading if also ask the packet of other sequence number with this sequence number deletion that comprises among the ACK; After then the ACK request data package buffer memory sign in the local cache being resetted, initiate to transmit packet as new source node with present node; When receiving that initiatively the node of ACK bag is judged is not source node and this via node when not having buffer memory, and 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 finishes; 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 next-hop node in net, and removing logical transport passage LTC information, receive the interest bag up to destination node, the logical transport passage is removed and is finished.
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 data general illustration of RPTP of the present invention.
Fig. 2 sets up flow chart for the logical transport passage of RPTP of the present invention.
Fig. 3 is a 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 represents the interest bag and removes 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 data source address among the figure; Dest_addr represents to send the destination address of data; Pre_addr represents a last jumping 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; Whether END indicator sign current data packet is last packet of current sequence number; Whether cached indicator sign 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 a 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 testing process figure 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 compares effect contrast figure aspect end-to-end re-transmission for the conventional transmission agreement with the present invention.
Figure 11 compares with the present invention effect contrast figure aspect the transmission data packet number for the conventional transmission agreement.
Below in conjunction with accompanying drawing the present invention is described in further detail.
Embodiment
Have " network information asymmetry " in the wireless sensor network, node knows how data are dealt into the base station by next redirect in the network, and base station and do not know any nodal information in the network.The base station can only even need nodes in communication to have only one, also need to be broadcast to whole network by node communication in the forms of broadcasting and the 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 big data fragmentation, on the logical transport passage of setting up, send packet then 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 the burst reorganization, 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 the small number of nodes direct communication;
Node is maintenance of neighbor information, and preserve the optimum next hop information that arrives the base station;
Two adjacent arbitrarily internodal wireless communication link packet loss 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(hops), the hops initial value is-1 for src_addr, dest_addr, and this broadcasting interest bag content comprises: need 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 be maintained into base station jumping figure my_hops, and the hops in the only interesting bag satisfies hops＜my_hops-1, and node adds 1 with hops, broadcasts the interest bag then and just is forwarded.
When the node of receiving broadcasting interest bag is destination node, sends the logical transport passage and set up packet Packet
Establish(src_addr, dest_addr, pre_addr, hops, RTT), 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, start the timing processing procedure then, 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 a next hop address, and addr2 sets up pre_addr in the packet for the logical transport passage, and the logical transport passage is set up packet Packet
EstablishMiddle pre_addr is revised as the current address, and the hops that simultaneously the logical transport passage is set up in the packet adds 1 back forwarding logic transmission channel foundation bag; When the node of receiving logical transport passage foundation bag was judged as the base station, expression was set up the logical transport passage and is finished, and the base station sends a special logical transport passage to node and sets up packet Packet
Establish(src_addr, dest_addr, pre_addr, hops, RTT), notification target node logical transport passage is set up and is finished, 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 send the logical transport passage and sets up bag Packet
Establish(src_addr, dest_addr, pre_addr, hops RTT) just can set up the logical transport passage of node to the base station.Compare to the logical transport passage foundation 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 relation 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 the route and the MAC of lower floor, only require that lower floor has certain stable routing mechanism that support node arrives the base station and gets final product, the address field size can be adjusted definite according to actual conditions in the data packet head.Especially, based on present many network integrations trend,, use the IP address each head-coating structure and function to be described as the routing address structure to adopt current popular the Internet system that WSN is carried out telemanagement and information inquiry is an example.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 data source address, with logical transport passage of sign, accounts for 32bit, promptly from 0bit to 31bit; Dest_addr represents to send the destination address of data, accounts for 32bit, promptly from 32bit to 63bit; Prt_addr represents that last one of down link jumps the address, as the logical transport channel information, account for 32bit, promptly from 64bit to 95bit; Sequence represents transport layer burst sequence number, accounts for 7bit, promptly 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, promptly 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 promptly from 121bit to 123bit, when type of data packet was logical transport channel data bag, size was empty; Reserved is a reserved place, accounts for 4bit, promptly 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, is expressed as the logical transport passage and sets up bag; When type is 110, is expressed as the logical transport passage and removes bag; Reserved is a reserved place, accounts for 5bit; Hops represents the jumping figure of current logical transport passage, accounts for 8bit; Src_addr represents to send data source address, 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 sets up bag head-coating structure schematic diagram for the logical transport passage.Wherein Type represents type of data packet, accounts for 3bit; When type is 0, be expressed as the interest bag; When type is 10, is expressed as the logical transport passage and sets up bag; When type is 110, is expressed as the logical transport passage and removes bag; Reserved is a reserved place, accounts for 5bit; Hops represents the jumping figure of current logical transport passage, accounts for 8bit; Src_addr represents to send data source address, 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 that one jumps the address, accounts for 32bit.
Referring to Fig. 4, be logical transport passage buffer storage process 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 uses window to receive packet, orderly packet is submitted transport layer recombinates, content according to receive window sends initiatively ACK bag in 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) } represent 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 is checked the sequence number of asking among the ACK, the packet that partial retransmission is lost.Source node retransmit to send failure 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, fill when window left data bag and to finish, window slides to the right.Destination node is filled situation according to current window, initiates initiatively ACK (size, { sequence}) (sequence of data packet that data packet number that size sends for this request, sequences send for request number gather) request data package receive window is filled.Destination node is that failure retransmits or newly transmits data packets is transparent to requested packets.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: promptly last time, the ACK requested packets was all lost when via node transmits and all at via node buffer memory, warp
After time, send initiatively ACK bag once more, because this requested packets is all carried 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 initiatively ACK bag immediately, to improve efficiency of transmission.When the END sign that receives packet is set, represent all packets end of transmission, stop to send initiatively ACK bag, finish transmission.
In a word, destination node has only 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 promptly 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 checked promptly that by the nodal cache on the logical transport passage (Cached) indicates whether set behind the logical transport channel information packet, the logical transport channel information packet that (Cached) is indicated not set is to set probability r at local cache, revise this Cached sign simultaneously, transmit packet then.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 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 Cached set only is forwarded to next-hop node.
(3) partial retransmission:
This locality has the via node of buffering to receive initiatively ACK bag, check whether the sequence of data packet of local cache number is asked by ACK, if requested packets was not at local cache during initiatively ACK wrapped, 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, make the descendant node data cached bag of having an opportunity;
(b), forwarding logic transmission channel packet.Certainly, new source node is not removed buffer memory, no longer comprises this packet up to ACK next time.
More than analyze as can be seen, 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.
Referring to Fig. 5 is that logical transport passage of the present invention is removed flow process, and the base station sends removes logical transport passage interest bag, Pack
Tear down(src_addr, dest_addr hops), after node is received, are next hop address with addr1 among the logical transport passage LTC, transmit and remove logical transport passage interest bag, and remove addr1 and addr2, simultaneously hops are subtracted 1.Receive the interest bag up to destination node, the logical transport passage is removed and is finished.
(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 passage when source node and set up, on source node, start a timer Timer
pIf initiating the passage of the initiation of broadcasting foundation, the base station sets up, its initial value is 2 times according to the round-trip delay RTT of hops estimation in the broadcasting interest bag, otherwise get a default definite value (can estimate to set in program according to network size, bigger RTT value can guarantee that the logical transport passage sets up), send then 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) and set 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
Establish(src_addr, dest_addr, pre_addr, hops, RTT) after, 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 The selection discussion
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 bigger.
r Increase, expression has the data cached bag of high probability near the intermediate node of source node, and simultaneously, packet is big more 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, initiate to retransmit by the node of data cached bag, and the intermediate node of data cached bag is far away relatively apart from destination node near source node.Therefore, as shown in Figure 7, when
r When excessive, increased the transmission quantity of packet on the contrary.When
r When big, 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 influences ACK.
S During increase, each ACK that sends can ask the more data bag.But, when
S When arriving certain value, to the almost not influence of ACK transmission quantity, the data-bag lost rate limits on the logical transport passage because be subjected to, and packet that at every turn can transmission success is also restricted.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:
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, No. 3 packets are respectively at 3,4, No. 5 nodal caches, and No. 1 packet is No. 5 to No. 6 node bust thiss, No. 4 packet is not buffered, after destination node receives 2, No. 3 packets of branch, send 1, No. 4 packet that is lacked on the ACK request receive window.
4, after No. 5 nodes received ACK, the packet of finding local cache represented that this packet successfully is received not in ACK, the deletion local cache; After No. 3 node receives ACK, find No. 1 data packet transmission failure of local cache, the new round reliable transmission that to initiate with No. 3 nodes be source node is removed the CA sign, make that descendant node can this packet of buffer memory, data packet transmission to 7 node is buffered once more; Source node receives ACK, and No. 4 packets are carried out end-to-end re-transmission; After destination node received 1,2,3, No. 4 packet, window slided, and asks 5,6,7, No. 8 packet, till receiving the packet that END is set.
The present invention's advantage relative and the conventional transmission agreement shows:
(1) end-to-end re-transmission aspect:
In Transmission Control Protocol,, when TCP has detected data-bag lost, directly carry out end-to-end re-transmission by source node because the packet loss of wire link is very low usually.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 difference to some extent.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 is not buffered before as yet to the packet of receiving, so with probability r buffer memory.Purpose is to make the back node data cached bag of having an opportunity, and makes 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 retransmits packet, and follow-up node continues this packet is transmitted.As seen when link packet drop rate is higher, frequently packet is retransmitted.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 initiate to retransmit from the node of data cached bag, has reduced total data packet transmission quantity.As shown in figure 11, TCP transmits data packets quantity is exponential growth when link packet drop rate increases.When link packet drop rate increased, RPTP showed than DTC more performance, when packet loss greater than 10% the time, RPTP sends quantity of data packets and obviously is less than DTC.
RPTP uses initiatively ACK mechanism, initiate initiatively ACK every the time by destination node,, send ACK and gather way and send data packet number certain relation that gathered way up to harvesting all packets, 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 agreement, it is characterized in that this agreement 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 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 and give 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 the logical transport passage and set up packet, certain node receives that the logical transport passage sets up packet, carries out different disposal according to node type:
If the base station, the logical transport passage is set up and is finished, and the base station sends a special logical transport passage to destination node and sets up packet, and promptly the jumping figure of packet is 255, and notice node logical transport passage is set up and finished, and enters transfer of data;
If intermediate node, then the node maintenance timer is set at the logical transport passage and sets up 2 times of the round RTT of prolonging that estimates in the packet, set up logical transport passage LTC information, write down this information, and last one of logical transport passage LTC information down link is jumped address setting become the current address, jumping figure with current logical transport passage adds 1 simultaneously, and the forwarding logic transmission channel is set up packet then, starts the timer maintenance process; If it is 255 that the logical transport passage is set up the jumping figure of packet, promptly receive the packet that base station affirmation passage is set up, 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 if do not receive any packet up to timer expiry, thinks that then the logical transport passage breaks down, and then removes all logical channel relevant informations;
If initiate to set up logical channel by non-base-station node, then send the logical transport passage and set up the packet step from the above-mentioned purpose node, between node and base station, set up the logical transport passage;
(2) transfer of data:
When destination node started the node maintenance timer and send active ACK bag in the round-trip delay of setting, request sent packet receive window is filled, and when source node receives that initiatively ACK wraps, sent and wanted data packets for transmission; 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, transmit packet; When the buffer memory sign does not have set, this packet is carried out local cache to set probability r, set buffer memory sign carries out XOR to this logical transport channel information then and obtains transmitting packet behind the forwarding address; When destination node is received packet, judgment data bag receive window is filled situation, fill up or overtime and under the situation that window is filled in proper order at the Data Receiving 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 finishes, destination node need send a special ACK response packet, promptly 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 requested packets 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,,, then transmit the packet after upgrading if also ask the packet of other sequence number with this sequence number deletion that comprises among the ACK; After then the ACK request data package buffer memory sign in the local cache being resetted, initiate to transmit packet as new source node with present node; When receiving that initiatively the node of ACK bag is judged is not source node and this via node when not having buffer memory, and 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 finishes; 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 next-hop node in net, and removing logical transport passage LTC information, receive the interest bag up to destination node, the logical transport passage is removed and is finished.
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 true CN101945341A (en) | 2011-01-12 |
| CN101945341B 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) |
Cited By (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2013071478A1 (en) * | 2011-11-14 | 2013-05-23 | Renesas Mobile Corporation | A method and an apparatus for assisting operation of a wireless sensor network |
| CN103532845A (en) * | 2013-10-17 | 2014-01-22 | 西北大学 | Routing protocol for intermittently connected wireless sensor network |
| CN103858372A (en) * | 2011-10-07 | 2014-06-11 | 华为技术有限公司 | System and method for communication system with multiple point transmission |
| CN103973423A (en) * | 2014-05-27 | 2014-08-06 | 中南大学 | Automatic single-data multi-confirmation send-and-wait repeat-request method of wireless sensor network |
| CN105208553A (en) * | 2015-08-25 | 2015-12-30 | 中国科学院信息工程研究所 | CCMANET request node retrieval privacy protection method and system |
| CN106712908A (en) * | 2015-11-13 | 2017-05-24 | 富士通株式会社 | Data transmission method, device and system |
| US9838089B2 (en) | 2011-10-07 | 2017-12-05 | Futurewei Technologies, Inc. | System and method for multiple point transmission in a communications system |
| CN109408257A (en) * | 2018-11-09 | 2019-03-01 | 北京灵汐科技有限公司 | Data transmission method, device and electronic equipment for network-on-chip NOC |
| CN109743143A (en) * | 2018-11-16 | 2019-05-10 | 深圳证券交易所 | Repeating method, device and the computer readable storage medium of data |
| CN110213167A (en) * | 2018-02-28 | 2019-09-06 | 吴瑞 | A kind for the treatment of method and apparatus of transmission control protocol in network congestion |
| CN110809032A (en) * | 2019-10-22 | 2020-02-18 | 北京邮电大学 | Network resource caching method and communication network |
| 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 |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10218414B2 (en) | 2011-10-07 | 2019-02-26 | Futurewei Technologies, Inc. | System and method for multiple point transmission in a communications system |
| US10090890B2 (en) | 2011-10-07 | 2018-10-02 | Futurewei Technologies, Inc. | System and method for multiple point transmission in a communications system |
| CN103858372A (en) * | 2011-10-07 | 2014-06-11 | 华为技术有限公司 | System and method for communication system with multiple point transmission |
| CN103858372B (en) * | 2011-10-07 | 2019-08-20 | 华为技术有限公司 | System and method for multicast communication in communication system |
| US9871736B2 (en) | 2011-10-07 | 2018-01-16 | Futurewei Technologies, Inc. | System and method for information delivery with multiple point transmission |
| US10257103B2 (en) | 2011-10-07 | 2019-04-09 | Futurewei Technologies, Inc. | System and method for information delivery with multiple point transmission |
| US11070482B2 (en) | 2011-10-07 | 2021-07-20 | Futurewei Technologies, Inc. | System and method for information delivery with multiple point transmission |
| US10116357B2 (en) | 2011-10-07 | 2018-10-30 | Futurewei Technologies, Inc. | System and method for multiple point transmission in a communications system |
| US9838089B2 (en) | 2011-10-07 | 2017-12-05 | Futurewei Technologies, Inc. | System and method for multiple point transmission in a communications system |
| US9882821B2 (en) | 2011-10-07 | 2018-01-30 | 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 |
| CN103532845A (en) * | 2013-10-17 | 2014-01-22 | 西北大学 | Routing protocol for intermittently connected 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 |
| CN105208553A (en) * | 2015-08-25 | 2015-12-30 | 中国科学院信息工程研究所 | CCMANET request node retrieval privacy protection method and system |
| CN105208553B (en) * | 2015-08-25 | 2019-07-12 | 中国科学院信息工程研究所 | The guard method and system of CCMANET requesting node retrieval privacy |
| CN106712908A (en) * | 2015-11-13 | 2017-05-24 | 富士通株式会社 | Data transmission method, device and system |
| 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 |
| CN109408257A (en) * | 2018-11-09 | 2019-03-01 | 北京灵汐科技有限公司 | Data transmission method, device and electronic equipment for network-on-chip NOC |
| CN109743143A (en) * | 2018-11-16 | 2019-05-10 | 深圳证券交易所 | Repeating method, device and the computer readable storage medium of data |
| CN109743143B (en) * | 2018-11-16 | 2021-07-30 | 深圳证券交易所 | Data retransmission method, device and computer readable storage medium |
| CN110809032A (en) * | 2019-10-22 | 2020-02-18 | 北京邮电大学 | Network resource caching method and communication network |
| 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 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101945341B (en) | 2013-01-23 |
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 | |
| EP3100420B1 (en) | Buffer sizing for multi-hop networks | |
| CN103119887B (en) | Device and method for scheduling data packet transmissions in wireless networks | |
| CN106559739B (en) | Lightweight data transmission method suitable for Bluetooth low-power wireless communication system | |
| US9276832B2 (en) | Buffer sizing for multi-hop networks | |
| EP2965455A2 (en) | Enhanced acknowledgement and retransmission mechanism | |
| CN103222241A (en) | System and method for optimizing data transmission to nodes of a wireless mesh network | |
| CN104093170A (en) | TCP-based data transmission method and TCP agent apparatus | |
| US11245612B2 (en) | Node and a method performed by the node operable in a mesh communication network for routing a received packet towards a destination | |
| US9686733B2 (en) | Communication method in a wireless telecommunications network, associated computer program and wireless communication node | |
| CN102340391B (en) | Segmented ARQ (automatic repeat request) automatic retransmission method | |
| CN102217258A (en) | Detection processing method, data transmitter, data receiver and communication system | |
| CN103188716B (en) | RUDP periodic line fault location methods and device | |
| JP6408580B2 (en) | Method and node apparatus for operating a node in a network | |
| JP5569452B2 (en) | Wireless communication apparatus, method and program | |
| Zhou et al. | Reliable transport with memory consideration in wireless sensor networks | |
| Ayadi et al. | Improving distributed TCP caching for wireless sensor networks | |
| Braun et al. | Energy-efficient TCP operation in wireless sensor networks | |
| US20150117201A1 (en) | Data transmission system for networks with non-full-duplex or asymmetric transport | |
| CN100550891C (en) | Improve the method for wireless network transmissions performance | |
| JP6973511B2 (en) | Communication equipment, communication systems, communication methods and programs | |
| KR20120065867A (en) | Multipath tcp with end-to-end energy saving for large bandwidth delay product 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 |