Initiation information notification and feedback method suitable for wireless node detector

Abstract

The invention discloses a detonation information notification and feedback method suitable for a wireless node detector, and the method comprises the steps: carrying out the information notification of all nodes before the detonation of a seismic source through a wireless ad hoc network, and feeding back the confirmation information to a seismograph through all nodes. The invention provides a method for notifying and feeding back detonation information for a seismic exploration system using a wireless node detector under a three-layer network architecture, so that a seismograph can notify all nodes before a seismic source is detonated, thereby greatly reducing the energy consumption of the nodes and the storage of invalid data, and effectively improving the seismic exploration efficiency.

Description

Technical Field

[0001] The invention relates to the field of geological exploration, and in particular to a detonation information notification and feedback method suitable for a wireless node detector. Background Art

[0002] In geological exploration, in the traditional detector data acquisition system connected by cables, when the seismic wave is excited, the detector will be notified through the cable. After receiving the notification, the detector will immediately collect the seismic data and store the collected data. The current mainstream wireless node detector (referred to as "node" in this invention) first collects seismic data at the field deployment location, and then waits until the construction break, and then the data of all nodes are centrally exported by special equipment. Information cannot be exchanged between the node and the seismograph in real time.

[0003] Since the seismograph and the wireless node detector cannot communicate in real time, the current mainstream wireless node detectors will continuously collect data according to the established cycle and store the data after being deployed, regardless of whether seismic waves are stimulated or not. This brings two major problems: a. Excessive invalid data is collected and stored, resulting in a large waste of storage space. In scenarios where continuous large-scale data collection is required, this will greatly increase the cost of seismic exploration; b. The continuous reception of signals by the nodes will cause additional ineffective consumption of energy. The above two points will bring major practical problems for some scenarios with complex terrain, where it is hoped that all measurements will be completed after the nodes are deployed once, and the nodes will not be replenished with energy or data will not be exported in the middle.

[0004] The present invention proposes a notification and feedback method for detonation information for a seismic exploration system using wireless node detectors under a three-layer network architecture. In this method, information is notified to all nodes before the earthquake source is detonated through a wireless self-organizing network, and all nodes feed back confirmation information to the seismograph, which greatly reduces the energy consumption of the nodes and the storage of invalid data, and effectively improves the efficiency of seismic exploration. Summary of the invention

[0005] In view of the shortcomings of the prior art, the present invention proposes a detonation information notification and feedback method suitable for a wireless node detector.

[0006] The present invention provides the following technical solutions:

[0007] A detonation information notification and feedback method applicable to a wireless node detector comprises the following steps:

[0008] S1, through the three-layer network architecture, all the deployed nodes are layered and grouped, all the nodes are divided into common nodes, aggregation nodes, and routing nodes, and the information interaction routes between all nodes and seismographs are set;

[0009] S2, a spreading code is assigned to each node, and the spreading codes assigned to nodes within one-hop communication distance are different;

[0010] S3, for any node i, the number of hops from the node to the seismograph is h i , The channel resources are divided into continuous time frames, each frame contains N time slots, and the time slots between nodes are all aligned. An activation time slot is set for each node in each time frame cycle, and the transceiver is turned off and enters a dormant state in other time slots;

[0011] S4, before each node sends information in a given time slot, it first spreads the information using the assigned spreading code;

[0012] S5, after the detonation information is generated, the seismometer immediately activates the next time slot n 0 Send information, h i = 1 and h i =1 in n 0 The time slot monitoring channel receives the detonation information and remains active in the following time slots until it receives the h i = 1 and h i = 1 until the detonation notification success message or detonation notification failure message is sent by the routing node;

[0013] S6,h i = k common nodes in n 0 +k-1 time slot monitoring channel, if the detonation information is received, then 0 +k time slot sends the reception confirmation information to the bound aggregation node, and performs the seismic wave reception status in the NN time slot;

[0014] S7,h i = k sink nodes in n 0 +k-1 time slot monitoring channel, if the detonation information is received, then 0 +k time slot forwards this information, and 0 +k+1 time slot to monitor the channel again, expecting to receive the reception confirmation information of the ordinary node bound to it. If 0 +k+1 time slot receives the reception confirmation information of all ordinary nodes bound to it, then in n 0 +k+2 time slot sends a detonation notification success message to its bound routing node, and performs seismic wave receiving status in NN time slot. If 0 +k+1 time slot does not receive the reception confirmation information of a common node bound to it, then in n 0 +k+2 time slot sends detonation notification failure information to its bound routing node;

[0015] S8,h i =k routing node in n 0 +k-1 time slot monitoring channel:

