A robot-based irrigation area monitoring implementation method

By using robot nodes and sensor nodes in the irrigation area to work together, the problems of delay and cost of irrigation area monitoring in the existing technology are solved, and the rapid real-time monitoring of the irrigation area environment is realized, data collection efficiency and real-time monitoring are improved, ensuring that Healthy growth and sustainable production of crops.

CN118661627BActive Publication Date: 2024-11-29CHANGSHU INSTITUTE OF TECHNOLOGY
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202411162239.9
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2024-08-23
Publication Date
2024-11-29
Estimated Expiration
2044-08-23

AI Technical Summary

Technical Problem

The existing irrigation area monitoring methods fail to effectively consider the factors of energy and neighboring nodes, resulting in the delay and cost of environmental monitoring in the irrigation area, and the inability to realize real-time monitoring.

Method used

Using robot-based irrigation area monitoring method, through the coordinated work of the robot node and the sensing node, and using mechanisms such as publishing messages, registering messages and quadruple sets, ensure that the sensor node only forwards the publishing messages once, and the robot node moves to a large energy and Data is collected at sensing nodes with many neighbor nodes to improve data acquisition efficiency.

Benefits of technology

It realizes rapid real-time monitoring of the irrigation area environment, reduces monitoring delays and costs, improves the real-time nature of irrigation area monitoring and data collection efficiency, and ensures healthy growth and production sustainability of crops.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN118661627B_ABST
    Figure CN118661627B_ABST
Patent Text Reader

Abstract

The present invention discloses a robot-based irrigation area monitoring implementation method, which relates to the field of intelligent irrigation technology. The method comprises a robot node and a plurality of sensor nodes, wherein the sensor nodes are evenly distributed in the irrigation area and are used to collect irrigation area data; the robot node can move freely and is used to collect data collected by the sensor node; the robot node sends a release message, and the sensor node that receives the release message creates a machine table item and establishes a neighbor address set. The robot-based irrigation area monitoring implementation method uses a movable robot node to collect data from the sensor nodes arranged in the irrigation area, such as humidity and drought degree, shortens the distance between the robot node and the collected sensor node, greatly improves the efficiency of data collection, and thus improves the real-time performance of irrigation area monitoring, ensures the healthy growth of crops, and the sustainability of crop production, and has broad application prospects.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present invention relates to the technical field of intelligent irrigation, and in particular to a robot-based irrigation area monitoring implementation method. Background Art

[0002] Smart irrigation is an important means of providing necessary water to farmland, which is used to increase crop yields and improve the stability and sustainability of agricultural production. Smart irrigation automatically monitors the degree of soil drought and automatically implements irrigation to ensure the healthy growth of crops.

[0003] Existing irrigation area monitoring methods fail to consider factors such as energy and the number of neighboring nodes, increasing the cost and latency of irrigation area environmental monitoring. Furthermore, low-energy robotic nodes are unable to forward and process monitoring data, making real-time monitoring of the irrigation area environment impossible. This application proposes a robot-based irrigation area monitoring method designed to achieve real-time monitoring of the irrigation area environment and ensure the healthy growth of crops in irrigated areas. Summary of the Invention

[0004] Purpose of the invention: The technical problem to be solved by the present invention is to provide a robot-based irrigation area monitoring implementation method in response to the shortcomings of the existing technology, namely the high cost and delay of irrigation area environmental monitoring.

[0005] Technical solution: The present invention discloses a method comprising a robot node and a plurality of sensor nodes, wherein the sensor nodes are evenly distributed in the irrigation area and used to collect irrigation area data; the robot node can move freely and is used to collect data collected by the sensor nodes;

[0006] The method includes: the robot node sends a publish message, and the sensor node that receives the publish message creates a machine table entry and establishes a neighbor address set, wherein the machine table entry includes an address set and a response time;

[0007] If the sensor node does not receive the registration message within the predetermined time w1, it sends a registration message containing a machine table entry and a four-tuple set, where the four-tuple consists of an address, coordinates, a neighbor address set, and energy;

[0008] If the sensor node that receives the registration message meets condition 1, it adds its own four-tuple to the four-tuple set in the registration message and forwards the registration message;

[0009] Condition 1: The address of the sensor node that receives the registration message is included in the address set of the machine table entry of the registration message, and the address in each quadruple in the quadruple set in the registration message is not equal to the address of the sensor node;

