CN109005011A - It is a kind of for the data transmission method of underwater acoustic network, system and readable storage medium storing program for executing - Google Patents
It is a kind of for the data transmission method of underwater acoustic network, system and readable storage medium storing program for executing Download PDFInfo
- Publication number
- CN109005011A CN109005011A CN201810908859.0A CN201810908859A CN109005011A CN 109005011 A CN109005011 A CN 109005011A CN 201810908859 A CN201810908859 A CN 201810908859A CN 109005011 A CN109005011 A CN 109005011A
- Authority
- CN
- China
- Prior art keywords
- data
- data transmission
- packets
- node
- coding
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000005540 biological transmission Effects 0.000 title claims abstract description 150
- 238000000034 method Methods 0.000 title claims abstract description 37
- 238000004590 computer program Methods 0.000 claims description 11
- 230000001934 delay Effects 0.000 claims description 6
- 238000004364 calculation method Methods 0.000 claims description 4
- 230000006870 function Effects 0.000 description 10
- 238000004891 communication Methods 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 230000007704 transition Effects 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 238000007796 conventional method Methods 0.000 description 1
- 230000003247 decreasing effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- ZZUFCTLCJUWOSV-UHFFFAOYSA-N furosemide Chemical compound C1=C(Cl)C(S(=O)(=O)N)=CC(C(O)=O)=C1NCC1=CC=CO1 ZZUFCTLCJUWOSV-UHFFFAOYSA-N 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
- H04L1/0001—Systems modifying transmission characteristics according to link quality, e.g. power backoff
- H04L1/0006—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format
- H04L1/0007—Systems modifying transmission characteristics according to link quality, e.g. power backoff by adapting the transmission format by modifying the frame length
-
- 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/36—Flow control; Congestion control by determining packet size, e.g. maximum transfer unit [MTU]
- H04L47/365—Dynamic adaptation of the packet size
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B11/00—Transmission systems employing sonic, ultrasonic or infrasonic waves
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B13/00—Transmission systems characterised by the medium used for transmission, not provided for in groups H04B3/00 - H04B11/00
- H04B13/02—Transmission systems in which the medium consists of the earth or a large mass of water thereon, e.g. earth telegraphy
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Quality & Reliability (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Detection And Prevention Of Errors In Transmission (AREA)
Abstract
The present invention relates to a kind of for the data transmission method of underwater acoustic network, system and readable storage medium storing program for executing, which includes: the data transmission fails rate and data delay time for obtaining coding packet in data transmission procedure；It obtains data transmission fails rate and meets the first preset condition, and data delay time meets the size for the data block transmitted when the second preset condition；Carried out data transmission according to the data packet of the acquiring size respective numbers of data block based on fountain codes；The size of each data packet is preset value.The embodiment of the present invention is by obtaining data transmission fails rate and data delay time in data transmission procedure, the size of the data block transmitted in more excellent situation is obtained according to data transmission fails rate and data delay time, it is subsequent when carrying out data transmission, after being encoded according to the acquiring size data packet of the data block and transmit, to reach higher end-to-end delivery rate, thus reduce end to end delay and it is more energy efficient.
Description
Technical Field
The present invention relates to the field of underwater acoustic communication network technologies, and in particular, to a data transmission method and system for an underwater acoustic network, and a readable storage medium.
Background
Underwater acoustic networks are characterized by long propagation delays, error-prone channels and low available bandwidth. Furthermore, current hydro modems are half-duplex, with state transition delays between transmission and reception being significant, from hundreds of milliseconds to seconds. These features make the conventional method of reliable data transmission on land no longer reliable in underwater networks. First, the end-to-end data transmission method is very inefficient because a transmission failure of any one hop will result in a retransmission from the source node to the sink node, which significantly increases the average end-to-end delay. Secondly, because the data transmission is performed in a hop-by-hop manner, the delay of data propagation and node state transition is large, and the performance of the whole system may be seriously reduced by one retransmission.
Disclosure of Invention
In order to solve the problems in the prior art, at least one embodiment of the present invention provides a data transmission method, a system and a readable storage medium for an underwater acoustic network.
In a first aspect, an embodiment of the present invention provides a data transmission method for an underwater acoustic network, where the data transmission method includes:
acquiring data transmission failure rate and data delay time of a coding packet in a data transmission process;
obtaining the size of the transmitted data block when the data transmission failure rate meets a first preset condition and the data delay time meets a second preset condition;
acquiring a corresponding number of data packets according to the size of the data block and performing data transmission based on fountain codes; and the size of each data packet is a preset value.
Based on the above technical solutions, the embodiments of the present invention may be further improved as follows.
In combination with the first aspect, in a first embodiment of the first aspect,
the method includes the steps that data blocks formed by a certain number of data packets are coded based on fountain codes to obtain a preset number of coding packets, the coding packets are transmitted, and the data transmission failure rate of the coding packets in the transmission process is obtained, and the method specifically includes the following steps:
wherein P is the data transmission failure rate, miFor the number of data packets, M is the number of code packets obtained by coding the data block based on the fountain code, pi eAnd k is the packet error rate between the ith node and the (i + 1) th node, and the number of successfully transmitted coded packets is determined.
With reference to the first kind of embodiment of the first aspect, in a second kind of embodiment of the first aspect, the data delay time includes: theoretical transmission delays and theoretical queuing delays.
With reference to the second embodiment of the first aspect, in a third embodiment of the first aspect, the method for calculating the theoretical transmission delay includes:
calculating the theoretical transmission delay according to the data transmission failure rate:
wherein d isiFor the theoretical transmission delay between the ith node and the (i + 1) th node, tiAnd P is the average transmission time of successful transmission between the ith node and the (i + 1) th node, and is the data transmission failure rate.
With reference to the second embodiment of the first aspect, in a fourth embodiment of the first aspect, the method for calculating the theoretical queuing delay includes:
calculating the sending number of the coding packets in unit time in the data transmission process according to the theoretical transmission delay:
wherein, muiFor the coded packet of unit time between the ith node and the (i + 1) th nodeThe number of the transmissions is,the probability that the ith node is in the transmit state,is the probability that the (i + 1) th node is in the receiving state, tiThe average transmission time of successful transmission from the ith node to the (i + 1) th node is defined, and P is the data transmission failure rate;
and setting the probability of any node in a receiving state according to the number of the data packets:
wherein,the probability that the ith node is in the transmit state,is the probability that the ith node is in the receiving state, e is a natural constant, miM is the number of coding packets obtained by coding the data block based on the fountain code;
calculating the theoretical queuing delay of the coding packets in the data transmission process according to the sending number of the coding packets in unit time:
wherein q isiTheoretical queuing delay, λ, for the coded packet at the ith nodeFor the queuing delay of the encoded packet to conform to the parameters of the Poisson distribution, μiThe number of coded packets sent in unit time from the ith node to the (i + 1) th node, miIs the number of the data packets;
calculating the data delay time:
τi＝qi+di；
τithe data delay time at the ith node for the encoded packet.
With reference to the first aspect or any one of the first, second, third, or fourth embodiments of the first aspect, in a fifth embodiment of the first aspect, acquiring a corresponding number of data packets according to the size of the data block for data transmission based on fountain codes includes:
acquiring a corresponding number of data packets according to the size of the data block;
forming all the data packets into data blocks;
and coding the data blocks into a preset number of coding packets based on the fountain codes, and sending the coding packets to a receiving end.
With reference to the fifth embodiment of the first aspect, in the sixth embodiment of the first aspect, obtaining the size of the data block to be transmitted when the data transmission failure rate meets a first preset condition and the data delay time meets a second preset condition specifically includes:
calculating to obtain the number of the data packets by taking the data transmission failure rate smaller than a preset threshold and the data delay time as a minimum value as a constraint condition;
the number of the data packets is taken as the size of the data block to be transmitted.
In a second aspect, an embodiment of the present invention provides a data transmission system for an underwater acoustic network, where the apparatus includes: a memory, a processor and at least one computer program stored in the memory and configured to be executed by the processor, the computer program being configured to perform the data transmission method of any of the embodiments of the first aspect.
In a third aspect, the present invention provides a computer-readable storage medium, where a computer program is stored, where the computer program is executable by a processor to implement the data transmission method described in any one of the first aspect.
Compared with the prior art, the technical scheme of the invention has the following advantages: according to the embodiment of the invention, the size of the transmitted data block under the better condition is obtained according to the data transmission failure rate and the data delay time by obtaining the data transmission failure rate and the data delay time in the data transmission process, and when data transmission is subsequently carried out, the corresponding number of data packets are obtained according to the size of the data block, and then coding and transmission are carried out, so that the higher end-to-end delivery rate is achieved, and the end-to-end delay is reduced and more energy is saved.
Drawings
Fig. 1 is a schematic flow chart of a data transmission method for an underwater acoustic network according to an embodiment of the present invention;
fig. 2 is a schematic flow chart of a data transmission method for an underwater acoustic network according to another embodiment of the present invention;
fig. 3 is a schematic flow chart of a data transmission method for an underwater acoustic network according to another embodiment of the present invention;
fig. 4 is a schematic structural diagram of a data transmission system for an underwater acoustic network according to yet another embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be obtained by a person skilled in the art without any inventive step based on the embodiments of the present invention, are within the scope of the present invention.
As shown in fig. 1, an embodiment of the present invention provides a data transmission method for an underwater acoustic network, where the data transmission method includes:
and S11, acquiring the data transmission failure rate and the data delay time of the coded packet in the data transmission process.
In this embodiment, in the data transmission process, the packet error rate of the data packet between different nodes is determined by the channel quality, in the underwater acoustic network, since the packet error rate of the data transmission in the underwater environment is greater than the packet error rate of the data transmission on the land, a common mode for performing the data transmission in the underwater acoustic network is to perform the data transmission by using a fountain code, and when performing the data transmission by using the fountain code, for example, a data block composed of a certain number of data packets is encoded based on the fountain code to obtain a preset number of encoded packets, the encoded packets are transmitted, and the data transmission failure rate of the encoded packets in the data transmission process is obtained, which specifically includes:
where P is the data transmission failure rate, miM is the number of coded packets obtained by coding the data block based on the fountain code,is the packet error rate from the ith node to the (i + 1) th node, and k is the number of successfully transmitted coded packetsAnd (4) counting.
In this embodiment, when the number of successfully transmitted code packets is greater than or equal to the preset number, the original data packet can be obtained based on the fountain code principle, so that the probability of failed transmission of the original data packet is the probability and the value under all conditions when the number of successfully transmitted code packets is less than the preset number.
In this embodiment, in the underwater acoustic network, since the transmission process of the encoded packet between the nodes is performed by following a first-in first-out queue principle, the queuing delay in the transmission process of the encoded packet is a value that cannot be ignored, and one item is the data transmission delay, that is, the transmission delay of the data packet in the channel, and the transmission delay also needs the probability of transmission failure, so that the real transmission delay can be obtained by the probability of transmission failure, that is, when the condition of the channel is not changed, the transmission delay is a constant value, and at this time, the transmission delay is divided by the success rate of transmitting the encoded packet, that is, the transmission delay can be obtained; the data delay time in the data transmission process includes: theoretical queuing delay and theoretical transmission delay.
The method for calculating the theoretical transmission delay comprises the following steps:
calculating theoretical transmission delay according to the data transmission failure rate:
wherein d isiIs the theoretical transmission delay from the ith node to the (i + 1) th node, tiThe average transmission time of successful transmission from the ith node to the (i + 1) th node is P, and the data transmission failure rate is P.
As shown in fig. 2, the method for calculating the theoretical queuing delay includes:
s21, calculating the sending number of the coding packets in unit time in the data transmission process according to the theoretical transmission delay:
wherein, muiThe number of the coded packets sent in unit time from the ith node to the (i + 1) th node,the probability that the ith node is in the transmit state,is the probability that the (i + 1) th node is in the receiving state, tiThe average transmission time of successful transmission from the ith node to the (i + 1) th node is P, and the data transmission failure rate is P.
And setting the probability of any node in a receiving state according to the number of the data packets:
wherein,the probability that the ith node is in the transmit state,is the probability that the ith node is in the receiving state, e is the natural constant, miAnd M is the number of coding packets obtained by coding the data block based on the fountain code.
For example, in this embodiment, let us note that the probability that node i is in the sending state isIt is obviously a variable data block size miA function of: smaller miMeaning a larger code rate and thus a poorer channel condition; to compensate for this, if the channel quality between node i and node i +1 is poor, node i should be assigned a larger transmission probability. Therefore, it should be miIs a monotonically decreasing function of (a). To simplify the analysis, let
S22, calculating the theoretical queuing delay of the coded packets in the data transmission process according to the sending number of the coded packets in unit time:
wherein q isiThe theoretical queuing delay of the coded packet at the ith node is shown, lambda is the parameter that the queuing delay of the coded packet conforms to the Poisson distribution, muiThe number of coded packets sent in unit time from the ith node to the (i + 1) th node, miIs the number of packets. The entire system can be abstracted into a Jackson network because the service time of each node is approximately exponentially distributed and can therefore pass.
In conclusion:
τi＝qi+di；
τithe data delay time at the ith node for the encoded packet.
And S12, obtaining the size of the data block to be transmitted when the data transmission failure rate meets a first preset condition and the data delay time meets a second preset condition.
In this embodiment, the number of data packets is calculated by using the data transmission failure rate smaller than the preset threshold and the data delay time as the minimum value as the constraint condition; in order to ensure the highest success rate of data transmission, in this embodiment, since the number of the encoded packets is a fixed value, the failure rate of data transmission can be adjusted by adjusting the size of the data packets, and meanwhile, the number of the data packets under the condition that the failure rate of data transmission is smaller than a preset threshold and the data delay time is the minimum is found through the above calculation formula of the data delay time, and the size of the data block to be transmitted is determined through the number of the data packets.
S13, acquiring a corresponding number of data packets according to the size of the data block and carrying out data transmission based on the fountain codes; the size of each data packet is a preset value.
At node i, upon receiving a packet from node i-1, mi packets are first combined into one block, miIs defined as the data block size of node i. It then encodes each block into M encoded packets with a fountain code, M being defined as the encoded data block size. For design convenience, M is the same for each node, and then node i sends M encoded packets to node i + 1.
In this embodiment, since the packet error rate of data transmission in an underwater environment is greater than that of data transmission on land, a fountain code is used for data transmission in an underwater acoustic network, where the fountain code is a random code generated by a sending end of the code, and any number of code packets are generated from k original packets, and a source node continuously sends data packets without knowing whether the data packets are successfully received. And the receiving end can successfully recover all original data packets with high probability by decoding as long as receiving any subset of k (1+ epsilon) coded packets, namely receiving N slightly larger than or equal to the original k value.
As shown in fig. 3, the method for acquiring a corresponding number of data packets according to the size of a data block for data transmission based on fountain codes includes:
and S31, acquiring a corresponding number of data packets according to the size of the data block.
In this embodiment, the size of the data block is obtained by calculation in the above embodiment, and the data packets of the number corresponding to the size of the data block are obtained from all the data packets to be sent, for example, if the size of the data block obtained by calculation is 10MB, and the size of each data packet is 1MB, only 10 data packets need to be obtained.
And S32, grouping all the data packets into data blocks.
When data transmission is carried out through fountain codes every time, all data packets to be transmitted are combined into data blocks, and data transmission is convenient to carry out.
And S33, coding the data blocks into a preset number of coding packets based on the fountain codes, and sending the coding packets to a receiving end.
In this embodiment, based on the fountain code transmission and parsing manner, the data block is encoded to obtain a predetermined number of encoded packets, all the encoded packets are sent to the next node, and if the next node can correctly decode the original m packetsiFor each packet, the next node will send a positive ACK to the previous node. Otherwise, the next node will send a negative ACK to the previous node indicating the number of packets that were not recovered. Based on the negative ACK information, the previous node will send more code packets to the next node, if the next node receives code packets in the retransmission and the number of previously received code packets reaches the number of code packets that can recover all the original miAnd when the data packet is received, the data transmission process is completed. The ACK is an acknowledgement character, and in data communication, a transmission control character sent by the receiving station to the sending station indicates that the received data is acknowledged without errors.
As shown in fig. 4, an embodiment of the present invention provides a data transmission system for an underwater acoustic network, where the apparatus includes: a memory, a processor and at least one computer program stored in the memory and configured to be executed by the processor, the computer program being configured to perform the data transmission method of any of the embodiments described above.
The storage medium for recording the program code of the software program that can realize the functions of the above-described embodiments is provided to the system or apparatus in the above-described embodiments, and the program code stored in the storage medium is read and executed by the computer (or CPU or MPU) of the system or apparatus.
In this case, the program code itself read out from the storage medium performs the functions of the above-described embodiments, and the storage medium storing the program code constitutes an embodiment of the present invention.
As a storage medium for supplying the program code, for example, a flexible disk, hard disk, optical disk, magneto-optical disk, CD-ROM, CD-R, magnetic tape, nonvolatile memory card, ROM, and the like can be used.
The functions of the above-described embodiments may be realized not only by executing the readout program code by the computer, but also by some or all of actual processing operations executed by an OS (operating system) running on the computer according to instructions of the program code.
Further, the embodiments of the present invention also include a case where after the program code read out from the storage medium is written into a function expansion card inserted into the computer or into a memory provided in a function expansion unit connected to the computer, a CPU or the like included in the function expansion card or the function expansion unit performs a part of or the whole of the processing in accordance with the command of the program code, thereby realizing the functions of the above-described embodiments.
An embodiment of the present invention provides a computer-readable storage medium, in which a computer program is stored, where the computer program can be executed by a processor to implement the data transmission method in any one of the above embodiments.
Finally, it should be noted that: the above examples are only intended to illustrate the technical solution of the present invention, but not to limit it; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; and such modifications or substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (9)
1. A data transmission method for an underwater acoustic network, the data transmission method comprising:
acquiring data transmission failure rate and data delay time of a coding packet in a data transmission process;
obtaining the size of the transmitted data block when the data transmission failure rate meets a first preset condition and the data delay time meets a second preset condition;
acquiring a corresponding number of data packets according to the size of the data block and performing data transmission based on fountain codes; and the size of each data packet is a preset value.
2. The data transmission method according to claim 1,
coding a data block formed by a certain number of data packets based on a fountain code to obtain a preset number of coding packets, transmitting the coding packets, and acquiring a data transmission failure rate of the coding packets in a data transmission process, specifically comprising:
wherein P is the data transmission failure rate, miM is the number of coding packets obtained by coding the data block based on the fountain code,and k is the packet error rate between the ith node and the (i + 1) th node, and the number of successfully transmitted coded packets is determined.
3. The data transmission method of claim 2, wherein the data delay time comprises: theoretical transmission delays and theoretical queuing delays.
4. The data transmission method according to claim 3, wherein the calculation method of the theoretical transmission delay comprises:
calculating the theoretical transmission delay according to the data transmission failure rate:
wherein d isiFor the theoretical transmission delay between the ith node and the (i + 1) th node, tiIs the average transmission time from the ith node to the (i + 1) th node, and P is the dataThe rate of failed transmissions.
5. The data transmission method according to claim 3, wherein the method for calculating the theoretical queuing delay comprises:
calculating the sending number of the coding packets in unit time in the data transmission process according to the theoretical transmission delay:
wherein, muiThe number of the coded packets sent in unit time from the ith node to the (i + 1) th node,the probability that the ith node is in the transmit state,is the probability that the (i + 1) th node is in the receiving state, tiThe average transmission time of successful transmission from the ith node to the (i + 1) th node is defined, and P is the data transmission failure rate;
and setting the probability of any node in a receiving state according to the number of the data packets:
wherein,the probability that the ith node is in the transmit state,for the ith node to be in a receiving stateE is a natural constant, miM is the number of coding packets obtained by coding the data block based on the fountain code;
calculating the theoretical queuing delay of the coding packets in the data transmission process according to the sending number of the coding packets in unit time:
wherein q isiThe theoretical queuing delay of the coded packet at the ith node is shown, lambda is the parameter that the queuing delay of the coded packet conforms to the Poisson distribution, muiThe number of coded packets sent in unit time from the ith node to the (i + 1) th node, miIs the number of the data packets;
calculating the data delay time:
τi＝qi+di；
τithe data delay time at the ith node for the encoded packet.
6. The data transmission method according to any one of claims 1 to 5, wherein obtaining a corresponding number of data packets according to the size of the data block for data transmission based on fountain codes specifically includes:
acquiring a corresponding number of data packets according to the size of the data block;
forming all the data packets into data blocks;
and coding the data blocks into a preset number of coding packets based on the fountain codes, and sending the coding packets to a receiving end.
7. The data transmission method according to claim 6, wherein obtaining the size of the data block to be transmitted when the data transmission failure rate satisfies a first preset condition and the data delay time satisfies a second preset condition specifically includes:
calculating to obtain the number of the data packets by taking the data transmission failure rate smaller than a preset threshold and the data delay time as a minimum value as a constraint condition;
the number of the data packets is taken as the size of the data block to be transmitted.
8. A data transmission system for an underwater acoustic network, the apparatus comprising: memory, a processor and at least one computer program stored in the memory and configured to be executed by the processor, the computer program being configured to perform the data transmission method of any one of claims 1 to 7.
9. A computer-readable storage medium, in which a computer program is stored which is executable by a processor to implement the data transmission method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810908859.0A CN109005011B (en) | 2018-08-10 | 2018-08-10 | Data transmission method and system for underwater acoustic network and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810908859.0A CN109005011B (en) | 2018-08-10 | 2018-08-10 | Data transmission method and system for underwater acoustic network and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109005011A true CN109005011A (en) | 2018-12-14 |
| CN109005011B CN109005011B (en) | 2021-03-12 |
Family
ID=64594564
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810908859.0A Active CN109005011B (en) | 2018-08-10 | 2018-08-10 | Data transmission method and system for underwater acoustic network and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109005011B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114268677A (en) * | 2021-12-28 | 2022-04-01 | 厦门安胜网络科技有限公司 | Data transmission method and system based on weak network environment |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100100791A1 (en) * | 2008-10-22 | 2010-04-22 | Samsung Electronics Co., Ltd. | System and method for low complexity raptor codes for multimedia broadcast/multicast service |
| CN102195743A (en) * | 2010-03-17 | 2011-09-21 | 清华大学 | Coding scheme of dynamic real-time fountain code |
| CN102811221A (en) * | 2012-08-02 | 2012-12-05 | 中山大学 | Push mechanism-based scheduling method of peer-to-peer network live streaming media data package |
| CN103051981A (en) * | 2012-11-16 | 2013-04-17 | 北京邮电大学 | Adaptive frame size calculation method for multiple hop transmission of video |
| US20140068386A1 (en) * | 2012-08-31 | 2014-03-06 | Industrial Technology Research Institute | Apparatus and method for accelerating the encoding of raptor codes |
| CN103905152A (en) * | 2014-03-21 | 2014-07-02 | 华南理工大学 | Method for stochastically optimizing effective throughput adopting cross-layer joint encoding in erasure channel |
| CN105763297A (en) * | 2015-12-25 | 2016-07-13 | 珠海国芯云科技有限公司 | Cloud computing system-based remote data optimized transmission method and device |
| CN106302297A (en) * | 2016-09-22 | 2017-01-04 | 大连海事大学 | A kind of cyclic convolution hexagon multicarrier transmitting method |
-
2018
- 2018-08-10 CN CN201810908859.0A patent/CN109005011B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100100791A1 (en) * | 2008-10-22 | 2010-04-22 | Samsung Electronics Co., Ltd. | System and method for low complexity raptor codes for multimedia broadcast/multicast service |
| CN102195743A (en) * | 2010-03-17 | 2011-09-21 | 清华大学 | Coding scheme of dynamic real-time fountain code |
| CN102811221A (en) * | 2012-08-02 | 2012-12-05 | 中山大学 | Push mechanism-based scheduling method of peer-to-peer network live streaming media data package |
| US20140068386A1 (en) * | 2012-08-31 | 2014-03-06 | Industrial Technology Research Institute | Apparatus and method for accelerating the encoding of raptor codes |
| CN103051981A (en) * | 2012-11-16 | 2013-04-17 | 北京邮电大学 | Adaptive frame size calculation method for multiple hop transmission of video |
| CN103905152A (en) * | 2014-03-21 | 2014-07-02 | 华南理工大学 | Method for stochastically optimizing effective throughput adopting cross-layer joint encoding in erasure channel |
| CN105763297A (en) * | 2015-12-25 | 2016-07-13 | 珠海国芯云科技有限公司 | Cloud computing system-based remote data optimized transmission method and device |
| CN106302297A (en) * | 2016-09-22 | 2017-01-04 | 大连海事大学 | A kind of cyclic convolution hexagon multicarrier transmitting method |
Non-Patent Citations (3)
| Title |
|---|
| 焦健: "深空通信文件传输协议的交织技术研究", 《宇航学报》 * |
| 蒲保兴: "线性网络编码运算代价的估算与分析", 《通信学报》 * |
| 赵海: "工业以太网中层次拓扑结构对网络性能的影响", 《东北大学学报（自然科学版）》 * |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114268677A (en) * | 2021-12-28 | 2022-04-01 | 厦门安胜网络科技有限公司 | Data transmission method and system based on weak network environment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109005011B (en) | 2021-03-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2018045849A1 (en) | Polar code retransmission method and device | |
| CN110391879B (en) | Packet loss recovery method and device for data transmission network and computer equipment | |
| WO2018201831A1 (en) | Communication method and apparatus | |
| US11902407B2 (en) | Adaptive causal network coding with feedback | |
| CN102497248B (en) | Data retransmission method based on network coding | |
| CN113055285B (en) | Self-adaptive data transmission method based on MPTCP and network coding | |
| CN103580773A (en) | Method and device for transmitting data frame | |
| CN105306370B (en) | Method and apparatus for forwarding in a multicast network | |
| US20220209893A1 (en) | Adaptive Payload Extraction and Retransmission in Wireless Data Communications with Error Aggregations | |
| CN105450357A (en) | Adjustment method of encoding parameters, adjustment device of encoding parameters, processing method of feedback information and processing device of feedback information | |
| Zhou et al. | Fountain code based adaptive multi-hop reliable data transfer for underwater acoustic networks | |
| EP2782281A1 (en) | Data transmission using rateless coding | |
| KR102002939B1 (en) | On-demand file recovery methods and systems | |
| CN109150422B (en) | Data transmission method and terminal | |
| CN113300817A (en) | Data transmission method and device | |
| WO2022083371A1 (en) | Data transmission method and device | |
| CN109005011B (en) | Data transmission method and system for underwater acoustic network and readable storage medium | |
| KR100953567B1 (en) | Data reception acknowledge signal transmission/reception apparatus and method in mobile communication system | |
| CN114745042A (en) | Method and device for transmitting data of broadband and narrowband integrated satellite network | |
| US20160218825A1 (en) | Rateless decoding | |
| CN116847453B (en) | Satellite data transmission and satellite Internet of things access time management method | |
| JP2004349891A (en) | Packet transmitting device, packet receiving device, method, and program | |
| CN111556222B (en) | Fountain code-based image data variable-rate safe transmission method | |
| WO2015007357A1 (en) | Rateless encoding | |
| CN110943803B (en) | Data transmission control method based on erasure coding |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP02 | Change in the address of a patent holder | ||
| CP02 | Change in the address of a patent holder |
Address after: B1203-1204, Shenzhen national engineering laboratory building, 20 Gaoxin South 7th Road, Gaoxin community, Yuehai street, Nanshan District, Shenzhen, Guangdong 518000 Patentee after: SMART OCEAN TECHNOLOGY Co.,Ltd. Address before: Room 01, 11th floor, Sanhang science and technology building, Northwest University of technology, Gaoxin South 9th Road, Yuehai street, Nanshan District, Shenzhen, Guangdong 518000 Patentee before: SMART OCEAN TECHNOLOGY Co.,Ltd. |