Seismic node instrument wireless ad hoc network routing protocol based on improved AODV

Abstract

The invention belongs to the technical field of wireless communication routing protocols, and particularly relates to a seismic node instrument wireless ad hoc network routing protocol based on an improved AODV. According to the seismic node instrument wireless ad hoc network routing protocol based on the improved AODV, an existing AODV algorithm is improved, a unique data transmission frame and channel anti-collision protocol is designed for an oil field seismic survey scene, and efficient, stable and adaptive data transmission is achieved. The seismic node instrument wireless ad hoc network routing protocol based on the improved AODV comprises the following steps: designing a protocol frame; analyzing and preprocessing data needing to be transmitted; designing an access mechanism and an anti-collision protocol of a channel; analyzing a communication range and a data transmission rate, and performing conflict detection and processing; designing a network access mechanism; sending a position packet through broadcasting, and linking with nearby nodes; a networking route is designed; the routing is selected according to the principle of the best signal strength and the minimum hop count.

Description

Technical Field

[0001] This invention belongs to the field of wireless communication routing protocol technology, and particularly relates to a wireless ad hoc network routing protocol for seismic nodes based on an improved AODV. Background Technology

[0002] With the steady growth of my country's economic strength, the demand for natural resources from various industries continues to rise, making the optimization of natural resource extraction efficiency an urgent need. Especially in the field of oil exploration, as exploration deepens, technical personnel face increasing challenges, including expanding the scale of exploration, increasing the scope of operations, and dealing with complex terrain.

[0003] With the rapid development of the Internet of Things (IoT) and wireless communication technologies, wireless node instrument systems are evolving towards miniaturization, intelligence, low cost, and low power consumption. Considering the limitations of wired systems in seismic exploration, wireless communication methods have become the mainstream choice for seismic exploration systems. Among them, Wireless Ad Hoc Networks (AD hoc networks), as a fully adaptive distributed system, consist of multiple terminal nodes with wireless communication capabilities; these nodes are in real-time motion, so their network topology also changes in real-time. It is worth noting that a significant characteristic distinguishing AD hoc network technology from traditional mobile communication networks is that all nodes within the network not only undertake data transmission but also act as routing and forwarding functions. This unique network architecture enables nodes to achieve data transmission between each other through multi-hop methods, thereby achieving equality and autonomy among nodes in the network structure. Furthermore, the self-organizing and decentralized nature of AD hoc networks means they do not rely on pre-established basic network infrastructure. In AD hoc networks, when performing data exchange tasks, nodes calculate and determine their data transmission routes using a preset algorithm based on the acquired network topology information. For nodes outside each other's communication range, AD hoc networks effectively achieve remote data transmission through a multi-hop forwarding mechanism. The flexibility and adaptability of this network enable it to quickly adapt to various complex environments, facilitating rapid deployment and application. These characteristics are particularly important in geological exploration, emergency rescue, and mining operations. Therefore, AD hoc network technology not only demonstrates efficiency and adaptability in complex environments but also provides highly flexible and reliable network communication solutions for various application scenarios. Against the backdrop of the continuous evolution of modern communication technologies, AD hoc networks, with their unique advantages, are gradually becoming an important network technology choice.

[0004] For example, the patent document with application number CN202011522817.7 and invention title "A Self-Organizing Network System and Method for a Large-Scale Cableless Seismograph" employs the aforementioned AD hoc network technology in the communication process of the self-organizing network system. Specifically, this self-organizing network system and method for a large-scale cableless seismograph includes a master control server, a main central bridge connected to the master control server via wired communication, and multiple regional central bridges connected to the main central bridge via wireless communication. The large-scale cableless seismographs form a wireless multi-hop network, which is divided into multiple sub-networks, each of which is wirelessly connected to a corresponding regional central bridge. This invention employs a two-level wireless transmission structure to meet the wireless self-organizing network requirements of large-scale cableless seismographs, enabling the cableless seismographs to truly achieve large-scale real-time or near-real-time transmission of seismic data or quality monitoring data, thus meeting or partially meeting the data quality monitoring standards for oil and gas exploration, etc.

