Dynamic clustering algorithm for tracking targets with high and variable celerity (ATHVC)

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

Abstract

Target tracking with the wireless sensors networks is to detect and locate a target on its entire path through a region of interest. This application arouses interest in the world of research for its many fields of use. Wireless sensor networks, thanks to their versatility, can be used in many hostile and inaccessible to humans environments. However, with a limited energy, they cannot remain permanently active, which can significantly reduce their lifetime. The formation of a cluster network seems an effective mechanism to increase network lifetime. We propose to build optimal dynamic clusters on the target trajectory. For increasing energy efficiency, our algorithm integrates for the first time, to our knowledge, strategies to avoid overlapping clusters and a model to wake up the sensors, adapting to the context of targets with large and variable speed.

Cite

CITATION STYLE

APA

Toumi, M., Maizate, A., Ouzzif, M., & Said Salah, M. (2016). Dynamic clustering algorithm for tracking targets with high and variable celerity (ATHVC). Journal of Computer Networks and Communications, 2016. https://doi.org/10.1155/2016/7631548

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