Dynamic group scheduling method based on wireless sensor network

Abstract

The invention discloses a dynamic group scheduling method based on a wireless sensor network, comprising the steps: using Kalman filtering waves to predict and trace a target track; using a new dynamic group method to select the range of the next task sensor node; selecting the next sensor node as a task node according to the average energy consumption and the prediction precision in a sampling period, and selecting different sampling intervals according to energy and precision requirements. When the mode satisfies the precision requirement, the energy most-saving factor is considered to select the sampling intervals; when the node can not satisfy the precision requirement, the precision and energy consumption is comprehensively considered, and a weighted-average method is adopted to select the next task sensor node. The dynamic group scheduling method adopts a dynamic group to search the range of the next task sensor node in a limiting mode, shortens the scheduling time of the sensor node, is beneficial to the real-time target trace of the wireless sensor network, adopts variable sampling intervals, maintains the precision and is beneficial to saving energy simultaneously.

Description

technical field [0001] The invention relates to a wireless sensor network resource scheduling algorithm, in particular to a dynamic group scheduling method based on a wireless sensor network. Background technique [0002] Wireless sensor networks have the characteristics of large number of nodes, small size, self-organization, rapid deployment, limited battery energy, and limited computing and communication resources. Therefore, in a wireless sensor network with a large number of nodes, how to effectively and reasonably allocate resources, schedule and save energy to prolong the service life of the entire network has become a key technology for the wide application of wireless sensor networks. [0003] An important aspect of resource allocation in wireless sensor networks is the scheduling of task nodes. The current node scheduling methods mainly include: minimum distance based scheduling, minimum trace scheduling, adaptive scheduling, etc. Among them, the scheduling metho...

AI Technical Summary

Problems solved by technology

Among them, the scheduling method based on the minimum distance is simple and easy to use, and it is also easy to implement in the sensor network, but it does not consider the requirements of energy consumption and accuracy, and it is easy to generate error accumulation in the sensor nodes, thereby deteriorating the performance of the entire network; minimum trace scheduling It is a scheduling method based on the trace of the covariance matrix of the prediction error, which essentially only considers the performance index of accuracy, and does not consider the requirement of energy; the adaptive scheduling method uses the weighting of the two indicators of accuracy and energy as a cost function, using It is used as the basis for selecting the next task node, but this algorithm does not limit the scheduling range of sensors, nor does it consider the limited resources of sensor nodes and the real-time requirements of wireless sensor networks

Images