[0005] However, further research revealed that while wired node instrument systems offer high transmission rates and stability in most practical scenarios, their drawbacks become increasingly apparent in large-scale data acquisition scenarios, including complex cable deployment, susceptibility to environmental influences, and high maintenance difficulty. Cable failures or node malfunctions can lead to widespread data transmission interruptions, severely impacting the efficiency and accuracy of seismic monitoring. This is particularly evident in applications with complex terrain and extensive exploration areas, increasing the difficulty of troubleshooting and exploration. Furthermore, the limitations of mobile node energy and channel resources during AD hoc network design and implementation further complicate network setup and present significant challenges. Therefore, there is an urgent need for those skilled in the art to provide a novel wireless ad hoc network routing protocol to address the technical shortcomings of existing AD hoc network technologies, such as low seismic node instrument exploration data monitoring efficiency and long fault recovery times. Summary of the Invention

[0006] This invention provides a wireless ad hoc network routing protocol for seismic nodes based on an improved AODV. By improving the existing AODV algorithm, a unique data transmission frame and channel anti-collision protocol are designed for oilfield seismic exploration scenarios. It also improves a series of problems existing in the existing algorithm, such as "broadcast storm" and low data transmission efficiency, and achieves efficient, stable and adaptive data transmission.

[0007] To solve the above-mentioned technical problems, the present invention adopts the following technical solution: A wireless ad hoc network routing protocol for seismic nodes based on an improved AODV includes the following steps: S1: Design the protocol frame; analyze and preprocess the data to be transmitted; S2: Design the channel access mechanism and anti-collision protocol; analyze the communication range and data transmission rate, and perform collision detection and handling; S3: Design a network entry mechanism; send location packets via broadcast to link with nearby nodes; S4: Design network routing; select routes based on the principle of best signal strength and fewest hops.

[0008] Preferably, the process of designing the protocol frame in step S1 can be specifically described as follows: Use regular expressions to extract the required data fields from the protocol frame.

[0009] Preferably, the protocol frame includes four parts: a data frame header, a data frame trailer, a data check bit, and a status data bit. The status data bits include the ID bit of the seismic node instrument and status data bits that reflect the working status of the seismic node instrument.

[0010] Preferably, the conflict detection and processing process in step S2 can be specifically described as follows: Before sending data, perform carrier sensing to actively detect whether the channel is busy; If the channel is idle, data will be sent immediately.

[0011] More preferably, the conflict detection and processing process in step S2 can be further described as follows: If the channel is busy, the binary exponential backoff algorithm is used to calculate the backoff time T based on the current channel status and historical collision data, and then backoff is performed. Wherein, the backoff time T satisfies: T=N*CW(1); In equation (1), N is a random integer and CW is the competition window; The competition window CW satisfies: CW = 2 n -1(2); In equation (2), n is the number of attempts to retransmit.

[0012] Preferably, the process of sending a location packet via broadcast and linking with nearby nodes in step S3 can be specifically described as follows: When the current node is the master node, it sends a POSITION packet via broadcast; the POSITION packet carries the master node's location information that can be received by other nodes.

[0013] More preferably, the process of sending a location packet via broadcast and linking with nearby nodes in step S3 can be further described as follows: When the current node is a non-master node, the location information of the collection node is marked as n, the location information of the master node saved by the collection node is marked as m, and the location information in the data packet received by the collection node is marked as p. The distance Dlocal between the acquisition node and the master node stored by the acquisition node satisfies: The distance Dpacket between the acquisition node and the data packet satisfies: If Dlocal > Dpacket, then update the master node information stored locally by the acquisition node to the master node information corresponding to the POSITION packet, and continue to broadcast the POSITION packet; if Dlocal < Dpacket, then discard the received POSITION packet this time.

[0014] Preferably, the process of selecting a route based on the principle of the best signal strength and the fewest hops in step S4 can be specifically described as: Mark the set of all possible routes from the current node to the source node as R, and mark each route in the set of all possible routes R as r; where, r ∈ R; Then the finally selected route r * satisfies: r * = min r∈R h(r) (7) r * = max r∈R {S(r)|h(r) = h(r * )} (8) In formulas (7) and (8), h(r) is the number of hops corresponding to route r, and S(r) is the signal strength corresponding to route r.

