CN111901088B - Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor - Google Patents

Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor Download PDF

Info

Publication number
CN111901088B
CN111901088B CN202010604214.5A CN202010604214A CN111901088B CN 111901088 B CN111901088 B CN 111901088B CN 202010604214 A CN202010604214 A CN 202010604214A CN 111901088 B CN111901088 B CN 111901088B
Authority
CN
China
Prior art keywords
coding
path
transmission
blocks
coding blocks
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
CN202010604214.5A
Other languages
Chinese (zh)
Other versions
CN111901088A (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.)
Zhejiang University ZJU
Original Assignee
Zhejiang University ZJU
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 Zhejiang University ZJU filed Critical Zhejiang University ZJU
Priority to CN202010604214.5A priority Critical patent/CN111901088B/en
Priority to PCT/CN2020/099984 priority patent/WO2022000435A1/en
Publication of CN111901088A publication Critical patent/CN111901088A/en
Application granted granted Critical
Publication of CN111901088B publication Critical patent/CN111901088B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04BTRANSMISSION
    • H04B13/00Transmission systems characterised by the medium used for transmission, not provided for in groups H04B3/00 - H04B11/00
    • H04B13/02Transmission systems in which the medium consists of the earth or a large mass of water thereon, e.g. earth telegraphy
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L5/00Arrangements affording multiple use of the transmission path
    • H04L5/003Arrangements for allocating sub-channels of the transmission path
    • H04L5/0044Arrangements for allocating sub-channels of the transmission path allocation of payload
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W84/00Network topologies
    • H04W84/18Self-organising networks, e.g. ad-hoc networks or sensor networks

Abstract

The application provides a method and a device for distributing erasure correcting coding blocks in multi-path transmission of an ad hoc network of an underwater sensor, wherein the method comprises the following steps: acquiring a source node and a destination node; calculating the path transmission success rate of a plurality of paths between a source node and a destination node; determining a distribution scheme of the transmission of the coding blocks of a plurality of paths based on a probability model established by Bayesian theorem; and after the source node performs erasure coding on the original data, transmitting the coding blocks on multiple paths according to the distribution scheme. Therefore, the ordered transmission of the coding blocks on multiple paths is realized, the channel resources are fully utilized, the transmission success rate is improved, and the transmission performance of the underwater network system is improved.

