Cross-domain network opportunistic routing algorithm
By introducing underwater path exploration and relay node sleeping schemes into the ocean information transmission network, as well as the storage-carrying-forwarding mechanism of the water surface, the delay and energy consumption problems in underwater ocean information transmission are solved, and data packet delivery is improved rate and network lifespan.
Patent Information
- Application Number
- CN202411048138.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-08-01
- Publication Date
- 2024-11-08
AI Technical Summary
The prior art has problems such as large end-to-end delay, low network delivery rate, and high energy consumption in underwater ocean information transmission, and it depends on frequent signaling interactions and the establishment of neighbor node tables, resulting in increased network energy consumption and congestion. .
Introduce underwater accessible path exploration process and relay node sleep scheme, as well as the 'storage-carry-forwarding-' mechanism on the surface, directly suppress the forwarding of hollow nodes through the minimum hop value and periodic sleep mechanism, and optimize packet routing and energy Equilibrium consumption.
It improves the packet delivery rate and network life of cross-domain networks, reduces energy consumption and network congestion, and is suitable for sparsely deployed marine information transmission networks.
Smart Images

Figure CN118921711A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of network technology, and in particular to a cross-domain network opportunistic routing algorithm. Background Art
[0002] The transmission of ocean information needs to cross two media, water and air, so the concept of above-water / underwater cross-domain network came into being. As the only medium that can achieve long-distance propagation underwater, sound waves are widely used in underwater networks. However, due to the characteristics of underwater acoustic channels such as slow propagation speed, low bandwidth, and high bit error rate, underwater acoustic networks have problems such as large end-to-end delay, low network delivery rate, and high energy consumption.
[0003] On the water surface, electromagnetic waves can be used for communication, and the link quality is better than that in the underwater acoustic environment. However, long-distance electromagnetic wave communication is easily interfered by the water surface environment. Due to various factors such as wind and waves, the network topology and link quality on the sea surface are also unstable.
[0004] In the study of marine acoustic-electric cooperative networks, the routing method of data transmission is an important research topic. Underwater, due to limited resources and energy, the ability of a single node to process information is often very limited. Therefore, the information collected by the source node needs to be transmitted to the aggregation center through the underwater acoustic link for unified processing and scheduling. Routing, as a link selection criterion for establishing a source node to the aggregation center, has become an important part of multi-hop network design.
[0005] For underwater sensor nodes, their energy and information processing capabilities are often limited. Too frequent reception and forwarding of data packets will cause the node's remaining energy to drop too quickly, making energy holes prone to occur.
[0006] Most of the opportunistic routing protocols based on depth information to avoid hole areas require signaling overhead to maintain the depth information of neighbor nodes, such as the WDFAD-DBR protocol and the Hydrocast protocol.
[0007] The WDFAD-DBR protocol is an improvement on the DBR protocol. It predicts the next-hop node based on the depth difference of the current node, making up for the shortcomings of the DBR protocol. In the WDFAD-DBR protocol, nodes need to periodically send neighbor node search packets to update their own neighbor node table to determine whether there is a next-hop node. Only neighbor nodes with next-hop nodes can be used as candidate nodes, successfully avoiding the void area.
[0008] The Hydrocast protocol uses a fallback forwarding mechanism to avoid the hole area problem. In the Hydrocast protocol, each node obtains the depth information of all neighboring nodes through periodic signaling interactions. When there is no neighboring node with a lower depth, the node will determine itself as a hole node and stop receiving data packets. It will use flooding to find other nodes that are shallower than itself and establish paths with them.
[0009] While using the neighbor node table to assist in the selection of candidate nodes, the location-based acoustic opportunistic routing protocol can also use topology control technology to avoid void areas, such as the GEDAR protocol. In the GEDAR protocol, nodes need to know the geographic location information of neighbor nodes and sea surface target nodes and update them periodically. It is mainly divided into the opportunistic forwarding stage and the void recovery stage. In the opportunistic forwarding stage, the neighbor node closest to the target node at the sender is selected as the reference node, and the candidate node set is the node with a distance less than 1 / 2 of the maximum communication distance from the reference node. The candidate node set selected in this way always transmits data in the direction closer to the target node. At the same time, the candidate node sets can achieve complete mutual listening and reduce the number of redundant packets. If there is no qualified neighbor node, the node enters the void recovery stage. In the void recovery stage, the sending node first stops receiving new data packets, and then sends a notification packet to all neighbor nodes, indicating that it is currently in a void recovery state. The neighbor node that receives the notification packet will delete the sending node from the neighbor node table and reply with a reply packet containing its own location information and neighbor node information. After a period of time, the sending node will receive several reply packets sent by neighbor nodes. After receiving the reply packet, the sending node will select the depth according to the two-hop information in the reply packet. First, obtain all the one-hop node sets, then select the nodes whose horizontal distance from the sending node is less than the maximum communication distance in the two-hop node set, and select the depth with the shortest moving distance from the one-hop and two-hop node depth information that meets the conditions. Start the sensor node mobile device to move the sending node to the depth in the depth direction.
[0010] It can be seen that, currently, the solution to the void area often requires forwarding failure before it can be solved, which has caused a decrease in network delivery rate and an increase in end-to-end latency. At the same time, current solutions basically require the establishment of neighbor node locations or depth tables, which rely on frequent signaling interactions between nodes, increase network energy consumption and easily cause network congestion.
[0011] Therefore, it is necessary to provide a cross-domain network opportunistic routing algorithm to solve the above technical problems. Summary of the invention
[0012] Due to the sparse deployment and low computing power of sensor nodes in the marine information transmission network, the routing void phenomenon is more serious. At present, most of the opportunistic routing for the void area is "discover first, then solve", and relies on the establishment and maintenance of the neighbor node table, which consumes a lot of resources and energy. In order to improve the packet delivery rate and network life of the cross-domain network under sparse deployment, it is considered to introduce the underwater reachable path exploration process and relay node sleep scheme in the cross-domain network, as well as the "store-carry-forward" mechanism on the water surface, and directly suppress the forwarding of the void node through the forwarding mechanism. The implementation steps are:
[0013] (1) For underwater routing holes, a mechanism is adopted in which the buoy node sends a search packet to find the route underwater. Only the source node that receives the search packet can start forwarding data, which reduces the energy consumption under unreachable links. During the search process, the search packet assigns a minimum hop value to each relay node. The minimum hop value will participate in the forwarding of data packets as a forwarding condition, and the forwarding mechanism directly avoids the participation of the hole node in the forwarding;
[0014] (2) To address the problem of uneven network energy consumption caused by fixed transmission links due to relatively fixed priorities in underwater networks, a periodic relay node sleep scheme is adopted. When the energy consumption of a node in the network exceeds a certain threshold within a cycle, it will enter sleep mode in the next cycle and no longer participate in data packet forwarding, giving low-priority links a chance to participate in forwarding, making network energy consumption more balanced and improving network life.
[0015] (3) For routing holes on the water surface, the classic “store-carry-forward” mechanism is used. When there is no forwarding node, the data packet can be stored and wait for the appearance of a forwarding node, thus avoiding routing holes on the water surface.
[0016] The present invention provides a cross-domain network opportunistic routing algorithm, which ultimately achieves a higher data packet delivery rate and network life under sparse deployment of the cross-domain network, and meets the demand for long-term stable operation of the marine information transmission network under sparse deployment.
[0017] The cross-domain network opportunity routing algorithm provided by the present invention comprises a packet search process, a data packet underwater forwarding process and a data packet surface forwarding process.
[0018] The package search process includes:
[0019] S1. First, the buoy node generates and forwards a probe packet, which includes packet type, ID number, sending time, and number of hops. The probe packet will be broadcast to all neighboring nodes without distinction.
[0020] S2. Only relay nodes that are not in sleep mode can receive the probe packet. After receiving the probe packet, the relay node will determine whether it should forward the probe packet. If the relay node has not forwarded a probe packet with the same ID number and sending time and the number of hops in the probe packet does not exceed the threshold, the relay node can forward the probe packet. The hop value of the forwarded probe packet is increased by one, and there will be an information record table in the relay node to record the received probe packet information.
[0021] S3. After receiving the search packet, the source node updates the local information. When there is minimum hop count information in the local information, it means that it can establish a path to the surface buoy node and start forwarding data packets.
[0022] The underwater forwarding process of data packets includes:
[0023] P1. First, the source node generates and forwards the data packet, and searches for packet information including packet type, ID number, sending time, minimum number of hops, and data.
[0024] P2. Only relay nodes that are not in sleep state can receive data packets. After receiving a data packet, if the relay node has not forwarded the same data packet, the relay node will determine whether it belongs to the candidate node set of the sender. If it does, it needs to calculate the node's backoff delay based on the minimum hop value in the node's local information and the minimum hop value in the search packet. If the high-priority node does not forward successfully after the backoff delay, the data packet will be forwarded.
[0025] P3. After a period of time, the buoy node will receive the information in the data packet.
[0026] The data packet surface forwarding process includes:
[0027] Q1. After the buoy node hydroacoustic interface receives a data packet, it first determines whether the data packet has been forwarded. If not, it changes the minimum hop count in the data packet to the node position before forwarding.
[0028] Q2. When the buoy node radio interface receives a data packet, the node can extract the location information of the previous hop node from the data packet to determine whether it is a candidate node. If it is a candidate node, it needs to determine whether it has a candidate node at the current moment based on the neighbor information table. If so, it will replace the location information in the data packet with its own location and forward it immediately. If not, the data packet will be stored in the data packet and forwarded again when there is a candidate node.
[0029] Q3. After a period of time, the convergence center will receive the information in the data packet and complete the cross-domain data transmission process above / underwater.
[0030] The judgment criteria for the underwater candidate node set are as follows:
[0031]
[0032] In the formula, G(mi) represents the candidate node set of the sender node mi, and A(mi) is the neighbor node set of node mi. mh represents a hop value in the local cache information of the receiver, Mh(t) represents the hop set of the receiver, and np represents the minimum hop number carried in the data packet sent by the sender, that is, the minimum value in the hop set of the sender. In simple terms. In the local cache of the relay node that receives the data packet, if there is a hop value that is not greater than the minimum hop value carried by the data packet, that is, the minimum hop number of the relay node is not greater than the minimum hop number carried by the data packet, then the relay node belongs to the candidate node set of the sender.
[0033] The waiting delay of opportunistic routing is as follows:
[0034] T avoid =round{rand(0,RW)·t unit ·[H m -n p +2] + ,-1}
[0035] In the formula, RW (Retreat Window) is the size of the retreat window, tunit is the unit retreat delay, which is the maximum communication distance of the sensor node divided by the underwater propagation speed of sound waves, Hm refers to the minimum number of hops in the local cache information of the receiving node, np is the minimum number of hops carried in the data packet, that is, the minimum number of hops in the local cache information of the sender. The operator round{a,-1} means to keep one decimal place for the constant a, rand(0,a) refers to a random number between 0 and the constant a, and [a]+ refers to the maximum value between the constant a and 0.
[0036] The judgment criteria for the candidate node set of the water surface are as follows:
[0037] G(m i )={m j ∈A(m i ):D(m j ,m c )-D(m i ,m c )<0}
[0038] Where A(mi) is the neighbor node set of buoy node mi, mc is the aggregation center, and D(a,b) refers to the distance between nodes a and b, that is, all neighbor nodes that are closer to the aggregation center than the sending node are candidate nodes.
[0039] The relay node sleep scheme uses the energy consumption within a cycle as the sleep start standard. When the energy consumption of a node within a cycle exceeds a certain threshold, the node will enter sleep in the next cycle and will no longer receive and forward data packets, limiting high-priority nodes from participating too much in forwarding.
[0040] Compared with the related art, the cross-domain network opportunistic routing algorithm provided by the present invention has the following beneficial effects:
[0041] The present invention provides a cross-domain network opportunistic routing algorithm:
[0042] 1. The underwater part of the algorithm uses the minimum number of hops as the candidate node selection standard and priority calculation standard. Different from the previous routing algorithm's mechanism of "first find, then solve" for the void area problem, this protocol directly suppresses the void node from participating in forwarding through the forwarding mechanism;
[0043] 2. This algorithm is applicable to the case of multiple surface buoy nodes, which can shorten the propagation distance and number of hops of data from the source node to the surface, and also increase the transmission success rate of the surface part;
[0044] 3. The water surface part of the algorithm uses the Wait mechanism in Spray-and-Wait, which avoids routing holes on the water surface to a certain extent;
[0045] 4. The algorithm proposes a relay node sleep scheme to make the energy consumption between sensor nodes in the network more balanced and extend the network life;
[0046] 5. The algorithm is simple and has low computational complexity. It is more suitable for underwater sensor nodes with limited computing resources and does not require auxiliary equipment to obtain the location or depth of the node, saving the cost of the sensor node. BRIEF DESCRIPTION OF THE DRAWINGS
[0047] Figure 1 To explore the process flow chart of the package;
[0048] Figure 2 It is a flow chart of the underwater forwarding process of data packets;
[0049] Figure 3 Flowchart of the data packet surface forwarding process. DETAILED DESCRIPTION
[0050] The present invention will be further described below in conjunction with the accompanying drawings and implementation modes.
[0051] The cross-domain network opportunity routing algorithm provided by the present invention comprises a packet search process, a data packet underwater forwarding process and a data packet surface forwarding process.
[0052] The process flow chart of the search package is as follows Figure 1 shown, including:
[0053] S1. First, the buoy node generates and forwards a probe packet, which includes packet type, ID number, sending time, and number of hops. The probe packet will be broadcast to all neighboring nodes without distinction.
[0054] S2. Only relay nodes that are not in sleep mode can receive the probe packet. After receiving the probe packet, the relay node will determine whether it should forward the probe packet. If the relay node has not forwarded a probe packet with the same ID number and sending time and the number of hops in the probe packet does not exceed the threshold, the relay node can forward the probe packet. The hop value of the forwarded probe packet is increased by one, and there will be an information record table in the relay node to record the received probe packet information.
[0055] S3. After receiving the search packet, the source node updates the local information. When there is minimum hop count information in the local information, it means that it can establish a path to the surface buoy node and start forwarding data packets.
[0056] The process flow chart of underwater forwarding of data packets is as follows: Figure 2 shown, including:
[0057] P1. First, the source node generates and forwards the data packet, and searches for packet information including packet type, ID number, sending time, minimum number of hops, and data.
[0058] P2. Only relay nodes that are not in sleep state can receive data packets. After receiving a data packet, if the relay node has not forwarded the same data packet, the relay node will determine whether it belongs to the candidate node set of the sender. If it does, it needs to calculate the node's backoff delay based on the minimum hop value in the node's local information and the minimum hop value in the search packet. If the high-priority node does not forward successfully after the backoff delay, the data packet will be forwarded.
[0059] P3. After a period of time, the buoy node will receive the information in the data packet.
[0060] The flow chart of the data packet surface forwarding process is as follows Figure 3 shown, including:
[0061] Q1. After the buoy node hydroacoustic interface receives a data packet, it first determines whether the data packet has been forwarded. If not, it changes the minimum hop count in the data packet to the node position before forwarding.
[0062] Q2. When the buoy node radio interface receives a data packet, the node can extract the location information of the previous hop node from the data packet to determine whether it is a candidate node. If it is a candidate node, it needs to determine whether it has a candidate node at the current moment based on the neighbor information table. If so, it will replace the location information in the data packet with its own location and forward it immediately. If not, the data packet will be stored in the data packet and forwarded again when there is a candidate node.
[0063] Q3. After a period of time, the convergence center will receive the information in the data packet and complete the cross-domain data transmission process above / underwater.
[0064] The implementation steps and specific coding of the cross-domain network opportunistic routing algorithm are as follows:
[0065] 1. Underwater transmission of the search packet: The buoy node generates and forwards the search packet, which contains information such as type, ID number, sending time and number of hops; only the relay nodes in the non-sleeping state receive it, and forward it further when conditions permit, while recording the packet information; the source node updates the information accordingly and prepares for data transmission. Pseudo code of the search packet process:
[0066] FUNC main():
[0067] SEND search packet()
[0068] FUNC SEND search package ():
[0069] node = buoy node
[0070] packet = search packet
[0071] ifnode.SEND(packet):
[0072] Receive a probe packet
[0073] FUNC receives the search packet:
[0074] if relaynode.RECEIVE(packet):
[0075] if determines the node sleep status():
[0076] Discard the probe packet
[0077] elif determines the node forwarding status (packet):
[0078] Update cache and forward (packet) FUNC determine node sleep status ():
[0079] If relay node. Whether to sleep:
[0080] returnTrue
[0081] return False FUNC determines the node forwarding status (packet):
[0082] if relay node. Has it forwarded (packet):
[0083] returnFalse
[0084] return True FUNC updates the cache and forwards (packet):
[0085] Relay node. Update cache (packet)
[0086] Relay node. Forward (packet)
[0087] 2. Underwater transmission of data packets: The source node generates a data packet with type, ID number, sending time, minimum number of hops and data content; the non-sleeping relay node receives it, determines the forwarding qualification, calculates the backoff delay and forwards it.
[0088] Pseudo code of the underwater transmission process of data packets:
[0089] FUNC main():
[0090] Source node.Send data packet()
[0091] FUNC_SendDataPacket():
[0092] packet=data packet
[0093] If receiving a packet:
[0094] return
[0095] FUNC receives data packet:
[0096] if relaynode.receive(packet):
[0097] If the node is dormant ():
[0098] Dropping packets
[0099] return
[0100] If judge the node forwarding status (packet):
[0101] Dropping packets
[0102] return
[0103] if judge candidate node():
[0104] Calculate backoff delay()
[0105] if monitor priority node():
[0106] Forwarding a packet
[0107] else:
[0108] Dropping packets
[0109] FUNC determines the node sleep ():
[0110] return relay node.Whether to sleep()
[0111] FUNC determines the node forwarding status (packet):
[0112] return relay node. Whether it has forwarded (packet)
[0113] FUNC judge candidate node():
[0114] return relay node. Is it a candidate node? ()
[0115] FUNC calculate backoff delay():
[0116] Relay node. Calculate backoff delay ()
[0117] FUNC listen priority node():
[0118] return! Relay node. High priority node forwarding successfully()
[0119] FUNC forwards data packet:
[0120] Relay node. Forward (packet)
[0121] FUNC drops the packet:
[0122] Relay node.discard(packet)
[0123] 3. Surface buoy node reception: The buoy node receives the data packet, determines whether it has been forwarded, and decides whether to change the hop count to the location information and continue forwarding.
[0124] 4. Radio interface processing: The radio interface of the buoy node extracts the node location information of the previous hop, determines the identity of the candidate node, and if it meets the requirements, decides whether to replace the location information and then forward it based on the neighbor information. Pseudo code of the data packet surface forwarding process:
[0125] FUNC main():
[0126] Receive Packet()
[0127] FUNC_RECEIVE_PACKET():
[0128] packet=data packet
[0129] if buoynode.receive(packet):
[0130] if forwarded(packet):
[0131] Dropping packets
[0132] return
[0133] if! underwater acoustic link receiving (packet):
[0134] Drop packets and remove minimum hops (packet)
[0135] Add buoy node location information (packet)
[0136] return
[0137] Change location information (packet)
[0138] if there is a candidate node():
[0139] Storing packets
[0140] return
[0141] Forwarding a packet
[0142] FUNC forwarded (packet):
[0143] return buoy node. Forwarded (packet)
[0144] FUNC underwater acoustic link receiving (packet):
[0145] returnpacket.Received by the hydroacoustic link()
[0146] FUNCChange location information (packet):
[0147] packet.location information = buoy node.location
[0148] FUNC drops the packet:
[0149] buoynode.discard(packet)
[0150] FUNC drops the packet and removes the minimum number of hops (packet):
[0151] packet.deleteminhops()
[0152] Dropping packets
[0153] FUNC adds buoy node location information (packet):
[0154] packet.Add location information (buoy node.location)
[0155] FUNC has candidate nodes():
[0156] return float node. has candidate node()
[0157] FUNC stores data packets (packet):
[0158] Buoy node.storage(packet)
[0159] FUNC forwards data packet:
[0160] Buoy node. Forward (packet)
[0161] 5. Data aggregation: The aggregation center receives data packets and completes the cross-domain transmission process of data above and below the water.
[0162] The above descriptions are merely embodiments of the present invention and are not intended to limit the patent scope of the present invention. Any equivalent structure or equivalent process transformation made using the contents of the present invention specification and drawings, or directly or indirectly applied in other related technical fields, are also included in the patent protection scope of the present invention.
Claims
1. A cross-domain network opportunistic routing algorithm, characterized in that: include: Step 1: Explore the underwater transmission of the package; Step 2: underwater transmission of data packets; Step 3: Surface buoy node receiving; Step 4: Radio interface processing; Step 5: Data summary.
2. The cross-domain network opportunistic routing algorithm according to claim 1, characterized in that: In step 1, the specific steps of searching for underwater transmission of the packet are as follows: The buoy node generates and forwards a probe packet containing information such as type, ID number, sending time and number of hops; only the relay nodes in the non-sleeping state receive it and forward it further when conditions permit, while recording the packet information; the source node updates the information accordingly and prepares for data transmission.
3. The cross-domain network opportunistic routing algorithm according to claim 1, characterized in that: In step 2, the specific steps of underwater transmission of data packets are as follows: The source node generates a data packet with type, ID number, sending time, minimum number of hops and data content; the non-sleeping relay node receives it, calculates the backoff delay and forwards it after determining the forwarding qualification.
4. The cross-domain network opportunistic routing algorithm according to claim 1, characterized in that: In step 3, the surface buoy node receiving step is specifically as follows: The buoy node receives the data packet and determines whether it has been forwarded. Based on this, it decides whether to change the hop count to the location information and continue forwarding.
5. The cross-domain network opportunistic routing algorithm according to claim 1, characterized in that: In step 4, the specific steps of radio interface processing are: The radio interface of the buoy node extracts the node location information of the previous hop, determines the identity of the candidate node, and if it meets the requirements, decides whether to replace the location information and then forward it based on the neighbor information.
6. The cross-domain network opportunistic routing algorithm according to claim 1, characterized in that: In step 5, the specific steps of data aggregation are: The aggregation center receives the data packets and completes the cross-domain transmission process of data above and below the water.
