TRUSTWORTHY OPTIMIZED CLUSTERING BASED TARGET DETECTION AND TRACKING FOR WIRELESS SENSOR NETWORK
Abstract
vioft2nntf2t|tblJournal|Abstract_paper|0xf4ff3b501f00000044f4040001000100
In this paper, an efficient approach is proposed to address the problem of target tracking in wireless sensor network (WSN). The problem being tackled here uses adaptive dynamic clustering scheme for tracking the target. It is a specific problem in object tracking. The proposed adaptive dynamic clustering target tracking scheme uses three steps for target tracking. The first step deals with the identification of clusters and cluster heads using OGSAFCM. Here, kernel fuzzy c-means (KFCM) and gravitational search algorithm (GSA) are combined to create clusters. At first, oppositional gravitational search algorithm (OGSA) is used to optimize the initial clustering center and then the KFCM algorithm is availed to guide the classification and the cluster formation process. In the OGSA, the concept of the opposition based population initialization in the basic GSA to improve the convergence profile. The identified clusters are changed dynamically. The second step deals with the data transmission to the cluster heads. The third step deals with the transmission of aggregated data to the base station as well as the detection of target. From the experimental results, the proposed scheme efficiently and efficiently identifies the target. As a result the tracking error is minimized.

Authors
C. Jehan1, D. Shalini Punithavathani2
Tamizhan College of Engineering and Technology, India1, Government College of Engineering, Tirunelveli, India2

Keywords
Clustering, Dynamic, Target Tracking, Static, Oppositional, Gravitational Search
Yearly Full Views
JanuaryFebruaryMarchAprilMayJuneJulyAugustSeptemberOctoberNovemberDecember
000000000001
Published By :
ICTACT
Published In :
ICTACT Journal on Communication Technology
( Volume: 7 , Issue: 2 , Pages: 1326-1333 )
Date of Publication :
June 2016
Page Views :
182
Full Text Views :
1

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.