[0015] The present invention provides a wireless self - organizing network routing protocol for seismic node instruments based on improved AODV. This wireless self - organizing network routing protocol for seismic node instruments based on improved AODV includes the following steps: S1: Design protocol frames; analyze and pre - process the data to be transmitted; S2: Design the access mechanism of the channel and the anti - collision protocol; analyze the communication range and data transmission rate, and perform collision detection and processing; S3: Design the network access mechanism; send location packets by broadcasting and link with nearby nodes; S4: Design the network formation routing; select a route based on the principle of the best signal strength and the fewest hops. The wireless self - organizing network routing protocol for seismic node instruments with the above step characteristics improves the efficiency and self - adaptability of the wireless network formation of seismic node instruments, ensures the stability of data transmission, and compared with the prior art, at least has the following advantages: (1) This invention addresses the problems of unstable routing tables and dynamic changes in network topology in the routing protocol of wireless ad hoc networks for seismic nodes, and proposes a novel routing protocol. Specifically, by monitoring the network environment and analyzing data, routing information between nodes is extracted, enabling dynamic updating and optimization of the routing information. Then, using an improved algorithm, combined with information gain ratio and feature extraction algorithms, an effective subset of features is extracted from massive amounts of network data, which helps to improve the stability and accuracy of the routing table.

[0016] (2) This invention uses an improved algorithm to effectively solve a series of problems in the existing AODV algorithm, such as route congestion and high latency in the route discovery process. By optimizing the route discovery mechanism, the number of route request message transmissions and communication overhead between nodes are reduced, thereby improving communication efficiency.

[0017] (3) The routing protocol provided by this invention can be applied to earthquake survey scenarios, solving the shortcomings of complex cable layout, susceptibility to environmental influences and high maintenance difficulty in earthquake survey. Furthermore, its data can be directly collected through the network, greatly reducing the efficiency of earthquake survey and saving a lot of manpower and resources. Attached Figure Description

[0018] The accompanying drawings are provided to further illustrate the invention and form part of the specification. They are used in conjunction with embodiments of the invention to explain the invention and do not constitute a limitation thereof. In the following drawings: Figure 1 A schematic diagram illustrating the flow of the wireless ad hoc network routing protocol for seismic nodes based on the improved AODV provided by this invention. Figure 2 A structural design diagram of a protocol frame for transmitting data; Figure 3 This is a flowchart illustrating the conflict detection and handling process. Figure 4 A flowchart illustrating the network access mechanism for data acquisition nodes; Figure 5 This is one of the flowcharts for receiving RREQ packets using the improved AODV-based wireless ad hoc network routing protocol for seismic nodes provided by the present invention. Figure 6 This is the second flowchart of the process for receiving RREQ packets using the improved AODV-based wireless ad hoc network routing protocol for seismic nodes provided by this invention. Detailed Implementation

[0019] This invention provides a wireless ad hoc network routing protocol for seismic nodes based on an improved AODV. By improving the existing AODV algorithm, a unique data transmission frame and channel anti-collision protocol are designed for oilfield seismic exploration scenarios. It also improves a series of problems existing in the existing algorithm, such as "broadcast storm" and low data transmission efficiency, and achieves efficient, stable and adaptive data transmission.

[0020] To make the objectives, technical solutions, and advantages of this invention clearer, the invention will be further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative and not intended to limit the invention.

[0021] In the description of this invention, it should be understood that the terms "length," "width," "upper," "lower," "front," "rear," "left," "right," "vertical," "horizontal," "top," "bottom," "inner," and "outer," etc., indicating orientation or positional relationships, are based on the orientation or positional relationships shown in the accompanying drawings and are only for the convenience of describing the invention and simplifying the description, and do not indicate or imply that the device or element referred to must have a specific orientation, or be constructed and operated in a specific orientation, and therefore should not be construed as a limitation of the invention. Furthermore, in the description of this invention, "a plurality of" means two or more, unless otherwise explicitly specified. Example 1

[0022] This invention provides a wireless ad hoc network routing protocol for seismic nodes based on an improved AODV, such as... Figure 1 As shown, it includes the following steps: S1: Design the protocol frame; analyze and preprocess the data to be transmitted; S2: Design the channel access mechanism and anti-collision protocol; analyze the communication range and data transmission rate, and perform collision detection and handling; S3: Design a network entry mechanism; send location packets via broadcast to link with nearby nodes; S4: Design network routing; select routes based on the principle of best signal strength and fewest hops.

