Wireless sensor network node scheduling method based on improved binary particle swarm optimization

Abstract

The invention discloses a wireless sensor network node scheduling method based on improved binary particle swarm optimization, and the method comprises: firstly carrying out coding of positions and speeds of particles in an improved binary particle swarm optimization algorithm population on the premise that the coverage rate and connectivity constraints of a wireless sensor network are met; evaluating a fitness value of each particle, setting a current position of each initial particle as an individual optimal position, and setting the position of the particle with the maximum fitness value inthe particle swarm as a global optimal position; updating the speed and the binary position of each initial particle; executing mutation operation; judging whether the coverage rate and connectivityconstraints of newly generated particles are met or not; and when the number of iterations reaches a preset maximum value, stopping, and taking the finally obtained global optimal position as a node scheduling scheme. The node scheduling method can meet the coverage rate and connectivity constraints, and meanwhile, the network energy consumption is optimized and the network survival time is prolonged.

Description

technical field [0001] The invention relates to the technical field of sensor networks, in particular to a wireless sensor network node scheduling method based on improved binary particle swarm optimization. Background technique [0002] Due to the low cost and miniaturization of sensor nodes, wireless sensor networks can be deployed redundantly on a large scale in the monitoring area. Redundant nodes can increase the survival time and fault tolerance of the network, and at the same time aggravate network communication interference, reduce communication efficiency, and improve The total energy consumption of the network. Based on the redundant deployment of sensor nodes and the limited energy, computing and communication capabilities of a single node, only a subset of the wireless sensor network is needed to complete the monitoring task, and it is necessary to control the working status of the sensor network nodes through the node scheduling method to reduce energy consumpti...

AI Technical Summary

Problems solved by technology

[0003] The working state of the sensor nodes is controlled by node scheduling to obtain a set of working nodes that meet the coverage and connectivity constraints and can achieve optimal energy usage and network lifetime. The node scheduling problem under the coverage constraints is NP For complete problems, it is necessary to use heuristic methods to solve the optimal node scheduling scheme, but using the heuristic methods in the prior art, the computational complexity will increase exponentially with the increase of the problem size, and it is easy to fall into a local minimum

Images