A Practical Target Tracking Technique in Sensor Network Using Clustering Algorithm

  • Wang L
  • Wu C
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Sensor network basically has many intrinsic limitations such as energy consumption, sensor coverage and connectivity, and sensor processing capability. Tracking a moving target in clusters of sensor network online with less complexity algorithm and computational burden is our ultimate goal. Particle filtering (PF) technique, augmenting handoff and K-means classification of measurement data, is proposed to tackle the tracking mission in a sensor network. The hand- off decision, an alternative to multi-hop transmission, is implemented for switching between clusters of sensor nodes through received signal strength indication (RSSI) measurements. The measurements being used in particle filter proc- essing are RSSI and time of arrival (TOA). While non-line-of-sight (NLOS) is the dominant bias in tracking estima- tion/accuracy, it can be easily resolved simply by incorporating K-means classification method in PF processing with- out any priori identification of LOS/NLOS. Simulation using clusters of sensor nodes in a sensor network is conducted. The dependency of tracking performance with computational cost versus number of particles used in PF processing is also investigated.

Cite

CITATION STYLE

APA

Wang, L. K., & Wu, C.-C. (2012). A Practical Target Tracking Technique in Sensor Network Using Clustering Algorithm. Wireless Sensor Network, 04(11), 264–272. https://doi.org/10.4236/wsn.2012.411038

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free