[0023] Among them, as a preferred embodiment of the present invention, such as Figure 2 As shown, the designed protocol frame includes four parts: a data frame header, a data frame trailer, a data check bit, and status data bits. It is worth noting that the status data bits contain the seismic nodal instrument's ID bit and status data bits reflecting the seismic nodal instrument's operating status. Specifically, these status data bits correspond to the four operating states of the seismic nodal instrument, as shown in the table below: Status data bits Seismic nodal instrument status 0 The device is powered off and cannot connect. 1 Equipment is working normally 2 Device in standby mode, unable to connect 3 Device malfunction, connection failed. In step S1 above, the process of designing the protocol frame preferably uses regular expressions to extract the required data fields from the protocol frame. Example 2

[0024] Embodiment Two includes all the technical features described in Embodiment One. Furthermore, based on Embodiment One, Embodiment Two provides the following supplementary explanation of step S2: Specifically, as a preferred embodiment of the present invention, such as Figure 3 As shown, the collision detection and handling process in step S2 can be specifically described as follows: Before sending data, perform carrier sensing to actively detect whether the channel is busy; If the channel is idle, data will be sent immediately.

[0025] If the channel is busy, the binary exponential backoff algorithm is used to calculate the backoff time T based on the current channel status and historical collision data, and then backoff is performed. Wherein, the backoff time T satisfies: T=N*CW(1); In equation (1), N is a random integer and CW is the competition window; The competition window CW satisfies: CW = 2 n -1(2); In equation (2), n is the number of attempts to retransmit.

[0026] It should be noted that, to ensure the validity of the contention window (CW) value, it is necessary to determine whether the current contention window CW is greater than the maximum window value. If it is, the maximum window value should be used as the new CW value, and a random number between 0 and the contention window CW should be generated. A backoff time T is then calculated for backoff. After backoff, the radio channel is further checked for idleness to reduce channel collisions. Furthermore, the number of consecutive backoff attempts to access the radio channel should not exceed the maximum allowed number, and a random backoff time should be selected to reduce contention and collisions between nodes. Example 3

[0027] Implementation Three includes all the technical features described in Implementation One. Furthermore, based on Implementation One, Implementation Three provides the following supplementary explanation of step S3: Specifically, as a preferred embodiment of the present invention, such as Figure 4 As shown, the process of sending a location packet via broadcast and establishing a link with nearby nodes in step S3 can be specifically described as follows: When the current node is the master node, it sends a POSITION packet via broadcast; the POSITION packet carries the master node's location information that can be received by other nodes.

[0028] When the current node is a collection node that is not the master node, mark the location information of the collection node as n, mark the location information of the master node saved by the collection node as m, and mark the location information in the data packet received by the collection node as p; Then the distance Dlocal between the collection node and the master node saved by the collection node satisfies: The distance Dpacket between the collection node and the data packet satisfies: If Dlocal > Dpacket, update the master node information stored locally by the collection node to the master node information corresponding to the POSITION packet, and continue to broadcast the POSITION packet; if Dlocal < Dpacket, discard the received POSITION packet this time.

[0029] It should be added that after receiving a new data packet in step S3, the collection node needs to first check and process the data packet (that is, the POSITION packet defined in the rule library in step S3). The purpose of doing this is to verify whether the collection node locally already stores the location information of the master node. If not, the location information of the master node of this POSITION packet can be selected to be stored as the target node address when sending data, that is, regarding this master node as its own target node and transmitting the data to this master node.

[0030] If it has been saved, calculate the distance values from its location information to the master node saved locally and the master node in the POSITION packet respectively. Further, if the master node in the POSITION packet is closer, it means that the master node corresponding to the POSITION packet is better than the master node stored locally, and based on this, update the local information and broadcast the POSITION packet again. If the master node in the POSITION packet is farther away, discard the received POSITION packet this time. Embodiment 4

[0031] Embodiment 4 includes all the technical features recorded in Embodiment 1. And on the basis of Embodiment 1, Embodiment 4 further makes the following supplementary explanatory description for step S4: Specifically, as a relatively preferred implementation manner of the present invention, the process of selecting a route based on the principle of the best signal strength and the fewest hops in step S4 can be specifically described as: Mark the set of all possible routes from the current node to the source node as R, and mark each route in all possible route sets R as r; where, r ∈ R; Then the finally selected route r* satisfy: r * =min r∈R h(r) (7) r * =max r∈R {S(r)|h(r)=h(r * )} (8) In equations (7) and (8), h(r) is the number of hops corresponding to route r, and S(r) is the signal strength corresponding to route r.

[0032] It should be noted that existing AODV protocols typically use flooding to broadcast and forward RREQ packets during the reverse routing process, but this can lead to a series of problems such as "broadcast storms." Furthermore, they lack a selection mechanism to determine the optimal route to the source node when forwarding RREP packets. In contrast, the wireless ad hoc network routing protocol provided in this invention uses directional broadcasting, effectively avoiding the aforementioned problems, and introduces a selection mechanism based on signal strength and hop count to ensure that the best route is selected.

[0033] The flowchart illustrating the improved existing AODV algorithm (receiving RREQ packets) can be found as follows: Figure 5 , 6 As shown in the diagram. A specific process can be illustrated as follows: The `broadcast_id` and `src` in the RREQ packet uniquely identify the RREQ, determining whether it's the first time the packet has been received. Then, by checking the source node address (`src`), it checks if a routing table entry with the same source node address already exists locally. If not, it indicates the RREQ is being received for the first time, and the entry is saved locally. If a routing table entry with the same source node exists, the `broadcast_id` in the packet is compared to the values ​​of all locally stored routing table entries. If the `broadcast_id` in the packet is greater than all locally stored values, the RREQ is valid.

[0034] Furthermore, it can be checked whether the same sender_addr (the address of the previous hop node) exists locally as in the packet. If it exists, the corresponding information is updated locally; otherwise, it is saved locally. Finally, if the broadcast_id in the RREQ is less than any value stored locally, the RREQ is considered invalid and discarded. After completing the above operations, based on the relevant information of the RREQ, a reverse route can be established and added to the routing table.

[0035] Furthermore, during the transmission of the RREP packet, it is sent to the source node via unicast. For the relay node receiving the RREP packet, its primary task is to send an acknowledgment packet (RACK) back to the sending node of the RREP, identified by a type value of 2. If no RACK packet is received within a preset time limit, the relay node will trigger an error reporting process by sending an RRER packet with a modified src address to prompt the source node to rebuild the route, and wait for a RACK packet with a type value of 3 to confirm the successful propagation of the error report. In addition, after receiving the RREP, the node needs to construct or update the forward routing table entries based on the information within the packet. For non-source nodes, they will search their local routing table for all routes to the source node, determining the next-hop forwarding address for the RREP based on the minimum hop count and optimal signal strength. If no valid route is found, a RERR packet is sent to notify the source node, and then a RACK packet with a type value of 3 is waited for.

[0036] This invention provides a wireless ad hoc network routing protocol for seismic nodes based on an improved AODV (Advanced Optical Distance Variant). This protocol includes the following steps: S1: Designing protocol frames; analyzing and preprocessing the data to be transmitted; S2: Designing channel access mechanisms and anti-collision protocols; analyzing communication range and data transmission rate, and performing collision detection and handling; S3: Designing network entry mechanisms; broadcasting location packets to link with nearby nodes; S4: Designing network routes; selecting routes based on the principles of best signal strength and fewest hops. This improved AODV-based wireless ad hoc network routing protocol for seismic nodes, with the above-described steps, improves the efficiency and adaptability of wireless networking for seismic nodes, and ensures the stability of data transmission. Compared to existing technologies, it has at least the following advantages: (1) This invention addresses the problems of unstable routing tables and dynamic changes in network topology in the routing protocol of wireless ad hoc networks for seismic nodes, and proposes a novel routing protocol. Specifically, by monitoring the network environment and analyzing data, routing information between nodes is extracted, enabling dynamic updating and optimization of the routing information. Then, using an improved algorithm, combined with information gain ratio and feature extraction algorithms, an effective subset of features is extracted from massive amounts of network data, which helps to improve the stability and accuracy of the routing table.

[0037] (2) This invention uses an improved algorithm to effectively solve a series of problems in the existing AODV algorithm, such as route congestion and high latency in the route discovery process. By optimizing the route discovery mechanism, the number of route request message transmissions and communication overhead between nodes are reduced, thereby improving communication efficiency.

[0038] (3) The routing protocol provided by this invention can be applied to earthquake survey scenarios, solving the shortcomings of complex cable layout, susceptibility to environmental influences and high maintenance difficulty in earthquake survey. Furthermore, its data can be directly collected through the network, greatly reducing the efficiency of earthquake survey and saving a lot of manpower and resources.

[0039] The above description is merely a specific embodiment of the present invention, but the scope of protection of the present invention is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the technical scope disclosed in the present invention should be included within the scope of protection of the present invention. Therefore, the scope of protection of the present invention should be determined by the scope of the claims.

Claims

1. A wireless ad hoc network routing protocol for seismic nodes based on an improved AODV, characterized in that, It includes the following steps: S1: Design the protocol frame; analyze and preprocess the data to be transmitted; S2: Design the access mechanism of the channel and the anti-collision protocol; analyze the communication range and data transmission rate, and perform collision detection and handling; S3: Design the network access mechanism; Send the location packet by broadcast and link with nearby nodes; S4: Design the network routing; Select the route based on the principle of the best signal strength and the fewest hops.

2. The wireless ad hoc network routing protocol for seismic nodes based on an improved AODV as described in claim 1, characterized in that, The process of designing the protocol frame in step S1 can be specifically described as: Use regular expressions to extract the required data fields in the protocol frame.

3. A wireless ad hoc network routing protocol for seismic nodes based on an improved AODV, as described in claim 2, is characterized in that... The protocol frame includes four parts: data frame header, data frame tail, data check bit, and status data bit; The status data bit contains the ID bit of the seismic node instrument and the status data bit used to reflect the working status of the seismic node instrument.

4. A wireless ad hoc network routing protocol for seismic nodes based on an improved AODV, as described in claim 1, is characterized in that... The process of collision detection and handling in step S2 can be specifically described as: Perform carrier sensing before sending data to actively detect whether the channel is busy; If the channel is idle, send the data immediately.

5. A wireless ad hoc network routing protocol for seismic nodes based on an improved AODV, as described in claim 4, is characterized in that... The process of collision detection and handling in step S2 can also be specifically described as: If the channel is busy, according to the current channel state and historical collision situations, adopt the binary exponential backoff algorithm to calculate the backoff time T for backoff; Among them, the backoff time T satisfies: T = N * CW(1); in formula (1), N is a random integer, and CW is the contention window; The competition window CW satisfies: CW = 2 n -1(2); In equation (2), n is the number of attempts to retransmit.

6. A wireless ad hoc network routing protocol for seismic nodes based on an improved AODV, as described in claim 1, is characterized in that... The process of sending the location packet by broadcast and linking with nearby nodes in step S3 can be specifically described as: When the current node is the master node, send the POSITION packet by broadcast; among them, the POSITION packet carries the location information of the master node that can be received by other nodes.

7. A wireless ad hoc network routing protocol for seismic nodes based on an improved AODV, as described in claim 6, is characterized in that... The process of sending the location packet by broadcast and linking with nearby nodes in step S3 can also be specifically described as: When the current node is a non-master node acquisition node, mark the acquisition node location information as n, mark the master node location information saved by the acquisition node as m, and mark the location information in the data packet received by the acquisition node as p; Then the distance Dlocal between the acquisition node and the master node saved by the acquisition node satisfies: The distance Dpacket between the acquisition node and the data packet satisfies: If Dlocal > Dpacket, update the master node information stored locally by the acquisition node to the master node information corresponding to the POSITION packet, and continue to broadcast the POSITION packet; If Dlocal < Dpacket, discard the received POSITION packet this time.

8. A wireless ad hoc network routing protocol for seismic nodes based on an improved AODV, as described in claim 1, is characterized in that... The process of selecting the route based on the principle of the best signal strength and the fewest hops in step S4 can be specifically described as: Mark the set of all possible routes from the current node to the source node as R, and mark each route in all possible route sets R as r; where, r ∈ R; The final selected route r * satisfy: r * =my r∈R h(r) (7) r * =max r∈R {S(r)|h(r)=h(r * )} (8) In formulas (7) and (8), h(r) is the number of hops corresponding to route r, and S(r) is the signal strength corresponding to route r.

Images