CN109005011B - Data transmission method and system for underwater acoustic network and readable storage medium - Google Patents

Data transmission method and system for underwater acoustic network and readable storage medium Download PDF

Info

Publication number
CN109005011B
CN109005011B CN201810908859.0A CN201810908859A CN109005011B CN 109005011 B CN109005011 B CN 109005011B CN 201810908859 A CN201810908859 A CN 201810908859A CN 109005011 B CN109005011 B CN 109005011B
Authority
CN
China
Prior art keywords
data
data transmission
packets
node
failure rate
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
Application number
CN201810908859.0A
Other languages
Chinese (zh)
Other versions
CN109005011A (en
Inventor
周浩
刘金山
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Smart Ocean Technology Co ltd
Original Assignee
Smart Ocean Technology Co ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Smart Ocean Technology Co ltd filed Critical Smart Ocean Technology Co ltd
Priority to CN201810908859.0A priority Critical patent/CN109005011B/en
Publication of CN109005011A publication Critical patent/CN109005011A/en
Application granted granted Critical
Publication of CN109005011B publication Critical patent/CN109005011B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

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

Abstract

The invention relates to a data transmission method, a system and a readable storage medium for an underwater acoustic network, wherein the data transmission method comprises the following steps: acquiring data transmission failure rate and data delay time of a coding packet in a data transmission process; obtaining the size of a 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 carrying out data transmission based on the fountain codes; the size of each data packet is a preset value. 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 data packet is obtained according to the size of the data block, is encoded and transmitted, so that the higher end-to-end delivery rate is achieved, the end-to-end delay is reduced, and more energy is saved.

Description

Data transmission method and system for underwater acoustic network and readable storage medium
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 acquiring of the data transmission failure rate of the encoded packet in the transmission process specifically includes:
Figure GDA0002748081670000021
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,
Figure GDA0002748081670000022
from the ith node to theAnd (4) the packet error rate among the i +1 nodes, and k is the number of successfully transmitted coding packets.
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:
Figure GDA0002748081670000023
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:
Figure GDA0002748081670000024
wherein, muiThe number of the coded packets sent in unit time from the ith node to the (i + 1) th node,
Figure GDA0002748081670000025
the probability that the ith node is in the transmit state,
Figure GDA0002748081670000026
is the probability that the (i + 1) th node is in the receiving state, tiAverage transmission time for successful transmission from the ith node to the (i + 1) th nodeP 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:
Figure GDA0002748081670000027
Figure GDA0002748081670000031
wherein the content of the first and second substances,
Figure GDA0002748081670000032
the probability that the ith node is in the transmit state,
Figure GDA0002748081670000033
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:
Figure GDA0002748081670000034
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.
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 a data packet between different nodes is determined by channel quality, in an underwater acoustic network, since the packet error rate of data transmission in an underwater environment is greater than the packet error rate of data transmission on land, a common way for data transmission in the underwater acoustic network is to use a fountain code for data transmission, and when data transmission is performed by the fountain code, for example, obtaining the data transmission failure rate of an encoded packet in the data transmission process specifically includes:
Figure GDA0002748081670000051
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,
Figure GDA0002748081670000052
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.
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:
Figure GDA0002748081670000061
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:
Figure GDA0002748081670000062
wherein, muiThe number of the coded packets sent in unit time from the ith node to the (i + 1) th node,
Figure GDA0002748081670000063
the probability that the ith node is in the transmit state,
Figure GDA0002748081670000064
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:
Figure GDA0002748081670000065
Figure GDA0002748081670000066
wherein the content of the first and second substances,
Figure GDA0002748081670000067
for the ith node in the transmitting stateThe ratio of the total weight of the particles,
Figure GDA0002748081670000068
is the probability that the ith node is in the receiving state, e is a 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 is
Figure GDA0002748081670000069
It 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
Figure GDA0002748081670000071
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:
Figure GDA0002748081670000072
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；
τidata delay at ith node for coded packetA late time.
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 (8)

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 the data transmission process among all nodes of an underwater acoustic network;
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; the size of each data packet is a preset value;
the obtaining of the data transmission failure rate of the encoded packet in the data transmission process specifically includes:
Figure FDA0002748081660000011
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,
Figure FDA0002748081660000012
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.
2. The data transmission method of claim 1, wherein the data delay time comprises: theoretical transmission delays and theoretical queuing delays.
3. The data transmission method according to claim 2, wherein the calculation method of the theoretical transmission delay comprises:
calculating the theoretical transmission delay according to the data transmission failure rate:
Figure FDA0002748081660000013
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.
4. The data transmission method according to claim 2, 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:
Figure FDA0002748081660000021
wherein, muiThe number of the coded packets sent in unit time from the ith node to the (i + 1) th node,
Figure FDA0002748081660000022
the probability that the ith node is in the transmit state,
Figure FDA0002748081660000023
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:
Figure FDA0002748081660000024
Figure FDA0002748081660000025
wherein the content of the first and second substances,
Figure FDA0002748081660000026
the probability that the ith node is in the transmit state,
Figure FDA0002748081660000027
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:
Figure FDA0002748081660000028
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.
5. The data transmission method according to any one of claims 1 to 4, 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.
6. The data transmission method according to claim 5, 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.
7. A data transmission system for an underwater acoustic network, the system 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 of claims 1 to 6.
8. 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 6.
CN201810908859.0A 2018-08-10 2018-08-10 Data transmission method and system for underwater acoustic network and readable storage medium Active CN109005011B (en)

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 CN109005011A (en) 2018-12-14
CN109005011B true 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)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
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 (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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
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

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8301974B2 (en) * 2008-10-22 2012-10-30 Samsung Electronics Co., Ltd. System and method for low complexity raptor codes for multimedia broadcast/multicast service
TWI485992B (en) * 2012-08-31 2015-05-21 Ind Tech Res Inst Apparatus and method for accelerating the encoding of raptor codes

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
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
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)

