Multiple Targets Tracking Using Kinematics in Wireless Sensor Networks
- 1
- 2
- 3
Abstract
Target tracking is considered as one of the cardinal applications of a wireless sensor network. Tracking multiple targets is more challenging than tracking a single target in a wireless sensor network due to targets’ movement in different directions, targets’ speed variations and frequent connectivity failures of low powered sensor nodes. If all the low-powered sensor nodes are kept active in tracking multiple targets coming from different directions of the network, there is high probability of network failure due to wastage of power. It would be more realistic if the tracking area can be reduced so that less number of sensor nodes will be active and therefore, the network will consume less energy. Tracking area can be reduced by using the target’s kinematics. There is almost no method to track multiple targets based on targets’ kinematics. In our paper, we propose a distributed tracking method for tracking multiple targets considering targets’ kinematics. We simulate our method by a sensor network simulator OMNeT++ and empirical results state that our proposed methodology outperforms traditional tracking algorithms.
- C. Sharp, S. Schaffet, A. Woo, N. Sastri, C. Karlof, S. Sastry and D. Culler, “Design and Implementation of a Sensor Network and Autonomous Interception,” Proceedings of the 2nd European Workshop on Wireless Sensor Networks, 2005.
- G. W. Allen, K. Lorincz, M. Welsh, O. Marcillo, J. Johnson, M. Ruiz and J. Lees, “Deploying a Wireless Sensor Network on an Active Volcano,” IEEE Internet Computing, March-April 2006.
- E. Yoneki and J. Bacon, “A Survey of Wireless Sensor Network Technologies: Research Trends and Middleware’s Role,” Ph.D. Dissertation, University of Cambridge, Cambridge, 2005.
- W. Zhang and G. Cao, “Dynamic Convoy Tree based Collaboration for Target Tracking in Sensor Networks,” IEEE Transactions on Wireless Communication, September 2004.
- J. Jeong, T. Hwang, T. He and D. Du, “(MCTA) Target Tracking Algorithm based on Minimal Contour in Wireless Sensor Networks,” Technical Report, University of Minnesota, Twin Cities, 2007.
- S. M. LaValle, “Planning Algorithms,” Cambridge University Press, Cambridge, 2006.
- “OMNeT++ Community Site,” http://www.omnetpp.org.
- Y. Bar-Shalom and T. E. Fortmann, “Tracking and Data Association,” Academic Press Professional, San Diego, 1987.
- H. Yang and B. Sikdar, “A Protocol for Tracking Mobile Targets using Sensor Networks,” Proceedings of the IEEE Workshop on Sensor Network Protocols and Applications, 2003.
- “Tinynode,” http://www.tinynode.com
- W. AlSalih, K. Islam, Y. N. Rodriguez and H. Xiao, “Distributed Voronoi Diagram Computation in Wireless Sensor Networks,” Proceedings of the 20th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2008.
- X. Du and F. Lin, “Maintaining Differentaited Coverage in Heterogenous Sensor Networks,” EURASIP Journal on Wireless Communication and Networking, August 2002.
- Bob Stein, “A Point About Polygons,” Linux Journal, March 1997.
- J. A. Stankovic, T. Abdelzaher, and T. He, “Lightweight Detection and Classification for Wireless Sensor Networks in Realistic Environments,” Proceedings of the 3rd ACM Conference on Embedded Networked Sensor Systems, 2005.
- R. R. Brooks, P. Ramanathan, and A. M. Sayeed, “Distributed Target Classification and Tracking in Sensor Networks,” Proceedings of the IEEE, 2003.