Description

Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor
Technical Field
The application relates to the technical field of underwater ad hoc networks, in particular to a method and a device for distributing erasure correcting coding blocks in multi-path transmission of an underwater sensor ad hoc network.
Background
As an important means for obtaining ocean information in a wide range, research on underwater sensor network technology is rapidly developed in recent years. In the civil field, the underwater sensor network can be widely applied to the aspects of marine scientific research, meteorological hydrological data acquisition, environmental pollution monitoring, marine disaster early warning, marine rare organism protection and the like. In the military field, the underwater sensor network can continuously provide underwater detection information for offshore operations, and realize regional sea area monitoring, warning identification of threat targets, submarine remote positioning navigation and the like. In the field of development of marine information, research on underwater sensor networks has great development potential. The sensor nodes can realize information interaction and cooperative work in a network environment without or lacking infrastructure arrangement in a marine environment, and a plurality of communication technologies are involved, wherein one of the key technologies is an underwater ad hoc network communication technology.
However, the underwater acoustic channel is limited by factors such as limited communication bandwidth, doppler shift, multipath effect, and the like, and communication in the marine environment has the characteristics of prolonged communication transmission time, asymmetric data transmission rate, frequent interruption of communication links, high error rate, and limited transmission node resources, and faces many problems in realizing reliable underwater sensor ad hoc networks. The existing method of combining erasure coding with multi-path transmission can be used for improving the reliability of transmission, but in a high-dynamic underwater sensor network, the difference of the transmission success rates of a plurality of paths is not considered, and the data transmission success rate of the system still needs to be improved.
With the application and development of the autonomous underwater network system, the scale of the underwater ad hoc communication network node is larger and larger in the future, the service information amount is richer and richer, and the requirements on the safety and the reliability of the node collaborative networking in the network are higher and higher.
Disclosure of Invention
The present application is directed to solving, at least to some extent, one of the technical problems in the related art.
Therefore, one objective of the present application is to provide a method for allocating erasure-correcting coding blocks in an ad hoc network of an underwater sensor through multi-path transmission, which can realize ordered transmission of the coding blocks on the multi-path, fully utilize channel resources, improve the transmission success rate, and improve the transmission performance of an underwater network system.
Another objective of the present application is to provide an erasure correcting and coding block allocation apparatus for multi-path transmission in an ad hoc network of an underwater sensor.
An embodiment of the application provides a method for distributing erasure correcting coding blocks in an ad hoc network of an underwater sensor in a multi-path transmission manner, which comprises the following steps:
acquiring a source node and a destination node;
calculating the path transmission success rate of a plurality of paths between a source node and a destination node;
determining a distribution scheme of the transmission of the coding blocks of a plurality of paths based on a probability model established by Bayesian theorem;
and after the source node performs erasure coding on the original data, transmitting the coding blocks on multiple paths according to the distribution scheme.
An embodiment of another aspect of the present application provides an apparatus for allocating erasure coding blocks in an ad hoc network of an underwater sensor through multipath transmission, including:
the acquisition module is used for acquiring a source node and a destination node;
the computing module is used for computing the path transmission success rate of a plurality of paths between the source node and the destination node;
the distribution module is used for determining a distribution scheme of the transmission of the coding blocks of the multiple paths based on a probability model established by Bayesian theorem;
the encoding module is used for carrying out erasure coding on the original data by the source node;
and the transmission module is used for transmitting the coding blocks on the multipath according to the distribution scheme after the source node performs erasure coding on the original data.
The technical scheme provided by the embodiment of the application can have the following beneficial effects:
obtaining a source node and a destination node; calculating the path transmission success rate of a plurality of paths between a source node and a destination node; determining a distribution scheme of the transmission of the coding blocks of a plurality of paths based on a probability model established by Bayesian theorem; and after the source node performs erasure coding on the original data, transmitting the coding blocks on multiple paths according to the distribution scheme. Therefore, the ordered transmission of the coding blocks on multiple paths is realized, the channel resources are fully utilized, the transmission success rate is improved, and the transmission performance of the underwater network system is improved.
Additional aspects and advantages of the present application will be set forth in part in the description which follows and, in part, will be obvious from the description, or may be learned by practice of the present application.
Drawings
The foregoing and/or additional aspects and advantages of the present application will become apparent and readily appreciated from the following description of the embodiments, taken in conjunction with the accompanying drawings of which:
fig. 1 is a schematic flowchart of a method for allocating erasure-correcting coding blocks in an ad hoc network of an underwater sensor in a multi-path transmission manner according to an embodiment of the present disclosure;
fig. 2 is a schematic diagram of a multi-path transmission erasure coding according to an embodiment of the present application;
FIG. 3 is a CSMA scheme provided by an embodiment of the present application;
fig. 4 is a schematic diagram of a routing process provided in an embodiment of the present application;
fig. 5 is a schematic structural design diagram of a routing packet according to an embodiment of the present application;
fig. 6 is a schematic structural diagram of an underwater sensor ad hoc network multi-path transmission erasure-correcting coding block distribution device according to an embodiment of the present application.
Detailed Description
Reference will now be made in detail to embodiments of the present application, examples of which are illustrated in the accompanying drawings, wherein like or similar reference numerals refer to the same or similar elements or elements having the same or similar function throughout. The embodiments described below with reference to the drawings are exemplary and intended to be used for explaining the present application and should not be construed as limiting the present application.
The following describes a method and a device for allocating erasure coding blocks in an ad hoc network of an underwater sensor by multi-path transmission according to an embodiment of the present application with reference to the accompanying drawings.
The method comprises the steps of calculating the path transmission success rate of a plurality of paths between a source node and a target node in an underwater sensor network according to an underwater acoustic channel attenuation model, making a distribution scheme based on Bayesian theorem, carrying out erasure correction coding on original data by the source node, and then transmitting a corresponding number of coding blocks on different paths according to the distribution scheme. The process improves the success rate of the target node to reconstruct the original data and improves the reliability of data transmission.
Fig. 1 is a schematic flow chart of a method for allocating erasure-correcting coding blocks in an ad hoc network of an underwater sensor in an embodiment of the present application.
As shown in fig. 1, the method comprises the steps of:
step 101, a source node and a destination node are obtained.
Step 102, calculating path transmission success rates of a plurality of paths between a source node and a destination node.
In an embodiment of the present application, calculating a path transmission success rate of a plurality of paths between a source node and a destination node includes:
according to the underwater sound propagation attenuation model, the path loss between nodes at a single frequency is expressed as formula (1):
Figure BDA0002560337350000031
wherein d is the propagation distance, and the unit is km; x is an attenuation factor; f is the signal frequency in kHz;
Figure BDA0002560337350000032
for the attenuation coefficient, the unit is dB/km, and the attenuation coefficient is calculated by equation (2).
Figure BDA0002560337350000033
Ocean turbulence noise, shipping noise, wind wave noise, and thermal noise are obtained by equations (3) - (6).
10lg(Nt(f))=17-30lg(f) (3)。
10lg(Ns(f))=40+20(s-0.5)+26lg(f)-60lg(f+0.03) (4)。
10lg(Nw(f))=50+7.5(w0.5)+20lg(f)-40lg(f+0.4) (5)。
10lgNth(f)=-15+20lg(f) (6)。
Calculating the total environmental noise from the sea turbulence noise, shipping noise, wind wave noise and thermal noise is expressed as formula (7):
N(f)=Nt(f)+Ns(f)+Nw(f)+Nth(f) (7)。
wherein s is the ship density, a value between 0 and 1; w is the wind speed in m/s.
Calculating the average signal-to-noise ratio from the total ambient noise is expressed as formula (8):
Figure BDA0002560337350000034
wherein pr (f) is an average transmission power, and the bit error rate is calculated by formula (9), and the transmission success rate for a data packet having m bits is formula (10):
Figure BDA0002560337350000041
P=(1-pe(d))m (10)。
assume multiple paths as A1,A2,...,ALTotal L paths, AiDenotes the ith path, SiIs shown on path AiAnd the probability of successful transmission is up, wherein L is more than or equal to 1, i is more than or equal to 1 and less than or equal to L, and the transmission success rate of the path obtained according to the link transmission success rate among the relay nodes on the path is expressed as formula (11):
Figure BDA0002560337350000042
where M is the total number of links included in the path, PjIs the transmission success rate of the jth link.
And 103, determining a distribution scheme of the transmission of the coding blocks of the multiple paths based on a probability model established by Bayesian theorem.
In one embodiment of the present application, determining an allocation scheme for transmission of a coding block of multiple paths based on a probability model established by bayesian theorem includes:
b represents the event that the destination node successfully receives a code block, P (A)i) Representing the probability of using each path, P (B | A)i) Is represented on path AiProbability of successful transmission of the coded block.
Knowing that the destination node successfully received a coded block, the coded block is from path aiIs represented as P (A)i| B), calculated by equations (12) to (14).
Figure BDA0002560337350000043
P(B|Ai)=Si (13)。
Figure BDA0002560337350000044
Assume that the original data is divided into k data blocks and erasure coding is performed to generate n coded blocks, where n-k is the number of redundant blocks.
The destination node should receive at least any k code blocks in the n code blocks, and the k code blocks come from AiThe number of coded blocks of (A) is expressed as kP (A)iI B), with XiIs shown on path AiThe number of code blocks distributed above, the conditions that can be satisfied, are shown in equations (15) - (17):
Figure BDA0002560337350000045
XiSi≥kP(Ai|B) (16)。
Figure BDA0002560337350000051
calculating X according to the formula (18) based on the above-mentioned satisfied conditionsiI.e. when
Figure BDA0002560337350000052
When less than n, XiIs equal to
Figure BDA0002560337350000053
Otherwise, XiEqual to n, the allocation scheme is determined.
Figure BDA0002560337350000054
And 104, after the source node performs erasure coding on the original data, transmitting the coding blocks on multiple paths according to a distribution scheme.
In an embodiment of the present application, after performing erasure coding on original data by a source node, transmitting a coding block on multiple paths according to an allocation scheme, including:
and according to the distribution scheme, sequentially taking out the coding blocks with the corresponding number from the n coding blocks, and after the n coding blocks are taken out, starting to take out the coding block from the first coding block to transmit on the path.
Specifically, the source node performs erasure coding on the original data, including:
the encoding matrix E is an n x k order matrix, and the original data is divided into k data blocks D0~Dk-1The data matrix D is a k × 1 order matrix; coding according to the coding matrix E and k data blocks, and coding the original data into n coding blocks C0~Cn-1As shown in equation (19):
Figure BDA0002560337350000055
in order to make the above embodiments more clear to those skilled in the art, the following description is made in detail with reference to fig. 2 to 5.
Fig. 2 is a schematic diagram of a multi-path transmission erasure coding according to an embodiment of the present application; fig. 3 is a schematic diagram of a CSMA (Carrier Sense Multiple Access, a protocol that allows Multiple devices to transmit signals on the same channel) scheme according to an embodiment of the present application; fig. 4 is a schematic diagram of a routing process provided in an embodiment of the present application; fig. 5 is a schematic structural design diagram of a routing packet according to an embodiment of the present application.
In order to make the technical solutions and advantages of the present application more clear, the following detailed description will be made with reference to specific embodiments of the technical solutions:
an underwater sensor self-organizing network information acquisition system is designed, sensor nodes are respectively distributed underwater for information acquisition, the distance between the nodes is more than 100km, and the transmission rate is 2 Kbps. The Sink node and the sea surface buoy are in optical fiber connection, data can be transmitted to the ground, and all the sensor nodes send information to the Sink node.
1. And (4) performing an ad hoc network process of the underwater sensor network.
And competitive CSMA protocol is adopted among the sensor nodes. The CSMA scheme flow chart is as shown in figure 3, before sending out data, monitoring the channel state, if the channel is idle in a period of time, randomly delaying 0-1 time slot to send data; if the channel is busy, taking a random backoff time to backoff according to the design of a backoff window, wherein the backoff window needs to be added into a guard interval in reference; when the back-off time is up, monitoring the channel state again; until the data is successfully transmitted.
2. And finding a plurality of paths between the source node and the destination node through a multi-path routing algorithm.
The routing process is divided into four stages of neighbor discovery, topology establishment, routing calculation and routing maintenance, the schematic diagram of the routing process is shown in fig. 4, and the design structure of the routing packet is shown in fig. 5.
(1) Neighbor discovery phase
Each node periodically broadcasts a HELLO packet, and the content of the HELLO packet comprises { packet type, source node ID }. When the node receives the HELLO packets from other nodes, the node is determined to be a neighbor node of the node and added into a neighbor information table. When a node does not receive the HELLO packet from the neighbor node for a period of time, the link between the node and the neighbor node is considered to be broken, and the neighbor node is removed from the neighbor information table.
(2) Topology establishment phase
The node broadcasts the Link State information of the node and the neighbor nodes by using a Link State notification (LSA) packet. The content of the LSA packet comprises { packet type, source node ID, packet sequence number, transmitting node ID, forwarding hop count, a series of link state information }, and the LSA packet is not transmitted periodically and is transmitted only when the link state information of the node is changed. LSA packets may be forwarded and each node in the network maintains the most recent LSA packets from other nodes. And each node represents the connection state of the nodes in the network according to the received information of all the LSA packets, and forms a network topology graph G (V, E), wherein V represents a series of nodes in the topology graph, and E represents a series of links in the topology graph.
(3) Route calculation phase
(3.1) optimal Path
The characteristic of intermittent interruptions to the underwater acoustic channel, considering that a currently unavailable link may become available later, is also considered in the route calculation phase. The link delay comprises four parts of transmission delay, propagation delay, available delay of a waiting link and queuing delay, so that the delay estimation formulas of the available link and the unavailable link are respectively as follows:
available links: t is tavailable=(qnum+1)×latency+qlen/bw。
Wherein q isnumRepresenting the number of messages queued on the link, latency being the average propagation delay of the message transmission on the link, qlenIs the total size of the queued messages and bw is the bandwidth of the link.
Unavailable link: t is tunavaliable=latency+toutage
Where latency is the average propagation delay of a message transmission on a link, toutageIs the time (up to 24 hours) that link failure has so far lasted.
And taking the link delay as the link weight, wherein the route calculation stage is a Dijkstra shortest path algorithm of a delay version. By this, the best path can be obtained in the network.
(3.2) multipath routing
Note that the structure of the routing table includes two parts, a sequence number and a next hop address. Finding the optimal path according to the network topology G (V, E), if existing, the address n of the next hop node1Storing the routing table; otherwise, the searching process is ended. Finding a second path based on the presence of the first path: g (V, E) is first copied to obtain a copy of the original topology, and then the source node and n are copied in the copy1Removing the link between the two nodes to obtain a new topological graph G '(V, E'); finding the best path in the new topology, if existing, the next hop nodeAddress n2And storing the data into the routing table, otherwise, finishing searching. Similarly, more path searches may be performed. The link between the found next hop node and the source node is removed to obtain a new topological graph, the optimal path searching is carried out, and at least one link between different searched paths can be ensured to be different.
(4) Route maintenance phase
In a dynamic water environment, in order to prevent the path from not responding for a long time or the path from being unreachable due to the loss of a neighboring node, the routing process is performed again when the latest LSA packet from other nodes is received. In addition to this, a route maintenance timer is set, and when the timer expires, the routing process is also resumed.
3. And the source node performs erasure coding on the original data to generate a plurality of coding blocks.
The complete process of erasure coding is: the encoding matrix E is an n x k order matrix, and the original data is divided into k data blocks D0~Dk-1The data matrix D is a k × 1 order matrix, where n is 3 and k is 2, and the principle of encoding is shown:
Figure BDA0002560337350000071
any 2 rows of the encoding matrix E constitute a matrix that is invertible. Through the above coding process, the original data is coded into D0,D1,C0
4. And the source node obtains a distribution scheme for the coding blocks by a distribution method based on a Bayesian formula.
Suppose three paths A from the source node to the destination node are found1,A2,A3And calculating the successful transmission probability of each path according to the attenuation model: s1=0.8,S2=0.65,S3When the value is 0.7, the calculation process of the allocation scheme is as follows:
Figure BDA0002560337350000072
Figure BDA0002560337350000073
Figure BDA0002560337350000074
P(B|Ai)=Si
Figure BDA0002560337350000075
Figure BDA0002560337350000076
Figure BDA0002560337350000081
therefore, when
Figure BDA0002560337350000082
When less than n, XiIs equal to
Figure BDA0002560337350000083
Otherwise, XiIs equal to n. Obtaining: x1=2,X2=1,X3=1。
5. The source node transmits the encoded blocks over multiple paths according to a distribution scheme.
According to the distribution scheme described above, the first two of the 3 encoded blocks obtained by encoding are on path a1Up transmission, the third is on path A2Up-transmission, then starting from one coding block, the first coding block is at A3And (4) transmitting.
6. And the destination node performs erasure decoding on the received coding block.
When any 2 of the 3 data blocks are received, the original data can be recovered. Hypothesis receivingTo D0,C0Then, there are:
Figure BDA0002560337350000084
wherein, the matrix F is composed of the row vectors of the 1 st row and the 3 rd row in the corresponding E matrix, and then the inverse matrix F multiplied by the matrix F is arranged on the left side and the right side of the equation-1The following can be obtained:
Figure BDA0002560337350000085
namely:
Figure BDA0002560337350000086
thus, the original data D can be calculated0,D1This is the complete decoding process.
To sum up, according to the method for distributing the erasure correction coding blocks for the multi-path transmission of the ad hoc network of the underwater sensor, the original data are subjected to erasure correction coding according to the characteristics of frequent interruption, high bit error rate and the like of an underwater acoustic channel, redundant groups are generated by means of the erasure correction coding, and the original data can be decoded and recovered by a target node only by receiving part of coding groups, so that the transmission success rate and the transmission reliability are improved; by means of a multi-path routing scheme of the underwater sensor network and a distribution method based on Bayesian theorem, the coded packets are orderly transmitted in parallel on multiple paths, channel resources are fully utilized, and the receiving success rate is improved.
Fig. 6 is a schematic structural diagram of an underwater sensor ad hoc network multi-path transmission erasure-correcting coding block distribution device according to an embodiment of the present application.
As shown in fig. 6, the apparatus includes: an acquisition module 601, a calculation module 602, an allocation module 603, an encoding module 604, and a transmission module 605.
An obtaining module 601, configured to obtain a source node and a destination node.
A calculating module 602, configured to calculate a path transmission success rate of multiple paths between a source node and a destination node.
The allocating module 603 is configured to determine an allocation scheme for transmission of the coding blocks of the multiple paths based on a probability model established by bayesian theorem.
And an encoding module 604, configured to erasure encode the original data by the source node.
A transmission module 605, configured to transmit the coding block on the multipath according to the allocation scheme after the source node performs erasure coding on the original data.
Further, in a possible implementation manner of the embodiment of the present application, the calculating module 602 is specifically configured to:
according to the underwater sound propagation attenuation model, the path loss between nodes at a single frequency is expressed as formula (1):
Figure BDA0002560337350000091
wherein d is the propagation distance, and the unit is km; x is an attenuation factor; f is the signal frequency in kHz;
Figure BDA0002560337350000092
for the attenuation coefficient, the unit is dB/km, and the attenuation coefficient is calculated by equation (2).
Figure BDA0002560337350000093
Ocean turbulence noise, shipping noise, wind wave noise, and thermal noise are obtained by equations (3) - (6).
10lg(Nt(f))=17-30lg(f) (3)。
10lg(Ns(f))=40+20(s-0.5)+26lg(f)-60lg(f+0.03) (4)。
10lg(Nw(f))=50+7.5(w0.5)+20lg(f)-40lg(f+0.4) (5)。
10lgNth(f)=-15+20lg(f) (6)。
Calculating the total environmental noise from the sea turbulence noise, shipping noise, wind wave noise and thermal noise is expressed as formula (7):
N(f)=Nt(f)+Ns(f)+Nw(f)+Nth(f) (7)。
wherein s is the ship density, a value between 0 and 1; w is the wind speed in m/s.
Calculating the average signal-to-noise ratio from the total ambient noise is expressed as formula (8):
Figure BDA0002560337350000094
wherein pr (f) is an average transmission power, and the bit error rate is calculated by formula (9), and the transmission success rate for a data packet having m bits is formula (10):
Figure BDA0002560337350000095
P=(1-pe(d))m (10)。
assume multiple paths as A1,A2,...,ALTotal L paths, AiDenotes the ith path, SiIs shown on path AiAnd the probability of successful transmission is up, wherein L is more than or equal to 1, i is more than or equal to 1 and less than or equal to L, and the transmission success rate of the path obtained according to the link transmission success rate among the relay nodes on the path is expressed as formula (11):
Figure BDA0002560337350000096
where M is the total number of links included in the path, PjIs the transmission success rate of the jth link.
Further, in a possible implementation manner of the embodiment of the present application, the allocating module 603 is specifically configured to:
b represents the event that the destination node successfully receives a coded block, P (A)i) Representing the probability of using each path, P (B | A)i) Is represented on path AiProbability of successful transmission of the coded block.
Knowing that the destination node successfully received a coded block, the coded block is from path aiIs represented as P (A)i| B), calculated by equations (12) to (14).
Figure BDA0002560337350000101
P(B|Ai)=Si (13)。
Figure BDA0002560337350000102
Assume that the original data is divided into k data blocks and erasure coding is performed to generate n coded blocks, where n-k is the number of redundant blocks.
The destination node should receive at least any k code blocks in the n code blocks, and the k code blocks come from AiThe number of coded blocks of (A) is expressed as kP (A)iI B), with XiIs shown on path AiThe number of code blocks distributed above, the conditions that can be satisfied, are shown in equations (15) - (17):
Figure BDA0002560337350000103
XiSi≥kP(Ai|B) (16)。
Figure BDA0002560337350000104
calculating X according to the formula (18) based on the above-mentioned satisfied conditionsiI.e. when
Figure BDA0002560337350000105
When less than n, XiIs equal to
Figure BDA0002560337350000106
Otherwise, XiEqual to n, the allocation scheme is determined.
Figure BDA0002560337350000107
Further, in a possible implementation manner of the embodiment of the present application, the encoding module 604 is specifically configured to:
the coding matrix B is an n x k order matrix, and the original data is divided into k data blocks D0~Dk-1The data matrix D is a k × 1 order matrix; coding according to the coding matrix B and k data blocks, and coding the original data into n coding blocks C0~Cn-1As shown in equation (19):
Figure BDA0002560337350000111
further, in a possible implementation manner of the embodiment of the present application, the transmission module 605 is specifically configured to:
and according to the distribution scheme, sequentially taking out the coding blocks with the corresponding number from the n coding blocks, and after the n coding blocks are taken out, starting to take out the coding block from the first coding block to transmit on the path.
The device for distributing the erasure correcting coding blocks in the ad hoc network multi-path transmission of the underwater sensor in the embodiment of the application acquires a source node and a destination node; calculating the path transmission success rate of a plurality of paths between a source node and a destination node; determining a distribution scheme of the transmission of the coding blocks of a plurality of paths based on a probability model established by Bayesian theorem; and after the source node performs erasure coding on the original data, transmitting the coding blocks on multiple paths according to the distribution scheme. Therefore, the ordered transmission of the coding blocks on multiple paths is realized, the channel resources are fully utilized, the transmission success rate is improved, and the transmission performance of the underwater network system is improved.
In order to implement the foregoing embodiments, an embodiment of the present application provides an electronic device, including: the distribution method of the erasure-correcting coding blocks of the ad hoc network of the underwater sensor is realized by the processor when the processor executes the program.
In order to implement the foregoing embodiments, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method for allocating erasure-correcting coding blocks in an ad hoc network of underwater sensors according to the foregoing method embodiments.
Furthermore, the terms "first", "second" and "first" are used for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defined as "first" or "second" may explicitly or implicitly include at least one such feature. In the description of the present application, "plurality" means at least two, e.g., two, three, etc., unless specifically limited otherwise.
In the description herein, reference to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the application. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
Although embodiments of the present application have been shown and described above, it is understood that the above embodiments are exemplary and should not be construed as limiting the present application, and that variations, modifications, substitutions and alterations may be made to the above embodiments by those of ordinary skill in the art within the scope of the present application.

Claims (8)

1. A distribution method of erasure correcting coding blocks in multi-path transmission of an ad hoc network of an underwater sensor is characterized by comprising the following steps:
acquiring a source node and a destination node;
calculating path transmission success rates of a plurality of paths between the source node and the destination node;
determining a distribution scheme of the transmission of the coding blocks of the multiple paths based on a probability model established by Bayesian theorem;
after the source node performs erasure coding on the original data, transmitting coding blocks on multiple paths according to the distribution scheme;
the determining the distribution scheme of the transmission of the coding blocks of the multiple paths based on the probability model established by the Bayesian theorem comprises the following steps:
b represents the event of successful reception of a coded block by the destination node, P (A)i) Representing the probability of using each path, P (B | A)i) Is represented on path AiA probability of successful transmission of the code block;
knowing that the destination node successfully received a coded block, the coded block is from path aiIs represented as P (A)i| B), calculated by equations (12) to (14);
Figure FDA0003186664040000011
P(B|Ai)=Si (13);
Figure FDA0003186664040000012
the method comprises the steps of supposing that original data are divided into k data blocks, carrying out erasure coding, and generating n coding blocks, wherein n-k is the number of redundant blocks;
if the destination node should receive at least any k coding blocks from the n coding blocks, the k coding blocks are from AiIs represented by the number of coded blocksIs kP (A)iI B), with XiIs shown on path AiThe number of code blocks distributed above, the conditions that can be satisfied, are shown in equations (15) - (17):
Figure FDA0003186664040000013
XiSi≥kP(Ai|B) (16);
Figure FDA0003186664040000014
calculating X according to the formula (18) based on the above-mentioned satisfied conditionsiI.e. when
Figure FDA0003186664040000021
When less than n, XiIs equal to
Figure FDA0003186664040000022
Otherwise, XiIf n is equal, determining the distribution scheme;
Figure FDA0003186664040000023
2. the method for distributing erasure-correcting coding blocks in multi-path transmission of an ad hoc network of underwater sensors according to claim 1, wherein the calculating the path transmission success rate of the plurality of paths between the source node and the destination node includes:
according to the underwater sound propagation attenuation model, the path loss between nodes at a single frequency is expressed as formula (1):
Figure FDA0003186664040000024
wherein d isThe unit of the broadcast distance is km; x is an attenuation factor; f is the signal frequency in kHz;
Figure FDA0003186664040000025
calculating an attenuation coefficient in dB/km by formula (2);
Figure FDA0003186664040000026
obtaining ocean turbulence noise, shipping noise, wind wave noise and thermal noise through formulas (3) - (6);
10lg(Nt(f))=17-30lg(f) (3);
10lg(Ns(f))=40+20(s-0.5)+26lg(f)-60lg(f+0.03) (4);
10lg(Nw(f))=50+7.5(w0.5)+20lg(f)-40lg(f+0.4) (5);
10lgNth(f)=-15+20lg(f) (6);
calculating the total environmental noise from the marine turbulence noise, the shipping noise, the storm noise and the thermal noise as represented by equation (7):
N(f)=Nt(f)+Ns(f)+Nw(f)+Nth(f) (7);
wherein s is the ship density, a value between 0 and 1; w is the wind speed in m/s;
calculating an average signal-to-noise ratio from the total ambient noise, expressed as formula (8):
Figure FDA0003186664040000027
wherein pr (f) is an average transmission power, and the bit error rate is calculated by formula (9), and the transmission success rate for a data packet having m bits is formula (10):
Figure FDA0003186664040000031
P=(1-pe(d))m (10);
assume the multiple paths are A1,A2,...,ALTotal L paths, AiDenotes the ith path, SiIs shown on path AiAnd the probability of successful transmission is up, wherein L is more than or equal to 1, i is more than or equal to 1 and less than or equal to L, and the transmission success rate of the path obtained according to the link transmission success rate among the relay nodes on the path is expressed as formula (11):
Figure FDA0003186664040000032
where M is the total number of links included in the path, PjIs the transmission success rate of the jth link.
3. The method for distributing erasure-correcting coding blocks in multipath transmission of an ad hoc network of underwater sensors according to claim 1, wherein after the source node performs erasure-correcting coding on original data, the method for distributing the coding blocks in multipath transmission according to the distribution scheme comprises:
and according to the distribution scheme, sequentially taking out the coding blocks with corresponding number from the n coding blocks, and after the n coding blocks are taken out, starting to take out the coding block from the first coding block to transmit on a path.
4. The method for distributing erasure-correcting coding blocks in multipath transmission of ad hoc networks of underwater sensors according to claim 1, wherein the source node performs erasure-correcting coding on the original data, comprising:
the encoding matrix E is an n x k order matrix, and the original data is divided into k data blocks D0~Dk-1The data matrix D is a k × 1 order matrix; coding according to the coding matrix E and the k data blocks, and coding the original data into n coding blocks C0~Cn-1As shown in equation (19):
Figure FDA0003186664040000033
5. the utility model provides an erasure coding block distributor is corrected in sensor ad hoc network multipath transmission under water which characterized in that includes:
the acquisition module is used for acquiring a source node and a destination node;
a calculating module, configured to calculate a path transmission success rate of a plurality of paths between the source node and the destination node;
the distribution module is used for determining a distribution scheme of the transmission of the coding blocks of the multiple paths based on a probability model established by Bayesian theorem;
the encoding module is used for carrying out erasure coding on the original data by the source node;
the transmission module is used for transmitting the coding blocks on the multipath according to the distribution scheme after the source node performs erasure correction coding on the original data;
the allocation module is specifically configured to:
b represents the event that the destination node successfully receives a coded block, P (A)i) Representing the probability of using each path, P (B | A)i) Is represented on path AiA probability of successful transmission of the code block;
knowing that the destination node successfully received a coded block, the coded block is from path aiIs represented as P (A)i| B), calculated by equations (12) to (14);
Figure FDA0003186664040000041
P(B|Ai)=Si (13);
Figure FDA0003186664040000042
the method comprises the steps of supposing that original data are divided into k data blocks, carrying out erasure coding, and generating n coding blocks, wherein n-k is the number of redundant blocks;
if the destination node should receive at least any k coding blocks from the n coding blocks, the k coding blocks are from AiThe number of coded blocks of (A) is expressed as kP (A)iI B), with XiIs shown on path AiThe number of code blocks distributed above, the conditions that can be satisfied, are shown in equations (15) - (17):
Figure FDA0003186664040000043
XiSi≥kP(Ai|B) (16);
Figure FDA0003186664040000044
calculating X according to the formula (18) based on the above-mentioned satisfied conditionsiI.e. when
Figure FDA0003186664040000045
When less than n, XiIs equal to
Figure FDA0003186664040000046
Otherwise, XiIf n is equal, determining the distribution scheme;
Figure FDA0003186664040000047
6. the device for distributing erasure-correcting coding blocks in multipath transmission over an ad hoc network of underwater sensors according to claim 5, wherein the computing module is specifically configured to:
according to the underwater sound propagation attenuation model, the path loss between nodes at a single frequency is expressed as formula (1):
Figure FDA0003186664040000051
wherein d is the propagation distance, and the unit is km; x is an attenuation factor; f is the signal frequency in kHz;
Figure FDA0003186664040000052
calculating an attenuation coefficient in dB/km by formula (2);
Figure FDA0003186664040000053
obtaining ocean turbulence noise, shipping noise, wind wave noise and thermal noise through formulas (3) - (6);
10lg(Nt(f))=17-30lg(f) (3);
10lg(Ns(f))=40+20(s-0.5)+26lg(f)-60lg(f+0.03) (4);
10lg(Nw(f))=50+7.5(w0.5)+20lg(f)-40lg(f+0.4) (5);
10lgNth(f)=-15+20lg(f) (6);
calculating the total environmental noise from the marine turbulence noise, the shipping noise, the storm noise and the thermal noise as represented by equation (7):
N(f)=Nt(f)+Ns(f)+Nw(f)+Nth(f) (7);
wherein s is the ship density, a value between 0 and 1; w is the wind speed in m/s;
calculating an average signal-to-noise ratio from the total ambient noise, expressed as formula (8):
Figure FDA0003186664040000054
wherein pr (f) is an average transmission power, and the bit error rate is calculated by formula (9), and the transmission success rate for a data packet having m bits is formula (10):
Figure FDA0003186664040000055
P=(1-pe(d))m (10);
assume the multiple paths are A1,A2,...,ALTotal L paths, AiDenotes the ith path, SiIs shown on path AiAnd the probability of successful transmission is up, wherein L is more than or equal to 1, i is more than or equal to 1 and less than or equal to L, and the transmission success rate of the path obtained according to the link transmission success rate among the relay nodes on the path is expressed as formula (11):
Figure FDA0003186664040000061
where M is the total number of links included in the path, PjIs the transmission success rate of the jth link.
7. The device for distributing erasure-correcting coding blocks in multipath transmission over an ad hoc network of an underwater sensor as claimed in claim 5, wherein the coding module is specifically configured to:
the encoding matrix E is an n x k order matrix, and the original data is divided into k data blocks D0~Dk-1The data matrix D is a k × 1 order matrix; coding according to the coding matrix E and the k data blocks, and coding the original data into n coding blocks C0~Cn-1As shown in equation (19):
Figure FDA0003186664040000062
8. the device for distributing the erasure-correcting coding blocks in the multi-path transmission of the ad hoc network of the underwater sensor according to claim 5, wherein the transmission module is specifically configured to:
and according to the distribution scheme, sequentially taking out the coding blocks with corresponding number from the n coding blocks, and after the n coding blocks are taken out, starting to take out the coding block from the first coding block to transmit on a path.
CN202010604214.5A 2020-06-29 2020-06-29 Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor Active CN111901088B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202010604214.5A CN111901088B (en) 2020-06-29 2020-06-29 Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor
PCT/CN2020/099984 WO2022000435A1 (en) 2020-06-29 2020-07-02 Method and device for allocating multipath transmission erasure coding block in underwater sensor self-organizing network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202010604214.5A CN111901088B (en) 2020-06-29 2020-06-29 Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor

Publications (2)

Publication Number Publication Date
CN111901088A CN111901088A (en) 2020-11-06
CN111901088B true CN111901088B (en) 2021-10-01

Family

ID=73207162

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202010604214.5A Active CN111901088B (en) 2020-06-29 2020-06-29 Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor

Country Status (2)

Country Link
CN (1) CN111901088B (en)
WO (1) WO2022000435A1 (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112911716B (en) * 2021-02-05 2023-02-17 贵州久华信电子技术有限公司 Data transmission method, device, equipment and storage medium
TWI810877B (en) * 2022-03-31 2023-08-01 黃蔚國 Distributed underwater communication system
CN114745751B (en) * 2022-04-15 2023-11-21 中国电信股份有限公司 Data transmission method and device, electronic equipment and storage medium
CN117560093B (en) * 2024-01-11 2024-04-02 汉江国家实验室 Distributed underwater acoustic network multiple access method, device, equipment and storage medium

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101448281A (en) * 2008-12-31 2009-06-03 宁波中科集成电路设计中心有限公司 Fault-tolerance method in wireless sensor network
CN101925100A (en) * 2010-09-03 2010-12-22 东华大学 Fault-tolerant routing recovery method of heterogeneous wireless sensor network
CN104393960A (en) * 2014-12-09 2015-03-04 南京邮电大学 Erasure code based multi-path reliable satellite-ground transmission method for satellite networks
CN107801169A (en) * 2017-10-20 2018-03-13 潘柏霖 A kind of farmland pollution monitoring system based on wireless sensor network
WO2020028494A1 (en) * 2018-07-31 2020-02-06 Massachusetts Institute Of Technology Network coded multipath and related techniques

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103402235B (en) * 2013-07-22 2016-01-13 上海交通大学 Based on the multi tate Multi-path route optimization method of directional antenna
US9955238B2 (en) * 2015-01-20 2018-04-24 Nanyang Technological University Methods and systems for wireless transmission of data between network nodes
CN108769939A (en) * 2018-05-15 2018-11-06 重庆三峡学院 A kind of wireless sensor network multipath transmitting fault-tolerance approach
CN109495976B (en) * 2018-12-05 2020-05-19 浙江大学 Shipborne unmanned aerial vehicle communication channel access method

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101448281A (en) * 2008-12-31 2009-06-03 宁波中科集成电路设计中心有限公司 Fault-tolerance method in wireless sensor network
CN101925100A (en) * 2010-09-03 2010-12-22 东华大学 Fault-tolerant routing recovery method of heterogeneous wireless sensor network
CN104393960A (en) * 2014-12-09 2015-03-04 南京邮电大学 Erasure code based multi-path reliable satellite-ground transmission method for satellite networks
CN107801169A (en) * 2017-10-20 2018-03-13 潘柏霖 A kind of farmland pollution monitoring system based on wireless sensor network
WO2020028494A1 (en) * 2018-07-31 2020-02-06 Massachusetts Institute Of Technology Network coded multipath and related techniques

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
An Efficient Multipath Erasure Coding based Secure Routing Protocol in Manet;K.R.Melbha等;《IJESRT》;20140430;全文 *

Also Published As

Publication number Publication date
CN111901088A (en) 2020-11-06
WO2022000435A1 (en) 2022-01-06

Similar Documents

Publication Publication Date Title
CN111901088B (en) Method and device for distributing erasure correcting coding blocks in multi-path transmission of ad hoc network of underwater sensor
Goyal et al. Data aggregation in underwater wireless sensor network: Recent approaches and issues
Wei et al. Reliable data collection techniques in underwater wireless sensor networks: A survey
Basagni et al. CARP: A channel-aware routing protocol for underwater acoustic wireless networks
Seah et al. Multipath virtual sink architecture for underwater sensor networks
Wahid et al. An energy-efficient routing protocol for UWSNs using physical distance and residual energy
Han et al. Routing protocols for underwater wireless sensor networks
Pompili et al. Routing algorithms for delay-insensitive and delay-sensitive applications in underwater sensor networks
CN110493841B (en) Underwater acoustic sensor network routing implementation method
CN109769222A (en) Underwater sensor network method for routing based on more autonomous underwater vehicles
Liang et al. Information-carrying based routing protocol for underwater acoustic sensor network
Coutinho et al. OMUS: Efficient opportunistic routing in multi-modal underwater sensor networks
Uddin Link expiration time-aware routing protocol for UWSNs
Ashrafuddin et al. Energy efficient fitness based routing protocol for underwater sensor network
Khalid et al. Comparison of localization free routing protocols in underwater wireless sensor networks
Tariq et al. Distance based reliable and energy efficient (DREE) routing protocol for underwater acoustic sensor networks
Baranidharan et al. Clustered geographic-opportunistic routing protocol for underwater wireless sensor networks
Petroccia et al. An adaptive cross-layer routing protocol for underwater acoustic networks
CN111641990B (en) Underwater acoustic sensor network transmission method with high data packet delivery rate and energy efficiency
Sun et al. MOR: Multi-objective routing for underwater acoustic wireless sensor networks
Carlson et al. Location-aware source routing protocol for underwater acoustic networks of AUVs
Venkatesh et al. Geographic opportunistic routing protocol based on two-hop information for wireless sensor networks
CN111416669B (en) Underwater acoustic sensor network multi-buoy opportunistic routing method based on distance vector
Mahmood et al. A comprehensive survey on the performance analysis of underwater wireless sensor networks (uwsn) routing protocols
Kuo et al. Tier-based underwater acoustic routing for applications with reliability and delay constraints

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