CN114465905A - Time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method - Google Patents

Time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method Download PDF

Info

Publication number
CN114465905A
CN114465905A CN202111606751.4A CN202111606751A CN114465905A CN 114465905 A CN114465905 A CN 114465905A CN 202111606751 A CN202111606751 A CN 202111606751A CN 114465905 A CN114465905 A CN 114465905A
Authority
CN
China
Prior art keywords
node
data
forwarding
probe
network
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.)
Pending
Application number
CN202111606751.4A
Other languages
Chinese (zh)
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.)
Northwestern Polytechnical University
Original Assignee
Northwestern Polytechnical University
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 Northwestern Polytechnical University filed Critical Northwestern Polytechnical University
Priority to CN202111606751.4A priority Critical patent/CN114465905A/en
Publication of CN114465905A publication Critical patent/CN114465905A/en
Pending legal-status Critical Current

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/04—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources
    • H04W40/10—Communication route or path selection, e.g. power-based or shortest path routing based on wireless node resources based on available power or energy
    • 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
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/20—Communication route or path selection, e.g. power-based or shortest path routing based on geographic position or location
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
    • H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W40/00—Communication routing or communication path finding
    • H04W40/24—Connectivity information management, e.g. connectivity discovery or connectivity update
    • H04W40/248—Connectivity information update
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W84/00—Network topologies
    • H04W84/18—Self-organising networks, e.g. ad-hoc networks or sensor networks
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The invention provides a time reversal based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method, which comprises the steps that a sending node broadcasts a probe reservation packet to search for relay candidate set members, then an optimal relay node is evaluated from the relay candidate set members according to priority, the optimal relay node replies to a probe packet used by the sending node for acquiring channel information, then the sending node immediately performs time reversal processing on the probe packet, then a processed new datagram is sent to the optimal relay node, and finally whether the datagram is successfully transmitted or not is confirmed at a sending end and a receiving end and respective decisions are made. The invention overcomes the defects of non-optimal and inflexible design of the network layer route, bypasses the areas of link interruption, collision and transmission holes, and adaptively forms the optimal route; the method completes the conflict-free and safe hidden transmission of the datagram in the network, inhibits the forwarding of redundant data packets in the opportunistic routing and completes the reliable delivery of the datagram in the underwater acoustic network with low cost.

Description

