CN105337900B - DTN data beam acceleration transmission method based on segment polymerization - Google Patents
DTN data beam acceleration transmission method based on segment polymerization Download PDFInfo
- Publication number
- CN105337900B CN105337900B CN201510810319.5A CN201510810319A CN105337900B CN 105337900 B CN105337900 B CN 105337900B CN 201510810319 A CN201510810319 A CN 201510810319A CN 105337900 B CN105337900 B CN 105337900B
- Authority
- CN
- China
- Prior art keywords
- bundle
- segment
- link
- transmission
- intermediate node
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/40—Flow control; Congestion control using split connections
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9057—Arrangements for supporting packet reassembly or resequencing
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention proposes a kind of DTN data beam acceleration transmission methods based on segment polymerization, including when link II starts, if intermediate node receives complete bundle, are forwarded in the conventional mode to bundle；If intermediate node receives only part segment, it will then be encapsulated into new bundle and be forwarded as load after the segment received polymerization, then, when bundle is received completely by intermediate node, newly arrived segment will handle post package in the same way and be forwarded into another bundle.Wherein, each segment carries the EID of destination node.It can effectively improve the service efficiency of link using the transmission that method of the invention carries out bundle, reduce the time delay introduced because waiting complete b undle to receive.In addition, acceleration transmission method of the invention can be used for handling link happen suddenly in bundle transmission process interruption the case where, caused by avoiding because of interruption data transmission stop.
Description
Technical field
The present invention relates to technical field of deep space communication more particularly to a kind of DTN network data beam acceleration transmission methods.
Background technique
The features such as space communication has long delay, and link down is frequent, high bit-error, so that traditional based on end-to-end company
The ICP/IP protocol connect can not be applied to the transmission of space exploration data.To overcome these problems, space communication is adopted extensively at present
With the DTN network architecture.DTN is that potential heterogeneous networks mention by introducing coating between application layer and transport layer (convergence layer)
For data transport service, main protocol includes the BP agreement of coating and the LTP agreement of convergence layer.To utilize intermittent connection
Link ensure the reliable transmissions of data simultaneously, DTN carries out forwarded hop-by-hop to data using Store and forword mechanism.When being counted
When according to transmission, source node application data (Application data union, ADU) will be encapsulated into coating as load
Bundle in.After Bundle is transmitted to convergence layer, multiple segment are divided into as a LTP block.These segment
Intermediate node protocol stack will be sent in the form of isl frame after bottom-layer network is handled.In this transmission process, LTP's
ARQ mechanism ensures reliable, the complete reception of bundle.By once transmitting or repeatedly retransmitting, when receiving complete b undle
When, intermediate node will utilize (or waiting) next hop link to be forwarded and send keeping answer signal to sending node.It sends
Node deletes corresponding bundle after receiving the signal from its memory, and the custody of bundle is transferred to receiving node.By
The forwarding of hop-by-hop in this way, bundle will eventually arrive at destination node, entrained by ADU will be resumed and consign on corresponding
Layer application.In this transmission process, due to Store and forword mechanism, intermediate node only receives ability after complete bundle
Carry out next-hop forwarding.
In order to make full use of short link to carry out data transmission, the waste of link capacity is avoided, DTN defines two types
The bundle fragment of type.
1) active fragment (proactive fragmentation)
Active fragment is divided into multiple nonoverlapping sub-blocks before bundle transmission, and each sub-block is as independent
Bundle is transmitted.Fragment size is chosen generally according to time expected from link, the factors such as memory capacity limitation.Active
More special situation is source fragment (source fragmentation) in fragment, and load is that ADU is divided into mutually not by source node
The sub-block of overlapping and these sub-blocks are encapsulated into different bundle is transmitted, and intermediate node only forwards these bundle,
Fragment no longer is carried out to it.When these bundle reach destination node, wherein the ADU sub-block carried will be recombinated.
2) reaction equation fragment (reactive fragmentation)
The triggering scene of reaction equation fragment is that link interrupts during bundle is transmitted, and causes bundle partial data
It is received by intermediate node, remaining data transmits not successfully.At this point, according to the processing method of reaction equation fragment, the received number in part
It will be used as a sub-block according to (a part of load), the part transmitted not successfully will be used as another sub-block.Add for two sub-blocks
After adding necessary header information such as routing iinformation, blocking information, these sub-blocks will be transmitted as independent bundle, simultaneously
The bundle of the non-fragment stored in sending node will be dropped.It, can be right during carrying the bundle transmission of fragment
It carries out fragment again.
Since the transmission of DTN data uses Store and forword mechanism, intermediate node is only in the item for receiving complete b undle
It just can be carried out the forwarding of next-hop under part, it is insufficient that this property is likely to result in link utilization, introduces larger propagation delay time and asks
Topic.Illustrate this problem by scene of two-hop link communication, as shown in Fig. 1, T is that link is connected to the period.Consider that the first jump set is defeated
The influence defeated to the second jump set, point or less three kinds of situation discussion.
1: the first jump set of the scene defeated end time is less than Tb2, and intermediate node waits the connection chance of the second hop link.This
When, link II will be fully utilized；
2: the first jump set of the scene defeated end time falls in section [Tb2, Te1], and intermediate node needs to wait for the complete of bundle
Whole reception just can be carried out that the second jump set is defeated, and the connection chance of the beginning link II is caused to be wasted and cannot be fully used；
3: the first jump set of scene is defeated to be remained unfulfilled at the Te1 moment, and intermediate node is not because receiving complete bundle at this time
Data jump hair (second connection period that the second forwarding jumped needs to wait for link at this time) without can be carried out second, link II's
Entire connection chance will be wasted, while introduce larger propagation delay time.
Although two kinds of sliced fashions according to bundle carry out data transmission can use short link, the chain appearance of a street is avoided
The waste of amount, but come with some shortcomings in practical application.The fragment of active fragment determines to depend on the predictability of link
That is the connection rule of link is expectable to be known, in the network that some link connections occur at random, active fragment is difficult to make
Suitable fragment determines.On the other hand, active fragment is chosen lesser fragment according to short link and is transmitted, needed for increasing
The bundle quantity (the bundle header information of required transmission increases) of transmission, to introduce biggish transport overhead, and actively
Formula fragment occurs that before being transmitted, the emergency case of link cannot be coped with very well.A kind of more effective method is using reaction equation
Fragment, but reaction equation sliced transmission substantially process is only introduced in most of research at present, is not bound with the data packet format of agreement
Concrete operations algorithm is provided, and there is the hypothesis i.e. head bundle and be transmitted to intermediate node prior to load, is receiving fractional load
In the case where intermediate node be routed using the header information that receives.But consider the presence of channel bit error rate, number
Reception according to (segment) be it is random, this hypothesis may be invalid.
Summary of the invention
In order to solve the problems in the prior art, the invention proposes a kind of DTN data beam accelerations based on segment polymerization
Transmission method using bundle reaction equation fragment, and provides specific data packet format and transmission and reassembly algorithm, improves link
Service efficiency, reduce and bundle waited completely to receive the time delay of introducing.
The invention is realized by the following technical scheme:
A kind of DTN data beam acceleration transmission method based on segment polymerization, it is characterised in that: the described method includes: working as chain
When road II starts, if intermediate node receives complete bundle, second is carried out to bundle in the conventional mode and jumps hair；
If intermediate node receives only part segment, the segment received is collected, is encapsulated into after being polymerized as load
Second is carried out in new bundle and jumps hair, then, when the segment of rest part is received completely by intermediate node, is newly arrived
The segment reached will handle post package in the same way to carry out second into another bundle and jumps hair；Wherein, the chain
Road II is link of the intermediate node to destination node, each segment carries the EID of destination node.
As a further improvement of the present invention, each described segment carries the EID of destination node specifically: carries
The EID offset of destination node.
As a further improvement of the present invention, the EID offset is stored in the Extentions of segment.
As a further improvement of the present invention, dictionary is stored in the memory of node.
As a further improvement of the present invention, it will be encapsulated into after the segment received polymerization as load new
It is forwarded in bundle specifically: intermediate node will receive Client service data, the Session of segment
ID, Offset and Length are polymerized to data block, are then encapsulated into new bundle as load and carry out next-hop
Transmission.
As a further improvement of the present invention, the low level the 6th of the Processing Control Flags of bundle is utilized
Position indicates the sending method of bundle.
As a further improvement of the present invention, described 6th is 0 corresponding conventional transmission mode, is otherwise acceleration transmission
Mode.
It as a further improvement of the present invention, will be extensive when destination node receives the bundle with accelerated mode transmission
Load, that is, data block of these multiple bundle, and the data block with identical Session ID is reassembled as original
The corresponding LTP block of bundle, to restore ADU.
The beneficial effects of the present invention are: bundle proposed by the present invention accelerates transmission mechanism, specific data packet is given
The reassembly algorithm of the transmission algorithm and destination node of format and intermediate node provides one for existing bundle reaction equation fragment
The practicable scheme of kind.By the assessment to acceleration transmission plan performance of the invention, the present invention is demonstrated compared to tradition
The advantage of transmission plan can effectively reduce the propagation delay time of bundle while accomplish that WTE performance is better than or levels off to tradition and passes
The performance of defeated mode.So can effectively improve link using the transmission that acceleration transmission method of the invention carries out bundle
Service efficiency reduces the time delay introduced because waiting complete b undle to receive.In addition, acceleration transmission method of the invention can be used for
Processing link happen suddenly in bundle transmission process interruption the case where, caused by avoiding because of interruption data transmission suspension.
Detailed description of the invention
Fig. 1 is two-hop link communication scenes schematic diagram；
Fig. 2 (a) is the form schematic diagram of Segment；
Fig. 2 (b) is the storage form schematic diagram of Extensions and EID offset；
Fig. 3 is the form schematic diagram of Data block；
Fig. 4 is the Bundle end-to-end time delay contrast schematic diagram of method and conventional method of the invention；
Fig. 5 is the influence contrast schematic diagram of method and conventional method n of the invention to failed transmission consumption WTE, wherein n table
Show the segment number that intermediate node receives when link II starts；
Fig. 6 is that method and conventional method first of the invention jump influence contrast schematic diagram of the segment size to WTE；
Fig. 7 is the influence contrast schematic diagram of method and conventional method Bundle head size of the invention to WTE.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, with reference to the accompanying drawings and embodiments, right
The present invention is further elaborated.It should be appreciated that the specific embodiments described herein are merely illustrative of the present invention, and
It is not used in the restriction present invention.
The present invention, for basic research scene, it is defeated to the second jump to comprehensively consider the first jump set with attached 3 points of communication shown in FIG. 1
The discussion influenced is transmitted, following sending method is designed:
When link II starts, if intermediate node receives complete bundle, in the conventional mode to bundle into
Row second jumps hair；If intermediate node receives only part segment, the segment received is collected, is made after being polymerized
It is encapsulated into progress second in new bundle for load and jumps hair；It is newly arrived when bundle is received completely by intermediate node
Segment will handle post package in the same way to carry out second into another bundle and jumps hair.
In order to which support section receives polymerization, transmission and the recombination of segment, the present invention makees bundle/segment format
It is suitably modified out.
The mark (Endpoint Identifier, EID) of DTN network node is stored in the dictionary of bundle, in word
Position in allusion quotation is determined by EID offset.In these EID, destination node EID plays correct route vital.
The received segment in part to be forwarded must restore dictionary and destination node EID offset, to obtain destination node
EID.Bundle is divided into multiple segment in convergence layer and is transmitted, dictionary and destination node EID in bundle
Offset may be assigned in multiple segment.Due to channel error probability, the reception of segment is random, so in
The received segment in intermediate node part possibly can not recover dictionary and destination node EID offset, to be unable to get mesh
Node EID and next-hop forwarding can not be carried out.It therefore, is forwarding random received part segment, each segment
Destination node EID should all be carried.
In view of storage EID can introduce biggish transport overhead in segment, the present invention uses storage purpose node EID
The mode of offset.Protocol overhead is reduced simultaneously in segment for storage EID offset, and the present invention is by destination node EID
Offset is stored in the Extentions in segment.Extensions is used to extend the function of basic LTP segment,
Position and format in segment is as shown in Fig. 3, wherein " ext-tag " is for indicating the extension function.Destination node
Storage form of the EID offset in Extensions such as attached drawing 2 (b) marks and indicates this extension function with 0xC0
(" ext-tag " value range is 0x00-0xFF, and wherein 0xC0-0xFF is the experiment field that agreement retains).
Since EID offset needs dictionary for inquiring, but in view of dictionary length is larger, it is stored in segment
It is unpractiaca.Therefore, dictionary is stored in node memory by the present invention.Compared to ground network, the number of nodes of space DTN compared with
It is few, therefore this method will not largely occupy node memory.If reducing its length, Ke Yijin using suitable naming method to EID
One step reduces the occupied node memory of dictionary.
In view of intermediate node can not recover complete ADU in the case where receiving part segment, so can not
Forward ADU to next node by the way of traditional.To solve this problem, the method that the present invention uses segment polymerization, it is excellent
First transmit Client service data.Specific method is the Client service that intermediate node will receive segment
Data, Session ID, Offset and Length are polymerized to data block, are then encapsulated into new bundle as load
Middle progress next-hop transmission.The format of Data block is as shown in figure 3, Session ID belongs to same session for indicating
Data block, and Offset and Length will be used to indicate position of the Client service data relative to original LTP block
It sets.
Since intermediate node using conventional transmission mode or can accelerate transmission mode, mesh according to the reception condition of bundle
Node should be able to identify with different sending methods send bundle, so that respective handling method be taken to recover ADU.For
This, the present invention utilizes low level the 6th (agreement reserved place) mark of the Processing Control Flags of bundle
The sending method of bundle corresponds to conventional transmission mode if the position is 0, is otherwise acceleration transmission mode.When destination node connects
When receiving the bundle with accelerated mode transmission, the load i.e. data block of these bundle will be restored, and will have identical
The data block of Session ID is reassembled as the corresponding LTP block of the first jump bundle (original bundle), to restore ADU.
In this regrouping process, the Client service data with " Length " length will be by the position of its Offset instruction
Rearrangement.
According to the modification above to bundle/segment format and sending method is combined, specific transmission and reassembly algorithm
It is as shown in Table 1 and Table 2 respectively.
The transmission algorithm of the acceleration transmission method of the invention of table 1
The reassembly algorithm of the acceleration transmission method of the invention of table 2
For the advantage for verifying acceleration transmission method of the invention, the present invention is disappeared with bundle end-to-end time delay and failed transmission
Consuming (Wasted transmission effort, WTE) is performance indicator, in conventional transmission mode as comparison other, to this hair
Bright transmission method carries out Performance Evaluation, and experimental result is as illustrated in figs. 4-7.
Attached drawing 4 compared the bundle end-to-end time delay of method and conventional transmission mode of the invention.From attached drawing 4 it is found that
Method of the invention effectively reduces the propagation delay time of bundle.When segment sum N is less than 26, transmission time is with N's
Increase and increases；When N is greater than 26, situation is opposite.The reason of this phenomenon is in the case where bundle size is certain
Segment several larger then segment sizes of N are smaller, so that corresponding packet loss is smaller, so that more segment is reached
Intermediate node and accelerated be transmitted to destination node.On the other hand, when segment number is less, the head of required transmission is opened
Sell less, transmission time also can be reduced accordingly.
Attached drawing 5-7 has studied influence of the key parameter to the WTE of method of the invention.By attached drawing 5 in combination with attached drawing 6
(the wherein n expression segment number that intermediate node receives when link II starts) is it is found that smaller by (10 in the bit error rate-6)
In the case of the performance of method of the invention be better than conventional transmission mode；In the bit error rate larger (10-5) in the case where, it is better than to reach
The purpose of conventional transmission scheme performance, the defeated segment of the first jump set should select then lesser size, otherwise need to ask in middle node
Point receives more segment.Attached drawing 7 shows that influence of the size on the head bundle to method performance of the invention is smaller.By
In the method for being stored in memory using dictionary, bundle head size will not be significantlyd change, it is possible to almost be ignored
Bundle head size changes the influence to method performance of the invention.
The above content is a further detailed description of the present invention in conjunction with specific preferred embodiments, and it cannot be said that
Specific implementation of the invention is only limited to these instructions.For those of ordinary skill in the art to which the present invention belongs, exist
Under the premise of not departing from present inventive concept, a number of simple deductions or replacements can also be made, all shall be regarded as belonging to of the invention
Protection scope.
Claims (3)
1. a kind of DTN data beam acceleration transmission method based on segment polymerization, it is characterised in that: the described method includes: working as link
When II starts, if intermediate node receives complete data bundle bundle, bundle is forwarded in the conventional mode；If
Intermediate node receives only part segment, then collects the segment received, is encapsulated into newly after being polymerized as load
Bundle in be forwarded, it is then, newly arrived when the segment of rest part is received completely by intermediate node
Segment will handle post package in the same way and be forwarded into another bundle；Wherein, the link II is centre
For node to the link of destination node, each segment carries the EID offset of destination node, and the EID offset is deposited
It is stored in the Extentions of segment, dictionary is stored in the memory of node；Utilize the Processing of bundle
The low level the 6th of Control Flags indicates the sending method of bundle, and described 6th is 0 corresponding conventional transmission side
Otherwise formula is acceleration transmission mode.
2. data beam acceleration transmission method according to claim 1, it is characterised in that: the segment received to polymerize
It is encapsulated into new bundle and is forwarded as load afterwards specifically: intermediate node will receive the Client of segment
Service data, Session ID, Offset and Length are polymerized to data block, are then encapsulated into as load
Next-hop transmission is carried out in new bundle.
3. data beam acceleration transmission method according to claim 1, it is characterised in that: when destination node is received to accelerate
When the bundle that mode is transmitted, the load i.e. data block of these bundle will be restored, and there will be identical Session ID
Data block be reassembled as the corresponding LTP block of original bundle, to restore ADU.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510810319.5A CN105337900B (en) | 2015-11-20 | 2015-11-20 | DTN data beam acceleration transmission method based on segment polymerization |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510810319.5A CN105337900B (en) | 2015-11-20 | 2015-11-20 | DTN data beam acceleration transmission method based on segment polymerization |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105337900A CN105337900A (en) | 2016-02-17 |
| CN105337900B true CN105337900B (en) | 2019-08-09 |
Family
ID=55288196
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510810319.5A Active CN105337900B (en) | 2015-11-20 | 2015-11-20 | DTN data beam acceleration transmission method based on segment polymerization |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105337900B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103095438A (en) * | 2013-01-09 | 2013-05-08 | 哈尔滨工业大学深圳研究生院 | Deep space delay tolerant network (DTN) multiple hop transmission method |
| CN105049152A (en) * | 2015-08-10 | 2015-11-11 | 哈尔滨工业大学深圳研究生院 | Space-error-channel-oriented DTN data aggregation transmission method |
-
2015
- 2015-11-20 CN CN201510810319.5A patent/CN105337900B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103095438A (en) * | 2013-01-09 | 2013-05-08 | 哈尔滨工业大学深圳研究生院 | Deep space delay tolerant network (DTN) multiple hop transmission method |
| CN105049152A (en) * | 2015-08-10 | 2015-11-11 | 哈尔滨工业大学深圳研究生院 | Space-error-channel-oriented DTN data aggregation transmission method |
Non-Patent Citations (4)
| Title |
|---|
| 《Bundle Protocol Header Compression》;Martin Wegner,et.al;《ACM》;20140907;全文 * |
| 《Endpoint Naming for Space Delay / Disruption Tolerant Networking》;Loren Clare,et.al;《IEEE》;20091231;全文 * |
| 《TR-Delivery Time Estimation for Space Bundles》;Nikolaos Bezirgiannidis,et.al;《IEEE》;20131231;全文 * |
| 《基于BP_LTP的空间DTN传输策略优化研究》;袁鹏;《万方数据企业知识服务平台》;20150817;说明书第2-4章 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105337900A (en) | 2016-02-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105933232B (en) | Support the Multipath Transmission control terminal and method of multi-service data transmission demand | |
| CN103200639B (en) | Method of self-organizing network directed route in air | |
| CN106851727B (en) | Method for realizing self-organizing network congestion control based on multi-path routing protocol | |
| WO2014077905A1 (en) | Multi-hop error recovery | |
| CN106922008B (en) | IPv6 wireless sensor network multi-path transmission method based on RPL routing protocol | |
| CN102263697A (en) | Method and device for sharing aggregated link traffic | |
| CN107517158B (en) | The design method of Communication Network for UAVS joint route agreement | |
| JP2006287331A (en) | Congestion control network repeating device and method | |
| Lakkakorpi et al. | Using buffer space advertisements to avoid congestion in mobile opportunistic DTNs | |
| CN101826937B (en) | Link layer error control system suitable for next generation mobile Internet and method thereof | |
| CN110572320A (en) | Named data single-source multi-path routing method, system and medium based on NDN | |
| US20030095553A1 (en) | Optical dynamic burst switch | |
| CN108667746A (en) | A method of it is delayed in tolerant network in deep space and realizes service priority | |
| CN110138432B (en) | DTN data transmission method based on network coding and relay cache assistance | |
| CN105337900B (en) | DTN data beam acceleration transmission method based on segment polymerization | |
| Bisio et al. | Combined congestion control and link selection strategies for delay tolerant interplanetary networks | |
| CN106332145A (en) | Optimization method of connection performance of TCP in mobile Ad-hoc network | |
| Scheuermann et al. | Backpressure multicast congestion control in mobile ad-hoc networks | |
| RU2678470C1 (en) | Data blocks in the switched network multi-routing method | |
| EP1091530A2 (en) | Traffic allocation on virtual trunks | |
| Lien et al. | Hop-by-Hop TCP over MANET | |
| TW201023564A (en) | Frame merging apparatus and method thereof | |
| EP1953974B1 (en) | A packet transmission scheme for improved throughput over multi-hop routes of a wireless multihop network | |
| Rong et al. | LSMR: A label switching multipath routing protocol for ad hoc networks | |
| Karnani et al. | Improved BER and PER by Reducing Communication Traffic in Wireless Communication using a Modified Network Coding Technique |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |