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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.