* Cited by examiner, † Cited by third party
Title
工业以太网中层次拓扑结构对网络性能的影响;赵海;《东北大学学报（自然科学版）》;20081031;全文 *
深空通信文件传输协议的交织技术研究;焦健;《宇航学报》;20101130;全文 *
线性网络编码运算代价的估算与分析;蒲保兴;《通信学报》;20110531;全文 *

Also Published As

Publication number Publication date
CN109005011A (en) 2018-12-14

Similar Documents

Publication Publication Date Title
US9537759B2 (en) Multi-path data transfer using network coding
US9369255B2 (en) Method and apparatus for reducing feedback and enhancing message dissemination efficiency in a multicast network
CN103580773A (en) Method and device for transmitting data frame
US11902407B2 (en) Adaptive causal network coding with feedback
WO2016045332A1 (en) Method and device for encoding parameter adjustment and feedback information processing
CN113055285B (en) Self-adaptive data transmission method based on MPTCP and network coding
US20130019136A1 (en) Correction Data
EP2782281A1 (en) Data transmission using rateless coding
KR20150045346A (en) Apparatus and method for transmitting and receiving multimedia data in mobile communication system
KR102002939B1 (en) On-demand file recovery methods and systems
CN112751644A (en) Data transmission method, device and system and electronic equipment
JP7282895B2 (en) Data retransmission decoding method, device, system and communication device
CN111385055B (en) Data transmission method and device
CN109150422B (en) Data transmission method and terminal
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
US20160218825A1 (en) Rateless decoding
EP2846469A1 (en) Rateless encoding
CN113300817A (en) Data transmission method and device
JP4217534B2 (en) Packet transmitting apparatus, packet receiving apparatus, method, and program
US10135576B2 (en) Rateless encoding
CN114745042A (en) Method and device for transmitting data of broadband and narrowband integrated satellite network
CN110943803B (en) Data transmission control method based on erasure coding
CN110233699B (en) No-rate coding method based on relative entropy under limited feedback and electronic equipment

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

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.

CP02 Change in the address of a patent holder