Affiliation:
1. Federal University of Western Para, Santarém-PA-Brazil
2. Federal University of Amazonas, Manaus-AM-Brazil
3. University of Ontario Institute of Technology, Oshawa-ON-Canada
Abstract
Target-tracking algorithms typically organize the network into a logical structure (e.g., tree, cluster, or faces) to enable data fusion and reduce communication costs. These algorithms often predict the target’s future position. In addition to using position forecasts for decision making, we can also use such information to save energy by activating only the set of sensors nearby the target’s trajectory. In this work, we survey of the state of the art of target-tracking techniques in sensor networks. We identify three different formulations for the target-tracking problem and classify the target-tracking algorithms based on common characteristics. Furthermore, for the sake of a better understanding of the target-tracking process, we organize this process in six components: target detection, node cooperation, position computation, future-position estimation, energy management, and target recovery. Each component has different solutions that affect the target-tracking performance.
Publisher
Association for Computing Machinery (ACM)
Subject
General Computer Science,Theoretical Computer Science
Cited by
59 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献