Time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method
Technical Field
The invention relates to the technical field of network information, in particular to a self-adaptive cross-layer networking method of an underwater acoustic sensing network.
Background
The Underwater Acoustic Sensor Network (UASN) is a key network technology for human beings to know and explore the ocean, wherein the design of a routing protocol is one of the hot spots of current research, and the UASN can ensure the robust and reliable data transmission from a Source node to a Sink node. In UASNs, a time-varying space-variant underwater acoustic channel can cause random routing interruption and a transmission hole area; random packet collisions due to long propagation delay are also non-negligible, and some Medium Access Control (MAC) protocols handle uncertain collisions in UASNs through slot control or distance-aware random access, however, the randomness of collisions causes collision avoidance strategies to generate large overhead and undesirable retransmissions.
An Opportunistic Routing (OR) selects a relay candidate set, and then coordinates out an optimal relay node in the relay candidate set to dynamically form a desired route from the Source node to the Sink node. The key of the OR protocol design is the selection strategy and coordination strategy of the relay candidate set. The OR may be divided into a sending end OR and a receiving end OR according to different relay candidate set selection strategies. The sending end OR selects a relay candidate set by a sending node and carries out priority sequencing to require the nodes in the network to keep a link state OR a neighbor position, which can cause obvious time delay and cost and aggravate channel competition, but can effectively solve the problem of a hole area; the receiving end OR determines whether it is a relay candidate set member and evaluates the priority by the receiving node, for example: and each receiving node determines a relay candidate role according to the depth or the distance from the receiving node to the Sink node, so that the next relay node is selected in a telescopic mode. The relay candidate set coordination strategy is a process of determining an optimal relay by evaluating the forwarding priority, and therefore, influencing factors of the forwarding priority need to be carefully considered, and the weight of each influencing factor in the forwarding priority evaluation needs to be weighed according to an actual scene.
The opportunistic routing adaptively selects the relay node by utilizing the channel broadcasting characteristic and the redundant relay candidate to resist the random link interruption, is suitable for UASNs with a severe channel environment, however, the number of nodes for obtaining data packet backup is increased, the redundant forwarding of the data packet is caused, and the bandwidth and the energy in the UASNs are excessively consumed; if a malicious node exists in the network or the network is in a confrontation environment, the network security risk is greatly increased by excessive data packet backup in the network, hidden transmission of data cannot be guaranteed, and the risk that data information is interfered and intercepted is sharply increased.
The Time Reversal (TR) technology has the advantages of multi-path interference, is suitable for underwater acoustic channels, and can realize space-time focusing of signals at a receiving position by using the underwater multi-path channels during data transmission. The time focusing is embodied in that multipath channels are mutually superposed at a receiving node to achieve the effect of multipath diversity, the signal-to-noise ratio is improved, and the inter-symbol interference is reduced; spatial focusing is characterized by strong signal energy at the receiving node and weak signal energy at other nodes. The time reversal space-time focusing not only reduces the interference of the transmitted signal at the non-target node, but also obtains the anti-interference, anti-interception, hidden transmission and other capabilities of data packet transmission.
Disclosure of Invention
In order to overcome the defects of the prior art, the invention provides a time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method. The invention provides a time reversal-based adaptive cross-layer opportunistic routing method for an underwater acoustic sensing network, aiming at better coping with conflicts caused by random routing interruption, transmission cavity areas and long propagation delay in the underwater acoustic sensing network and solving the problems of easy exposure of transmission, unnecessary energy consumption caused by excessive redundant forwarding and the like due to excessive copies of data packets in the network in the conventional opportunistic routing mechanism of the underwater acoustic sensing network.
Four message types are defined in the network: beacons (Beacon), Probe reservation packets (P-R), Probe packets (Probe), and DATA packets (TR-DATA). Before the route is started, each sensing node knows the number of own neighbors by sending short beacon messages and records the number of own neighbors in a neighbor number list, the transmission period depends on network mobility, and the network cannot be rapidly changed due to drift of ocean currentsTopology, and therefore, does not require excessive overhead to maintain the number of neighbors. The maximum retransmission times of the message are set in the network, and the value is set according to the channel state and the network mobility. Using power P separately for Probe and other packetsPrAnd P transmits and PPrThe design is larger than P, so that the Probe can be ensured to reach all relay candidate set members of the forwarding node F, and the problem of hidden terminals is effectively solved.
The technical scheme adopted for solving the technical problems comprises the following specific steps:
step 1: at the sending end, according to the number n of single-hop neighbors of the forwarding node FFSets the relay candidate set member flag bit (Mem), and adds the flag bit into the message structure of P-R; specifically, the relay candidate set members of the forwarding node F are all composed of single-hop neighbors of F, when n isF≤NTsThen, set the Mem flag bit to 0; when n isF＞NTsSetting the Mem zone bit to be 1, wherein the relay candidate set members consist of neighbors with the distance to the Sink node shorter than F; wherein N isTsIs the neighbor number threshold of the forwarding node F;
step 2: a probe reservation stage;
the forwarding node F broadcasts P-R by using power P in a data packet transmission range R, and when the node i receives the P-R for the first time from the forwarding node F, the node i receives the P-R according to the number n of neighbors per seiReceiving a Mem flag bit in the P-R, and judging whether the node i is a relay candidate set member; specifically, the number of neighbors n when node i isiWhen the node is less than or equal to 1, the node is regarded as a cavity node and is placed in a standby state; neighbor number n of node iiWhen the node is more than 1, starting to judge the Mem flag bit in the P-R, and when the Mem flag bit is 0, determining the node as a relay candidate set member; when the Mem mark bit is 1, the distance d from the node i to the Sink node is judgediSAnd the distance d from the forwarding node F to the Sink nodeFSA size of diS＜dFSThen node i is determined to be a relay candidate set member if diS≥dFSPlacing the device in a standby state; when all the single-hop neighbor nodes of the forwarding node F finish judgment, entering the step 3;
and step 3: an optimal relay confirmation stage;
after the node i is determined as a relay candidate set member, a forwarding priority factor is calculated through local information
Figure BDA0003434220870000031
While reserving P-R according to forwarding priority
Figure BDA0003434220870000032
Time;
Figure BDA0003434220870000033
and
Figure BDA0003434220870000034
after the calculation is completed, according to
Figure BDA0003434220870000035
During which the best relay node R is determined by whether or not the Probe transmitted by the other node is receivednIf, if
Figure BDA0003434220870000036
During the period, the Probe sent by other nodes is received, the self P-R and the Probe are discarded, and the node is placed in a standby state; if it is
Figure BDA0003434220870000037
During which no Probe sent by other node is received, node i is determined as the optimal relay node, and waits for
Figure BDA0003434220870000038
By using power P after finishingPrTransmitting a Probe of the self to announce the optimal relay role of the self; in that
Figure BDA0003434220870000039
Timing T is started at the same time of endingTD；
And 4, step 4: a time reversal multiple access data transmission stage;
forwarding node F pairOptimal relay node RnThe Probe of (2) performs time reversal processing, and then sends a new time reversal DATA packet (TR-DATA) after the time reversal processing to the R againnThe simultaneous forwarding node F transmitting TR-DATA starts timing TP；
And 5: data transmission confirmation stage;
after the receiving end and the sending end both need to confirm the successful transmission of the TR-DATA, a new round of route can be opened; at the receiving end, RnAccording to at TTDWhether TR-DATA was successfully received within the time makes the following decision: if R isnAt TTDSuccessfully receiving TR-DATA over time, immediately at RnBroadcasting P-R within the data packet transmission range R, and simultaneously starting the next routing process; if R isnAt TTDWhen the TR-DATA is not successfully received within the time, the Probe is immediately broadcasted to inform the forwarding node F that the TR-DATA is unsuccessfully received by the forwarding node F, the DATA packet needs to be reprocessed according to new Probe information, and the TR-DATA is sent, wherein RnWait until TR-DATA is successfully received;
at the transmitting end, the forwarding node F is at TPConfirming whether TR-DATA is received by R or not according to whether P-R is received or not within timenSuccessful reception, the specific operation is as follows: if P-R is received, then R is indicatednSuccessfully receiving TR-DATA and starting the next round of routing process, putting the forwarding node F in a standby state, and ending the stage; if the P-R is not received, checking whether the number of times of the TR-DATA of the retransmission exceeds the maximum retransmission number set in the network or not, if the number of times of the TR-DATA of the retransmission does not exceed the maximum retransmission number set in the network, returning to the step 4, and forwarding the node F to the RnAnd (4) retransmitting TR-DATA, and if the number of times of the TR-DATA retransmission exceeds the maximum retransmission number set in the network and F is in a standby state, ending the stage.
A neighbor number threshold N of the forwarding node FTsThe sparse degree is set according to the sparse degree of the network, wherein the sparse degree refers to that if the density of the network node is large, the threshold value of the neighbor number is set to be a large value, the density of the network node is small, and the threshold value of the neighbor number is set to be a small value.
In step 3, in order to ensure that a truly robust relay node can be selected, not only the neighbors of the node are consideredThe population, the residual energy value and the distance from the Sink node, and node energy consumption rate index and stability index are also introduced,
Figure BDA0003434220870000041
and
Figure BDA0003434220870000042
the specific calculation formula of (2) is as follows:
Figure BDA0003434220870000043
Figure BDA0003434220870000044
Figure BDA0003434220870000045
wherein: c represents the speed of sound; dabRepresents the distance between node a and node b; e.g. of the typeiRepresenting the current remaining energy of node i; e and N respectively represent the initial energy and the maximum neighbor number of each node; ri esNormalizing the consumed energy for the nodes in the beacon transmission period;
Figure BDA0003434220870000046
representing a metric describing the stability of the number of neighbors of a node, ImMean value representing a list of node neighbors, IsdThe standard deviation of the node neighbor number list is expressed, the discrete degree of each value in the list is reflected, lambda and mu are network parameters, and lambda + mu is less than or equal to 1; xi represents an integer for adjusting the holding time interval, xi ≧ 1, and α, β, γ, and η each represent ei、Ri es、niAnd
Figure BDA0003434220870000047
the weight in the priority evaluation, α + β + γ + η ═ 1 and α > β.
The T isTDEqual to 2 times the maximum propagation delay end-to-end.
The T isPEqual to 2 times the maximum propagation delay end-to-end.
The underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method based on time reversal provided by the invention adopts a cross-layer design idea, and achieves the following effects:
1) the time reversal communication, the time reversal multiple access and the receiving end opportunistic routing mechanism are combined together, the bandwidth, energy and channel resources in the underwater acoustic sensing network are comprehensively and effectively utilized, the defects of non-optimization and inflexibility in the network layer routing design are overcome, the areas of link interruption, collision and transmission holes are bypassed, and the optimal routing is formed in a self-adaptive manner;
2) by utilizing time reversal space-time focusing and time reversal multiple access, conflict-free safe hidden transmission of the data packet in the network is completed, forwarding of redundant data packets in the opportunistic routing is inhibited, and reliable delivery of the data packet in the underwater acoustic network is completed with low expenditure.
Drawings
Fig. 1 is a flow chart of relay candidate set member selection in the present invention.
Fig. 2 is a flow chart of the optimal relay acknowledgement of the present invention.
Fig. 3 is a diagram of an inverse multiple access data transmission protocol of the present invention.
Fig. 4 is a flow chart of the data transmission acknowledgement phase of the present invention.
Detailed Description
The invention is further illustrated with reference to the following figures and examples.
The time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method spans an underwater acoustic network physical layer, a data link layer and a network layer, combines time reversal communication, multiple access and a receiving end opportunistic routing mechanism together, bypasses nodes with link interruption and routing void areas by using the opportunistic routing mechanism, and self-adaptively forms an optimized route; the data packet is transmitted safely and covertly in the network by utilizing the time-reversal space-time focusing property and the multiple access, the forwarding of redundant data packets is inhibited, and the reliable delivery of the data packet in the underwater acoustic network is completed with low expenditure.
The underwater acoustic sensing network is composed of one or more public Sink nodes randomly deployed on the water surface and a plurality of sensing nodes i (i belongs to V, V is a sensing node set) randomly deployed underwater. The Sink node acquires self-position information through a GPS, the sensing nodes acquire self-position information through a positioning mechanism, and it is assumed that all the sensing nodes know the position of the Sink node. Each sensing node has the capability of generating and forwarding a data packet (a plurality of types of sensors for acquiring water area information and the same underwater acoustic communicator are assembled), the sensed data is sent to the public Sink node, the transmission range of the data packet is r, and a neighbor number list and a current remaining energy value list are locally set (recorded once every other beacon transmission period).
The technical scheme comprises four stages: the method comprises a probe reservation stage, an optimal relay confirmation stage, a time-reversal multiple access data transmission stage and a data transmission confirmation stage. In each round of routing, a sending node needs to broadcast a Probe reservation packet (P-R) to search relay candidate set members in a Probe reservation stage, then an optimal relay node is evaluated from the relay candidate set members according to priority in an optimal relay confirmation stage, the optimal relay node replies a Probe packet (Probe) used by the sending node for acquiring channel information, then a time reversal multiple access DATA transmission stage is carried out, the sending node immediately reverses the time of the Probe packet (Probe), then a processed new DATA packet (TR-DATA) is sent to the optimal relay node, and finally the DATA confirmation stage is carried out, and whether the DATA packet (TR-DATA) is successfully transmitted or not and respective decisions are made at a sending end and a receiving end. Specifically, when the forwarding node F has a data packet to send, the following steps are sequentially performed: consider the underwater acoustic sensing network composed of a public Sink node deployed at the surface of water at random and a plurality of sensing nodes i deployed underwater at random (i ∈ V, V is a set of sensing nodes). The Sink node acquires self-position information through a GPS, the sensing nodes acquire self-position information through a positioning mechanism, and the positions of the Sink nodes are assumed to be known by all the sensing nodes. Each sensing node has the capability of generating and forwarding a data packet (a plurality of types of sensors for acquiring water area information and the same underwater acoustic communicator are assembled), the sensed data is sent to the public Sink node, the transmission range of the data packet is r, and a neighbor number list and a current remaining energy value list are locally set (recorded once every other beacon transmission period).
Four message types are defined in the network: beacons (Beacon), Probe reservation packets (P-R), Probe packets (Probe), and DATA packets (TR-DATA). Specifically, the method comprises the following steps: the beacon message structure comprises a packet type and a sending node ID; the probe reservation packet message structure comprises a packet type, a Source node ID and a Mem flag bit of a generated data packet; the probe packet message structure comprises a packet type, a Source node ID for generating a data packet and a probe signal; the data packet message structure comprises a packet type, a packet sequence number, a Source node ID for generating a data packet, a sending node position and a load. Before data packet transmission, each sensing node knows own neighbor number by sending short beacon messages and records the neighbor number in a neighbor number list, the transmission period depends on network mobility, and as drift of ocean current cannot change a network topological structure rapidly, excessive expenditure is not needed to maintain the neighbor number. The network is provided with a maximum number of retransmissions of the message, which is set according to the channel state and the network mobility. Using power P separately for Probe and other packetsPrAnd P transmits and PPrThe design is larger than P, so that the Probe can be ensured to reach all relay candidate set members of the forwarding node F, and the problem of hidden terminals is effectively solved.
This embodiment consists of four stages: the method comprises a probe reservation stage, an optimal relay confirmation stage, a time-reversal multiple access data transmission stage and a data transmission confirmation stage. When the forwarding node F has a data packet to send, the following steps are sequentially executed:
step 1: at the sending end, according to the number n of single-hop neighbors of the forwarding node FFSets the relay candidate set member flag bit (Mem), and adds the flag bit into the message structure of P-R; specifically, the relay candidate set members of the forwarding node F are all composed of single-hop neighbors of F, when n isF≤NTsThen, set the Mem flag bit to 0; otherwise, i.e. when nF＞NTsWhen the relay candidate set member is from the source node to the Sink node, the Mem flag bit is set to 1, and the relay candidate set member is from the source node to the Sink node at the momentNeighbors whose distance of points is shorter than F. Wherein: n is a radical ofTsSetting a neighbor number threshold value of the forwarding node F according to the sparsity degree of the network;
step 2: a probe reservation stage;
the forwarding node F broadcasts P-R by using power P in a data packet transmission range R, and when the node i receives the P-R for the first time from the forwarding node F, the node i receives the P-R according to the number n of neighbors per seiReceiving a Mem flag bit in the P-R, and judging whether the node i is a relay candidate set member or not; specifically, the number of neighbors n when node i isiWhen the node is less than or equal to 1, the node is regarded as a cavity node and is placed in a standby state; neighbor number n of node iiWhen the Mem flag bit is 0, the node is determined as a relay candidate set member; when the Mem mark bit is 1, judging the distance d from i to the Sink nodeiSAnd the distance d from the forwarding node F to the Sink nodeFSA size of diS＜dFSThen node i is determined to be a relay candidate set member if diS≥dFSPlacing the device in a standby state; after all the single-hop neighbor nodes of the forwarding node F are judged according to the flow, the step 3 is carried out; the selection process of the relay candidate set members is shown in fig. 1;
and step 3: an optimal relay confirmation stage;
after the node i is determined as a relay candidate set member, a forwarding priority factor is calculated through local information
Figure BDA0003434220870000071
While retaining the P-R for a period of time according to the forwarding priority
Figure BDA0003434220870000072
As can be appreciated, the first and second,
Figure BDA0003434220870000073
the smaller the size of the tube is,
Figure BDA0003434220870000074
the shorter and therefore the higher the forwarding priority.
Figure BDA0003434220870000075
By the residual energy e of node iiEnergy consumption rate Ri esN number of neighborsiAnd stability of the composition
Figure BDA0003434220870000076
And distance d to Sink nodeiSDetermining;
Figure BDA0003434220870000077
forwarding priority factor by node i
Figure BDA0003434220870000078
The integer ξ (ξ ≧ 1) that adjusts the hold interval, the speed of sound c, and the data packet transmission range r. The calculation formulas are respectively as follows:
Figure BDA0003434220870000079
Figure BDA00034342208700000710
Figure BDA00034342208700000711
wherein: dabIs the distance between node a and node b; e and N are respectively the initial energy and the maximum neighbor number of each node; ri esNormalizing the consumed energy for the nodes in the beacon transmission period;
Figure BDA00034342208700000712
to describe the stability of the node's neighbour number, ImMean value representing a list of node neighbors, IsdRepresenting the standard deviation of the list of node neighbor numbers (reflecting the degree of dispersion of each value in the list), λ and μ are network parameters and λ + μ ≦ 1.α, β, γ and η represent e respectivelyi、Ri es、niAnd
Figure BDA00034342208700000713
weight in priority evaluation, α + β + γ + η ═ 1 and α > β;
and 4, step 4:
Figure BDA0003434220870000081
and
Figure BDA0003434220870000082
after the calculation is completed, according to
Figure BDA0003434220870000083
During which probes transmitted by other nodes are received to determine the optimal relay node Rn. If it is
Figure BDA0003434220870000084
During the period, the Probe sent by other nodes is received, the self P-R and the Probe are discarded, and the node is placed in a standby state; if it is
Figure BDA0003434220870000085
During which no Probe sent by other node is received, node i is determined as the optimal relay node, and waits for
Figure BDA0003434220870000086
By using power P after finishingPrSends its own Probe to announce its optimal relay role. The acknowledgement flow of the optimal relay node is shown in fig. 2. In that
Figure BDA0003434220870000087
Timing T is started at the same time of endingTD，TTDEqual to 2 times the maximum end-to-end propagation delay;
and 5: a time reversal multiple access data transmission stage;
the forwarding node F receives the message from the optimal relay node RnImmediately after the transmitted Probe, the Probe is subjected to time reversal processing, and a new time reversal packet (TR-DATA) after the processing is transmitted againTo Rn. The simultaneous forwarding node F transmitting TR-DATA starts timing TP，TPEqual to 2 times the maximum propagation delay end-to-end. The time-reversal multiple access data transmission protocol is shown in fig. 3;
step 6: data transmission confirmation stage;
and after the receiving end and the transmitting end both need to confirm the successful transmission of the TR-DATA, a new round of routing can be started. The flow of the data transfer acknowledgement phase is shown in fig. 4. At the receiving end, RnAccording to at TTDWhether TR-DATA was successfully received within the time makes the following decision: if R isnAt TTDSuccessfully receiving TR-DATA over time, immediately at RnBroadcasting P-R within the data packet transmission range R, and simultaneously starting the next routing process; if R isnAt TTDUnsuccessfully receiving TR-DATA within a time period, broadcasting a Probe to inform F that it failed to receive TR-DATA, and retransmitting TR-DATA according to new Probe information, when RnIt is necessary to wait until the TR-DATA is successfully received. At the transmitting end, F is at TPConfirming whether TR-DATA is received by R or not according to whether P-R is received or not within timenAnd successfully receiving, and performing the following operations: if P-R is received, then R is indicatednSuccessfully receiving TR-DATA and starting the next round of routing process, and putting F in a standby state, and ending the stage; if not, checking whether the retransmission of the TR-DATA exceeds the maximum retransmission times set in the network, if not, returning to the step 5, and F gives the R againnAnd transmitting TR-DATA, if the TR-DATA exceeds the threshold value, putting F into a standby state, and ending the phase. It should be noted that: because the length of the P-R and the Probe is short and the transmitting power is large, the time delay in the transmission process is small, and the probability of collision is low.
The above-mentioned embodiments are merely illustrative of the preferred embodiments of the present invention, and do not limit the scope of the present invention, and various modifications and improvements made to the technical solution of the present invention by those skilled in the art without departing from the spirit of the present invention shall fall within the protection scope defined by the claims of the present invention.