[0016] If the detonation information is received, then 0 +k time slot forwards this information;

[0017] In n 0 +k+1 time slots monitor the channel again, expecting to receive: ① the detonation notification success information sent by all ordinary nodes bound to it as sink nodes; ② the detonation notification information forwarded by all sink nodes bound to it as routing nodes and routing nodes bound to it as routing nodes to reach the seismograph; if the information of a certain node is not received, the detonation notification failure information is generated and sent to the routing node bound to it to reach the seismograph; if all are received, continue to monitor the channel in the next time slot;

[0018] In n 0 +k+2 time slots continue to monitor the channel, expecting to receive the detonation notification success information sent by all the aggregation nodes bound to it as routing nodes; if it is not successfully received, it generates a detonation notification failure message and sends it to the routing node bound to it to reach the seismograph; if the reception is successful and there is no routing node bound to it as the next hop routing node to reach the seismograph, it generates a detonation notification success message and sends it in n 0 +k+3 is sent to the next-hop routing node bound to it to reach the seismograph; if the reception is successful and there is a routing node bound to it as the next-hop routing node to reach the seismograph, it will monitor the channel in the following time slots:

[0019] a. If a detonation failure notification message is received from a routing node in a certain time slot, it is forwarded to the next-hop routing node bound to the seismograph in the next time slot;

[0020] b. If the detonation notification success information sent by all the routing nodes bound to it as the next-hop routing node to reach the seismograph has been received in a certain time slot thereafter, the detonation notification success information is generated and forwarded to the next-hop routing node bound to it to reach the seismograph in the next time slot, and the seismic wave receiving state is performed in the NN time slot.

[0021] Further, the activation time slot setting of each node includes the following steps:

[0022] T1, after the seismograph receives the detonation command, the time slot in each time frame where the detonation information can be sent is:

[0023]

[0024] T2, order It means rounding down, and the number of hops to the seismograph is h i The time slots that the nodes monitor the channel in each time frame are:

[0025]

[0026] T3, except for the seismograph, once other nodes detect the detonation notification information in the monitoring time slot, they stop sleeping in the next time slot.

[0027] Furthermore, the transmission power of the common node is P 1 , the corresponding one-hop communication distance is L 1r , the transmission power of the aggregation node is P 2 , the corresponding one-hop communication distance is L 2r , the transmission power of the routing node is P 3 , the corresponding one-hop communication distance is L 3r .

[0028] Furthermore, each node is equipped with a communication module, and can effectively communicate with each other within a certain distance. The transmission power of the common node is less than the transmission power of the aggregation node, and the transmission power of the aggregation node is less than the transmission power of the routing node. The common node transmits at a power of P 1 Exchange information with a specific sink node, which uses power P 2 The routing node that it is bound to exchanges information with the power P 3 The next-hop routing node that is closer to the seismometer interacts with it.

[0029] Furthermore, the method for each node to obtain a spreading code includes the following steps:

[0030] F1, spreading code sequence set A, let the spreading code sequence in A be a n ,n=0,...,N A -1, N A is the number of spreading code sequences in A, excluding all-zero sequences;

[0031] F2, change a 0 Assigned to the seismograph, denoted as sc 0 ; Let the node element in the routing node set B be b m ,m=1,...,N B , N B is the number of elements in B, denoted by b m The spreading code is And initialized to a sequence of all zeros; let the node element in the aggregation node set D be d m ,m=1,...,ND , N D is the number of elements in D, denoted by d m The spreading code is And initialized to a sequence of all zeros; let the node element in the ordinary node set E be e m ,m=1,...,N E , N E is the number of elements in E, denoted by e m The spreading code is And initialized to an all-zero sequence; let u = 1, the value of u is used to record the number of spreading codes currently allocated;

[0032] F3, let j = 1, i = 1, and perform the following steps:

[0033] F3.1, traverse set B and find j Distance less than L 3r Nodes, denoted by C j ;

[0034] F3.2, perform the following steps in sequence:

[0035] F3.2.1, Check a i Whether it is related to C j The spreading code of a node in is the same:

[0036] If a i With C j The spreading codes of any node in are different, then:

[0037] A i Select b j The spreading code is

[0038] If u<i, update the value of u and set u=i;

[0039] Let j = j + 1, and determine j ≤ N B Is it true? If so, jump to step F3.1; if not, jump to step F4;

[0040] If a i With C j If the spreading code of a node in is the same, set i=i+1 and jump to step F3.2.1 to continue execution;

[0041] F4, let k = 1, i = u + 1, and perform the following steps:

