.png){kind=icon}
Return
A dynamic lookahead tree based tracking algorithm for wireless sensor networks using particle filtering technique
.png){kind=icon}
PRE
AI
DOI：10.1016/j.compeleceng.2013.06.014.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this study, five different algorithms are provided for tracking targets that move very fast in wireless sensor networks. The first algorithm is static and clusters are formed initially at the time of network deployment. In the second algorithm, clusters that have members at one hop distance from the cluster head are provided dynamically. In the third algorithm, clustered trees where members of a cluster may be more than one hop distance from the cluster head are provided dynamically. In the fourth, algorithm lookahead trees are formed along the predicted trajectory of the target dynamically. Linear, Kalman and particle filtering techniques are used to predict the target's next state. The algorithms are compared for linear and nonlinear motions of the target against tracking accuracy, energy consumption and missing ratio parameters. Simulation results show that, for all cases, better performance results are obtained in the dynamic lookahead tree based tracking approach. (C) 2013 Elsevier Ltd. All rights reserved.
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.9
Papers:
6.7K
Citations:
1.3W
Organization
Cited Papers
ShareSaveShareSaveCellular and molecular actions of binary toxins possessing ADP-ribosyltransferase activity.png)
Toxicon
ToxiconIF0
PREAI
ShareSaveShareSaveControlled vapor deposition approach to generating substrate surface energy/chemistry gradients
PREAI
ShareSaveSmall target detection using cross product based on temporal profile in infrared image sequences
PREAI
ShareSaveShareSave
View more