Claims (5)

1. A time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method is characterized by comprising the following steps:
step 1: at the sending end, according to the number n of single-hop neighbors of the forwarding node FFSetting the flag bit of the relay candidate set member, and adding the flag bit into the message structure of the P-R; specifically, the relay candidate set members of the forwarding node F are all composed of single-hop neighbors of F, when n isF≤NTsThen, set the Mem flag bit to 0; when n isF＞NTsSetting the Mem zone bit to be 1, wherein the relay candidate set members consist of neighbors with the distance to the Sink node shorter than F; wherein N isTsIs the neighbor number threshold of the forwarding node F;
step 2: a probe reservation stage;
the forwarding node F broadcasts P-R by using power P in a data packet transmission range R, and when the node i receives the P-R for the first time from the forwarding node F, the node i receives the P-R according to the number n of neighbors per seiReceiving a Mem flag bit in the P-R, and judging whether the node i is a relay candidate set member; specifically, the number of neighbors n when node i isiWhen the node is less than or equal to 1, the node is regarded as a cavity node and is placed in a standby state; number of neighbors n when node iiWhen the Mem flag bit is 0, the node is determined as a relay candidate set member; when the Mem mark bit is 1, the distance d from the node i to the Sink node is judgediSAnd the distance d from the forwarding node F to the Sink nodeFSA size of diS＜dFSThen node i is determined to be a relay candidate set member if diS≥dFSPlacing the device in a standby state; when all the single-hop neighbor nodes of the forwarding node F finish judgment, entering the step 3;
and 3, step 3: an optimal relay confirmation stage;
after the node i is determined as a relay candidate set member, a forwarding priority factor is calculated through local information
Figure FDA0003434220860000011
While reserving P-R according to forwarding priority
Figure FDA0003434220860000012
Time;
Figure FDA0003434220860000013
seed of a plant
Figure FDA0003434220860000014
After the calculation is completed, according to
Figure FDA0003434220860000015
During which the best relay node R is determined by whether or not the Probe transmitted by the other node is receivednIf, if
Figure FDA0003434220860000016
During the period, the Probe sent by other nodes is received, the self P-R and the Probe are discarded, and the node is placed in a standby state; if it is
Figure FDA0003434220860000017
If the Probe sent by other nodes is not received between the nodes, the node i is determined as the optimal relay node and waits for the relay node
Figure FDA0003434220860000018
By using power P after finishingPrTransmitting a Probe of the self to announce the optimal relay role of the self; in that
Figure FDA0003434220860000019
Timing T is started at the same time of endingTD；
And 4, step 4: a time reversal multiple access data transmission stage;
forwarding node F for optimal relay node RnThe Probe performs time reversal processing, and then sends a new time reversal data packet after time reversal processing to the R againnThe simultaneous forwarding node F transmitting TR-DATA starts timing TP；
And 5: data transmission confirmation stage;
receiving endAfter the transmitting end and the transmitting end both need to confirm that the TR-DATA transmission is successful, a new round of routing can be started; at the receiving end, RnAccording to at TTDWhether TR-DATA was successfully received within the time makes the following decision: if R isnAt TTDSuccessfully receiving TR-DATA over time, immediately at RnBroadcasting P-R within the data packet transmission range R, and simultaneously starting the next routing process; if R isnAt TTDWhen the TR-DATA is not successfully received within the time, the Probe is immediately broadcasted to inform the forwarding node F that the TR-DATA is unsuccessfully received by the forwarding node F, the DATA packet needs to be reprocessed according to new Probe information, and the TR-DATA is sent, wherein RnWait until TR-DATA is successfully received;
at the transmitting end, the forwarding node F is at TPConfirming whether TR-DATA is received by R or not according to whether P-R is received or not within timenSuccessful reception, the specific operation is as follows: if P-R is received, then R is indicatednSuccessfully receiving TR-DATA and starting the next round of routing process, putting the forwarding node F in a standby state, and ending the stage; if the P-R is not received, checking whether the number of times of the TR-DATA of the retransmission exceeds the maximum retransmission number set in the network or not, if the number of times of the TR-DATA of the retransmission does not exceed the maximum retransmission number set in the network, returning to the step 4, and forwarding the node F to the RnAnd (4) retransmitting TR-DATA, and if the number of times of the TR-DATA retransmission exceeds the maximum retransmission number set in the network and F is in a standby state, ending the stage.
2. The time reversal based underwater acoustic sensing network adaptive cross-layer opportunistic routing method according to claim 1, characterized in that:
a neighbor number threshold N of the forwarding node FTsAnd setting according to the sparsity of the network.
3. The time reversal based underwater acoustic sensing network adaptive cross-layer opportunistic routing method according to claim 1, characterized in that:
in the step 3, a node energy consumption rate index and a stability index are introduced,
Figure FDA0003434220860000021
and
Figure FDA0003434220860000022
the specific calculation formula of (2) is as follows:
Figure FDA0003434220860000023
Figure FDA0003434220860000024
Figure FDA0003434220860000025
wherein: c represents the speed of sound; dabRepresents the distance between node a and node b; e.g. of the typeiRepresenting the current remaining energy of node i; e and N respectively represent the initial energy and the maximum neighbor number of each node; ri esNormalizing the consumed energy for the nodes in the beacon transmission period;
Figure FDA0003434220860000031
representing a metric describing the stability of the number of neighbors of a node, ImMean value representing a list of node neighbours, IsdThe standard deviation of the node neighbor number list is expressed, the discrete degree of each value in the list is reflected, lambda and mu are network parameters, and lambda + mu is less than or equal to 1; xi represents an integer for adjusting the holding time interval, xi ≧ 1, and α, β, γ, and η each represent ei、Ri es、niAnd
Figure FDA0003434220860000032
the weight in the priority evaluation, α + β + γ + η ═ 1 and α > β.
4. The time reversal based underwater acoustic sensing network adaptive cross-layer opportunistic routing method according to claim 1, characterized in that:
the T isTDEqual to 2 times the maximum propagation delay end-to-end.
5. The time reversal based underwater acoustic sensing network adaptive cross-layer opportunistic routing method according to claim 1, characterized in that:
the T isPEqual to 2 times the maximum propagation delay end-to-end.
CN202111606751.4A 2021-12-26 2021-12-26 Time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method Pending CN114465905A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111606751.4A CN114465905A (en) 2021-12-26 2021-12-26 Time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111606751.4A CN114465905A (en) 2021-12-26 2021-12-26 Time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method