[0042] F4.1, traverse the set D and find k Distance less than L 2r The nodes of k ;

[0043] F4.2, perform the following steps in sequence:

[0044] F4.2.1, check a i Whether with G k The spreading code of a node in is the same:

[0045] If a i With G k The spreading codes of any node in are different, then:

[0046] A i Select d k The spreading code is

[0047] If u<i, update the value of u and set u=i;

[0048] Let k = k + 1, and determine k ≤ N D Is it true? If so, jump to step F4.1; if not, jump to step F5;

[0049] If a i With G k If the spreading code of a node in is the same, set i=i+1 and jump to step F4.2.1 to continue execution;

[0050] F5, let t = 1, i = u + 1, and perform the following steps:

[0051] F5.1, traverse the set E and find t Distance less than L 1r The nodes of k ;

[0052] F5.2, perform the following steps in sequence:

[0053] F5.2.1, check a i Whether it is related to F k The spreading code of a node in is the same:

[0054] If a i With F k The spreading codes of any node in are different, then:

[0055] A i Select e t The spreading code is

[0056] If u<i, update the value of u and set u=i;

[0057] Let t=t+1, and determine t≤N EIs it true? If so, jump to step F5.1; if not, end the entire spreading code allocation process;

[0058] If a i With G k If the spreading code of a node in the same, set i=i+1 and jump to step F5.2.1 to continue execution.

[0059] Compared with the prior art, the present invention has the following beneficial effects:

[0060] The present invention discloses a detonation information notification and feedback method suitable for wireless node detectors. The present invention hierarchizes and groups all nodes through a three-layer network architecture, and respectively sets and activates a time slot and a sleep state for each node in each time frame period. Before the seismograph commands a source to excite seismic waves, it first notifies each node through a wireless self-organizing network after activating communication. After receiving the notification, each node reports confirmation information to the seismograph and is in a sleep state during idle time, which greatly reduces the energy consumption of the node and the storage of invalid data, and effectively improves the efficiency of seismic exploration. BRIEF DESCRIPTION OF THE DRAWINGS

[0061] In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for use in the embodiments will be briefly introduced below. It should be understood that the following drawings only show certain embodiments of the present invention and therefore should not be regarded as limiting the scope. For ordinary technicians in this field, other related drawings can be obtained based on these drawings without paying creative work.

[0062] Figure 1 It is a schematic diagram of the time frame time slot distribution of the present invention.

[0063] Figure 2 This is an example diagram of the wireless node detector layout, network node division and routing setting of the present invention. DETAILED DESCRIPTION

[0064] In order to make the purpose, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0065] Therefore, the following detailed description of the embodiments of the present invention provided in the accompanying drawings is not intended to limit the scope of the invention claimed for protection, but merely represents selected embodiments of the present invention. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0066] The present invention provides a detonation information notification and feedback method applicable to a wireless node detector. The scenario setting of this patent is as follows.

[0067] In seismic exploration, in order to manage all wireless node detectors and effectively exchange information, each node is equipped with a communication module so that they can communicate effectively with each other within a certain distance. This patent sets the node network to adopt a three-layer architecture, and all nodes are divided into ordinary nodes, aggregation nodes and routing nodes, and their transmission powers are P and P respectively. 1 , P 2 and P 3 , and the corresponding one-hop communication distances are L 1r , L 2r and L 3r During network operation, the information exchange routes between all nodes and seismographs are set in advance and fixed. When communication is needed, ordinary nodes use a smaller power P 1 The sink node exchanges information with a specific sink node, which uses a larger power P 2 The routing node exchanges information with the bound node, and the routing node uses the maximum power P 3 The next-hop routing node that is closer to the seismometer interacts with it.

[0068] In this patent, before the seismograph instructs the source to excite seismic waves, it first notifies each node through the wireless self-organizing network, and each node reports confirmation information to the seismograph after receiving the notification. This patent describes in detail the method and process of sending detonation information and reporting confirmation information. The details are as follows.

[0069] The following steps are involved:

[0070] S1, through the three-layer network architecture, all the deployed nodes are layered and grouped, all the nodes are divided into common nodes, aggregation nodes, and routing nodes, and the information interaction routes between all nodes and seismographs are set;

[0071] S2, a spreading code is assigned to each node, and the spreading codes assigned to nodes within one-hop communication distance are different;

[0072] S3, for any node i, the number of hops from the node to the seismograph is h i , The channel resources are divided into continuous time frames, each frame contains N time slots, and the time slots between nodes are all aligned. An activation time slot is set for each node in each time frame cycle, and the transceiver is turned off and enters a dormant state in other time slots;

