A Parallel Computing Algorithm for Moving Targets Tracking in Wireless Sensor Networks

DOI

10.2991/ifmeita-16.2016.10How to use a DOI?

Keywords

Wireless Sensor Networks (WSN); Collaborative tracking; Feature extraction; Dynamic clustering algorithm; Parallel computing.

Abstract

In this paper, we address the problem of moving target feature extraction and collaborative tracking in wireless sensor networks (WSN), and present a parallel computing algorithm for moving human collaborative tracking. At first, WSN optimization deployment: divide the monitors in WSN into the two types: Behavior Recognition Monitor (BRM) and Collaborative Tracking Monitor (CTM), and settle all the monitors utilizing FCM algorithm into many groups. Secondly, parallel detection and behavior recognition to get the collaborative tracking target. Finally, a multi-points feature extraction scheme for WSN monitors to track the suspicious target collaboratively. We also compare our algorithm with three existing solutions, the statistics result shows that our scheme has a better detection accuracy and tracking performance.

Copyright

© 2016, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Jing Xiong
AU  - Zhi-Jing Liu
AU  - Guo-Liang Tang
PY  - 2016/01
DA  - 2016/01
TI  - A Parallel Computing Algorithm for Moving Targets Tracking in Wireless Sensor Networks
BT  - Proceedings of the 2016 International Forum on Management, Education and Information Technology Application
PB  - Atlantis Press
SP  - 51
EP  - 56
SN  - 2352-5398
UR  - https://doi.org/10.2991/ifmeita-16.2016.10
DO  - 10.2991/ifmeita-16.2016.10
ID  - Xiong2016/01
ER  -