Abstract

In WSN most of the target detection and tracking algorithms require the sensors to work in groups in order to advance the consistency of target tracking algorithms. This makes it necessary for deploying sensors to discover and group together so that their coverage can be maximized. In this study we have proposed a distributed clustering algorithm for effectively detecting the Target location. The proposed clustering algorithm is distributed in nature and has the ability to reconfigure in the event of node failure. The algorithm is highly localized and hence does not need flooding across the entire network. Since the algorithm allows for more clusters to track the same region the system reliability is greatly improved. The algorithm builds a series of over-lapping clusters which allow for more than one cluster to track a region. This redundancy improves the overall system reliability. The overlapping clusters also allow for tracking of curvilinear targets.

Keywords:

Cluster, energy conservation, route discovery, target detection, WSN,

References

1. Arora, A., P. Dutta, S. Bapat, V. Kulathumani, H. Zhang, V. Naik, V. Mittal, H. Cao, M. Demirbas, M. Gouda, Y. Choi, T. Herman, S. Kulkarni, U. Arumugam, M. Nesterenko, A. Vora and M. Miyashita, 2004. A line in the sand: A wireless sensor network for target detection, classification and tracking. Int. J. Comput. Telecom. Network., 46: 605-634.
   CrossRef    
2. Bar-Shalom, Y. and T.E. Fortmann, 1998. Tracking and Data Association. Academic Press, Boston.
   
3. Brooks, R. and C. Griffin, 2002. Traffic model evaluation of ad hoc target tracking algorithms. Int. J. High Perform. C., 16(3): 221-234.
   CrossRef    
4. Fonoage, M., M. Cardei and A. Ambrose, 2010. A QoS based routing protocol for wireless sensor networks. Proceeding of IEEE 29th International Performance Computing and Communications Conference (IPCCC, 2010), pp: 122-129.
   
5. Hall, D.L., 1992. Mathematical Techniques in Multisensor Data Fusion. Artech House, Boston.
   
6. Heinzelman, W.B., A.P. Chandrakasan and H. Balakrishnan, 2000. Energy-efficient communication protocol for wireless microsensor networks. Proceeding of the 33rd Annual Hawaii International Conference on System Science. Maui, Hawaii, pp: 1-10.
   CrossRef    
7. Jing, T., S. Hichem and R. Cedric, 2007. Binary variational filtering for target tracking in sensor networks. Proceeding of IEEE/SP 14th Workshop on Statistical Signal Processing, pp: 685-689.
   
8. Kaushik, C. and S. Abhrajit, 2011. An energy efficient data gathering scheme in WSN using spannig tree. Proceeding of IEMCON 2011 Organised by IEM in Collaboration with IEEE on 5th and 6th of Jan, 2011.
   
9. Kiran, M., K. Kamal and G. Nitin, 2011. Efficient cluster head selection scheme for data aggregation in wireless sensor network. Int. J. Comput. Appl., 23(9):112-119.
   
10. Lung, C.H. and C. Zhou, 2010. Using hierarchical agglomerative clustering in wireless sensor networks: An energy-ef?cient and ?exible approach. Ad Hoc Netw., 8: 328-344.
    CrossRef    
11. Oh, S., P. Chen, M. Manzo and S. Sastry, 2006. Instrumenting wireless sensor networks for real-time surveillance. Proceeding of the International Conference in Robotics and Automation.
    
12. Qi, Y., Z. Yuxiang and L. Hui, 2011. An multi-hop cluster based routing protocol for wireless sensor networks. J. Converg. Inform. Technol., 6(3).
    
13. Wang, Y., 2008. Topology Control for Wireless Sensor Networks. In: Li, Y., M.T. Thai and W. Wu (Eds.), Wireless Sensor Networks and Applications, Signals and Communication Technology. Springer, US, pp: 113-147.
    CrossRef    PMCid:PMC4651245    
14. Watfa, M., W. Daher and H. Al Azar, 2009. A sensor network data aggregation technique. Int. J. Comput. Theor. Eng., 1(1): 19-26.
    CrossRef    

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.