[0073] S4, before each node sends information in a given time slot, it first spreads the information using the assigned spreading code;

[0074] S5, after the detonation information is generated, the seismometer immediately activates the next time slot n 0 Send information, h i = 1 and h i =1 in n 0 The time slot monitoring channel receives the detonation information and remains active in the following time slots until it receives the h i = 1 and h i = 1 until the detonation notification success message or detonation notification failure message is sent by the routing node;

[0075] S6,h i = k common nodes in n 0 +k-1 time slot monitoring channel, if the detonation information is received, then 0 +k time slot sends the reception confirmation information to the bound aggregation node, and performs the seismic wave reception status in the NN time slot;

[0076] S7,h i = k sink nodes in n 0 +k-1 time slot monitoring channel, if the detonation information is received, then 0 +k time slot forwards this information, and 0 +k+1 time slot to monitor the channel again, expecting to receive the reception confirmation information of the ordinary node bound to it. If 0 +k+1 time slot receives the reception confirmation information of all ordinary nodes bound to it, then in n 0 +k+2 time slot sends a detonation notification success message to its bound routing node, and performs seismic wave receiving status in NN time slot. If 0 +k+1 time slot does not receive the reception confirmation information of a common node bound to it, then in n 0 +k+2 time slot sends detonation notification failure information to its bound routing node;

[0077] S8,h i =k routing node in n 0 +k-1 time slot monitoring channel:

[0078] If the detonation information is received, then 0 +k time slot forwards this information;

[0079] In n 0 +k+1 time slots monitor the channel again, expecting to receive: ① the detonation notification success information sent by all ordinary nodes bound to it as sink nodes; ② the detonation notification information forwarded by all sink nodes bound to it as routing nodes and routing nodes bound to it as routing nodes to reach the seismograph; if the information of a certain node is not received, the detonation notification failure information is generated and sent to the routing node bound to it to reach the seismograph; if all are received, continue to monitor the channel in the next time slot;

[0080] In n 0 +k+2 time slots continue to monitor the channel, expecting to receive the detonation notification success information sent by all the aggregation nodes bound to it as routing nodes; if it is not successfully received, it generates a detonation notification failure message and sends it to the routing node bound to it to reach the seismograph; if the reception is successful and there is no routing node bound to it as the next hop routing node to reach the seismograph, it generates a detonation notification success message and sends it in n 0 +k+3 is sent to the next-hop routing node bound to it to reach the seismograph; if the reception is successful and there is a routing node bound to it as the next-hop routing node to reach the seismograph, it will monitor the channel in the following time slots:

[0081] a. If a detonation failure notification message is received from a routing node in a certain time slot, it is forwarded to the next-hop routing node bound to the seismograph in the next time slot;

[0082] b. If the detonation notification success information sent by all the routing nodes bound to it as the next-hop routing node to reach the seismograph has been received in a certain time slot thereafter, the detonation notification success information is generated and forwarded to the next-hop routing node bound to it to reach the seismograph in the next time slot, and the seismic wave receiving state is performed in the NN time slot.

[0083] In this patent, each node is configured with a spreading code, and the information is spread by the spreading code before being sent, and then transmitted through the omnidirectional antenna. There are mature methods for generating orthogonal spreading codes, which will not be repeated in this patent. The method for each node to obtain the spreading code includes the following steps:

[0084] F1, spreading code sequence set A, let the spreading code sequence in A be a n ,n=0,...,N A -1, N A is the number of spreading code sequences in A, excluding all-zero sequences;

[0085] F2, change a 0 Assigned to the seismograph, denoted as sc 0 ; Let the node element in the routing node set B be bm ,m=1,...,N B , N B is the number of elements in B, denoted by b m The spreading code is And initialized to a sequence of all zeros; let the node element in the aggregation node set D be d m ,m=1,...,N D , N D is the number of elements in D, denoted by d m The spreading code is And initialized to a sequence of all zeros; let the node element in the ordinary node set E be e m ,m=1,...,N E , N E is the number of elements in E, denoted by e m The spreading code is And initialized to an all-zero sequence; let u = 1, the value of u is used to record the number of spreading codes currently allocated;

[0086] F3, let j = 1, i = 1, and perform the following steps:

[0087] F3.1, traverse set B and find j Distance less than L 3r Nodes, denoted by C j ;

[0088] F3.2, perform the following steps in sequence:

[0089] F3.2.1, Check a i Whether it is related to C j The spreading code of a node in is the same:

[0090] If a i With C j The spreading codes of any node in are different, then:

