LEACH-MTC: A network energy optimization algorithm constraint as moving target prediction

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

When some nodes cooperatively track moving targets in a wireless sensor network, some things including network working node selection and network energy consumption are influenced. Thus, this paper proposes an improved algorithm LEACH-MTC (LEACH with Moving Target Constraint) based on low energy adaptive clustering hierarchy protocol (LEACH). First, based on the two-step linearization of the nonlinear dynamic model, the state of the nonlinear moving target is predicted by the extended Kalman filter (EKF). Second, combining the state prediction of the moving target and the performance of collaborative monitoring, this paper constructs an ellipse monitoring area of some working nodes to consist with the direction of the target movement. Subsequently, the node sleep strategy corresponding to the state prediction of moving target is designed. Finally, the cluster head selection strategy is proposed based on energy balance utilizing the state prediction of the moving target. Simulation results show that the proposed LEACH-MTC algorithm can not only ensure the real-time consistency between the changing direction of area and the direction of target movement, but also increase the number of working nodes’ survival and reduce the network energy consumption.

Cite

CITATION STYLE

APA

Fu, C., Zhou, L., Hu, Z., Jin, Y., Bai, K., & Wang, C. (2021). LEACH-MTC: A network energy optimization algorithm constraint as moving target prediction. Applied Sciences (Switzerland), 11(19). https://doi.org/10.3390/app11199064

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free