An efficient dynamic clustering algorithm for object tracking in Wireless Sensor Networks

Object Tracking Sensor Network (OTSN) is one of the important applications of Wireless Sensor Networks. Nowadays many researchers are developing in this OTSN field. Because OTSN is for detecting moving object, traditional static clustering algorithms are not suitable. Therefore, we need a dynamic clustering algorithm for efficient data aggregation and data routing in OTSN. There are many dynamic clustering algorithms in OTSN. However, there may be overlap area between two clusters which would cause redundant data and unnecessary data transmissions from the cluster head to base station. Thus, an algorithm is needed to reduce these unnecessary data transmissions. This paper proposes an algorithm not only to avoid redundant data but also reduce energy consumption based on prediction result of moving objects. It also introduces an algorithm for cluster formation to minimize the overlap area of clusters. And our simulation results show that our Dynamic Clustering algorithm can achieve more energy efficiency and better performance.