[0091] A i Select b j The spreading code is

[0092] If u<i, update the value of u and set u=i;

[0093] Let j = j + 1, and determine j ≤ N B Is it true? If so, jump to step F3.1; if not, jump to step F4;

[0094] If a i With C j If the spreading code of a node in is the same, set i=i+1 and jump to step F3.2.1 to continue execution;

[0095] F4, let k = 1, i = u + 1, and perform the following steps:

[0096] F4.1, traverse the set D and find k Distance less than L 2r The nodes of k ;

[0097] F4.2, perform the following steps in sequence:

[0098] F4.2.1, check a i Whether with G k The spreading code of a node in is the same:

[0099] If a i With G k The spreading codes of any node in are different, then:

[0100] A i Select d k The spreading code is

[0101] If u<i, update the value of u and set u=i;

[0102] Let k = k + 1, and determine k ≤ N D Is it true? If so, jump to step F4.1; if not, jump to step F5;

[0103] If a i With G k If the spreading code of a node in is the same, set i=i+1 and jump to step F4.2.1 to continue execution;

[0104] F5, let t = 1, i = u + 1, and perform the following steps:

[0105] F5.1, traverse the set E and find t Distance less than L 1r The nodes of k ;

[0106] F5.2, perform the following steps in sequence:

[0107] F5.2.1, check a i Whether it is related to F k The spreading code of a node in is the same:

[0108] If a i With F k The spreading codes of any node in are different, then:

[0109] Ai Select e t The spreading code is

[0110] If u<i, update the value of u and set u=i;

[0111] Let t=t+1, and determine t≤N E Is it true? If so, jump to step F5.1; if not, end the entire spreading code allocation process;

[0112] If a i With G k If the spreading code of a node in the same, set i=i+1 and jump to step F5.2.1 to continue execution.

[0113] After the above process, each node is assigned a spreading code, and the spreading codes assigned to nodes within a one-hop communication distance are all different.

[0114] Furthermore, the setting of activation and dormancy time slots: In the three-layer network architecture, the routing between each node and the seismograph is fixed. For any node i, the number of hops to reach the seismograph is h i , For example, the number of hops of a routing node that is reachable with a seismograph in one hop is 1, and the number of hops of a routing node or a sink node that can communicate with the seismograph through forwarding of a one-hop routing node is 2.

[0115] In this patent, the channel resources are divided into continuous time frames, each of which contains N time slots. Since each node is equipped with a GPS or Beidou module, the nodes are synchronized and all time slots are aligned.

[0116] In order to save energy, each node is activated only in a few time slots in each time frame cycle, and turns off the transceiver in most other time slots and enters a dormant state. Let each node activate one time slot every r time slots. The activation time slot setting of each node includes the following steps:

[0117] T1, after the seismograph receives the detonation command, the time slot in each time frame where the detonation information can be sent is:

[0118]

[0119] For example, each time frame contains 100 time slots, and the seismometer is activated every 10 time slots, that is, the seismometer is activated in the 1st, 11th, ..., 81st, and 91st time slots, and the transceiver of the node is turned off at other times and enters a communication dormant state.

[0120] T2, order It means rounding down, and the number of hops to the seismograph is h i The time slots that the nodes monitor the channel in each time frame are:

[0121]

[0122] For example, a node with a hop count of 3 is activated in the 3rd, 13th, ..., 83rd, and 93th time slots, and turns off the node's transceiver at other times and enters a communication dormant state; a node with a hop count of 12 is activated in the 2nd, 12th, ..., 82nd, and 92th time slots, and turns off the node's transceiver at other times and enters a communication dormant state.

[0123] T3, except for the seismograph, once other nodes detect the detonation notification information in the monitoring time slot, they stop sleeping in the next time slot. Figure 1 , a schematic diagram of the time frame slot is given.

[0124] Furthermore, the process of sending detonation information and confirming information feedback: In this patent, before each node sends information in a given time slot, it first spreads the information with the assigned spread spectrum code. In this way, even if multiple nodes send information in the same time slot, each receiving node can correctly receive the information of the corresponding node according to the node spread spectrum code information sent by the system to avoid interference.

[0125] The process of sending detonation information and confirming information feedback is as follows.

[0126] 1. After the detonation information is generated, the seismometer immediately activates the next activation time slot n. 0 Send information; i = 1 and h i =1 in n 0 The time slot monitoring channel receives the detonation information; in the following process, all nodes that send the detonation notification success information are in NN = 2*H max +4 time slot enters seismic wave receiving state.

