CN102497315B - Deep space file transmission method based on multipath - Google Patents
Deep space file transmission method based on multipath Download PDFInfo
- Publication number
- CN102497315B CN102497315B CN201110410691.9A CN201110410691A CN102497315B CN 102497315 B CN102497315 B CN 102497315B CN 201110410691 A CN201110410691 A CN 201110410691A CN 102497315 B CN102497315 B CN 102497315B
- Authority
- CN
- China
- Prior art keywords
- packet
- link
- time
- transmission
- deep space
- 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
Landscapes
- Communication Control (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a deep space file transmission method based on multipath, which relates to the technical field of deep space communication, and is used for efficiently utilizing a connection time period of a periodic line in a deep space communication network, thereby improving file transmission performance. The transmission steps of the deep space file transmission method include: firstly, selecting current paths, enabling communication paths between a source node and a destination node to serve as the current paths; secondly, revising connection time sequence; judging whether packets in a buffer memory to be sent of a sending node belonging to the periodic line of the connection time period need to be sent in a connection time period of a non-overlapping time period; processing the packets; and at last updating the buffer memory. The deep space file transmission method based on the multipath has the advantages of being short in transmission time, high in utilization rate of the periodic line, small in influence caused by time delay and bit error rate of the deep space periodic line, suitable for the intermittent connected deep space communication network with large time delay and capable of achieving efficient utilization of deep space periodic line sources.
Description
Technical field
The invention belongs to communication technical field, further relate to a kind of method for transmitting deep space file based on multipath.The present invention can realize the waste that reduces the Lifetime section to deep space communication network link causing because of the free time, makes data packet transfer tightr, thereby improves the performance of file transfer.
Background technology
Along with various countries are to the deepening continuously of space probation, people are also increasing to the demand of the file transfer between satellite and ground, satellite and satellite.Owing to there is not the link that continues connection in deep space communication network, make to obtain the transmission path of end to end connectivity, therefore the file in traditional Internet is no longer applicable.
In order to address this problem, the deep space transfer of data committee (The Consultative Committee for Space Data Systems CCSDS) has proposed to be applicable to the file transfer protocol (FTP) (CCSDS File Delivery Protocol CFDP) of deep space communication.In file transfer protocol (FTP) CFDP, the file division that transmit leg sends needs becomes the identical packet of size to transmit.File transfer protocol (FTP) CFDP adopts negative response mechanism, in the time that recipient has detected packet loss, can send negative response (Non-Acknowledgement NAK) request retransmission.For transmit leg, receive after NAK at every turn, can preferentially send the packet of NAK institute request retransmission, then continue to send remainder data grouping.If recipient does not detect packet loss, do not return to NAK.
File transfer protocol (FTP) CFDP provides two kinds of basic transmission modes: transmitting pattern and unreliable transmission mode.Under transmitting pattern, for the packet that makes transmission can correctly arrive recipient with the probability that is greater than specified value in transmitting procedure, therefore, in limited link Lifetime section, node will guarantee packet to carry out the re-transmission of certain number of times.This mode can cause in the end of Lifetime section part, and owing to not having time enough to ensure the re-transmission of packet, causing cannot transmitting portion packet, the time of occurrence free time in link Lifetime section, causes the waste to link circuit resource.Especially on the shorter link of every section of Lifetime section, in deep space communication network, larger chain-circuit time delay occupies for a long time data packet retransmission, causes the hydraulic performance decline of file transfer.
The patent application document " based on the method for transmitting deep space file of negative response " (publication number CN 101577613A, application number 200910022871.2) of Xian Electronics Science and Technology University discloses a kind of method for transmitting deep space file based on negative response.The method, on the basis of file transfer protocol (FTP) CFDP, adopts the method for associating transmission, and file unit and new file unit waiting for transmission that needs are retransmitted are combined, and to the continuous Transmit message of recipient unit, thereby shortens the transmission time.The deficiency that the method exists is, owing to only having a paths in transmitting procedure, transmission quality is subject to this path uplink quality influence larger, when thering is more Lifetime section in the connection sequential of link, but average every section of Lifetime section more in short-term, for ensureing transmission quality, still can cause the waste to Lifetime section causing because of the free time.
Summary of the invention
The object of the invention is to solve the part Lifetime section of link because idle and be wasted, cause the problem of file transfer protocol (FTP) hydraulic performance decline, a kind of method for transmitting deep space file based on multipath is proposed, to reduce the waste to Lifetime section as far as possible, realize the effective utilization to deep space link circuit resource, improve protocol capabilities.
The concretism that the present invention realizes above-mentioned purpose is: the method that adopts multi-path transmission, utilize the mutual assistance of mulitpath between identical sources node and destination node, by assist to need the packet retransmitting to reduce the waste to Lifetime section on another paths of transmission on a paths.
The concrete steps that the present invention realizes above-mentioned purpose are as follows:
(1) choose current path: by deep space communication network, source node to destination node all can communication path as current path;
(2) revise and be communicated with sequential
2a) choose the arbitrary node on current path, the connection sequential of more all links that belong to current path from this node, if there is section overlapping time, continues to carry out next step, otherwise, execution step (3);
2b) initial time of the Lifetime section that belongs to of more overlapping time period, rejects section overlapping time in the Lifetime section that all initial times are larger;
(3) in the Lifetime section of zero lap time period, judge in the buffer memory to be sent of sending node of this Lifetime section home link and whether have packet to need to send, if having, to continue to carry out next step, otherwise, turn to step (5);
(4) process grouping
4a) relatively link residue can the transmission time and the size of successful transmission of data packets required time, if link residue can be less than successfully transmission of data packets required time the transmission time, turn to step (5), otherwise sending node sends packet to the next-hop node on link;
4b) size that passes number of times and maximum retransmission of comparing data grouping, if the number of times of biography of packet is less than maximum retransmission, moves to packet and sends in buffer memory, otherwise, packet is deleted from buffer memory to be sent;
(5) upgrade buffer memory
5a) judged whether success rate of data packet transmission transmission, if having, by packet from sending buffer memory and delete, turn to step (3), otherwise, continue to carry out next step;
5b) judge whether to receive packet negative response, if so, packet has been passed to number of times and added 1, simultaneously packet moves to buffer memory to be sent foremost from sending buffer memory, turn to step (3), otherwise, directly turn to step (3).
The present invention compared with prior art has the following advantages:
First, the present invention adopts between path and mutually assists transmission to need the method for the packet retransmitting, solve in prior art between Lian Shitong in section, owing to not having enough time to ensure the re-transmission of packet, cause cannot transmitting portion packet problem, make data packet transfer of the present invention tightr, shortened the transmission time, improved the performance of deep space communication network file transfer.
The second, the present invention adopts the method for multi-path transmission, has overcome transmission quality in prior art and has been subject to the larger problem of a paths uplink quality influence.The invention solves and there is more Lifetime section when link, but average every section of Lifetime section more in short-term, for ensureing that transmission quality causes the problem because of the waste of free time to Lifetime section, improve link utilization, improve the performance of deep space communication network file transfer.
Brief description of the drawings
Fig. 1 is flow chart of the present invention;
Fig. 2 is that correction of the present invention is communicated with sequential schematic diagram;
Fig. 3 is the file transfer protocol (FTP) CFDP performance comparison diagram of the present invention and prior art.
Embodiment:
Below in conjunction with accompanying drawing, the present invention will be further described.
With reference to accompanying drawing 1, the specific embodiment of the present invention is as follows:
Step 1, choose current path: by deep space communication network, source node to destination node all can communication path as current path.
In embodiments of the present invention, by the node A, the B that exist in deep space communication network, C, D and five nodes of E, be defined as respectively source node A, Node B, node C, node D and destination node E.Between source node A and Node B, node C and node D, have respectively link AB, link AC and the link AD that can communicate by letter, Node B, node C and node D are respectively and between destination node E, have link BE, link CE and a link DE that can communicate by letter.Therefore, three of existing to destination node of source node can be respectively by communication path: formed by link AB and link BE can communication path ABE, formed by link AC and link CE can communication path ACE, formed by link AD and link DE can communication path ADE.By source node A to three of destination node E can communication path, ABE, ACE and ADE are as current path.
Step 2, revises and is communicated with sequential
First choose the arbitrary node on current path, the connection sequential of more all links that belong to current path from this node, if there is section overlapping time, continues to carry out next step, otherwise, execution step 3.
In embodiments of the present invention, choosing arbitrary node is source node A, all from source node A, belongs to current path ABE, and the link of ACE and ADE is link AB, AC and AD.Fig. 2 is that correction of the present invention is communicated with sequential schematic diagram, in figure, and l
1, l
2and l
3represent respectively link AB, link AC and link AD.Before correction, the Lifetime section that link AB is communicated with sequential is
the Lifetime section that link AC is communicated with sequential is
the Lifetime section of link AD is
Check the sequential that is communicated with of link AB and AC, the Lifetime section of link AB
while also end, there is Lifetime section in link AC
therefore will there is section overlapping time with being communicated with in sequential of AC in link AB, section overlapping time as represented in left diagonal line hatches in Fig. 2
check the sequential that is communicated with of link AC and link AD, the Lifetime section of link AC
while also end, there is Lifetime section in link AD
therefore will there is section overlapping time with being communicated with in sequential of AD in link AC, section overlapping time as represented in vertical line shade in Fig. 2
check the sequential that is communicated with of link AB and link AD, the Lifetime section of link AB
while also end, there is Lifetime section in link AD
therefore will there is section overlapping time with being communicated with in sequential of AD in link AB, section overlapping time as represented in right diagonal line hatches in Fig. 2
Then the initial time of the Lifetime section that belongs to of more overlapping time period, rejects section overlapping time in the Lifetime section that all initial times are larger.
In embodiments of the present invention, with reference to Fig. 2, time-interleaving section
belong to the Lifetime section of link AB
it is communicated with initial time
the section of time-interleaving simultaneously
belong to the Lifetime section of link AC
it is communicated with initial time
the more overlapping time period
the Lifetime section belonging to
initial time
because
so by section overlapping time
from the larger Lifetime section of initial time
middle rejecting.Same, by section overlapping time
from the larger Lifetime section of initial time
middle rejecting, by section overlapping time
from the larger Lifetime section of initial time
middle rejecting.The revised connection sequential zero lap time period, the Lifetime section of link AB is
length is respectively T
1, T
4, the Lifetime section of link AC is
length is T
2, the Lifetime section of link AD is
length is respectively T
3, T
5.
Whether step 3, in the Lifetime section of zero lap time period, judge in the buffer memory to be sent of sending node of this Lifetime section home link and have packet to need to send, if having, to continue to carry out next step, otherwise, turn to step 5.
In embodiments of the present invention, in the Lifetime section of zero lap time period
with
in, source node A checks physical equipment, in the time that physical equipment has inquired packet arrival, just calls the program of reading out data grouping.In this way, source node judges Lifetime section
in the buffer memory to be sent of the sending node A of home link AB, whether there is packet to need transmission, Lifetime section
in the buffer memory to be sent of the sending node A of home link AC, whether there is packet to need transmission, Lifetime section
in the buffer memory to be sent of the sending node A of home link AD, whether there is packet to need transmission, Lifetime section
in the buffer memory to be sent of the sending node A of home link AB, whether there is packet to need transmission, Lifetime section
in the buffer memory to be sent of the sending node A of home link AD, whether there is packet to need to send.If have, continue to carry out next step, otherwise, turn to step 5 to upgrade buffer memory.
Step 4, processes grouping
First, relatively link residue can the transmission time and the size of successful transmission of data packets required time, can be less than successfully transmission of data packets required time the transmission time if link remains, and turns to step 5, otherwise sending node sends packet to the next-hop node on link.
In embodiments of the present invention, relatively link residue can transmission time T for source node A
iwith successful transmission of data packets required time T
nsize, if T
l< T
n, illustrate in link residue and can in the transmission time, can not ensure that packet correctly arrives recipient with the probability of specified value in being greater than transmitting procedure, so turn to step 5 to upgrade buffer memory.Otherwise, illustrate in link residue and can in the transmission time, can ensure that packet correctly arrives recipient with the probability of specified value in being greater than transmitting procedure, so work as
time, sending node A sends packet to the next-hop node B on link AB; When
time, sending node A sends packet to the next-hop node C on link AC; When
time, sending node A sends packet to the next-hop node D on link AD; When
time, sending node A sends packet to the next-hop node B on link AB; When
time, sending node A sends packet to the next-hop node D on link AD.
Link remains and can refer in the transmission time from current time, till the length of current Lifetime section this period of time of the finish time, within this period, link is communicated with, and can carry out the transmission of packet.Calculating as follows link residue can the transmission time:
Wherein, T
lfor link residue can the transmission time,
for the finish time of current Lifetime section, t is current time.In the embodiment of the present invention, when
time,
when
time,
when
Time,
When
Time,
When
Time,
Success transmission of data packets required time refers to as making packet correctly reach with the probability that is greater than specified value in transmitting procedure the time that recipient also needs.Because the number of times that can assist retransmitted data packet in next section of Lifetime section may be very large, for the successful transmission of data packets required time that prevents from calculating is negative value, need to revise result of calculation, make result of calculation must not be less than one times of chain-circuit time delay, the i.e. time that packet one-way transmission once needs.Calculate as follows successful transmission of data packets required time:
T
n＝max{[2(N-n-x)+1]·T
p，T
p}
Wherein, T
nfor successful transmission of data packets required time,
N is maximum retransmission, is expressed as and makes the packet of transmission correctly arrive recipient with the probability that is greater than specified value in transmitting procedure, will guarantee in Lifetime section joint interior nodes the number of retransmissions that packet is carried out.By stack do not have retransmit, retransmit once, twice, three times ... rear successfully probability, getting the minimum number that the sum that makes to superpose is greater than the probability of specified value in transmitting procedure is maximum retransmission N.Therefore in transmitting procedure, once number of retransmissions reaches maximum retransmission, no matter whether packet successfully arrives recipient, has all met the requirement that makes packet arrive recipient to be greater than the probability of specified value, without preserving this packet again.Calculate as follows maximum retransmission:
Wherein: m is the set satisfying condition, p is that data are grouped in the probability of makeing mistakes in transmitting procedure, data packet size in the embodiment of the present invention is 1KB, and given bit error rate (Bit Error Rate BER), can calculate p=1-(1-BER)
1024 × 8, A is the probability that the packet of regulation correctly arrives recipient,
N is the number of times of biography of packet,
X is the number of times that the link of next section of Lifetime section ownership can be assisted the link retransmitted data packet of current Lifetime section ownership.Carry out data packet retransmission and need time of twice chain-circuit time delay length, because last re-transmission does not need to wait for that recipient replys, therefore last re-transmission only needs the time of one times of chain-circuit time delay length, therefore the time needing divided by data packet retransmission by the length of next section of Lifetime section and the length sum of one times of chain-circuit time delay, using the business's who obtains integer part as x.Calculate as follows:
Wherein, T
i+1for the length of next section of Lifetime section, T
pfor chain-circuit time delay.
In the embodiment of the present invention, if current time
?
if current time
?
if current time
?
if current time
?
if current time
?
Then the size that passes number of times and maximum retransmission of comparing data grouping, if the number of times of biography of packet is less than maximum retransmission, moves to packet and sends in buffer memory, otherwise, packet is deleted from buffer memory to be sent.
In embodiments of the present invention, the grouping of source node A comparing data has passed the size of frequency n and maximum retransmission N, if n < is N, illustrate that passing number of times does not exceed maximum retransmission, source node A still needs to preserve this packet, once bust this still can retransmit this packet, so packet is moved to and sent in buffer memory.Otherwise, illustrate that passing number of times has exceeded maximum retransmission, no longer need to preserve this packet, so packet is deleted from buffer memory to be sent.
Step 5, upgrades buffer memory
First judged whether success rate of data packet transmission transmission, if having, by packet from sending buffer memory and delete, turn to step 3, otherwise, continue to carry out next step.
In embodiments of the present invention, source node A checks physical equipment, if receive replying of success rate of data packet transmission transmission, this data packet transfer success is described, no longer need to preserve this packet, so whether from sending buffer memory and delete, turning to step 3 to judge in buffer memory to be sent has packet to need to send by packet.If source node A does not receive replying of success rate of data packet transmission transmission, continue to carry out next step.
Then judge whether to receive packet negative response, if so, packet has been passed to number of times and added 1, simultaneously packet moves to buffer memory to be sent foremost from sending buffer memory, turns to step 3, otherwise, directly turn to step 3.
In embodiments of the present invention, source node A checks physical equipment, if receive packet negative response, this data packet transfer failure is described, need to be to this data packet retransmission, add 1 so packet has been passed to number of times, simultaneously packet moves to buffer memory to be sent foremost from sending buffer memory, and whether turn to step 3 to judge in buffer memory to be sent has packet to need to send.If source node A does not receive packet negative response, turn to step 3.
Below in conjunction with analogous diagram, effect of the present invention is further described.
Accompanying drawing 3 (a) is under MATLAB (Matrix Laboratory) simulated environment, as bit error rate (Bit Error Rate BER) BER=10
-5, chain-circuit time delay T
p=3s, the packet of regulation correctly arrives recipient's probability A=99%, when the link of next section of Lifetime section ownership can be assisted the number of times x=2 of link retransmitted data packet of current Lifetime section ownership, transmit respectively the transmission time comparison diagram of a file that the transmission time under leisureless desirable transmission conditions is 20s in Lifetime section with the present invention and file transfer protocol (FTP) CFDP.
In accompanying drawing 3 (a), abscissa represents the length T of link Lifetime section
i, unit is second, ordinate represents transmission time T
t, unit is second, the curve of circle mark represents T in the present invention
twith T
isituation about changing, T in the curve representation file host-host protocol CFDP of square mark
twith T
isituation about changing.
From accompanying drawing 3 (a), while adopting file transfer protocol (FTP) CFDP transmission of data packets, the transmission time is longer, and protocol capabilities is poor; While adopting transmission of data packets of the present invention, the transmission time obviously shortens, and protocol capabilities is significantly improved.Particularly work as the length T of link Lifetime section
iwhen decline, the transmission time of file transfer protocol (FTP) CFDP agreement sharply increases, and less on impact of the present invention.
Accompanying drawing 3 (b) is under MATLAB (Matrix Laboratory) simulated environment, as bit error rate BER=10
-5the packet of regulation correctly arrives recipient's probability A=99%, when the link of next section of Lifetime section ownership can be assisted the number of times x=2 of link retransmitted data packet of current Lifetime section ownership, the link utilization comparison diagram of the present invention and file transfer protocol (FTP) CFDP under different chain-circuit time delays.
In accompanying drawing 3 (b), abscissa represents the length T of link Lifetime section
i, unit is second, and ordinate represents link utilization (Link Utilization) LU, and the curve of circle mark represents chain-circuit time delay T
pwhen=1s, in the present invention, LU is with T
isituation about changing, the curve of positive triangle mark represents chain-circuit time delay T
pwhen=2s, in the present invention, LU is with T
isituation about changing, the curve of square mark represents chain-circuit time delay T
pwhen=3s, in the present invention, LU is with T
isituation about changing, the curve of cross mark represents chain-circuit time delay T
pwhen=1s, in file transfer protocol (FTP) CFDP, LU is with T
isituation about changing, the curve of asterisk mark represents chain-circuit time delay T
pwhen=2s, in file transfer protocol (FTP) CFDP, LU is with T
isituation about changing, the curve of inverted triangle mark represents chain-circuit time delay T
pwhen=3s, in file transfer protocol (FTP) CFDP, LU is with T
isituation about changing.
From accompanying drawing 3 (b), at identical chain-circuit time delay T
punder, while adopting file transfer protocol (FTP) CFDP transmission of data packets, link utilization is lower, and protocol capabilities is poor; While adopting transmission of data packets of the present invention, link utilization obviously improves, and protocol capabilities is significantly improved.Particularly work as the length T of link Lifetime section
iwhen decline, the link utilization of file transfer protocol (FTP) CFDP agreement sharply declines, and less on impact of the present invention.In addition identical T,
iunder, the gap that gap between the curve of the curve of circle mark and cross mark is less than between the curve of positive triangle mark and the curve of asterisk mark is less than the gap between the curve of square mark and the curve of inverted triangle mark, increase along with chain-circuit time delay is described, the present invention is more obvious to the improvement degree of link utilization.
Accompanying drawing 3 (c) is under MATLAB (Matrix Laboratory) simulated environment, as chain-circuit time delay T
p=1s, the packet of regulation correctly arrives recipient's probability A=99%, when the link of next section of Lifetime section ownership can be assisted the number of times x=2 of link retransmitted data packet of current Lifetime section ownership, the link utilization comparison diagram of the present invention and file transfer protocol (FTP) CFDP under different bit error rates.
In accompanying drawing 3 (c), abscissa represents the length T of link Lifetime section
i, unit is second, and ordinate represents link utilization (Link Utilization) LU, and the curve of circle mark represents bit error rate BER=10
-6time, in the present invention, LU is with T
isituation about changing, the curve of cross mark represents bit error rate BER=10
-6time, in file transfer protocol (FTP) CFDP, LU is with T
isituation about changing, the curve of positive triangle mark represents bit error rate BER=10
-5time, in the present invention, LU is with T
isituation about changing, the curve of asterisk mark represents bit error rate BER=10
-5time, in file transfer protocol (FTP) CFDP, LU is with T
isituation about changing, the curve of square mark represents bit error rate BER=10
-4time, in the present invention, LU is with T
isituation about changing, the curve of inverted triangle mark represents bit error rate BER=10
-4time, in file transfer protocol (FTP) CFDP, LU is with T
isituation about changing.
From accompanying drawing 3 (c), under identical bit error rate BER, performance of the present invention is obviously better than file transfer protocol (FTP) CFDP.In addition identical T,
iunder, the gap that gap between the curve of the curve of circle mark and cross mark is less than between the curve of positive triangle mark and the curve of asterisk mark is less than the gap between the curve of square mark and the curve of inverted triangle mark, increase along with BER is described, the present invention is more obvious to the improvement degree of link utilization.In the time of BER=10-6, because just can meeting packet, transmission primaries only successfully arrives receiving terminal to be greater than 99% probability, therefore do not need packet to retransmit, now file transfer protocol (FTP) CFDP equates with link utilization of the present invention.
Claims (4)
1. the method for transmitting deep space file based on multipath, its step comprises as follows:
(1) choose current path: by deep space communication network, source node to destination node all can communication path as current path;
(2) revise and be communicated with sequential
2a) choose the arbitrary node on current path, find all links that belong to current path from this node, and obtain the connection sequential of these links, if being communicated with in sequential, link has section overlapping time, continue to carry out next step, otherwise, execution step (3);
2b) the initial time of the Lifetime section that belongs to of more overlapping time period for several Lifetime sections with common lap, is rejected those of section that initial time is larger overlapping time;
(3) in the Lifetime section of zero lap time period, judge in the buffer memory to be sent of sending node of this Lifetime section home link and whether have packet to need to send, if having, to continue to carry out next step, otherwise, turn to step (5);
(4) process grouping
4a) relatively link residue can the transmission time and the size of successful transmission of data packets required time, if link residue can be less than successfully transmission of data packets required time the transmission time, turn to step (5), otherwise sending node sends packet to the next-hop node on link;
4b) size that passes number of times and maximum retransmission of comparing data grouping, if the number of times of biography of packet is less than maximum retransmission, moves to packet and sends in buffer memory, otherwise, packet is deleted from buffer memory to be sent;
(5) upgrade buffer memory
5a) judged whether success rate of data packet transmission transmission, if having, by packet from sending buffer memory and delete, turn to step (3), otherwise, continue to carry out next step;
5b) judge whether to receive packet negative response, if so, packet has been passed to number of times and added 1, simultaneously packet moves to buffer memory to be sent foremost from sending buffer memory, turn to step (3), otherwise, directly turn to step (3).
2. the method for transmitting deep space file based on multipath according to claim 1, is characterized in that step 4a) described link residue can calculate in the transmission time according to the following formula:
Wherein, T
lfor link residue can the transmission time,
for the finish time of current Lifetime section, t is current time.
3. the method for transmitting deep space file based on multipath according to claim 1, is characterized in that step 4a) described successful transmission of data packets required time calculates according to the following formula:
T
n＝max{[2(N-n-x)+1]·T
p，T
p}
Wherein, T
nfor successful transmission of data packets required time, N is maximum retransmission, the number of times of biography that n is packet, and x is the number of times that the link of next section of Lifetime section ownership can be assisted the link retransmitted data packet of current Lifetime section ownership, T
pfor chain-circuit time delay.
4. the method for transmitting deep space file based on multipath according to claim 1, it is characterized in that, step 4b) described maximum retransmission is expressed as and makes the packet of transmission correctly arrive recipient with the probability that is greater than specified value in transmitting procedure, will guarantee in Lifetime section joint interior nodes the number of retransmissions that packet is carried out.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110410691.9A CN102497315B (en) | 2011-12-09 | 2011-12-09 | Deep space file transmission method based on multipath |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201110410691.9A CN102497315B (en) | 2011-12-09 | 2011-12-09 | Deep space file transmission method based on multipath |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN102497315A CN102497315A (en) | 2012-06-13 |
| CN102497315B true CN102497315B (en) | 2014-10-29 |
Family
ID=46189103
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201110410691.9A Active CN102497315B (en) | 2011-12-09 | 2011-12-09 | Deep space file transmission method based on multipath |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102497315B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103001741B (en) * | 2013-01-08 | 2015-06-10 | 北京理工大学 | Multi-path based deep space file seepage transmission method |
| CN107612665B (en) * | 2017-10-27 | 2021-02-26 | 深圳友讯达科技股份有限公司 | Data information retransmission method and network transmission system |
| CN110620638B (en) * | 2019-09-27 | 2022-03-22 | 北京奇艺世纪科技有限公司 | Data transmission control method, related device and storage medium |
| CN110928717B (en) * | 2019-11-14 | 2023-04-07 | 绿盟科技集团股份有限公司 | Complex time sequence event detection method and device |
| CN111404594A (en) * | 2020-03-18 | 2020-07-10 | 杭州微萤科技有限公司 | Positioning system and method for automatically setting time sequence and cell number |
Citations (2)
| 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 |
| CN101577613A (en) * | 2009-06-05 | 2009-11-11 | 西安电子科技大学 | Method for transmitting deep space file based on negative response |
-
2011
- 2011-12-09 CN CN201110410691.9A patent/CN102497315B/en active Active
Patent Citations (2)
| 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 |
| CN101577613A (en) * | 2009-06-05 | 2009-11-11 | 西安电子科技大学 | Method for transmitting deep space file based on negative response |
Non-Patent Citations (2)
| Title |
|---|
| 史立.空间数据通信与组网技术研究.《中国优秀博硕士学位论文全文数据库》.2006,第2006年卷(第10期),全文. |
| 空间数据通信与组网技术研究;史立;《中国优秀博硕士学位论文全文数据库》;20061015;第2006年卷(第10期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN102497315A (en) | 2012-06-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101714915B (en) | Data retransmission method and system | |
| US20170134911A1 (en) | Establishment of reliable multicast/broadcast in a wireless network | |
| JP6275751B2 (en) | Improved acknowledgment and retransmission mechanism | |
| CN102497315B (en) | Deep space file transmission method based on multipath | |
| CN103051424B (en) | A kind of radio transmitting method of unequal error protection fountain codes | |
| WO2017045487A1 (en) | Method for transmitting data, base station and terminal equipment | |
| US20070104199A1 (en) | Efficient broadcast in wireless mesh networks | |
| CN101714914A (en) | Enhanced block acknowledgement | |
| CN102217258B (en) | Detection processing method, data sending terminal, data receiver and communication system | |
| Cai et al. | A network coding based protocol for reliable data transfer in underwater acoustic sensor | |
| CN103647625B (en) | Link-based data reliable transmission method | |
| CN104518853A (en) | Data retransmission method, receiving end and system | |
| US10931570B1 (en) | Flooding to routing | |
| CN100583776C (en) | Network device internal node reliable multicast method, system and device | |
| EP1207709B1 (en) | Retransmission control method and the apparatus | |
| JP4319654B2 (en) | Method for reporting packet reception result in mobile communication system | |
| CN103634083A (en) | Dynamic network coded packet loss retransmission method suitable for sensor network | |
| CN109936424A (en) | Multi-relay cooperation retransmission algorithm based on hybrid network coding | |
| CN101212283A (en) | Method for transporting acknowledged information/non-acknowledged information in communication system | |
| CN101562507A (en) | Data transmission method | |
| CN101562506B (en) | Data transmission method | |
| WO2018000373A1 (en) | Method, device, and system for data transmission | |
| CN104539402A (en) | Broadcast transmission method for use in wireless network | |
| CN101938779B (en) | Self-adapting protocol design method suitable for asymmetric burst channel | |
| CN102201901A (en) | Data retransmission method and device |
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 |