Implementation method of intelligent irrigation environment management system

Abstract

The application discloses an implementation method of a smart irrigation environment management system, and belongs to the technical field of smart irrigation monitoring, and comprises the following steps: the system comprises a plurality of mobile nodes uniformly distributed in an irrigation area; the mobile nodes comprise backbone nodes and terminal nodes; the backbone nodes have a forwarding function, and irrigation creation messages and irrigation response messages are used to acquire irrigation data; the terminal nodes do not have the forwarding function and are used for collecting irrigation area environment data; and a virtual center node is arranged in the irrigation area. The application can quickly acquire accurate real-time data of the irrigation area for monitoring and management, such as humidity, temperature, illumination, soil pH, drought degree and other parameters, so that effective measures can be taken to ensure the healthy growth of crops and the sustainability of crop production, and the application has a wide application prospect.

Description

TECHNICAL FIELD

[0001] The application belongs to the technical field of intelligent irrigation monitoring, and particularly relates to an implementation method of an intelligent irrigation environment management system. BACKGROUND

[0002] Real-time data collection and monitoring of irrigation areas is an important means to provide necessary water sources for farmlands, for increasing the yield of crops and improving the stability and sustainability of agricultural production, and irrigation area environment monitoring and early warning ensure the healthy growth of crops by automatically monitoring the drought degree of soil. The traditional irrigation area data collection and monitoring system transmits data in a broadcast mode, resulting in problems such as large power consumption and long delay of irrigation area data collection, management and monitoring, and meanwhile, the traditional irrigation area data collection and monitoring system cannot realize data fusion, resulting in problems such as low data accuracy and long response time, which further increase the cost and delay of irrigation area data collection, management and monitoring.

[0003] Therefore, it is necessary to design an implementation method of an intelligent irrigation environment management system capable of realizing real-time data collection and management and ensuring the healthy growth of crops in irrigation areas in view of the above problems. SUMMARY

[0004] The purpose of the present application is to provide an implementation method of an intelligent irrigation environment management system in view of the problems such as low data accuracy and long response time caused by the fact that the traditional irrigation area data collection and monitoring system cannot realize data fusion, to improve the data accuracy, reduce the response time, and further reduce the cost and delay of irrigation area data collection, management and monitoring by establishing a backbone network to quickly acquire irrigation area environment data collected by each end node.

[0005] According to an aspect of the present specification, an implementation method of an intelligent irrigation environment management system is provided, comprising:

[0006] The system comprises mobile nodes distributed in an irrigation area; the mobile nodes comprise backbone nodes and end nodes; and the method comprises:

[0007] The backbone node sends an irrigation creation message while setting a hop limit parameter and a timer, and an end node or a backbone node receiving the irrigation creation message sends an irrigation response message; if the backbone node receiving the irrigation creation message does not exist a message table item with the name in the irrigation creation message, a message table item is created while the hop limit parameter in the irrigation creation message is decremented by 1, and the irrigation creation message is forwarded when the hop limit parameter value is not equal to 0;

[0008] If the backbone node sending the irrigation creation message receives the irrigation response message and the timer decays to 0, an irrigation table item is created;

[0009] The mobile node sends a find message; a backbone node receiving the find message sends a data message if the node ID of the backbone node is equal to the node ID in the find message and there exists an irrigation table entry whose name is included in the name set in the find message;

[0010] For each name in the name set in the find message, the backbone node deletes the name from the name set if the backbone node has a processing table entry whose name is equal to the name, otherwise creates a processing table entry; if the name set is not empty, the backbone node forwards the find message;

[0011] If a backbone node receiving a data message has a processing table entry whose name is equal to the name in the data message, the backbone node forwards the data message.

[0012] If a mobile node sending a find message receives a data message, the mobile node creates a monitoring table entry.

[0013] Further, the method further comprises:

[0014] The mobile node establishes a neighbor table by sending a neighbor message; the end node elects a backbone node by sending a build message; each mobile node saves an irrigation table, an irrigation table including a name, data and a lifetime; the initial state is an empty table; each mobile node saves a message table, a message table including a name and a lifetime; the initial state is an empty table; an irrigation create message includes a message ID, a name and a hop limit parameter; an irrigation response message includes a message ID, a name and a data block; the mobile node sending the irrigation create message has a message ID of 3, a name equal to a name identifying target data and a hop limit parameter being preset;

[0015] The mobile node receiving the irrigation create message sends an irrigation response message having a message ID of 4, a name equal to the name in the irrigation create message and a data block equal to a data block collected by the mobile node; the backbone node receiving the irrigation create message creates a message table entry having a name equal to the name in the create message and sets a lifetime of the message table entry to a maximum value;

[0016] If a backbone node receiving an irrigation response message is not a backbone node sending an irrigation create message and there exists a message table entry having a name equal to the name in the irrigation response message, the backbone node forwards the irrigation response message.

[0017] Further, the method further comprises:

[0018] Each mobile node saves a processing table, a processing table entry including a name and a lifetime;

[0019] A find message includes a message ID, a node ID and a name set; a data message includes a message ID, a name and data;

[0020] The mobile node sending the search message calculates the distance between each name in the pre-set name set and its own coordinates, arranges all the names in the name set in ascending order according to the calculated distance value, that is, the distance between the first name and the mobile node coordinates is the closest, and the distance between the last name and the mobile node coordinates is the farthest, selects a neighbor table entry whose type is 0 and whose coordinates are closest to the first name in the name set, and in the sent search message, the message ID is 5, the node ID is the node ID in the neighbor table entry, and the name set is the name set.

[0021] Further, the method further comprises:

[0022] The end node elects a backbone node by sending a build message, and the irrigation area sets a virtual center node with coordinates ((x max +x min ) / 2,(y max +y min ) / 2), x min and x max are the minimum and maximum horizontal coordinates of the irrigation area, and y min and y max are the minimum and maximum vertical coordinates.

[0023] If the end node does not have a neighbor table entry whose type is 0 and whose coordinates are closer to the virtual center node coordinates than its own coordinates, and the distance between the end node and the virtual center node coordinates is greater than the distance between the coordinates of any neighbor table entry of type 1 and the virtual center node coordinates, the end node marks itself as a backbone node, selects a neighbor table entry whose coordinates are closest to the virtual center node coordinates, and sends a build message with a message ID of 2 and a node ID equal to the node ID of the neighbor table entry.

[0024] Further, the method further comprises:

[0025] If the node ID of the mobile node receiving the build message is equal to the node ID in the build message, the mobile node marks itself as a backbone node; if the mobile node does not have a neighbor table entry with type 0 and the distance between the coordinates of the virtual center node and the coordinates of the neighbor table entry is less than the distance between the coordinates of the virtual center node and the coordinates of the mobile node, and the distance between the coordinates of the virtual center node and the coordinates of the mobile node is less than a value, the value is equal to 0.5*r, r is the communication radius of the mobile node, the mobile node selects a neighbor table entry with the smallest distance between the coordinates of the virtual center node and the coordinates of the neighbor table entry, sets the node ID of the build message to the node ID of the neighbor table entry, and forwards the build message.

[0026] Further, the method further comprises:

[0027] Each mobile node maintains a neighbor table, and the neighbor table entry contains a node ID, coordinates, type and life cycle, the type value of 0 indicates that the mobile node identified by the node ID of the neighbor table entry is a backbone node, and the type value of 1 indicates that the mobile node identified by the node ID of the neighbor table entry is an end node; the neighbor message contains a message ID, a node ID, coordinates and a type; in the neighbor message sent by the mobile node, the message ID is 1, and the node ID, coordinates and node type are respectively the node ID, coordinates and node type of the mobile node.

[0028] Further, the method further comprises:

[0029] In the data message sent by the backbone node receiving the find message, the message ID is 6, and the name and data are respectively equal to the name and data of the irrigation table entry in which the name is contained in the name set in the find message; in the processing table entry created by the backbone node receiving the find message, the name is equal to the name in the name set in the find message, and the life cycle is set to the maximum value.

[0030] Further, the method further comprises:

[0031] The backbone node forwarding the find message selects a neighbor table entry with type 0 and the distance between the coordinates of the first name in the name set in the find message and the coordinates of the neighbor table entry is less than the distance between the coordinates of the first name in the name set in the find message and the coordinates of the mobile node, and in the forwarded find message, the node ID is equal to the node ID of the neighbor table entry.

[0032] Compared with the prior art, the present application has the following beneficial effects:

[0033] 1. The application provides a kind of intelligent irrigation environment management system implementation method, by the information transmission between mobile node, backbone node and end node, can quickly obtain the real-time data of irrigation area for monitoring and management, for example humidity, temperature, illumination, soil pH, drought degree and other parameters, to ensure the healthy growth of crops, And the sustainability of crop production, with wide application prospect;

[0034] 2, the application can quickly obtain the irrigation area environment data collected by each end node and find the corresponding irrigation environment data by establishing neighbor table and electing backbone node to establish overall intelligent irrigation management system, not only improve data accuracy, reduce response time, but also further reduce the cost and delay of irrigation area data acquisition, management and monitoring. DETAILED DESCRIPTION

[0035] In order to more clearly illustrate the technical solutions of the embodiments of the application or the prior art, the following will briefly introduce the drawings needed to be used in the embodiment or prior art description, and obviously, the drawings in the following description are only some embodiments of the application, and those skilled in the art can obtain other drawings according to these drawings without creative labor.

[0036] Figure 1 The flow chart of the implementation method of the intelligent irrigation environment management system of the embodiment of the application is shown in the figure.

[0037] Figure 2 The flow chart of the embodiment of the application is shown in the figure.

[0038] Figure 3 The flow chart of the embodiment of the application is shown in the figure.

[0039] Figure 4 The flow chart of the embodiment of the application is shown in the figure.

[0040] Figure 5 The flow chart of the embodiment of the application is shown in the figure. DETAILED DESCRIPTION

[0041] It should be noted that:

[0042] Neighbor table refers to the collection information of all nodes directly connected with a mobile node or establishing neighbor relationship.

[0043] Neighbor table entry refers to a single record entry in neighbor table, corresponding to a specific neighbor node.

[0044] The following will clearly and completely describe the technical solutions in the embodiments of the present invention in conjunction with the accompanying drawings. Obviously, the described embodiments are only 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 making creative efforts are within the scope of protection of the present invention.

[0045] like Figure 1 As shown, an embodiment of the present invention provides a method for implementing a smart irrigation environment management system, wherein the system includes a plurality of mobile nodes evenly distributed in an irrigation area; the mobile nodes are divided into backbone nodes and terminal nodes, the backbone nodes have a forwarding function, and the terminal nodes do not have a forwarding function; the minimum horizontal coordinate and the maximum horizontal coordinate of the irrigation area are x and y respectively. min and x max , the minimum and maximum ordinates are y min and y max , the irrigation area sets a virtual center node, the coordinates of the virtual center node are ((x max +x min ) / 2,(y max +y min ) / 2); Each mobile node has a node ID, such as a hardware ID or a MAC address; Each mobile node stores a neighbor table, and the neighbor table entry contains a node ID, coordinates, type, and life cycle. A type threshold of 0 indicates that the mobile node identified by the node ID of the neighbor table entry is a backbone node, and a type threshold of 1 indicates that the mobile node identified by the node ID of the neighbor table entry is an end node.

[0046] Specifically, if Figure 2 As shown, the embodiment of the present invention provides a flowchart for establishing a neighbor table. Each message is uniquely identified by a message ID. A neighbor message includes a message ID, a node ID, coordinates, and a type. Mobile node M1 periodically performs the following operations. Mobile node M1 is a backbone node or an end node:

[0047] Step 101: Start;

[0048] Step 102: Mobile node M1 sends a neighbor message. The message ID of the neighbor message is 1, the node ID is the node ID of mobile node M1, and the coordinates are the coordinates of mobile node M1. If mobile node M1 is a backbone node, the type value is 0, otherwise the type value is 1.

[0049] Step 103: After the neighbor mobile node receives the neighbor message, it is checked whether there is a neighbor table entry with the node ID equal to the node ID in the neighbor message in the neighbor table, if there is, the coordinate and type of the neighbor table entry are set as the coordinate and type in the neighbor message respectively, and the life cycle is set as the maximum value, otherwise, a neighbor table entry with the node ID equal to the node ID in the neighbor message is created, the coordinate and type of the neighbor table entry are set as the coordinate and type in the neighbor message respectively, and the life cycle is set as the maximum value;

[0050] Step 104: End;

[0051] The mobile node establishes the neighbor table through steps 101-104 to obtain the node ID, coordinate and node type of each neighbor node, so that the backbone network is established, and the environment data of the irrigation area collected by each end node can be quickly obtained, and the above neighbor table ensures the validity and real-time performance of the neighbor table entry through the life cycle, so that the validity and correctness of the environment data communication of the irrigation area are ensured.

[0052] Specifically, the embodiment of the present application also provides a process for electing the backbone node, as shown in the figure, the construction message comprises a message ID and a node ID; the end node H1 periodically executes the following process: Figure 3

[0053] Step 201: Start;

[0054] Step 202: The end node H1 judges whether there is a neighbor table entry with the type value of 0 and the distance between the coordinate and the virtual center node coordinate smaller than the distance between its own coordinate and the virtual center node coordinate, if not, step 203 is executed, otherwise, step 209 is executed;

[0055] Step 203: If the distance between the end node H1 and the virtual center node coordinate is greater than the distance between the coordinate of any neighbor table entry with the type of 1 and the virtual center node coordinate, step 204 is executed, otherwise, step 209 is executed;

[0056] Step 204: The end node H1 marks itself as a backbone node, selects a neighbor table entry with the smallest distance between the coordinate and the virtual center node coordinate, and sends a construction message with the message ID of 2 and the node ID equal to the node ID of the neighbor table entry;

[0057] Step 205: The end node receiving the construction message judges whether its node ID is equal to the node ID in the construction message, if yes, step 206 is executed, otherwise, step 209 is executed;

[0058] ​Step 206: the end node receiving the construction message marks itself as a backbone node, judges whether there is a neighbor table entry whose type threshold is 0 and the distance between the coordinate and the virtual center node coordinate is less than the distance between the coordinate and the virtual center node coordinate, if yes, step 209 is executed, otherwise, step 207 is executed;

[0059] Step 207: the end node receiving the construction message judges whether the distance between the coordinate and the virtual center node coordinate is less than a threshold TH0, the threshold TH0 is equal to 0.5xr, r is the communication radius of the mobile node, if yes, step 209 is executed, otherwise, step 208 is executed;

[0060] Step 208: the end node receiving the construction message selects a neighbor table entry whose coordinate is the closest to the virtual center node coordinate, sets the node ID of the construction message as the node ID of the neighbor table entry, forwards the construction message, and executes step 205;

[0061] Step 209: ends.

[0062] The end nodes elect the backbone nodes through steps 201-209 to construct the backbone network, so that the backbone nodes cover the whole irrigation area, and then the environment data of the irrigation area collected by the end nodes are collected, since the number of the backbone nodes performing the forwarding function is far less than the total number of the mobile nodes, the cost and delay of collecting the environment data of the irrigation area are greatly reduced, and the correctness and real-time performance of collecting the environment of the irrigation area are improved.

[0063] Specifically, the embodiment of the present application further provides a flow of constructing the irrigation data, as shown in Figure 4 A data is uniquely identified by a name, and the name is equal to a coordinate; a data is composed of multiple data blocks, for example, the environment parameters of an irrigation area identified by a coordinate, humidity, temperature, illumination, etc.; each mobile node stores an irrigation table, and the irrigation table includes a name, data and a life cycle, and the initial state is an empty table; each mobile node stores a message table, and the message table includes a name and a life cycle, and the initial state is an empty table; the irrigation creation message includes a message ID, a name and a hop limit parameter; the irrigation response message includes a message ID, a name and a data block; the data DA1 is defined by a name NA1, and the name NA1 is equal to a coordinate CO1, the coordinate of the backbone node B1 is CO1, and the backbone node B1 executes the following process to create the data DA1:

[0064] Step 301: starts;

[0065] Step 302: The backbone node B1 sets a hop limit parameter, the initial value of which is a preset value HL1, the value of HL1 ranges from 1 to 5, sets a timer TM1, and sends an irrigation creation message, the message ID of the message is 3, the name is NA1, and the hop limit parameter is HL1;

[0066] Step 303: The mobile node (which can be a backbone node or an end node) receiving the irrigation creation message sends an irrigation response message, the message ID of the message is 4, the name is equal to the name in the irrigation creation message, and the data block is equal to the data block collected by itself, such as humidity or temperature;

[0067] Step 304: If the mobile node receiving the irrigation creation message is a backbone node, it executes step 305, otherwise it executes step 313;

[0068] Step 305: The backbone node receiving the irrigation creation message judges whether there is a message table entry whose name is equal to the name in the irrigation creation message, if there is, it executes step 308, otherwise it executes step 306;

[0069] Step 306: The backbone node receiving the irrigation creation message creates a message table entry, the name of which is equal to the name in the irrigation creation message, sets the lifetime of the message table entry to the maximum value, decrements the hop limit parameter in the irrigation creation message by 1, and if the value of the hop limit parameter is equal to 0, it executes step 308, otherwise it executes step 307;

[0070] Step 307: The backbone node receiving the irrigation creation message forwards the irrigation creation message and executes step 303;

[0071] Step 308: If the backbone node B1 receives the irrigation response message, it executes step 311, otherwise it executes step 309;

[0072] Step 309: The backbone node receiving the irrigation response message judges whether there is a message table entry whose name is equal to the name in the irrigation response message, if there is, it executes step 310, otherwise it executes step 313;

[0073] Step 310: The mobile node receiving the irrigation response message forwards the irrigation response message and executes step 308;

[0074] Step 311: The backbone node B1 judges whether the timer TM1 has decayed to 0, if it has, it executes step 312, otherwise it executes step 308;

[0075] Step 312: The backbone node B1 constructs data DA1 by using data blocks in all received irrigation response messages, creates an irrigation table entry with a name NA1 and data DA1, and sets a lifetime of the irrigation table entry to a maximum value;

[0076] Step 313: End.

[0077] The backbone node solves the problem that a single node cannot create comprehensive irrigation area environment data due to limited resources by using the irrigation creation message and the irrigation response message to construct irrigation data through steps 301-313.

[0078] Specifically, the embodiment of the present application further provides a process for monitoring irrigation data, as shown in Figure 5 As shown in the figure, each mobile node (including a backbone node and a terminal node) stores a processing table, and each processing table entry includes a name and a lifetime; a search message includes a message ID, a node ID and a name set; a data message includes a message ID, a name and data; in a case where an irrigation table entry is created at each backbone node in the name set NS2 (i.e., the name of the irrigation table entry is equal to the coordinates of the backbone node), a mobile node M2 (the mobile node M2 can be a backbone node or a terminal node) obtains data defined by each name in the name set NS2 by the following process:

[0079] Step 401: Start;

[0080] Step 402: The mobile node M2 calculates distances between each name in the name set NS2 and its own coordinates, arranges all names in the name set NS2 in ascending order according to the calculated distance values, i.e., the distance between the first name and the coordinates of the mobile node M2 is the closest, and the distance between the last name and the coordinates of the mobile node M2 is the farthest, selects a neighbor table entry with a type threshold value of 0 and the closest distance between the coordinates and the first element in the name set NS2, and sends a search message with a message ID of 5, a node ID in the neighbor table entry, and the name set NS2;

[0081] Step 403: The backbone node receiving the search message judges whether its node ID is equal to the node ID in the search message, and if yes, executes step 404, otherwise executes step 415;

[0082] Step 404: The backbone node receiving the search message performs the following operation for each irrigation table entry thereof: if the name set in the search message contains the name of the irrigation table entry, deletes the name of the irrigation table entry from the name set in the search message, and sends a data message with a message ID of 6, a name equal to the name of the irrigation table entry and data equal to the data of the irrigation table entry, otherwise, does not perform any operation;

[0083] Step 405: The backbone node receiving the find message judges whether the name set in the find message is empty set, if yes, step 409 is executed, otherwise step 406 is executed;

[0084] Step 406: The backbone node receiving the find message executes the following operation for each name in the name set of the find message: judges whether there is a processing entry whose name is equal to the name, if yes, deletes the element from the name set of the find message, sets the life cycle of the processing entry to maximum value, otherwise creates a processing entry whose name is equal to the name, and sets the life cycle of the processing entry to maximum value;

[0085] Step 407: The backbone node receiving the find message judges whether the name set in the find message is empty set, if yes, step 409 is executed, otherwise step 408 is executed;

[0086] Step 408: The backbone node receiving the find message selects a neighbor entry whose type threshold value is 0 and the distance between the coordinate and the first name in the name set of the find message is less than the distance between the own coordinate and the first name in the name set of the find message, sets the node ID of the find message to the node ID of the neighbor entry, forwards the find message, and executes step 403;

[0087] Step 409: If the mobile node M2 receives the data message, step 412 is executed, otherwise step 410 is executed;

[0088] Step 410: The backbone node receiving the data message judges whether there is a monitoring entry whose name is equal to the name in the data message, if not, creates a region entry whose name and data are equal to the name and data in the data message respectively, and sets the life cycle to maximum value, if the backbone node has a processing entry whose name is equal to the name in the data message, step 411 is executed, otherwise step 415 is executed;

[0089] Step 411: The backbone node receiving the data message selects a processing entry whose name is equal to the name in the data message, deletes the processing entry, forwards the data message, and executes step 409;

[0090] Step 412: The mobile node M2 judges whether there is a monitoring entry whose name is equal to the name in the data message, if yes, step 414 is executed, otherwise step 413 is executed;

[0091] Step 413: the mobile node M2 creates a monitoring table entry, the name and data of which are equal to the name and data in the data message respectively, and the life cycle is set to the maximum value;

[0092] Step 414: the mobile node M2 judges whether there is a monitoring table entry for each name in the name set NS2, the name of which is equal to the name of the data message, if yes, step 415 is executed, otherwise, step 409 is executed.

[0093] Step 415: end.

[0094] The mobile node has the following innovations through steps 401-415: (1) the mobile node sends the lookup message, the request message and the data message to obtain multiple irrigation area environment parameters through one data communication process; (2) multiple data are obtained through the neighbor table from the nearest backbone node, which greatly reduces the irrigation area data management delay and cost; (3) the routing state is saved through the processing table, so that the irrigation area data can be returned to the mobile node without establishing a route, and multiple mobile nodes can share data through the processing table, further reducing the irrigation area data management and monitoring delay, and realizing real-time performance.

[0095] Specifically, based on the simulation parameters in Table 1, the embodiment of the present application further provides an implementation method for simulating a smart irrigation environment management system, and the performance analysis is as follows: when the irrigation area is large, the success rate of obtaining real-time data of the irrigation area decreases, and when the irrigation area is small, the success rate of obtaining real-time data of the irrigation area increases, and the average success rate of the collection node for obtaining the irrigation area environment monitoring data is 98.1%.

[0096] Table 1 Simulation parameters

[0097]

[0098] Finally, it should be noted that the above specific embodiments are only representative examples of the present application. Apparently, the present application is not limited to the above specific embodiments, and can have many variations. Any simple modification, equivalent change and modification made according to the technical essence of the present application to the above specific embodiments shall be considered as falling within the protection scope of the present application.

Claims

1. A method for implementing a smart irrigation environment management system, characterized by, The system comprises mobile nodes distributed in an irrigation area; the mobile nodes comprise backbone nodes and end nodes; the method comprises: The mobile nodes establish a neighbor table by sending a neighbor message; the end nodes elect a backbone node by sending a build message; If an end node does not have a neighbor table entry of type 0 and the distance between the coordinates of the end node and the virtual center node is greater than the distance between the coordinates of any neighbor table entry of type 1 and the virtual center node, the end node marks itself as a backbone node, selects a neighbor table entry with the smallest distance between the coordinates and the virtual center node, and sends a build message with a message ID of 2 and a node ID equal to the node ID of the neighbor table entry; If a mobile node receiving a build message has a node ID equal to the node ID in the build message, the mobile node marks itself as a backbone node; if the mobile node does not have a neighbor table entry of type 0 and the distance between the coordinates of the mobile node and the virtual center node is greater than a value equal to 0.5×r, r being the communication radius of the mobile node, the mobile node selects a neighbor table entry with the smallest distance between the coordinates and the virtual center node, sets the node ID of the build message to the node ID of the neighbor table entry, and forwards the build message; The backbone node sends an irrigation creation message while setting a hop limit parameter and a timer; an end node or a backbone node receiving the irrigation creation message sends an irrigation response message; if a backbone node receiving the irrigation creation message does not have a message table entry with the same name as in the irrigation creation message, the backbone node creates a message table entry while decreasing the hop limit parameter in the irrigation creation message by 1, and forwards the irrigation creation message when the hop limit parameter value is not equal to 0; If a backbone node sending an irrigation creation message receives an irrigation response message and the timer decays to 0, the backbone node creates an irrigation table entry; The mobile node sends a search message containing a message ID, a node ID and a name set; each mobile node saves a processing table, and each processing table entry contains a name and a life cycle; if a backbone node receiving a search message has a node ID equal to the node ID in the search message and has an irrigation table entry with a name included in the name set in the search message, the backbone node sends a data message; For each name in the name set in the search message, if the backbone node has a processing table entry with the name, the backbone node removes the name from the name set; otherwise, the backbone node creates a processing table entry; if the name set is not empty, the backbone node forwards the search message; If a backbone node receiving a data message has a processing table entry with a name equal to the name in the data message, the backbone node forwards the data message; If a mobile node sending a search message receives a data message, the mobile node creates a monitoring table entry.

2. The method of claim 1, wherein the method further comprises: The method further comprises: Each mobile node maintains an irrigation table, an irrigation table contains name, data and life cycle; initial state is empty table; each mobile node maintains a message table, a message table contains name and life cycle; initial state is empty table; irrigation creation message contains message ID, name and hop limit parameter; irrigation response message contains message ID, name and data block; mobile node sending irrigation creation message, message ID is 3, name is equal to the name identifying target data, hop limit parameter is preset; Mobile node receiving irrigation creation message sending irrigation response message, message ID is 4, name is equal to the name in irrigation creation message, data block is equal to the data block collected by itself; backbone node receiving irrigation creation message creating message table entry, name is equal to the name in the creation message, setting the life cycle of the message table entry as maximum value; If the backbone node receiving irrigation response message is not the backbone node sending irrigation creation message, and there is a message table entry, the name of the message table entry is equal to the name in the irrigation response message, then forwarding the irrigation response message.

3. The method of claim 1, wherein the method further comprises: receiving, by the server, a request from the user device to access the irrigation environment; and transmitting, by the server, a response to the request to the user device, the response including the access information. The method further comprises: Data message contains message ID, name and data; The mobile node sending the search message calculates the distance between each name in the preset name set and its coordinates, arranges all names in the name set in ascending order according to the calculated distance value, that is, the distance between the first name and the coordinates of the mobile node is the closest, and the distance between the last name and the coordinates of the mobile node is the farthest, selects a neighbor table entry, the type of the neighbor table entry is 0 and the distance between the coordinates and the first name in the name set is the closest, in the sent search message, message ID is 5, node ID is the node ID in the neighbor table entry, name set is the name set.

4. The method of claim 1-3, wherein, The method further comprises: The end nodes elect the backbone nodes by sending a build message, the irrigation area sets a virtual center node with coordinates ( x max +x min ) / 2,( y max +y min ) / 2), x min and x max are the minimum and maximum abscissas for the irrigation area, y min and y max are the minimum and maximum ordinates.

5. The method of claim 1-3, wherein, The method further comprises: Each mobile node maintains a neighbor table, a neighbor table entry contains node ID, coordinates, type and life cycle, type value 0 indicates that the mobile node identified by the node ID of the neighbor table entry is a backbone node, type value 1 indicates that the mobile node identified by the node ID of the neighbor table entry is an end node; neighbor message contains message ID, node ID, coordinates and type; the neighbor message sent by the mobile node, message ID is 1, node ID, coordinates and node type are respectively the node ID, coordinates and node type of the mobile node.

6. The method of claim 1-3, wherein, The method further comprises: The data message sent by the backbone node receiving the search message, message ID is 6, name and data are respectively equal to the name and data of the irrigation table entry in which the name is contained in the name set in the search message; the processing table entry created by the backbone node receiving the search message, name is equal to the name in the name set in the search message, life cycle is set as maximum value.

7. The method of claim 1-3, wherein, The method further comprises: The backbone node forwarding the lookup message selects a neighbor table entry whose type is 0 and whose distance between the coordinate and the first name in the name set in the lookup message is less than the distance between its own coordinate and the first name in the name set in the lookup message, and in the forwarding lookup message, the node ID is equal to the node ID of the neighbor table entry.

Images