A method for monitoring and controlling plant growth parameters based on wireless sensor implementation network

Abstract

The invention relates to a method for monitoring and controlling growth parameters of facility crops based on a wireless sensor executing network. The method is characterized by comprising three states, namely a clustering formation stage, an intra-cluster update stage and a cluster head re-election stage. According to the method, a wireless sensor and actor network (WSAN) technology is applied to the facility crops, a cooperate routing protocol-a dynamic clustering-based angle forwarding routing protocol suitable for the WSAN is provided, and a real-time task distribution algorithm RTAA-SFPA based on sealing first price auction is also provided. By the method, automation, networking and intelligentization of facility crop application can be realized, and real-time performance, reliability and low energy consumption of facility crop management can be realized.

Description

technical field [0001] The present invention relates to the fields of wireless network communication technology, sensor technology, microelectronics technology, computer technology, distributed information processing technology, collaborative cooperation technology, and intelligent control technology. The method for monitoring and controlling the growth parameters of facility crops (fruits and vegetables, flowers) is characterized in that it adopts a three-layer cooperation model: a sensor (Sensor) node network monitoring and control method for facility crop growth environment parameters, and belongs to the technical field of wireless sensor networks. Background technique [0002] Traditional facility crops are often managed by machines and equipment in isolation. Since there is no communication capability between devices, it is impossible to get rid of the embarrassing situation of relying on manpower to monitor crop growth. Since the 1990s, with the development of microele...

AI Technical Summary

Problems solved by technology

The classic routing algorithms for flat routing protocols include flooding, DD directional diffusion, AODV distance routing and GEAR geographic location routing. However, these routing protocols need to forward a large number of data packets when selecting the next hop node, which seriously consumes the network. bandwidth, and the delay of data packet arrival is large, which cannot meet the low energy consumption and real-time requirements of WSAN network

The classic algorithms for hierarchical routing protocols include LEACH low-energy adaptive algorithm, LSCA dynamic clustering algorithm based on link state, and TEEN energy-effective routing based on threshold, but these routing protocols have a common disadvantage that CLH energy consumption is too fast , the network needs to re-elect cluster heads frequently, and at the same time, some protocols have insufficient consideration for the re-selection of cluster heads, which seriously shortens the network life cycle

[0007] As for how the cluster head node reports the event to the executor node, there are many ways: the DDLSC routing protocol uses the LSCA algorithm to cluster the sensor nodes, and uses the Directed Diffusion (DD) method for the cluster head node to transfer the event from the cluster head node Report to the executor node. This method broadcasts the interest message in the whole network through flooding to establish the path to the executor node. At the same time, it needs to periodically send the reinforcement (reinforcement) message to repair the path. Therefore, this method occupies Network bandwidth, waste of network resources and large transmission delay cannot meet the energy consumption and real-time requirements of WSAN; the method of cooperative routing (CooperateRouting) requires each node in the cluster head CLH1 to know its own overhead to CLH2, and then through multi-hop Transmission, which is not realistic in actual application and the delay is too large to meet the real-time requirements of WSAN network; based on the location-aided method, the node selects the node closest to the destination node as the next-hop node according to the coordinates, In this method, each node needs to be positioned. At the same time, the calculation of the coordinates is very complicated and the calculation amount is large. The calculation of the coordinates causes a great burden on the energy of the nodes, so it cannot meet the requirements of the WSAN network for energy consumption. However, this method is compared with other methods. It has a good performance in real-time performance; the source host selects the next-hop route with the help of angle information and geographic location information in the route discovery stage, but the angle information is manually specified, lacking theoretical support, and each time it chooses the nearest Actor Host forwarding, which will cause the host near the executor node to die prematurely, resulting in uneven energy consumption of the entire network, but the protocol uses angle information to reduce the flooding of data packets and network delay

Images