[0010] The robot that receives the registration message creates a sensor entry for each four-tuple in the four-tuple set in the registration message;

[0011] The robot node calculates the coefficient of each sensor table entry and establishes a sensor node address set; for each address in the sensor node address set, the robot node moves to the communication range of the sensor node identified by the address, notifies the sensor node to collect neighboring sensor node data, and obtains the collected data from the sensor node.

[0012] In the invention,

[0013] The scheduled time w1 is defined by formula (1):

[0014] (1)

[0015] Wherein, HL1 is the number of hops between the two farthest sensor nodes in the irrigation area, which is preset, h1 is the number of addresses contained in the address set in the sensor node machine table entry for calculating the predetermined time w1, and r1 is the response time in the sensor node machine table entry for calculating the predetermined time w1;

[0016] The robot node calculates the coefficient of each sensor table item according to formula (2) , formula (2) is:

[0017] (2)

[0018] Wherein: e2 is the energy value of the sensing entry, s2 is the number of nodes included in the neighbor address set of the sensing entry, and λ2 is the adjustment coefficient, which ranges from 0.1 to 0.9.

[0019] In the invention,

[0020] The publish message sent by the robot node includes an address set and a timestamp, wherein the address set contains only one element, namely the address of the robot node, and the timestamp is the current time;

[0021] If the neighbor address set of the sensor node that receives the publish message includes the last address of the address set in the publish message, the sensor node adds the last address to its own neighbor address set;

[0022] If the machine table of the sensor node that receives the publish message is an empty table, it adds its own address to the address set in the publish message and creates a machine table entry as the last element. The address set of the machine table entry is equal to the address set in the publish message, the response time is equal to the absolute value of the difference between the current time and the timestamp in the publish message, and the publish message is forwarded.

[0023] In the invention,

[0024] The robot node saves a sensor table, and a sensor table entry contains the address, neighbor address set, coordinates, energy and address set;

[0025] In the registration message sent by the sensor node, the four-tuple set contains only one four-tuple, and the address, coordinates, neighbor address set and energy of the four-tuple are respectively equal to the address, coordinates, neighbor address set and current remaining energy of the sensor node;

[0026] If the sensor node that receives the registration message meets condition 1, it constructs its own quadruple, where the address, coordinates, neighbor address set, and energy of the quadruple are respectively equal to the address, coordinates, neighbor address set, and current remaining energy of the sensor node, adds its own quadruple to the quadruple set in the registration message, and forwards the registration message;

[0027] The robot node that receives the registration message performs the following operations for each quadruple in the quadruple set in the registration message: determine whether there is a sensor table entry whose address is equal to the address in the quadruple; if so, do not perform any operation; otherwise, create a sensor table entry whose address, coordinates, neighbor address set and energy are respectively equal to the address, coordinates, neighbor address set and energy in the quadruple, and the address set is equal to the address set in the machine table entry in the registration message.

[0028] In the invention,

[0029] The robot node maintains a sensor node address set and a temporary node address set, both of which are initially empty;

[0030] The robot node sets a sensor table variable, the variable value is equal to the sensor table of the robot node;

[0031] The robot node calculates the coefficient of each sensor table item in the sensor table variable, adds the address in the sensor table item with the largest coefficient to the sensor node address set, and adds each address in the neighbor address set of the sensor table item to the temporary node address set. If the union of the sensor node address set and the temporary node address set is not equal to the union of the neighbor address sets of each sensor table item of the robot node, the sensor table item with the largest coefficient is deleted from the sensor table variable.

[0032] In the invention,

[0033] For each address in the sensor node address set, the robot node selects a sensor table entry whose address is equal to the address in the sensor node address set. The robot node moves to the communication range of the coordinates of the sensor table entry, that is, the distance between the coordinates of the robot node and the coordinates of the sensor table entry is less than the communication radius of the sensor node, and sends a collection message, in which the address in the collection message is equal to the address in the sensor node address set.

[0034] In the invention,

[0035] If the address of the sensor node that receives the collection message is equal to the address in the collection message, a request message is sent, and the address in the request message is equal to the address of the sensor node.

[0036] In the invention,

[0037] The sensor node that receives the request message sends a response message. The data in the message is equal to the data collected by itself, and the address is the address in the request message.

[0038] If the address of the sensor node that receives the response message is equal to the address in the response message, the response message is saved.

[0039] In the invention,

[0040] The sensor node that receives the response message sends a data message, the data set of which is composed of the data in each response message stored by the sensor node.

[0041] In the invention,

[0042] The robot node that receives the data message saves the data set in the data message.

[0043] Beneficial effects: The present invention provides a robot-based irrigation area monitoring implementation method. Through the robot-based irrigation area monitoring implementation method provided by the present invention, staff can quickly obtain monitoring data of the irrigation area environment, such as humidity and drought level, so as to take effective measures to ensure the healthy growth of crops and the sustainability of crop production, and has broad application prospects. Compared with the existing technology, the robot-based irrigation area monitoring implementation method uses a neighbor address set to ensure that each sensor node only forwards the published message once, which greatly reduces the creation time of the machine table and the neighbor address set, and improves the real-time performance of irrigation area monitoring. In addition, the robot-based irrigation area monitoring implementation method uses a movable robot node to collect data from the sensor nodes arranged in the irrigation area, shortening the distance between the robot node and the collected sensor node, and the robot node collects data by selecting sensor nodes with larger energy values ​​and a larger number of neighbor sensor nodes, which greatly improves the efficiency of data collection, thereby improving the real-time performance of irrigation area monitoring. BRIEF DESCRIPTION OF THE DRAWINGS

[0044] Figure 1 This is a flow chart of the irrigation area monitoring implementation method of the present invention;

[0045] Figure 2 This is a schematic diagram of the process of establishing a neighbor address set and a machine table according to the present invention;

[0046] Figure 3 This is a schematic diagram of the process of establishing a sensor table according to the present invention;

[0047] Figure 4 This is a schematic diagram of the process of establishing an address set according to the present invention;

[0048] Figure 5 This is a schematic diagram of the data acquisition process described in the present invention. DETAILED DESCRIPTION

[0049] Figure 1 This is a flow chart of the irrigation area monitoring implementation method of the present invention; Figure 2 This is a flow chart of establishing a neighbor address set and a machine table according to the present invention.

[0050] The method includes a robot node and multiple sensor nodes, wherein the sensor nodes are evenly distributed in the irrigation area and are used to collect irrigation area data, such as humidity. The robot node can move freely and is used to collect data collected by the sensor nodes.

[0051] Each robot node and sensor node consists of a unique address, for example, the address can be a hardware ID or a MAC address;

[0052] Each sensor node stores a machine table and a set of neighbor addresses. Each machine table contains only one machine entry, including the address set and response time;

[0053] In the initial state, the machine table and neighbor address set of each sensor node are empty;

[0054] The published message contains the message ID, address set and timestamp;

[0055] The address of robot node RN1 is AD1. The neighbor address set and machine table are established through the following process:

[0056] Step 101: Start;

[0057] Step 102: Robot node RN1 sends a publish message. The message ID of the message is 1. The address set contains only one element, namely address AD1. The timestamp is the current time.

[0058] Step 103: The sensor node SN1 that receives the published message determines whether its neighbor address set includes the last address in the address set in the published message. If so, step 107 is executed; otherwise, step 104 is executed.

[0059] Step 104: The sensor node SN1 that receives the publish message adds the last address in the address set in the publish message to its own neighbor address set;

[0060] Step 105: The sensor node SN1 that receives the published message determines whether its own machine table is empty. If so, it executes step 106; otherwise, it executes step 107.

[0061] Step 106: Sensor node SN1, having received the publish message, adds its own address to the address set in the publish message and creates a machine table entry as the last element. The address set of this entry is equal to the address set in the publish message, and the response time is equal to the absolute value of the difference between the current time and the timestamp in the publish message. The publish message is then forwarded, and step 103 is executed.

[0062] Step 107: End.

[0063] Through the above process, the sensor node creates its own machine table and neighbor address set, thereby learning the routing information to reach the robot and the addresses of the neighbor nodes. Since the above process uses the neighbor address set to ensure that each sensor node only forwards the published message once, it greatly reduces the time to create the machine table and neighbor address set, and improves the real-time performance of irrigation area monitoring.

[0064] Figure 3 This is a flow chart of establishing a sensor table according to the present invention. The coordinates of each sensor node are pre-set;

[0065] The registration message contains a message ID, a machine table entry, and a set of four tuples, where the four tuples consist of an address, coordinates, a set of neighbor addresses, and energy.

[0066] The robot node saves a sensor table, and a sensor table entry contains the address, neighbor address set, coordinates, energy and address set;

