CN112566213B - Automatic relay method of low-power-consumption wireless irrigation control system - Google Patents
Automatic relay method of low-power-consumption wireless irrigation control system Download PDFInfo
- Publication number
- CN112566213B CN112566213B CN202110197208.7A CN202110197208A CN112566213B CN 112566213 B CN112566213 B CN 112566213B CN 202110197208 A CN202110197208 A CN 202110197208A CN 112566213 B CN112566213 B CN 112566213B
- Authority
- CN
- China
- Prior art keywords
- data packet
- control node
- node
- data
- list
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 59
- 230000002262 irrigation Effects 0.000 title claims abstract description 21
- 238000003973 irrigation Methods 0.000 title claims abstract description 21
- 238000012546 transfer Methods 0.000 claims abstract description 60
- 238000004891 communication Methods 0.000 claims description 28
- 230000003993 interaction Effects 0.000 claims description 16
- 230000005540 biological transmission Effects 0.000 claims description 11
- 238000005516 engineering process Methods 0.000 description 4
- 238000012795 verification Methods 0.000 description 4
- 238000010586 diagram Methods 0.000 description 3
- 238000006467 substitution reaction Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005265 energy consumption Methods 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 238000009434 installation Methods 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W40/00—Communication routing or communication path finding
- H04W40/02—Communication route or path selection, e.g. power-based or shortest path routing
- H04W40/22—Communication route or path selection, e.g. power-based or shortest path routing using selective relaying for reaching a BTS [Base Transceiver Station] or an access point
-
- G—PHYSICS
- G08—SIGNALLING
- G08C—TRANSMISSION SYSTEMS FOR MEASURED VALUES, CONTROL OR SIMILAR SIGNALS
- G08C17/00—Arrangements for transmitting signals characterised by the use of a wireless electrical link
- G08C17/02—Arrangements for transmitting signals characterised by the use of a wireless electrical link using a radio link
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W52/00—Power management, e.g. Transmission Power Control [TPC] or power classes
- H04W52/02—Power saving arrangements
- H04W52/0209—Power saving arrangements in terminal devices
- H04W52/0225—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal
- H04W52/0229—Power saving arrangements in terminal devices using monitoring of external events, e.g. the presence of a signal where the received signal is a wanted signal
-
- G—PHYSICS
- G08—SIGNALLING
- G08C—TRANSMISSION SYSTEMS FOR MEASURED VALUES, CONTROL OR SIMILAR SIGNALS
- G08C2201/00—Transmission systems of control signals via wireless link
- G08C2201/10—Power supply of remote control devices
- G08C2201/12—Power saving techniques of remote control or controlled devices
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D30/00—Reducing energy consumption in communication networks
- Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Mobile Radio Communication Systems (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides an automatic relay method of a low-power-consumption wireless irrigation control system, which is used for increasing wireless coverage capacity and diffraction capacity.A gateway sends query data packets to each control node in sequence through an acquired ID list containing all control nodes and detects whether a data packet returned by the control node is received in a set time period; if a data packet returned by the control node is received, a path list is newly established according to the corresponding node ID; if the data packet returned by the control node is not received, establishing a pending list according to the corresponding node ID; then analyzing whether the number of the nodes in the newly established pending list is zero or not; if the number of the nodes in the newly-built pending list is zero, ending the path establishing process; and if the number of the nodes in the newly-built pending list is not zero, continuing to utilize the control nodes in the newly-built path list to sequentially send transfer query data packets to each control node in the newly-built pending list, and circulating until the number of the nodes in the newly-built pending list is zero.
Description
Technical Field
The invention relates to the technical field of wireless irrigation, in particular to an automatic relay method of a low-power-consumption wireless irrigation control system.
Background
In field irrigation, particularly in irrigation in mountainous and hilly areas, wireless communication technology and low-power-consumption control technology are generally used in order to control irrigation equipment more conveniently while reducing cost. The existing scheme is a technical scheme of solar energy, battery and wireless communication. However, wireless communication capabilities are limited due to limited wireless coverage and diffraction capabilities. In order to increase the range of wireless communication, there are two methods commonly used at present: 1. adding communication transfer between the initiating communication point and the target communication area; 2. and increasing the transmission power of the wireless module. However, the former adds more cost; the latter not only increases energy consumption, but also can not solve the problem of mountain body shielding. It is desirable to provide a solution that increases radio coverage and diffraction capabilities while reducing costs.
Disclosure of Invention
The invention aims to provide an automatic relay method of a low-power-consumption wireless irrigation control system, which is used for realizing the technical effect of reducing the cost while increasing the wireless coverage capability and the diffraction capability.
The invention provides an automatic relay method of a low-power-consumption wireless irrigation control system, which comprises the following steps:
s1, a gateway acquires an ID list containing all control nodes;
s2, sequentially sending query data packets to each control node according to the ID list;
s3, detecting whether a data packet returned by the control node is received within a set time period;
s4, if a data packet returned by the control node is received, a path list is newly established according to the corresponding node ID; if the data packet returned by the control node is not received, establishing a pending list according to the corresponding node ID;
s5, analyzing whether the number of the nodes in the newly-built pending list is zero or not; if the number of the nodes in the newly-built pending list is not zero, continuing to execute S6; if the number of the nodes in the newly-built pending list is zero, ending the path establishing process;
s6, sequentially sending a transfer query data packet to each control node in the newly-built pending list by using the control nodes in the newly-built path list, and repeatedly executing S3-S5;
the method also comprises a control node data interaction process:
the control node regularly monitors whether the wake-up code is received;
if the wake-up code is received, starting to receive a data packet and analyzing the format of the data packet, and analyzing whether the data packet is directly executed data or transit data;
if the data packet is directly executed data, executing corresponding operation according to a command field in the data packet, then creating a return data packet according to a set frame format of the data packet, and switching to a low-power-consumption receiving mode after the return data packet is sent;
if the data packet is transfer data, analyzing whether the control node transfers the data packet by itself according to the data packet, and simultaneously analyzing whether the control node is a last-stage transfer node;
if the control node performs transfer, the control node is not the last-stage transfer node; updating the transfer progress of the data packet, re-checking the data packet, sending the data packet in a low-power-consumption sending mode, switching to a transparent transmission mode after the data packet is sent, and waiting for receiving data according to a set receiving window period.
Further, the S5 further includes: analyzing whether the number of the nodes in the newly-built path list is zero or not; if the number of the nodes in the newly-built pending list is not zero and the number in the newly-built path list is not zero, continuing to execute S6; and if the number of the nodes in the newly-built pending list is not zero and the number in the newly-built path list is zero, ending the path creation process.
Further, the data in the newly-built path list at least includes time for successfully receiving and transmitting the data, communication signal strength, node power and successful communication times.
Further, the method further comprises: s7, analyzing whether a plurality of relay paths exist in the target control node in each newly-built path list after the path creation process is finished; and if the target control node in the newly-built path list has a plurality of relay paths, analyzing the optimal path according to the electric quantity of the node, the time for successfully receiving and transmitting the data and the communication signal strength.
Further, the method further comprises a gateway data interaction process: the gateway acquires a control instruction to be transmitted to a target control node; and analyzing whether each established path list contains the node ID of the target control node, if the path list contains the node ID of the target control node, constructing a relay path according to the path list, and creating and sending a data packet according to the frame format of the set data packet.
Further, the gateway data interaction process further includes: the gateway starts to receive data according to a set receiving time window and detects whether a data packet returned by a target control node is received in the receiving time window; if a data packet returned by a target control node is received in the receiving time window, analyzing sensing data and valve state data in the data packet, and updating the path list; and if the data packet returned by the target control node is not received in the receiving time window, updating the corresponding communication success times in the path list and retransmitting the control instruction.
Further, the gateway data interaction process further includes: and if the control instruction is retransmitted by the gateway for more than the preset times, reselecting the relay path according to the path list.
Further, the control node data interaction process further includes: and if the control node performs transfer by itself and the control node is the last-stage transfer node, updating the command field and the transfer progress of the data packet, re-checking the data packet, sending the data packet in a low-power-consumption sending mode, switching to a transparent transmission mode after the data packet is sent, and waiting for receiving data according to a set receiving window period.
Further, the control node data interaction process further includes: after receiving the transferred data packet, the target control node analyzes whether to execute the data packet according to a command field in the data packet; if the command field is executed, the corresponding operation is executed according to the command field, then a data packet is constructed according to the frame format of the set data packet, the data packet is sent in a transparent transmission mode, and the data packet is switched to a low-power-consumption sending mode after the sending is finished; after receiving a data packet returned by a target control node, a control node serving as a relay analyzes whether the data packet is transferred by the control node; and if the data packet is transferred, updating the transfer progress of the data packet, and sending the data packet to a control node of the next-stage transfer in a transparent transfer mode after the data packet is re-checked.
The beneficial effects that the invention can realize are as follows: according to the wireless irrigation system, each control node in the wireless irrigation system is used as a transfer node, no additional communication transfer node is needed, each control node can be used as a transfer node to forward data to a farther control node while controlling equipment in charge of the control node, and the cost is reduced while the wireless coverage capacity and the diffraction capacity are increased.
Drawings
In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings needed to be used in the embodiments of the present invention will be briefly described below, it should be understood that the following drawings only illustrate some embodiments of the present invention and therefore should not be considered as limiting the scope, and for those skilled in the art, other related drawings can be obtained according to the drawings without inventive efforts.
Fig. 1 is a schematic flow chart of an automatic relay method of a low power consumption wireless irrigation control system according to an embodiment of the present invention;
fig. 2 is a schematic diagram of a gateway data interaction flow provided in an embodiment of the present invention;
fig. 3 is a schematic diagram of a data interaction flow of a control node according to an embodiment of the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention.
It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures. Meanwhile, in the description of the present invention, the terms "first", "second", and the like are used only for distinguishing the description, and are not to be construed as indicating or implying relative importance.
Referring to fig. 1, fig. 1 is a schematic flow chart illustrating an automatic relaying method of a low power consumption wireless irrigation control system according to an embodiment of the present invention.
The applicant researches and discovers that equipment control in a wired communication mode is not adopted in field irrigation, particularly in irrigation of mountainous and hilly lands, and is limited by factors such as wiring rules, construction cost, material cost and safety. The problem is solved to a certain extent by introducing a wireless communication technology and a low-power consumption control technology; among them, "solar energy + battery + wireless communication" is a relatively advanced scheme at present. The wireless low-power-consumption irrigation control has the characteristics of no dependence on electric facilities, simple installation and quick deployment, but has limited wireless coverage and diffraction capacity, and the wireless communication capacity is limited due to the shielding formed by mountains and tall buildings. Embodiments of the present invention provide an automatic relay method for a low power consumption wireless irrigation control system to increase wireless coverage and diffraction capabilities while reducing costs, and are described in detail below.
S1, the gateway acquires an ID list containing all control nodes.
Specifically, after each control node in the wireless irrigation system is built, a user can configure an ID list according to the ID of each control node, and then send the ID list to the gateway through the wireless network.
And S2, sequentially sending query data packets to each control node according to the ID list.
Specifically, after receiving the ID list, the gateway may create an inquiry packet according to the ID of each node in the ID list, and send the inquiry packet in a polling manner.
And S3, detecting whether a data packet returned by the control node is received within a set time period.
Specifically, after the gateway sends the query packet to each node, it may be detected whether a packet returned by the control node is received within a set time period. In one embodiment, the set time period may be set according to the actual needs of the user.
S4, if a data packet returned by the control node is received, a path list is newly established according to the corresponding node ID; and if the data packet returned by the control node is not received, establishing a pending list according to the corresponding node ID.
In one embodiment, if the gateway receives a data packet returned by the control node within a set time period, the data packet can be analyzed, and a path list is established according to the acquired data; the data in the path list at least includes information such as time for successfully receiving and transmitting the data, communication signal strength, node electric quantity, successful communication times and the like. If the gateway does not receive the data packet returned by the control node within the set time period, a pending list can be created according to the corresponding node ID.
S5, analyzing whether the number of the nodes in the newly-built pending list is zero or not; if the number of the nodes in the newly-built pending list is not zero, continuing to execute S6; and if the number of the nodes in the newly-built pending list is zero, ending the path establishing process.
After the gateway polls all the control nodes in the ID list and constructs a path list and an undetermined list, whether the number of the nodes in the undetermined list is zero or not can be analyzed; if the number of nodes in the pending list is not zero, it indicates that there are control nodes that cannot build the path, and the path needs to be built continuously (i.e., the step of S6 is executed). If the number of the nodes in the pending list is zero, it indicates that the paths between all the control nodes and the gateway are completely constructed, and the path creation process can be ended.
S6, the control nodes in the newly-built path list are used for sequentially sending relay query data packets to each control node in the newly-built pending list, and S3-S5 are repeatedly executed.
By the above method, the transit paths are cyclically built, the control nodes in the newly built path list at the previous step each time sequentially send query data packets to the control nodes in the newly built pending list, and a deeper path list is further built until the number of the nodes in the newly built pending list is zero, so that a path list of the control nodes serving as the transit nodes in the path building process each time is obtained, and illustratively, the path list of each transit node can be built in the following manner:
list 1 (gateway-directly constructed path list):
{
{ target node ID1, timer, singer, dianliang, number },
{ target node ID2, timer, singer, dianliang, number },
...
{ target node IDN, timer, singer, dianliang, number }
}
List 2 (path list constructed by the first-level transit control node):
{
{ transit node ID1, target node ID1, timer, singer, dianliang, number },
{ transit node ID2, target node ID2, timer, singer, dianliang, number },
...
{ transit node IDN, destination node IDN, timer, singer, dianlian, number }
}
List 3 (path list constructed by secondary transit control nodes):
{
{ transit node ID1, transit node ID1A, destination node ID1, timer, singer, dianliang, number },
{ transit node ID2, transit node ID2A, destination node ID2, timer, singer, dianliang, number },
...
{ transit node IDN, transit node IDNA, destination node IDN, timer, singer, dianliang, number }
}
...
List N (path list constructed by N-level transit control nodes):
{
{ transit node ID1, transit node ID 1A., transit node ID1N, target node ID1, timer, singer, dianliang, number },
{ transit node ID2, transit node ID 2A., transit node ID2N, target node ID2, timer, singer, dianliang, number },
...
{ transit node IDN, transit node IDNA., transit node IDN, target node IDN,
timer，singer，dianliang，number}
}
in each path list, the Time represents the Time for successfully receiving and transmitting the data; singer represents the communication signal strength; dianliang represents the node power; number indicates the Number of successful communications.
In one embodiment, considering that there may be a situation that a path cannot be constructed due to an equipment failure in the process of constructing a path, it may be further analyzed whether the number of nodes in the newly-created path list is zero when the step of S5 is executed; if the number of the nodes in the newly-built pending list is not zero and the number in the newly-built path list is not zero, continuing to execute S6; and if the number of the nodes in the newly-built pending list is not zero and the number in the newly-built path list is zero, ending the path establishing process.
In one embodiment, data is forwarded by a control node to other control nodes while ensuring that the control nodes operate properly. The method further comprises the following steps: s7, analyzing whether a plurality of relay paths exist in the target control node in each newly-built path list after the path creation process is finished; and if a plurality of relay paths exist in the target control node in the newly-built path list, analyzing the optimal path according to the electric quantity of the node, the time for successfully receiving and transmitting the data and the communication signal strength. Specifically, the node electric quantity, the time for successful data transceiving and the communication signal strength of each level of the path as the control node for relay can be sorted from large to small, and one or more control nodes with the highest electric quantity are preferentially selected as the relay nodes; then, the optimal path is selected by combining the time for successfully receiving and transmitting the data and the strength of the communication signal.
Referring to fig. 2, fig. 2 is a schematic view of a gateway data interaction flow according to an embodiment of the present invention.
In an embodiment, after acquiring a control instruction to be transmitted to a target control node, a gateway may analyze whether each established path list includes a node ID of the target control node, and if the path list includes the node ID of the target control node, construct a relay path according to the path list, and create and transmit a data packet according to a frame format of the set data packet. Then, the gateway starts to receive data according to a set receiving time window and detects whether a data packet returned by the target control node is received in the receiving time window; if a data packet returned by the target control node is received in the receiving time window, analyzing sensing data and valve state data in the data packet, and updating a path list; and if the data packet returned by the target control node is not received in the receiving time window, updating the corresponding communication success times in the path list and retransmitting the control instruction.
It should be noted that the data packet returned by the target control node includes two formats:
1) the control node directly returns the frame format of the data packet, namely packet header + frame length + gateway ID + node ID + command 3+ switching state + node electric quantity + signal strength + sensing data + verification.
2) Frame format of the control node transfer return data packet: the method comprises the steps of header, frame length, gateway ID, node ID, command 4, electric quantity, signal strength, switch state, sensing data, transfer progress control byte, transfer node ID2 and transfer node ID1+ verification.
In one embodiment, if the gateway retransmits the control command more than a preset number of times (e.g., 3 times), the relay path is reselected according to the newly-built path list.
Referring to fig. 3, fig. 3 is a schematic diagram illustrating a data interaction flow of a control node according to an embodiment of the present invention.
In one embodiment, the control node periodically monitors whether a wake-up code is received; if the wake-up code is received, starting to receive the data packet and analyzing the format of the data packet, and analyzing whether the data packet is directly executed data or transferred data; and if the data packet is directly executed data, executing corresponding operation according to a command field in the data packet, then creating a return data packet according to a set frame format of the data packet, and switching to a low-power-consumption receiving mode after the return data packet is sent. If the data packet is transfer data, analyzing whether the data packet is transferred by the control node per se or not according to the data packet; and if the control node performs transfer, updating the transfer progress of the data packet, re-checking the data packet, sending the data packet in a low-power-consumption sending mode, switching to a transparent transmission mode after the data packet is sent, and waiting for receiving data according to a set receiving window period.
In the implementation process, the frame format of the data packet for directly executing data may be set as: packet header + frame length + gateway ID + target ID + command 1+ switch state + calibration; the frame format of the data packet of the relay data may be set as follows: the method comprises the steps of header, frame length, gateway ID, target ID, command 2, switch state, transfer progress control byte, transfer node ID1, and transfer node ID 2.
In one embodiment, the method further comprises: if the data packet is transfer data, analyzing whether the control node is the last-stage transfer node or not while analyzing whether the data packet is transferred by the control node; if the control node performs transfer and the control node is the last-stage transfer node, updating a command field and a transfer progress of the data packet, re-checking the data packet, sending the data packet in a low-power-consumption sending mode, switching to a transparent transmission mode after the data packet is sent, and waiting for receiving data according to a set receiving window period. The frame format of the data packet for updating the command field and the forwarding progress of the data packet may be: the method comprises the steps of header, frame length, gateway ID, target ID, command 1, switch state, transfer progress control byte, transfer node ID1, and transfer node ID 2.
In one embodiment, after receiving the relayed data packet, the target control node analyzes whether to execute the data packet according to a command field in the data packet; if the command field is executed, the corresponding operation is executed according to the command field, then a data packet is constructed according to a set data frame format, the data packet is sent in a transparent transmission mode, and the data packet is switched to a low-power-consumption sending mode after the sending is finished; after receiving a data packet returned by a target control node, a control node serving as a relay analyzes whether the data packet is transferred by the control node; if the data packet is transferred, updating the transfer progress of the data packet, and sending the data packet to the control node of the next transfer stage in a transparent transfer mode after rechecking the data packet. The data frame format in the data packet constructed by the target control node may be: the method comprises the steps of header, frame length, gateway ID, node ID, command 4, electric quantity, signal strength, switch state, sensing data, transfer progress control byte, transfer node ID2 and transfer node ID1+ verification. The format of the data packet after the transfer progress updated by the transfer node is as follows: the method comprises the steps of header, frame length, gateway ID, node ID, command 3, electric quantity, signal strength, switch state, sensing data, transfer progress control byte, transfer node ID2 and transfer node ID1+ verification.
In summary, an embodiment of the present invention provides an automatic relaying method for a low-power wireless irrigation control system, including: s1, a gateway acquires an ID list containing all control nodes; s2, sequentially sending query data packets to each control node according to the ID list; s3, detecting whether a data packet returned by the control node is received within a set time period; s4, if a data packet returned by the control node is received, a path list is newly established according to the corresponding node ID; if the data packet returned by the control node is not received, establishing a pending list according to the corresponding node ID; s5, analyzing whether the number of the nodes in the newly-built pending list is zero or not; if the number of the nodes in the newly-built pending list is not zero, continuing to execute S6; and if the number of the nodes in the newly-built pending list is zero, ending the path establishing process. S6, the control nodes in the newly-built path list are used for sequentially sending relay query data packets to each control node in the newly-built pending list, and S3-S5 are repeatedly executed. By the mode, the cost can be reduced while the wireless coverage capability and the diffraction capability are increased.
The above description is only for the specific embodiments of the present invention, but the scope of the present invention is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present invention, and all the changes or substitutions should be covered within the scope of the present invention. Therefore, the protection scope of the present invention shall be subject to the protection scope of the claims.
Claims (9)
1. An automatic relay method of a low-power wireless irrigation control system is characterized by comprising a path creation process:
s1, a gateway acquires an ID list containing all control nodes;
s2, sequentially sending query data packets to each control node according to the ID list;
s3, detecting whether a data packet returned by the control node is received within a set time period;
s4, if a data packet returned by the control node is received, a path list is newly established according to the corresponding node ID; if the data packet returned by the control node is not received, establishing a pending list according to the corresponding node ID;
s5, analyzing whether the number of the nodes in the newly-built pending list is zero or not; if the number of the nodes in the newly-built pending list is not zero, continuing to execute S6; if the number of the nodes in the newly-built pending list is zero, ending the path establishing process;
s6, sequentially sending a transfer query data packet to each control node in the newly-built pending list by using the control nodes in the newly-built path list, and repeatedly executing S3-S5;
the method also comprises a control node data interaction process:
the control node regularly monitors whether the wake-up code is received;
if the wake-up code is received, starting to receive a data packet and analyzing the format of the data packet, and analyzing whether the data packet is directly executed data or transit data;
if the data packet is directly executed data, executing corresponding operation according to a command field in the data packet, then creating a return data packet according to a set frame format of the data packet, and switching to a low-power-consumption receiving mode after the return data packet is sent;
if the data packet is transfer data, analyzing whether the control node transfers the data packet by itself according to the data packet, and simultaneously analyzing whether the control node is a last-stage transfer node;
if the control node performs transfer, the control node is not the last-stage transfer node; updating the transfer progress of the data packet, re-checking the data packet, sending the data packet in a low-power-consumption sending mode, switching to a transparent transmission mode after the data packet is sent, and waiting for receiving data according to a set receiving window period.
2. The method according to claim 1, wherein the S5 further comprises:
analyzing whether the number of the nodes in the newly-built path list is zero or not;
if the number of the nodes in the newly-built pending list is not zero and the number in the newly-built path list is not zero, continuing to execute S6; and if the number of the nodes in the newly-built pending list is not zero and the number in the newly-built path list is zero, ending the path creation process.
3. The method of claim 1, wherein the data in the newly created path list comprises at least time taken for successful data transmission and reception, communication signal strength, node power consumption, and number of successful communications.
4. The method of claim 3, further comprising:
s7, analyzing whether a plurality of relay paths exist in the target control node in each newly-built path list after the path creation process is finished; and if the target control node in the newly-built path list has a plurality of relay paths, analyzing the optimal path according to the electric quantity of the node, the time for successfully receiving and transmitting the data and the communication signal strength.
5. The method of claim 1, wherein the method further comprises a gateway data interaction process:
the gateway acquires a control instruction to be transmitted to a target control node;
and analyzing whether each established path list contains the node ID of the target control node, if the path list contains the node ID of the target control node, constructing a relay path according to the path list, and creating and sending a data packet according to the frame format of the set data packet.
6. The method of claim 5, wherein the gateway data interaction process further comprises:
the gateway starts to receive data according to a set receiving time window and detects whether a data packet returned by a target control node is received in the receiving time window;
if a data packet returned by a target control node is received in the receiving time window, analyzing sensing data and valve state data in the data packet, and updating the path list;
and if the data packet returned by the target control node is not received in the receiving time window, updating the corresponding communication success times in the path list and retransmitting the control instruction.
7. The method of claim 6, wherein the gateway data interaction process further comprises:
and if the control instruction is retransmitted by the gateway for more than the preset times, reselecting the relay path according to the path list.
8. The method of claim 1, wherein the control node data interaction flow further comprises:
and if the control node performs transfer by itself and the control node is the last-stage transfer node, updating the command field and the transfer progress of the data packet, re-checking the data packet, sending the data packet in a low-power-consumption sending mode, switching to a transparent transmission mode after the data packet is sent, and waiting for receiving data according to a set receiving window period.
9. The method of claim 1, wherein the control node data interaction flow further comprises:
after receiving the transferred data packet, the target control node analyzes whether to execute the data packet according to a command field in the data packet;
if the command field is executed, the corresponding operation is executed according to the command field, then a data packet is constructed according to the frame format of the set data packet, the data packet is sent in a transparent transmission mode, and the data packet is switched to a low-power-consumption sending mode after the sending is finished;
after receiving a data packet returned by a target control node, a control node serving as a relay analyzes whether the data packet is transferred by the control node; and if the data packet is transferred, updating the transfer progress of the data packet, and sending the data packet to a control node of the next-stage transfer in a transparent transfer mode after the data packet is re-checked.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110197208.7A CN112566213B (en) | 2021-02-22 | 2021-02-22 | Automatic relay method of low-power-consumption wireless irrigation control system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110197208.7A CN112566213B (en) | 2021-02-22 | 2021-02-22 | Automatic relay method of low-power-consumption wireless irrigation control system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112566213A CN112566213A (en) | 2021-03-26 |
| CN112566213B true CN112566213B (en) | 2021-05-14 |
Family
ID=75034464
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110197208.7A Active CN112566213B (en) | 2021-02-22 | 2021-02-22 | Automatic relay method of low-power-consumption wireless irrigation control system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112566213B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN210899634U (en) * | 2020-01-08 | 2020-06-30 | 南京信息工程大学 | Desert Environment Monitoring System Based on Zigbee Wireless Sensor Network |
| CN112383889A (en) * | 2020-11-09 | 2021-02-19 | 哈尔滨工业大学 | Efficient dynamic network switching and load balancing method based on self-organizing network |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101521895A (en) * | 2009-04-03 | 2009-09-02 | 南京邮电大学 | Forwarding method used for constructing multi-hop routing in wireless self-organizing network |
| KR20130130534A (en) * | 2012-05-22 | 2013-12-02 | 경기대학교 산학협력단 | Mesh network using wireless distribution system |
| CN103280089A (en) * | 2013-06-21 | 2013-09-04 | 湖南威铭能源科技有限公司 | Method and system for networking wireless water meters or wireless gas meters |
| US10182327B2 (en) * | 2015-03-24 | 2019-01-15 | Lg Electronics Inc. | Method and device for transmitting/receiving data in mesh network using bluetooth |
| CN107231674A (en) * | 2017-05-27 | 2017-10-03 | 郑州云海信息技术有限公司 | A kind of method and apparatus of cluster ad-hoc network |
| CN110351377A (en) * | 2019-07-17 | 2019-10-18 | 成都鑫芯电子科技有限公司 | A kind of multistage linking control method and system |
-
2021
- 2021-02-22 CN CN202110197208.7A patent/CN112566213B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN210899634U (en) * | 2020-01-08 | 2020-06-30 | 南京信息工程大学 | Desert Environment Monitoring System Based on Zigbee Wireless Sensor Network |
| CN112383889A (en) * | 2020-11-09 | 2021-02-19 | 哈尔滨工业大学 | Efficient dynamic network switching and load balancing method based on self-organizing network |
Non-Patent Citations (2)
| Title |
|---|
| Sensitivity Analysis of a Low-Power Wake-Up Receiver Using an RF Barker Code SAW Correlator and a Baseband Narrowband Correlator;Saed Abughannam; J. Christoph Scheytt;《2020 IEEE 31st Annual International Symposium on Personal, Indoor and Mobile Radio Communications》;20200903;全文 * |
| 无线终端设备低功耗唤醒方法的研究;田阳;《中国优秀硕士学位论文全文数据库 信息科技辑》;20180215;全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112566213A (en) | 2021-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3326331B1 (en) | A centralized controlling system controlling interactions and cooperation between radio-operated devices operating in a mesh network supporting multiple radio communication protocols | |
| US20150245351A1 (en) | Communicating data over a mesh network | |
| Reinisch et al. | Wireless technologies in home and building automation | |
| CN101527968B (en) | Interaction method between space network and ground network, and communication protocol gateway | |
| CN105357746B (en) | Double bounce wireless network architecture | |
| US20140293855A1 (en) | Wireless communication system and wireless router | |
| CN109983832A (en) | Transmitter communication equipment and relay communications equipment for D2D communication | |
| CN105827488A (en) | MESH network system applicable to smart home, networking method and communication method | |
| CN108541001B (en) | An Outage Rate Optimization Method for Energy Harvestable Bidirectional Collaborative Communication | |
| CN101820661A (en) | Random walk routing method combining opportunistic forwarding in mobile wireless multi-hop network | |
| CN110351827A (en) | A kind of wireless self-networking method and system based on Sub-GHz | |
| CN107249026A (en) | Intelligent domestic system based on Internet of Things cloud computing | |
| JP2007019574A (en) | Wireless ad hoc communication method | |
| CN112566213B (en) | Automatic relay method of low-power-consumption wireless irrigation control system | |
| JP3762881B2 (en) | Wireless data communication system and wireless slave unit | |
| CN102761883B (en) | Multi-hop broadband wireless communication system and wireless node device thereof | |
| CN102761955B (en) | A kind of data transfer control method of multi-hop wireless network | |
| CN101227503B (en) | Method for communication between intelligent microminiature ground robot and wireless sensor node | |
| CN112367407A (en) | Control method, control device and computer storage medium | |
| RU2231930C2 (en) | Method for data transfer in hybrid network and hybrid network router | |
| GB2519698A (en) | Communicating data over a mesh network | |
| CN115474235A (en) | Long-distance meter reading communication system and method combining LoRa wireless autonomous frequency division and multi-hop | |
| Rabarijaona et al. | Hierarchical mesh routing implementation for indoor data collection | |
| Wen et al. | Dynamic topology construction in a joint deployment | |
| US7742435B1 (en) | Providing a low latency backbone in a wireless mesh network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |