Heterogeneous sensing node movement scheduling method for optimizing network survival time and coverage

Abstract

The invention discloses a heterogeneous sensing node movement scheduling method for optimizing network survival time and coverage, and the method is a distributed method, and comprises the steps that a static sensing node, a moving sensing node and a Sink node respectively execute different working methods. The method solves a problem of a coverage blind area caused by the deployment and failure of a heterogeneous sensing node, gives consideration to a sensing radius isomerism of the heterogeneous sensing node, and achieves the calculation of a staying position of the moving sensing node according to the information of the neighbor sensing nodes. A coverage scheduling model is built according to the position reported by the static sensing node, a heuristic solving method is employed for solving the scheduling model, and a better scheme of the staying position of the moving sensing node is obtained. Therefore, the method improves the area coverage rate and increases the survival number of static sensing nodes. No matter how the number of moving sensing nodes changes, the method improves the network survival time and reduces the mean energy consumption of the static sensing nodes under the condition that the same area coverage rate is maintained.

Description

technical field [0001] The invention relates to the field of mobile wireless sensor networks, in particular to a mobile scheduling method for heterogeneous sensor nodes that optimizes network survival time and coverage. Background technique [0002] In wireless sensor networks (WSNs), the energy constraints of nodes limit the basic functions such as network coverage and lifetime. Network coverage ensures that data collected from sensor nodes is an accurate representation of the entire monitored area. According to different sensing objects, network coverage can be divided into target coverage, fence coverage and area coverage. Among them, the target coverage requires that the sensor nodes can cover all the target points. When the target points are all over the monitoring area and the number is sufficient, the target coverage problem can be transformed into an area coverage problem. Fence coverage requires sensor nodes to completely cover a straight line. When the number o...

AI Technical Summary

Problems solved by technology

However, the related methods of heterogeneous static sensor nodes also have the problem of energy holes, and the coverage optimization problem of heterogeneous mobile sensor nodes is mainly biased towards assuming that all sensor nodes are mobile, which has a large hardware cost.

Images