CN103001741B - Multi-path based deep space file seepage transmission method - Google Patents
Multi-path based deep space file seepage transmission method Download PDFInfo
- Publication number
- CN103001741B CN103001741B CN201310007056.5A CN201310007056A CN103001741B CN 103001741 B CN103001741 B CN 103001741B CN 201310007056 A CN201310007056 A CN 201310007056A CN 103001741 B CN103001741 B CN 103001741B
- Authority
- CN
- China
- Prior art keywords
- link
- transmission
- node
- file
- message capacity
- 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.)
- Expired - Fee Related
Links
Abstract
The invention relates to a multi-path based deep space file seepage transmission method and belongs to the technical field of deep space communication and deep space networks. The method comprises the steps of firstly, selecting all existing available links, correcting file transmission timing sequences of links, and reducing waste of link connecting time caused by propagation time delay; then calculating communication capacities of all available links, correcting communication capacities of all node input links, and preventing jamming during multi-path seepage transmission; correcting transmission timing sequences again through corrected communication capacities; and finally, conducting file transmission tasks according to corrected transmission timing sequences, and distributing files to all links for simultaneous transmission until file transmission is finished when a plurality of links can be used for transmission simultaneously. According to the method, the utilization ratio of the communication capacity, the file transmission instantaneity and the transmission rate of the whole deep space communication system are improved, and simultaneously, communication capacities of all levels of input links are corrected, link blockage can be prevented, and the file transmission reliability can be improved.
Description
Technical field
The present invention relates to a kind of deep space file seepage transmission method based on multipath, belong to deep space communication and deep space network technical field.
Background technology
Survey of deep space for human knowledge universe flora development, develop space resources significant.Along with development that is economic and science and technology, people are more and more higher for the enthusiasm of survey of deep space, survey of deep space task becomes increasingly complex, thing followed deep space communication business is also more and more come diversified, except traditional remote control, remote measurement and navigation data, have also appeared the data transmission service of the magnanimity such as scientific experimental data, voice, image and video.The data interaction become increasingly complex is had higher requirement to the file transfer rate in deep space communication system, system communication capacity.Due to deep space communication have that communication distance is far away, propagation delay time is large, error rate high, meanwhile, because current deep space network also exists the problems such as cycle interruption, Node distribution are sparse.Current transmission method cannot ensure the transmission of file in deep space communication system high speed rate, high reliability.Therefore, the message capacity how improving file transfer rate in deep space communication network and deep space communication network becomes an important technical problem.
" a kind of constellation cooperation high-capacity all-weather communication method based on celestial body relay " (application number 201110341391.X), disclose a kind of constellation cooperation high-capacity all-weather communication method based on celestial body relay, propose and adopt any two stars in a group of stars to work in coordination with through celestial body relay, realize between fixed star, between fixed star and planet in conjunction with seepage flow technology and the method for planet and intersatellite round-the-clock, all standing high capacity communication, method for routing proposes the seepage data transmission of to carry out in a group of stars based on parallel route.
" method for transmitting deep space file based on multipath " (application number 201110410691.9) discloses a kind of method for transmitting deep space file based on multipath, the method adopts multi-path transmission, first select communication path, by connect hours sequencing, select the connecting link of each time period, utilize a rear link to assist to transmit the packet last link needing retransmit.The waste of Lifetime section in the deep space communication network caused because of the free time can be reduced, make data packet transfer more tight, thus improve the performance of file transfer.But the method only have employed single link at each time point and carries out data packet transfer, wastes other links be communicated with, does not make full use of link communication capacity simultaneously.
" the satellite network route constructing method based on Reliability Assurance " (application number 201110410692.3) discloses a kind of satellite network route constructing method based on Reliability Assurance.The method is that main path node builds secondary node, preferentially utilizes host node to carry out transmission of messages, after completing, utilizes secondary node to transmit the message identical with host node, till destination node receives message.The method increase the reliability of satellite network transmission.The weak point of the method does not make full use of the time period that secondary node overlaps with host node; And only have selected a secondary node, abandon other enabled nodes; There is strict demand to the Lifetime of secondary node simultaneously, must ensure that secondary node has sufficient time to transmit the content identical with host node after master node transmission.
" have QoS ensure deep space network method for routing " (application number 201110410640.6) discloses a kind of method selecting time delay shortest path when there is multipath, but adopt propagation delay intercept method when time complexity curve, namely a period of time identical with link propagation time delay is clipped in the end part of every section of Lifetime section of every bar link, form available Lifetime section, if Lifetime section is less than propagation delay, then give up this time period.The method does not effectively compensate propagation delay, and in deep space communication, propagation delay is large especially, and therefore this method wastes a large amount of Lifetimes.
" the Multi-path route system of selection based on being communicated with sequential " (application number 201110293702.X) discloses a kind of Multi-path route system of selection based on being communicated with sequential, propose a kind of multi-path routing method in deep space communication time delay tolerant network DTN, link can be made full use of and be communicated with sequential, utilize multipath to transmit, improve link utilization and network throughput.But the method is still from single link communications, namely each moment only adopts single link to communicate, and do not consider multipath parallel communications simultaneously, when multilink is communicated with simultaneously, the method can waste a large amount of useful communication time.
Summary of the invention
The object of the invention is for solving the problems such as deep space communication network file transmission rate is slow, message capacity utilance is low, link Lifetime utilance is low, a kind of deep space file seepage transmission method based on multipath is proposed, to make full use of the Lifetime of multipath, by multipath seepage transmission method, make full use of the message capacity of deep space communication network, significantly promote the transmission rate of deep space file.
The concretism that the present invention realizes above-mentioned purpose is: the available link first choosing all existence, revises the file transfer sequential of link, reduces propagation delay to the waste of link Lifetime; Then calculate the message capacity of all available links, and the message capacity of each node input link is revised, prevent from producing during multi-path seepage transmission congested; Then again transmission time sequence is revised by revising rear message capacity; Finally according to revised transmission time sequence, carry out file transmission task, when multilink can transmit, transmit, until file transfer is complete to each bar link file allocation simultaneously simultaneously.
Based on a deep space file seepage transmission method for multipath, specific implementation step is:
Step one, find all available paths, obtain each bar link information;
The source node of file transfer is called traffic originating node, and file reception node is called destination node, and other nodes are called via node.Traffic originating node finds out all available paths of source node to destination node by consulting ephemeris, obtains in all available paths the connection sequential, propagation delay and the transmission rate that comprise each bar link (paths between two direct connected nodes).Using the connection sequential of each link as its file transfer sequential.
The file transfer sequential of each bar link that step 2, correction step one find;
Described file transfer sequential is the link sequential can carrying out file transfer.For any link X, the modification method of its file transfer sequential is:
The propagation delay of link X is T
x_delay, comprise n Lifetime section in each connection cycle, before revising, its connection sequential is
wherein,
represent the time started of link X i-th Lifetime section,
represent the end time of link X i-th Lifetime section.When link carries out file transfer, when the remaining SEE time of link each Lifetime section is less than propagation delay, file transfer can not be carried out again, otherwise will File lose be caused.In order to make full use of link Lifetime, and do not cause File lose, the present invention carries previous propagation delay and carries out file transfer on the basis of link Lifetime section time started, the basis of link connection end time is carried previous propagation delay and stops file transfer.Revised link transmission file sequential is
Adopt the above-mentioned file transfer sequential modification method to link X, each link is revised.
Step 3, on the basis of step 2, calculate the message capacity of each bar link within a connection cycle;
For any a link X, its message capacity C
xfor: X
Wherein, R
xt () is the transmission rate of link X.
The message capacity computational methods of link X are adopted to calculate the message capacity of each link.
The message capacity of each bar link that step 4, correction step 3 obtain.
Take paper conveyance direction as link direction, first order link is that service originating point arrives first order via node, second level link be the end node of first order link to second level via node ... total q level link in deep space network, node for the purpose of the end node of q level link.When the message capacity of via node input link is greater than the message capacity of output link, if input link sends to the data volume of via node to be greater than the message capacity of this node output link, output link has little time to send data, via node will produce choking phenomenon, cause this node to store to overflow, cause transfer files to be lost.In order to prevent choking phenomenon, need to revise the message capacity of via node input link.
The present invention revises according to the direction from destination node to traffic originating node, because destination node no longer carries out storage forwarding, there is not spillover, therefore q level link does not need to revise, first revise q-1 level link, finally revise the 1st grade of link.
For any via node J, the message capacity modification method of its input link is: via node J comprises m bar input link and k bar output link, and the message capacity before the correction of each bar input link is respectively a
1, a
2..., a
m, the revised message capacity of each bar output link is respectively b
1, b
2..., b
k, then message capacity is a
jthe revised message capacity of jth bar (1≤j≤m) input link
according to said method obtain the revised message capacity of m bar input link of via node J.
The message capacity of method to each via node input link revising via node J input link message capacity is adopted to revise.
Step 5, again revise the file transfer sequential of each bar link;
Calculate the revised message capacity of each bar link according to step 4, determined by traffic rate and transmission time according to the known message capacity of the formula calculating message capacity in step 3.In order to ensure traffic rate, traffic rate not being revised, being completed the correction of link communication capacity by the file transmission time revising link.Concrete grammar is: in file transfer sequential, intercept the Lifetime section that can reach and revise rear message capacity, abandon the transmission time sequence after this period.
For the link X crossing message capacity through step 4 correction, its revised transmission end time T
x_endmeet
wherein C '
xfor message capacity after the correction that step 4 obtains, T
startfor link is communicated with the initial time in cycle,
obtain T
x_end, thus to obtain the effective transmission time sequence of revised file be [T
start, T
x_end].T
x_endlater transmission time sequence is dropped, and does not carry out file transfer.
The file transfer sequential modification method of above-mentioned steps five link X is adopted to revise the link that each revised message capacity.
Step 6, multipath seepage transmission file.
The effective transmission time sequence obtained according to step 5 gives each bar link assignment seepage transmission content.
Step 6.1, traffic originating node is packaged into multiple packet by needing the file of transmission according to host-host protocol.
Step 6.2, the revised file transfer sequential of traffic originating node inquiry first order link, once find Lifetime section, then by the transmission rate allocation packet of packet according to this link; The transmission rate of link X is R bit/s, then link X allocated size of giving per second is the packet of R bit.Service originating point can give many corresponding packets of qualified link assignment simultaneously.
Step 6.3, file transmission time sequence after the correction of self output link of first order via node inquiry, according to method described in step 6.2 by the allocation of packets that receives to next stage link;
Step 6.4, carries out the distribution transmission of packet, until all data packet transmission are to destination node according to method described in step 6.3.
Thus complete multipath seepage transmission in deep space communication system.
Beneficial effect
Compared with prior art, tool has the following advantages in the present invention:
1. the present invention adopts multipath seepage transmission deep space file simultaneously, overcome the drawback only adopting single-link when current technology is communicated with multipath simultaneously, deep space network message capacity is made full use of, improves whole deep space communication system communication capacity utilization.
2. the present invention is when file transfer, adopting multipath seepage transmission, carrying out file transfer, as long as link with just carrying out file transfer, can significantly improve file transfer real-time and transmission rate according to transmission time sequence; The message capacity of input link at different levels is revised simultaneously, prevent link obstructions, improve the file transmission reliability.
3. present invention employs transmission time correction, by revising file transmission time, overcoming prior art to propagation delay waste of time, taking full advantage of link Lifetime and carry out transfer files, improve Link Time utilance.
Accompanying drawing explanation
Fig. 1 is flow chart of the present invention;
Fig. 2 is the network topology structure figure that the present invention uses;
Fig. 3 is the primitive connection sequential chart in the embodiment of the present invention;
Fig. 4 revises schematic diagram to the first time of link AB transmission time sequence in the embodiment of the present invention, wherein (a) original transmitted sequential that is AB link, b () is the inventive method revised AB link transmission sequential, (c) is uncorrected AB link transmission sequential;
Fig. 5 is the final correction schematic diagram to each bar link transmission sequential in the embodiment of the present invention;
Fig. 6 is the transmission time comparison diagram adopting multipath seepage transmission method of the present invention and the large small documents of existing single path method transmission 1Mbit in embodiment;
Fig. 7 adopts multipath seepage transmission method of the present invention and existing single path method to the comparison diagram of whole deep space communication system communication capacity utilization in embodiment.
Embodiment
For making the object, technical solutions and advantages of the present invention definitely, below in conjunction with accompanying drawing and instantiation, the present invention will be further described and describe in detail:
Multipath deep space file seepage transmission example of the present invention carries out based on the network topology structure shown in Fig. 2, but is not limited to this network.Topological structure in Fig. 2 represents a Mars architectures of communication networks, and due in survey of deep space task, descending file transmission task amount is far longer than upstream data, and therefore in the present invention, following style of writing part is transmitted as example.Fig. 2 interior joint A represents Mars probes, Node B, C, D represent three Mars repeater satellites, node E, F represent two grounded receiving stations, node G represents ground control centre, owing to passing through ground Internet connection between grounded receiving station and ground control centre, the speed of file transfer and reliability have extraordinary guarantee, can think that the transfer of data of Mars probes just completes the transmission of deep space file to grounded receiving station.Therefore the present invention does not consider the communication link between node E, F and node G, a research Mars probes by deep space communication system by file transfer to the process of grounded receiving station.
With reference to Fig. 1, specific implementation step of the present invention is as follows:
Step one, find all available paths, obtain each bar link information;
File transfer is initiated node and is found out all available paths of source node to destination node by consulting ephemeris, obtains in all available paths the connection sequential, propagation delay and the propagation rate that comprise each bar link;
With reference to Fig. 2, in the embodiment of the present invention, source node is node A, and destination node is node G, and what exist between source node A to destination node G can have by communication path: ABEG, ABFG, ACEG, ACFG, ADEG, ADFG6 paths.The active link existed in all paths has link AB, AC, AD, BE, BF, CE, CF, DE, DF.First consult the link that ephemeris obtains this deep space network and be communicated with cycle T=200s, then by consulting the connection sequential of every bar link in ephemeris acquisition time T, propagation delay and propagation rate.The connection sequential of each link as shown in Figure 3.Propagation delay and the propagation rate of each link are as shown in the table.
| Link | AB | AC | AD | BE | BF | CE | CF | DE | DF |
| Propagation delay (unit: s) | 15 | 10 | 12 | 10 | 15 | 15 | 20 | 20 | 15 |
| Transmission rate (unit: kbit/s) | 9 | 10 | 8 | 7 | 6 | 8 | 7 | 7 | 7 |
The file transfer sequential of each bar link that step 2, correction step one find;
Described file transfer sequential is the link sequential can carrying out file transfer.For any link X, the modification method of its file transfer sequential is:
The propagation delay of link X is T
x_delay, comprise n Lifetime section in each connection cycle, its connection sequential is
...,
wherein,
represent the time started of link X i-th Lifetime section,
represent the end time of link X i-th Lifetime section.When link carries out file transfer, when the remaining SEE time of link each Lifetime section is less than propagation delay, file transfer can not be carried out again, otherwise will File lose be caused.In order to make full use of link Lifetime, and do not cause File lose, the present invention carries previous propagation delay and carries out file transfer on the basis of link Lifetime section time started, the basis of link connection end time is carried previous propagation delay and stops file transfer.Revised link transmission file sequential is
Adopt the above-mentioned file transfer sequential modification method to link X, each link is revised.
Be described for link AB in the present embodiment.The propagation delay obtaining link AB from ephemeris is 15s, with reference to Fig. 4 (a), and the original transmitted sequential of link AB is [20,60], [80,90], [110,160].Because propagation delay is on the impact of file transfer, if do not revised link, last propagation delay of each Lifetime section of link can not be used for transfer files, AB link can transmission time sequence be [20,45], [110,145], as shown in Fig. 4 (c).Modification method of the present invention adopts to be carried previous propagation delay and carries out file transfer, after revising AB link can transmission time be [50,45], [65,75], [95,145].As shown in Fig. 4 (b).The present invention's significantly improving link Lifetime utilance can be embodied intuitively thus.Revise according to the transmission time sequence of the method to each link.
Step 3, on the basis of step 2, calculate the message capacity of each bar link within a connection cycle;
For any a link X, its message capacity C
xfor:
Wherein, R
xt () is the transmission rate of link X.
The message capacity computational methods of link X are adopted to calculate the message capacity of each link.
The message capacity of trying to achieve each bar link in the present embodiment according to said method is as shown in the table.
| Link | AB | AC | AD | BE | BF | CE | CF | DE | DF |
| Message capacity (unit: kbit) | 900 | 800 | 800 | 420 | 420 | 400 | 490 | 350 | 350 |
The message capacity of each bar link that step 4, correction step 3 obtain.
Take paper conveyance direction as link direction, first order link is that service originating point arrives first order via node, second level link be the end node of first order link to second level via node ... total q level link in deep space network, node for the purpose of the end node of q level link.When the message capacity of via node input link is greater than the message capacity of output link, if input link sends to the data volume of via node to be greater than the message capacity of this node output link, output link has little time to send data, via node will produce choking phenomenon, cause this node to store to overflow, cause transfer files to be lost.In order to prevent choking phenomenon, need to revise the message capacity of via node input link.
The present invention revises according to the direction from destination node to traffic originating node, because destination node no longer carries out storage forwarding, there is not spillover, therefore q level link does not need to revise, first revise q-1 level link, finally revise the 1st grade of link.
For any via node J, the message capacity modification method of its input link is: via node J comprises m bar input link and k bar output link, and the message capacity before the correction of each bar input link is respectively a
1, a
2..., a
m, the revised message capacity of each bar output link is respectively b
1, b
2..., b
k, then message capacity is a
jthe revised message capacity of jth bar (1≤j≤m) input link
according to said method obtain the revised message capacity of m bar input link of via node J.
The message capacity of method to each via node input link revising via node J input link message capacity is adopted to revise.
Have 3 first order via nodes in the present embodiment, be respectively Node B, C, D.Node B has an input link AB, and node C has an input link AC, and node D has an input link AD.Therefore need to revise link AB, AC, AD tri-links.For Node B, obtained the message capacity C of input link AB by step 3
aB=900kbit, the message capacity of output link BE and BF is respectively C
bE=420kbit, C
bF=420kbit.The revised message capacity C of link AB
aB'=min{C
aB, C
bE+ C
bF}=840kbit, obtains the revised message capacity of link AC and AD according to the method described above and is respectively C
aC'=800kbit, C
aD'=700kbit.
Step 5, again revise the file transfer sequential of each bar link;
Calculate the revised message capacity of each bar link according to step 4, determined by traffic rate and transmission time according to the known message capacity of the formula calculating message capacity in step 3.In order to ensure traffic rate, traffic rate not being revised, being completed the correction of link communication capacity by the file transmission time revising link.Concrete grammar is: in file transfer sequential, intercept the Lifetime section that can reach and revise rear message capacity, abandon the transmission time sequence after this period.
For the link X crossing message capacity through step 4 correction, its revised transmission end time T
x_endmeet
wherein C
' xfor message capacity after the correction that step 4 obtains, T
startfor link is communicated with the initial time in cycle,
obtain T
x_end, thus to obtain the effective transmission time sequence of revised file be [T
start, T
x_end].T
x_endlater transmission time sequence is dropped, and does not carry out file transfer.
The file transfer sequential modification method of above-mentioned steps five link X is adopted to revise the link that each revised message capacity.
In the present embodiment, after step 4 correction, the vicissitudinous link of message capacity has AB, AD.For link AB, its revised transmission end time T
aB_endmeet
be [50,45] through the revised transmission time sequence of step 2, [65,75], [95,145], namely the value of R (t) within these time periods is R
aBt ()=9kbit/s, all the other moment are 0.Solve an equation and obtain T
aB_end=138.3s, therefore the revised file transfer sequential of link AB is [50,45], [65,75], [95,138.3].In like manner try to achieve the revised file transfer sequential of link AD for [8,95.5].
In the present embodiment through all revised file transfer sequential as shown in Figure 5.
Step 6, multipath seepage transmission file.
The effective transmission time sequence obtained according to step 5 gives each bar link assignment seepage transmission content.
Step 6.1, traffic originating node is packaged into multiple packet by needing the file of transmission according to host-host protocol.
Step 6.2, the revised file transfer sequential of traffic originating node inquiry first order link, once find Lifetime section, then by the transmission rate allocation packet of packet according to this link; The transmission rate of link X is R bit/s, then the link X of giving per second distributes the packet of R bit size.Service originating point can give many corresponding packets of qualified link assignment simultaneously.
Step 6.3, file transmission time sequence after the correction of self output link of first order via node inquiry, according to method described in step 6.2 by the allocation of packets that receives to next stage link;
Step 6.4, carries out the distribution transmission of packet, until all data packet transmission are to destination node according to method described in step 6.3.
The present embodiment is to transmit the file of 1Mbit, and known each transmission protocol data bag size is 1kbit.First file is packaged into the packet of 1024 1kbit sizes according to host-host protocol.
Traffic originating node A inquires about the file transfer sequential of first order link AB, AC, AD, once find Lifetime section, then by the transmission rate allocation packet of packet according to this link.With reference to Fig. 5, in transmission 0 moment, link AC is communicated with, and the transmission rate of AC link is 10kbit/s, then the link AC that gives per second distributes 10 packets; When the transmission time is 5s, link AB can use, then give AB link distribution per second 9 packets simultaneously; When the transmission time is 8s, link AD can use, to AD link distribution per second 8 packets; Transmission time, when being 40s, link AC disconnected, then do not give AC link assignment packet.Within the time period ［ 8,40 ］, transmit to link AB, AC, AD distribute data bag simultaneously, and the packet that every bar link assignment is different.According to the method until all transfer files are transmitted by node A.When the transmission time is 44s, distributes last packet to link AD and transmit, complete the transmission of whole file at node A.
Via node B, C, D, with reference to the transmission time sequence of Fig. 5, carry out file seepage transmission, according to the method described above until by whole file transfer to node E or F.Node E and F passes through ground Ethernet again by file transfer to ground control centre G, thus completes the transmitting procedure of deep space file from Mars probes to ground control centre.
Adopt the transmission time contrast of multipath seepage transmission method of the present invention and the large small documents of existing single path method transmission 1Mbit respectively as shown in Figure 6.Wherein the transmission time of existing single path method is the minimum value of each bar single path transfer files time.As can be seen from the figure, the inventive method significantly shorten file transmission time, also namely improves file transfer rate.
Adopt multipath seepage transmission method of the present invention and existing single path method respectively to the contrast of whole deep space communication system communication capacity utilization as shown in Figure 7.Wherein existing single path method is the maximum of each bar single path message capacity utilance to the utilance of message capacity.As can be seen from the figure, the inventive method takes full advantage of the message capacity of deep space communication system, significantly improves the utilance of deep space network message capacity.
The above is preferred embodiment of the present invention, and the present invention should not be confined to the content disclosed in this embodiment and accompanying drawing.Every do not depart from spirit disclosed in this invention under the equivalence that completes or amendment, all fall into the scope of protection of the invention.
Claims (4)
1. based on a deep space file seepage transmission method for multipath, it is characterized in that: specific implementation step is as follows:
Step one, find all available paths, obtain each bar link information;
The file transfer sequential of each bar link that step 2, correction step one find; Correction principle is: on the basis of link Lifetime section time started, carry previous propagation delay carry out file transfer, the basis of link Lifetime section end time is carried previous propagation delay and stops file transfer;
Step 3, on the basis of step 2, calculate the message capacity of each bar link within a connection cycle;
For any a link X, its message capacity C
xfor:
Wherein,
represent the time started of link X i-th Lifetime section,
represent the end time of link X i-th Lifetime section, T
x_delayfor the propagation delay of link X, R
xt () is the transmission rate of link X;
for i-th Lifetime section revised time started of link X,
for i-th Lifetime section revised end time of link X, n is Lifetime section sum;
The message capacity of each bar link that step 4, correction step 3 obtain;
Take paper conveyance direction as link direction, first order link be traffic originating node to first order via node, second level link be the end node of first order link to second level via node ..., node for the purpose of the end node of q level link; If the message capacity of via node input link is greater than the message capacity of output link, then revise from q-1 level link according to the direction of destination node to traffic originating node;
For any via node J, the message capacity modification method of its input link is: via node J comprises m bar input link and k bar output link, and the message capacity before the correction of each bar input link is respectively a
1, a
2..., a
m, the revised message capacity of each bar output link is respectively b
1, b
2..., b
k, then message capacity is a
jthe revised message capacity of jth bar input link
1≤j≤m, according to said method obtains the revised message capacity of m bar input link of via node J;
The message capacity of method to each via node input link revising via node J input link message capacity is adopted to revise;
Step 5, calculate the revised message capacity of each bar link according to step 4, again revise the file transfer sequential of each bar link;
Concrete grammar is: in file transfer sequential, intercept the Lifetime section that can reach and revise rear message capacity, abandon the transmission time sequence after this time period;
Step 6, effective transmission time sequence of obtaining according to step 5, to each bar link assignment seepage transmission content, carry out multipath seepage flow file transfer;
Step 6.1, traffic originating node is packaged into multiple packet by needing the file of transmission according to host-host protocol;
Step 6.2, the revised file transfer sequential of traffic originating node inquiry first order link, once find Lifetime section, then by the transmission rate allocation packet of packet according to this link; Traffic originating node can give many corresponding packets of qualified link assignment simultaneously;
Step 6.3, file transmission time sequence after the correction of self output link of first order via node inquiry, according to method described in step 6.2 by the allocation of packets that receives to next stage link;
Step 6.4, carries out the distribution transmission of packet, until all data packet transmission are to destination node according to method described in step 6.3; Thus complete multipath seepage transmission in deep space communication system.
2. a kind of deep space file seepage transmission method based on multipath according to claim 1, it is characterized in that: traffic originating node is the source node of file transfer, destination node is file reception node, and other nodes are via node; Traffic originating node finds out all available paths of source node to destination node by consulting ephemeris, obtains in all available paths the connection sequential, propagation delay and the transmission rate that comprise each bar link; Using the connection sequential of each link as its file transfer sequential.
3. a kind of deep space file seepage transmission method based on multipath according to claim 1, is characterized in that: for any link X, the modification method of its file transfer sequential is:
Comprise n Lifetime section in each connection cycle, before revising, its connection sequential is
revised link transmission file sequential is
4. a kind of deep space file seepage transmission method based on multipath according to claim 1, is characterized in that: for the link X crossing message capacity through step 4 correction, its revised transmission end time T
x_endmeet
wherein C '
xfor message capacity after the correction that step 4 obtains, T
startfor link is communicated with the initial time in cycle,
obtain T
x_end, obtaining the effective transmission time sequence of revised file is [T
start, T
x_end]; T
x_endlater transmission time sequence is dropped.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310007056.5A CN103001741B (en) | 2013-01-08 | 2013-01-08 | Multi-path based deep space file seepage transmission method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310007056.5A CN103001741B (en) | 2013-01-08 | 2013-01-08 | Multi-path based deep space file seepage transmission method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103001741A CN103001741A (en) | 2013-03-27 |
| CN103001741B true CN103001741B (en) | 2015-06-10 |
Family
ID=47929914
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310007056.5A Expired - Fee Related CN103001741B (en) | 2013-01-08 | 2013-01-08 | Multi-path based deep space file seepage transmission method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103001741B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115442640B (en) * | 2022-08-30 | 2024-01-09 | 苏州华兴源创科技股份有限公司 | Video data transmission method, device and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1890509A2 (en) * | 2006-08-17 | 2008-02-20 | Fujitsu Ltd. | Relay station, radio base station and communication method |
| CN102316546A (en) * | 2011-10-02 | 2012-01-11 | 西安电子科技大学 | Multipath routing method based on communication sequence |
| CN102387086A (en) * | 2011-12-09 | 2012-03-21 | 西安电子科技大学 | Deep-space network routing method with QoS assurance |
| CN102413483A (en) * | 2011-11-02 | 2012-04-11 | 北京理工大学 | Constellation cooperation high-capacity all-weather communication method based on celestial body relay |
| CN102497315A (en) * | 2011-12-09 | 2012-06-13 | 西安电子科技大学 | Deep space file transmission method based on multipath |
-
2013
- 2013-01-08 CN CN201310007056.5A patent/CN103001741B/en not_active Expired - Fee Related
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP1890509A2 (en) * | 2006-08-17 | 2008-02-20 | Fujitsu Ltd. | Relay station, radio base station and communication method |
| CN102316546A (en) * | 2011-10-02 | 2012-01-11 | 西安电子科技大学 | Multipath routing method based on communication sequence |
| CN102413483A (en) * | 2011-11-02 | 2012-04-11 | 北京理工大学 | Constellation cooperation high-capacity all-weather communication method based on celestial body relay |
| CN102387086A (en) * | 2011-12-09 | 2012-03-21 | 西安电子科技大学 | Deep-space network routing method with QoS assurance |
| CN102497315A (en) * | 2011-12-09 | 2012-06-13 | 西安电子科技大学 | Deep space file transmission method based on multipath |
Non-Patent Citations (1)
| Title |
|---|
| 刘珩.《一种基于喷泉码和并行路径的深空通信无反馈协议》.《重庆邮电大学学报(自然科学版)》.2012,第24卷(第5期),第554-558页. * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103001741A (en) | 2013-03-27 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Araniti et al. | Contact graph routing in DTN space networks: overview, enhancements and performance | |
| CN102316546B (en) | Multipath routing method based on communication sequence | |
| CN103634842B (en) | Method for routing between a kind of distributed satellite network group | |
| Liu et al. | Hybrid-traffic-detour based load balancing for onboard routing in LEO satellite networks | |
| CN106254254B (en) | Mesh topology structure-based network-on-chip communication method | |
| CN109547096B (en) | Addressing and routing method suitable for global low-earth-orbit satellite constellation | |
| CN105471493A (en) | Multi-measure routing method applicable to double-layer satellite network | |
| CN105227483A (en) | Based on the low complex degree Load Balance Routing Algorithms of LEO satellite network | |
| CN103051424B (en) | A kind of radio transmitting method of unequal error protection fountain codes | |
| CN109067453A (en) | The elastic routing algorithm of the unpredictable interruption of satellite DTN network based on space-time graph model | |
| CN106209624B (en) | Earth observation satellite network minimal-overhead method for routing based on space-time diagram | |
| CN105471730A (en) | Power communication hierarchical routing path determining method | |
| CN103124420A (en) | Wireless on-chip network structuring method | |
| CN101938418A (en) | Relaying method of power line communication network | |
| CN106162752A (en) | It is applicable to the load balancing method for routing of air-ground integrated network | |
| CN101965031A (en) | Maximum probability-based cognitive radio multi-path multicast routing method | |
| CN107302396A (en) | Network route planning method between dynamic star based on mixed strategy | |
| CN102821438B (en) | A kind of wireless Mesh netword chance method for routing and router | |
| CN111162830A (en) | Satellite-ground data transmission routing method based on track forecast | |
| De Rango et al. | DTN architecture with resource-aware rate adaptation for multiple bundle transmission in interplanetary networks | |
| CN103001741B (en) | Multi-path based deep space file seepage transmission method | |
| CN102595458B (en) | Distributed multi-path route-healing method | |
| CN110149140A (en) | The retransmission method of satellite opportunistic network | |
| CN112217726B (en) | Air-to-air network distributed routing method based on Qos guarantee | |
| Apollonio et al. | DTN LEO satellite communications through ground stations and GEO relays |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20150610 Termination date: 20160108 |