Research On Multi-Vehicle Cooperative Charging Scheduling Technology Based On Dynamic Priority In WRSNs

As a core technology of Io T applications,Wireless Sensor Networks(WSNs)have been widely used in industry,agriculture,smart home and other fields.However,due to the limited battery capacity carried by sensor nodes,the energy issue of Wireless Sensor Networks has become a major factor limiting its development.With the development of wireless charging technology,it has become a reality to use mobile robots or Mobile Charging Vehicles(MCV)to replenish power to nodes in sensor networks,resulting in Wireless Rechargeable Sensor Networks(WRSNs).However,the network scale in practical applications is often large and the MCV moving speed and energy supply rate are low.Therefore,many scholars and experts have carried out research from different network clustering methods and different wireless charging strategies.The various MCV scheduling schemes proposed have not only effectively extended the network lifetime,but also improved the charging efficiency,enabling the network to adapt to a wider and more complex environment.Based on the existing research,this thesis proposes a multi-vehicle cooperative charging scheduling technology based on dynamic priority in WRSNs.Firstly,a Power based Fuzzy C-means(PFCM)clustering strategy based on node energy consumption is designed.To ensure that the nodes in each cluster are relatively concentrated in space,the energy consumption is balanced within a period of time,and the optimal number of clusters in the current network is determined according to the clustering effectiveness analysis.Secondly,the relationship between the current moment,charging deadline,remaining life time and other time scales of the network operation is analyzed to calculate the urgency of charging task execution,while a dynamic priority calculation method is developed based on the node membership attribute of the clustering results,and the charging sequence is constructed on the basis of dynamic priority.Finally,a Multi-Vehicle Cooperative Scheduling based on Urgency and Membership(UM-MVCS)algorithm is proposed to ensure that each MCV serves the cluster node and has spare capacity.It also charges nodes in other clusters in order to reduce node mortality,and make full use of the idle time of MCV to improve its energy utilization and improve the performance of the entire network.Simulation experiments show that the algorithm mentioned in this thesis has obvious advantages compared with the traditional clustering strategies of K-means and FCM,which not only reduces the distance and standard deviation of energy consumption,but also reduces the node mortality,while reducing the charging task duration of MCVs and improving the speed of being responded to charging requests compared to the m TS algorithm.