Wireless Sensor Networks Node Scheduling Algorithm Based on BQPSO
Mei Liu · Science Technology and Engineering · 2011
On the premise of meeting tracking precision in wireless sensor networks,it is necessary that the maximum limit to reduce the use of sensor resources in multiple target tracking.Based on this objective,it designs node tracking objective function through choosing nodes appropriately to avoid too high colinearity,then using APIT to achieve accurate positioning and considering the total energy consumption of cluster,uses node scheduling algorithm by binary quantum particle swarm optimization to solve sensor resource conflict problem.The simulation results show that the nodes scheduling algorithm based on BQPSO than the nodes scheduling algorithm based on PSO increased 17.47% in energy consumption,but improved 31.84% in location accuracy.The algorithm reaches tracking accuracy requirements,minimizes the network resource utilization and prolongs the working life of wireless sensor networks.