[0127] 2. In n 0 +k time slot (k=1,...,2*H max +3), different nodes have different actions, the classification description is as follows:

[0128] ah i = k+1 nodes

[0129] In the time slot monitoring channel, the common node (k≥2) determines whether the sink node it is bound to is sending the detonation information, the sink node determines whether the routing node it is bound to is sending the detonation information, and the routing node determines whether the next hop routing node to the seismograph is sending the detonation information;

[0130] bhi = k ordinary nodes (k ≥ 3 is required, otherwise this step will not be executed)

[0131] Sending a reception confirmation message to the aggregation node bound to it in the time slot;

[0132] ch i = k sink nodes (k ≥ 2 is required, otherwise this step will not be executed)

[0133] In this time slot, it forwards the data in n to the ordinary node bound to it. 0 + Detonation information received in the k-1 time slot;

[0134] ch i =k routing nodes

[0135] In this time slot, the data is forwarded to the common node bound to it as the sink node and the routing node bound to it as the next hop routing node to reach the seismograph. 0 + Detonation information received in the k-1 time slot;

[0136] dh i = k-1 sink nodes (k ≥ 3 is required, otherwise this step will not be executed)

[0137] If in n 0 If the node receives the reception confirmation information sent by all the ordinary nodes bound to it as the aggregation node within the +k-1 time slot, it will send the detonation notification success information to the routing node bound to it in this time slot to confirm that all the nodes in its aggregation group have received the detonation information; if the information of any node is not received, it is considered that the forwarding has failed, and the node number that has not received its information will be recorded, and the detonation notification failure information will be sent to the bound routing node in the next time slot;

[0138] eh i =k-1 routing nodes (k≥2 is required, otherwise this step will not be executed)

[0139] In n 0 +h of the forwarding explosion information within k-1 time slot i = k-1 routing nodes monitor the channel in this time slot if:

[0140] 1) Bind the detonation information forwarded by all routing nodes (if any) that are the next-hop routing nodes to the seismograph in this time slot;

[0141] 2) Bind the detonation information forwarded by all the aggregation nodes that are routing nodes in this time slot;

[0142] 3) The confirmation information sent by the common node bound as the sink node in this time slot;

[0143] If the information of any node in 1)-3) is not received, it is considered that the forwarding has failed, and the node number whose information has not been received is placed in the generated forwarding failure information, and immediately forwarded to the seismograph according to the set route in the next time slot.

[0144] If all 1)-3) are received, it is considered that the detonation information forwarding is successful, and it continues to listen in the next time slot for the detonation notification success information sent by all routing nodes bound to it as the next hop routing node to reach the seismograph, or the detonation notification success information sent by all aggregation nodes bound to it as routing nodes in this time slot.

[0145] fh i =k-2 routing nodes (k≥3 is required, otherwise this step will not be executed)

[0146] In n 0 +h of the forwarding explosion information within k-2 time slots i = k-2 routing nodes monitor the channel in this time slot if:

[0147] 1) Upon receiving the detonation notification failure information sent by the aggregation node bound to it as a routing node or failing to receive its valid information, the detonation notification failure information is sent to the seismograph according to the set fixed route;

[0148] 2) If: ① all the aggregation nodes bound to it as routing nodes have received the detonation notification success information sent; ② there is no routing node bound to it as the next hop routing node to reach the seismograph, then the detonation notification success information is generated and reported to the next hop routing node bound to it to reach the seismograph. If condition ② is not met, continue to monitor the information in the next time slot.

[0149] g. Seismograph and h. i <k-2 routing nodes (k≥4 is required, otherwise this step will not be executed)

[0150] h i The routing node < k-2 monitors the channel. If it has received the detonation notification success information sent by all the routing nodes bound to it as the next hop routing node to reach the seismograph, it is considered that the detonation information is forwarded successfully, and a detonation notification success information is generated and sent to the next hop routing node bound to it to reach the seismograph in the next time slot.

[0151] If the seismograph receives the detonation notification success information sent by all one-hop routing nodes and the aggregation node bound to it as a one-hop destination, it is considered that the detonation information has been notified to all nodes.

[0152] If the seismograph receives a failure notification message, it records the node number in the forwarding failure message and sends the detonation message again. If the seismograph receives a failure notification message for the second time, it prompts the exploration technician, who checks the node number recorded in the failure message and sends the detonation message again after the check is completed.

[0153] Further, as a specific implementation method, refer to Figure 2 , the wireless node detector follows Figure 2 , and are arranged according to the structure of the grid points. The wireless node detector is equipped with a communication module, and the nodes form a wireless self-organizing network, which can report node abnormal information to the seismograph. In order to facilitate the explanation of the algorithm execution process, Figure 2 Each node in is numbered, and the first and second numbers in the number represent the row and column numbers of the node. For example, the number (2,2) represents the node in the second row and second column. Figure 2 As shown in , all common nodes are divided into 4 aggregation groups, which are the 1st, 2nd, 3rd, and 4th groups from left to right. The node at the center of the group is the aggregation node of the group, and the aggregation nodes (2,5) and (2,11) of the 2nd and 4th groups are selected as routing nodes.

[0154] The process of sending detonation information and confirming information feedback is as follows.

[0155] (1) After receiving the detonation command, the seismograph sends a detonation notification message to the one-hop routing node (2, 11) in time slot 1.

[0156] (2) Routing node (2,11) forwards the explosion notification information to the common nodes in the fourth group bound to it as a sink node, the sink node (2,8) bound to it as a routing node, and the routing node (2,5) bound to it as a one-hop routing node in time slot 2.

[0157] (3) In time slot 3, the common nodes in the fourth group send a receipt confirmation message to the routing node (2,11); the aggregation node (2,8) forwards the detonation notification message to the common nodes in the third group; the routing node (2,5) sends the detonation notification message to the common nodes in the second group and the aggregation node (2,2) bound to it as a routing node;

[0158] (4) In time slot 4, the common nodes in the third group send a reception confirmation message to the sink node (2,8), the common nodes in the second group send a reception confirmation message to the routing node (2,5), and the sink node (2,2) forwards the explosion notification message to the common nodes in the first group;

[0159] (5) In the fifth time slot, the common nodes in the first group send a reception confirmation message to the sink node (2,2); the sink node (2,8) sends a detonation success notification message to the routing node (2,11);

[0160] (6) In the sixth time slot, the sink node (2,2) sends a detonation success notification message to the routing node (2,5);

[0161] (7) In the seventh time slot, routing node (2,5) sends a detonation success notification message to routing node (2,11);

[0162] (8) In the 8th time slot, the routing node (2,11) sends a detonation success notification message to the seismograph;

[0163] (9) After receiving the confirmation information, the seismograph initiates the seismic wave detonation in the 12th time slot, and all nodes collect seismic wave data.

[0164] Furthermore, each node is layered and grouped and routed through a three-layer network architecture: In this patent, a method for dividing nodes and setting fixed routes in a three-layer network is proposed. This method requires technicians to know the location coordinates of all nodes, which is easy to meet in seismic exploration.

[0165] 1. Let the set of all nodes be M, the coordinates of node i∈M be (ih,iv), and the coordinates of the seismograph be (Dh,Dv). 1 The square whose side length is (0,0) is recorded.

[0166] Pick

[0167]

[0168] Then all squares consisting of the squares (m,n) m=h_left,...,h_right,n=v_below,...,v_up can cover all nodes.

[0169] The nodes falling in each square form a convergence group (the nodes falling on the edge of the square belong to any of the two squares to which the cash belongs), and the node closest to the center of the square is selected as the convergence node, denoted as node j (m,n) , and other nodes are ordinary nodes bound to it. In this way, all nodes are classified as sink nodes or ordinary nodes.

[0170] 2 orders Select the sink node

[0171] j (k ,l), As a routing node. For any routing node j (k,l) , :

[0172] a. If l≠0, let Bind its next hop routing node to (Here abs means taking the absolute value of a real number);

[0173] b. If l = 0, let Bind its next hop routing node to

[0174] In this way, each routing node sets the route to the seismograph.

[0175] 3. For other aggregation nodes set as other than routing nodes, find the next-hop routing node bound to the nearest routing node.

[0176] In this way, the common node communicates with its bound aggregation node, the aggregation node communicates with its bound routing node, the routing node communicates with its bound next-hop routing node, and the routing node closest to the seismograph communicates with the seismograph.

[0177] The embodiments described above are only descriptions of the preferred embodiments of the present invention and are not intended to limit the scope of the present invention. Without departing from the design spirit of the present invention, various modifications and improvements made to the technical solutions of the present invention by ordinary technicians in this field should all fall within the protection scope determined by the claims of the present invention.

Claims

1. A detonation information notification and feedback method applicable to a wireless node detector, characterized in that: The following steps are involved: S1, through the three-layer network architecture, all the deployed nodes are layered and grouped, all the nodes are divided into common nodes, aggregation nodes, and routing nodes, and the information interaction routes between all nodes and seismographs are set; S2, a spreading code is assigned to each node, and the spreading codes assigned to nodes within one-hop communication distance are different; S3, for any node i, the number of hops from the node to the seismograph is h i , The channel resources are divided into continuous time frames, each frame contains N time slots, and the time slots between nodes are all aligned. An activation time slot is set for each node in each time frame cycle, and the transceiver is turned off and enters a dormant state in other time slots; S4, before each node sends information in a given time slot, it first spreads the information using the assigned spreading code; S5, after the detonation information is generated, the seismograph immediately sends the information in the next activation time slot n0, h i = 1 and h i = 1 monitors the channel in time slot n0, receives the detonation information, and remains active in the following time slots until it receives h i = 1 and h i = 1 until the detonation notification success message or detonation notification failure message is sent by the routing node; S6,h i = k ordinary nodes monitor the channel in the n0+k-1 time slot. If the detonation information is received, it sends the reception confirmation information to the bound aggregation node in the n0+k time slot and performs the seismic wave receiving state in the NN time slot; S7,h i = k, the sink node monitors the channel in the n0+k-1 time slot. If the detonation information is received, it forwards the information in the n0+k time slot, and monitors the channel again in the n0+k+1 time slot, hoping to receive the reception confirmation information of the ordinary nodes bound to it. If the reception confirmation information of all ordinary nodes bound to it is received in the n0+k+1 time slot, it sends the detonation notification success information to the routing node bound to it in the n0+k+2 time slot, and performs the seismic wave receiving state in the NN time slot. If the reception confirmation information of a certain ordinary node bound to it is not received in the n0+k+1 time slot, it sends the detonation notification failure information to the routing node bound to it in the n0+k+2 time slot; S8,h i =k routing node monitors the channel in time slot n0+k-1: If detonation information is received, it is forwarded in the n0+k time slot; In the n0+k+1 time slot, the channel is monitored again, and it is expected to receive: ① the detonation notification success information sent by all ordinary nodes bound as aggregation nodes; ② the detonation notification information forwarded by all aggregation nodes bound as routing nodes and routing nodes bound as routing nodes that reach the seismograph; if the information of a certain node is not received, the detonation notification failure information is generated and sent to the routing node bound to the seismograph; If all are received, continue to monitor the channel in the next time slot; Continue to monitor the channel in the n0+k+2 time slot, expecting to receive the detonation success notification information sent by all the aggregation nodes bound to it as routing nodes; If the message is not received successfully, a detonation notification failure message is generated and sent to the routing node bound to the seismograph; If the reception is successful and there is no routing node bound to it as the next hop routing node to reach the seismograph, a detonation notification success message is generated and sent to the next hop routing node bound to it to reach the seismograph at n0+k+3; if the reception is successful and there is a routing node bound to it as the next hop routing node to reach the seismograph, the channel is monitored in the following time slots: a. If a detonation failure notification message is received from a routing node in a certain time slot, it is forwarded to the next-hop routing node bound to the seismograph in the next time slot; b. If the detonation notification success information sent by all the routing nodes bound to it as the next-hop routing node to reach the seismograph has been received in a certain time slot thereafter, the detonation notification success information is generated and forwarded to the next-hop routing node bound to it to reach the seismograph in the next time slot, and the seismic wave receiving state is performed in the NN time slot.

2. According to claim 1, a detonation information notification and feedback method applicable to a wireless node detector is characterized in that: Activation time slot setting for each node The following steps are involved: T1, after the seismograph receives the detonation command, the time slot in each time frame where the detonation information can be sent is: T2, order It means rounding down, and the number of hops to the seismograph is h i The time slots that the nodes monitor the channel in each time frame are: T3, except for the seismograph, once other nodes detect the detonation notification information in the monitoring time slot, they stop sleeping in the next time slot.

3. According to claim 1, a detonation information notification and feedback method applicable to a wireless node detector is characterized in that: The transmission power of the common node is P1, and the corresponding one-hop communication distance is L 1r , the transmission power of the aggregation node is P2, and the corresponding one-hop communication distance is L 2r , the transmission power of the routing node is P3, and the corresponding one-hop communication distance is L 3r .

4. A detonation information notification and feedback method applicable to a wireless node detector according to claim 3, characterized in that: Each node is equipped with a communication module and can communicate effectively with each other within a certain distance. The transmission power of the ordinary node is less than the transmission power of the aggregation node, and the transmission power of the aggregation node is less than the transmission power of the routing node. The ordinary node interacts with a specific aggregation node at power P1, the aggregation node interacts with the routing node bound to it at power P2, and the routing node interacts with the next-hop routing node bound to it and closer to the seismograph at power P3.

Images