Data Scheduling Algorithm for Mobile Sensor Networks Based on Lagrange Matching Opti-mization Mechanism
Absrtact:In order to solve the problems of low node matching efficiency,weak sink node scheduling ability,especially the difficulty in controlling network jitter,which exist in current mobile sensor network data scheduling algorithms,a data scheduling algorithm for mobile sensor networks based on Lagrangian matching optimization mechanism is proposed.First of all,a scheduling model that integrates data cost,polling time slice and service reliability is designed.Using ascending order and combining time slice model to schedule resources can better meet the demand of sink nodes for resource scheduling.Subsequently,the algorithm introduces the Lagrangian optimization matching mechanism,and conducts multiple differential processing for the three parameters of data cost,polling time slice and service reliability under resource constrained conditions,which can achieve the optimal solution of data cost,polling time slice and service reliability,significantly improve the network's ability to schedule data and improve network jitter.Simulation results show that the proposed algorithm has the characteristics of low node scheduling failure rate and good network link jitter suppression effect,and has high practical deployment value.
mobile sensor networktime sliceLagrange optimizationdifferential
NETL
NSTL
万方数据