Publications (1)

Publication Number Publication Date
CN114465905A true CN114465905A (en) 2022-05-10

Family

ID=81406701

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111606751.4A Pending CN114465905A (en) 2021-12-26 2021-12-26 Time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method

Country Status (1)

Country Link
CN (1) CN114465905A (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115190559A (en) * 2022-07-14 2022-10-14 浙江方大通信有限公司 Networking and control method of multi-scene-oriented Internet of things equipment

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115190559A (en) * 2022-07-14 2022-10-14 浙江方大通信有限公司 Networking and control method of multi-scene-oriented Internet of things equipment

Similar Documents

Publication Publication Date Title
Molins et al. Slotted FAMA: a MAC protocol for underwater acoustic networks
Noh et al. DOTS: A propagation delay-aware opportunistic MAC protocol for underwater sensor networks
Noh et al. DOTS: A propagation delay-aware opportunistic MAC protocol for mobile underwater networks
KR100522948B1 (en) Method for performing packet flooding at wireless ad hoc network
Roy et al. A network-aware MAC and routing protocol for effective load balancing in ad hoc wireless networks with directional antenna
US5303207A (en) Acoustic local area networks
KR102139017B1 (en) Routing of data packets in wireless networks with directional transmissions
Vieira Performance and trade-offs of opportunistic routing in underwater networks
KR101153970B1 (en) Routing method for wireless mesh networks and wireless mesh network system using the same
WO2006035707A1 (en) Wireless transmission system, wireless station used therein and method used therefor
JP2009100443A (en) Method of setting packet transmission path in ad hoc network and network apparatus using the same
Tran-Dang et al. Channel-aware energy-efficient two-hop cooperative routing protocol for underwater acoustic sensor networks
CN110492950B (en) Time reversal underwater acoustic network multiple access method for inter-link interference suppression
CN113766597B (en) Directional transmission-based opportunistic routing method in underwater acoustic sensor network
JP2011139284A (en) Wireless communication device, and wireless communication method
CN114465905A (en) Time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method
Marchenko et al. Selecting a spatially efficient cooperative relay
JP3896125B2 (en) Method for performing packet flooding in a wireless ad hoc network
Songzou et al. An Enhanced Full-Duplex MAC Protocol for an Underwater Acoustic Network
CN113099392B (en) Underwater broadcast transmission method based on hierarchy and state
CN114793352A (en) Time reversal-based underwater acoustic sensing network self-adaptive cross-layer opportunistic routing method
Kim et al. Cross layer based cooperative communication protocol for improving network performance in underwater sensor networks
Busanelli et al. Clustered vehicular networks: Decentralized detection “on the move”
Petroccia et al. A hybrid routing protocol for underwater acoustic networks
Baccelli et al. An optimized relay self selection technique for opportunistic routing in mobile ad hoc networks

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