An adaptive cone based distributed tracking algorithm for a highly dynamic target in wireless sensor networks
by Aysegul Alaybeyoglu; Kayhan Erciyes; Aylin Kantarci
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 12, No. 2, 2013

Abstract: Accurate tracking of a target is imperative in military as well as civil applications. In this study, we propose a distributed cone based tracking algorithm for a target that can move with highly dynamic kinematics along linear and nonlinear trajectories. The algorithm provides wakening of a group of nodes in a cone shaped region along the trajectory of the target and particle filtering is used in the prediction of the next state of the target to decrease the target missing ratios. Algorithm used is adaptive in that the shape of the cone is determined dynamically in accordance with the target kinematics. We compared our algorithm with traditional tracking approaches, a recent tracking algorithm (Semi-Dynamic Clustering (SDC)) and other tracking algorithms that we have previously proposed. Simulation results show that, in terms of target missing ratios, our algorithm is superior to all of these algorithms. Secondly, lower target missing ratios lead to less frequent execution of recovery mechanisms which in turn results in lower energy consumptions.

Online publication date: Thu, 28-Feb-2013

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com