[0067] If the sensor node SN1 does not receive the registration message within the predetermined time w1, the following process is performed:

[0068] The predetermined time w1 is defined by formula (1), where HL1 is the number of hops between the two most distant sensor nodes in the irrigation area, which is preset, h1 is the number of addresses contained in the address set in the machine table entry of sensor node SN1, and r1 is the response time in the machine table entry;

[0069] (1)

[0070] Step 201: Start;

[0071] Step 202: Sensor node SN1 constructs its own quad-tuple, where the address is its own address, the coordinates are its own coordinates, the neighbor address set is its own neighbor address set, the energy is equal to its current remaining energy, and sends a registration message with a message ID of 2. The machine table is equal to the machine table entry in its own machine table. The quad-tuple set contains only one element, namely the constructed quad-tuple.

[0072] Step 203: If the robot node receives the registration message, execute step 206, otherwise execute step 204;

[0073] Step 204: If the sensor node that receives the registration message meets condition 1, then execute step 205; otherwise, execute step 207;

[0074] Condition 1: The address of the sensor node that receives the registration message is included in the address set of the machine table entry of the registration message, and the address in each quadruple in the quadruple set in the registration message is not equal to the address of the sensor node;

[0075] Step 205: The sensor node that receives the registration message constructs its own quad-tuple, where the address is its own address, the coordinates are its own coordinates, the neighbor address set is its own neighbor address set, and the energy is equal to its current remaining energy. It adds its own quad-tuple to the quad-tuple set in the registration message, forwards the registration message, and executes step 203.

[0076] Step 206: The robot node that receives the registration message performs the following operations for each quadruple in the quadruple set in the registration message: determines whether there is a sensor table entry whose address is equal to the address in the quadruple; if so, does not perform any operation; otherwise, creates a sensor table entry whose address, coordinates, neighbor address set, and energy are respectively equal to the address, coordinates, neighbor address set, and energy in the quadruple, and the address set is equal to the address set in the machine phenotype in the registration message;

[0077] Step 207: End.

[0078] The sensor node passes its own parameters to the robot node through the above process, so that the robot node obtains the coordinates, address, energy, number of neighbor nodes and other parameters of each sensor node, and obtains the path to the sensor node, thereby selecting the sensor node that is capable of obtaining data and then obtaining data.

[0079] Figure 4This is a schematic diagram of the address set establishment process described in the present invention. The robot node maintains a sensor node address set and a temporary node address set, both of which are initially empty.

[0080] After the robot node RN1 establishes the sensor table, it executes the following process to establish the sensor node address set:

[0081] Step 301: Start;

[0082] Step 302: The robot node RN1 sets a sensor table variable sv1, whose value is equal to the sensor table established by the robot node RN1;

[0083] Step 303: The robot node RN1 performs the following operations for each sensor entry SE2 in the sensor table variable sv1: Calculate the coefficient f2 of the sensor entry SE2 according to formula (2), where e2 is the energy value of the sensor entry SE2, s2 is the number of nodes included in the neighbor address set of the sensor entry SE2, and λ2 is the adjustment coefficient, which ranges from 0.1 to 0.9;

[0084] (2)

[0085] Step 304: Robot node RN1 selects the sensor entry SE3 with the largest coefficient, adds the address of the sensor entry to its own sensor node address set, and adds each address in the neighbor address set of the sensor entry to the temporary node address set. If the union of the sensor node address set and the temporary node address set is equal to the union of the neighbor address sets of each sensor entry of robot node RN1, then execute step 306; otherwise, execute step 305.

[0086] Step 305: The robot node RN1 deletes the sensor table entry SE3 from the sensor table variable sv1. If the sensor table variable sv1 is empty, execute step 306; otherwise, execute step 303.

[0087] Step 306: End.

[0088] Through the above process, the robot node selects the sensor nodes with larger energy values ​​and more neighboring sensor nodes to collect data and builds a set of sensor node addresses.

[0089] Figure 5 This is a schematic diagram of the data acquisition process of the present invention. The collected message includes a message ID and an address;

[0090] The request message contains the message ID and address;

[0091] The response message contains message ID, address, and data;

[0092] The data message contains the message ID and data set;

[0093] After the robot RN1 establishes the sensor node address set, it performs the following operations for each address AD1 in the sensor node address set:

[0094] Step 401: Start;

[0095] Step 402: Robot node RN1 selects a sensor entry whose address is equal to address AD1. Robot node RN1 moves into the communication range of the sensor entry, i.e., the distance between the coordinates of robot node RN1 and the coordinates of the sensor entry is less than the communication radius R1 of the sensor node. Robot node RN1 then sends a collection message with a message ID of 3 and an address equal to address AD1.

[0096] Step 403: The sensor node that receives the collection message determines whether its own address is equal to the address in the collection message. If yes, it executes step 404; otherwise, it executes step 410.

[0097] Step 404: The sensor node that receives the collection message sends a request message to start the clock. The message ID of the request message is 4 and the address is its own address.

[0098] Step 405: The sensor node that receives the request message sends a response message with a message ID of 5, data equal to the data collected by itself, and an address equal to the address in the request message;

[0099] Step 406: The sensor node that receives the response message determines whether its own address is equal to the address in the response message. If yes, it executes step 407; otherwise, it executes step 410.

[0100] Step 407: The sensor node that receives the response message saves the response message;

[0101] Step 408: After the clock expires, the sensor node that receives the response message sends a data message, the message ID of which is equal to 5, and the data set is composed of the data in each saved response message;

[0102] Step 409: The robot RN1 that receives the data message saves the data set in the data message;

[0103] Step 410: End.

[0104] The robot node collects data directly from the sensor node through the above process, thereby realizing real-time monitoring of the environmental parameters of the irrigation area. From the above description, it can be seen that the robot-based irrigation area monitoring implementation method proposed in this application collects data from sensor nodes at different locations in the irrigation area through movable robot nodes during use, thereby improving data collection efficiency and improving the real-time performance of irrigation area monitoring. Since the irrigation area is large and it is impossible to arrange basic settings, the system distributes robot nodes and sensor nodes in the irrigation area based on the characteristics of the irrigation environment. The sensor nodes transmit the collected environmental parameters such as soil moisture content, humidity, and temperature of the irrigation area to the robot nodes through multi-hop transmission, and the robot nodes monitor the environmental parameters of the irrigation area in real time.

[0105] Example 1

[0106] Based on the simulation parameters in Table 1, this example simulates a robot-based irrigation area monitoring method according to the present invention. Performance analysis is as follows: When the sensor node coverage area is large, the robot is farther away from the data-collecting sensor nodes, and the robot's success rate in acquiring data from all sensor nodes decreases. When the sensor node coverage area is small, the robot is closer to the data-collecting sensor nodes, and the robot's success rate in acquiring data from all sensor nodes increases. The average success rate for all sensor nodes is 97.8%.

[0107] Table 1

[0108]

[0109] This invention provides a method for implementing a robot-based irrigation area monitoring system. Numerous methods and approaches exist for implementing this technical solution. The foregoing description is merely a preferred embodiment of the invention. It should be noted that those skilled in the art may make improvements and modifications without departing from the principles of the invention, and such improvements and modifications are within the scope of protection of this invention. Any components not specified in this embodiment may be implemented using existing technologies.

Claims

1. A robot-based irrigation area monitoring implementation method, characterized in that: The method comprises a robot node and a plurality of sensor nodes, wherein the sensor nodes are evenly distributed in the irrigation area and are used to collect irrigation area data; The robot node can move freely and is used to collect data collected by the sensor node; The method comprises: the robot node sends a publishing message, the publishing message sent by the robot node includes an address set and a timestamp, wherein the address set includes only one element, namely the address of the robot node, and the timestamp is the current time; the sensor node that receives the publishing message creates a machine table entry and establishes a neighbor address set, wherein the machine table entry includes an address set and a response time; if the neighbor address set of the sensor node that receives the publishing message includes the last address of the address set in the publishing message, the sensor node adds the last address to its own neighbor address set; if the machine table of the sensor node that receives the publishing message is an empty table, the sensor node adds its own address to the address set in the publishing message, and creates a machine table entry as the last element, the address set of the machine table entry is equal to the address set in the publishing message, the response time is equal to the absolute value of the difference between the current time and the timestamp in the publishing message, and the publishing message is forwarded; If the sensor node does not receive the registration message within the predetermined time w1, it sends a registration message, the registration message includes a machine table entry and a four-tuple set, wherein the four-tuple is composed of an address, a coordinate, a neighbor address set and an energy; in the registration message sent by the sensor node, the four-tuple set includes only one four-tuple, the address, coordinates, neighbor address set and energy of the four-tuple are respectively equal to the address, coordinates, neighbor address set and current remaining energy of the sensor node; The scheduled time w1 is defined by formula (1): (1) Wherein, HL1 is the number of hops between the two farthest sensor nodes in the irrigation area, which value is preset, h1 is the number of addresses contained in the address set in the sensor node machine table entry for calculating the predetermined time w1, and r1 is the response time in the sensor node machine table entry for calculating the predetermined time w1; If the sensor node that receives the registration message meets condition 1, it constructs its own quadruple, where the address, coordinates, neighbor address set and energy of the quadruple are respectively equal to the address, coordinates, neighbor address set and current remaining energy of the sensor node, adds its own quadruple to the quadruple set in the registration message, and forwards the registration message; The robot node that receives the registration message performs the following operations for each quadruple in the quadruple set in the registration message: determine whether there is a sensor table entry whose address is equal to the address in the quadruple, if so, do not perform any operation, otherwise create a sensor table entry whose address, coordinates, neighbor address set and energy are respectively equal to the address, coordinates, neighbor address set and energy in the quadruple, and the address set is equal to the address set in the machine table entry in the registration message; Condition 1: The address of the sensor node that receives the registration message is included in the address set of the machine table entry of the registration message, and the address in each quadruple in the quadruple set in the registration message is not equal to the address of the sensor node; The robot that receives the registration message creates a sensor table entry for each four-tuple in the four-tuple set in the registration message; The robot node calculates the coefficient of each sensor table item and establishes a sensor node address set; the robot node calculates the coefficient of each sensor table item according to formula (2): , formula (2) is: (2) Wherein: e2 is the energy value of the sensor entry, s2 is the number of nodes included in the neighbor address set of the sensor entry, λ2 is the adjustment coefficient, and the value range is 0.1-0.9; For each address in the sensor node address set, the robot node moves to the communication range of the sensor node identified by the address, notifies the sensor node to collect data from neighboring sensor nodes, and the sensor node transmits the collected environmental parameters such as soil moisture content, humidity, and temperature of the irrigation area to the robot node through multi-hop transmission. The robot node obtains the collected data from the sensor node and monitors the environmental parameters of the irrigation area in real time; The robot node saves a sensor table entry, which contains the address, neighbor address set, coordinates, energy and address set; the robot node maintains a sensor node address set and a temporary node address set, both of which are empty in the initial state; The robot node sets a sensor table variable, and the variable value is equal to the sensor table of the robot node; the robot node calculates the coefficient of each sensor table item in the sensor table variable, adds the address in the sensor table item with the largest coefficient to the sensor node address set, and adds each address in the neighbor address set of the sensor table item to the temporary node address set; if the union of the sensor node address set and the temporary node address set is not equal to the union of the neighbor address set of each sensor table item of the robot node, then the sensor table item with the largest coefficient is deleted from the sensor table variable.

2. The method for implementing irrigation area monitoring based on a robot according to claim 1, characterized in that: For each address in the sensor node address set, the robot node selects a sensor table item whose address is equal to the address in the sensor node address set. The robot node moves to the communication range of the coordinates of the sensor table item, that is, the distance between the coordinates of the robot node and the coordinates of the sensor table item is less than the communication radius of the sensor node, and sends a collection message, in which the address in the collection message is equal to the address in the sensor node address set.

3. The method for implementing irrigation area monitoring based on a robot according to claim 2, characterized in that: If the address of the sensor node that receives the collection message is equal to the address in the collection message, a request message is sent, and the address in the request message is equal to the address of the sensor node.

4. The method for implementing irrigation area monitoring based on a robot according to claim 3 is characterized in that: The sensor node that receives the request message sends a response message, the data of which is equal to the data collected by itself, and the address is the address in the request message; If the address of the sensor node that receives the response message is equal to the address in the response message, the response message is saved.

5. The method for implementing irrigation area monitoring based on a robot according to claim 1, characterized in that: The sensor node that receives the response message sends a data message, the data set of which is composed of the data in each response message stored by the sensor node.

6. The method for implementing irrigation area monitoring based on a robot according to claim 1, characterized in that: The robot node that receives the data message saves the data set in the data message.

Citation Information

Patent Citations

  • Efficient wireless sensor network address configuration method

    CN109688244A

  • Intelligent irrigation system implementation method based on Internet of Things

    CN111642376A