Abstract
Target tracking is one of the important applications of wireless sensor networks (WSNs). Most of the existing approaches assume that the nodes are dense enough and ignore the coverage holes which are very common in WSNs because of random deployment of the sensor nodes, block of obstacles, etc. Besides, predicting the target’s location of the next time instance is unwise because of the quite a lot random factors. In this paper, we propose a novel target tracking approach without any predicting, called k-nearest neighbors tracking (k-NNT), to tackle the problems of energy efficiency, continuity and coverage holes. In k-NNT, only the k-nearest neighbors keep active and track the target when more than k nodes can sense the target; the k′-nearest neighbors work when there are only k′ nodes (k′ < k) can sense the target. A sophisticated rotation mechanism is designed to improve the continuity of the tracking process. In the worst case, none of the nodes can sense the target, i.e., the target enters into the coverage holes, and then k-NNT recovers by the Round Up mode (RU mode). The nodes on the perimeter of the coverage hole always keep active for a time threshold t and sense the around environment to find the target in time. Once a node finds the target, the RU mode is over and the irrelevant nodes turn into inactive mode. A series of simulation show that k-NNT performs superiorly compared with several existing approaches in terms of tracking accuracy, continuity and energy efficiency.
Similar content being viewed by others
References
Bhuiyan MZA, Wang G, Wu J (2009) Target tracking with monitor and backup sensors in wireless sensor networks. In: Computer communications and networks, 2009. ICCCN 2009. Proceedings of 18th international conference on IEEE, 2009, pp 1–6
Agarwal PK et al (1995) Constructing levels in arrangements and higher order voronoi diagrams. SIAM J Comput 27(3):67–75
Wang X et al (2007) Prediction-based dynamic energy management in wireless sensor networks. Sensors 7(3):251–266
Zhang P, Martonosi M (2008) LOCALE: collaborative localization estimation for sparse mobile sensor networks. In: 2008 international conference on information processing in sensor networks IEEE computer society, 2008, pp 195–206
Wang Z et al (2010) A novel mobility management scheme for target tracking in cluster-based sensor networks. In: Proceedings of the 6th IEEE international conference on distributed computing in sensor systems. Springer, New York, pp 172–186
Yang H, Sikdar B (2003) A protocol for tracking mobile targets using sensor networks. In: Proceedings of IEEE IWSNPA, pp 71–81
Wang G et al (2014) Detecting movements of a target using face tracking in wireless sensor networks. IEEE Trans Parallel Distrib Syst 25(4):939–949
Zhong Z et al (2009) Tracking with unreliable node sequences. In: INFOCOM 2009, IEEE, 2009
Kaplan LM (2006) Global node selection for localization in a distributed sensor network. IEEE Trans Aerosp Electron Syst 42.1:113–135
Kaplan LM (2006) Local node selection for localization in a distributed sensor network. IEEE Trans Aerosp Electron Syst 42.1:136–146
Zhang L et al (2015) Mobility-aware routing in delay tolerant networks. Personal Ubiquitous Comput 19(7):1–13
Ammari HM, Das SK (2011) Centralized and clustered k-coverage protocols for wireless sensor networks. IEEE Trans Comput 61(1):118–133
Adlakha S, Srivastava M (2003) Critical density thresholds for coverage in wireless sensor networks. In: Wireless communications and networking, 2003. WCNC 2003. 2003 IEEE 2003, vol 3, pp 1615–1620
Bai X et al (2010) Deploying wireless sensors to achieve both coverage and connectivity. In: Proceedings of ACM international symposium on mobile Ad Hoc networking and computing, pp 131–142
Ye W, Heidemann J, Estrin D (2004) Medium access control with coordinated adaptive sleeping for wireless sensor networks. IEEE/ACM Trans Netw 493–506
Lee DT (1982) On k-nearest neighbor Voronoi diagrams in the plane. IEEE Trans Comput 31(6):478–487
De Berg M et al (1997) Computational geometry: algorithms and applications. Springer, New York
Gabriel KR, Sokal RR (1969) A new statistical approach to geographic variation analysis. Syst Biol 18(3):259–278
Toussaint G (1980) The relative neighborhood graph of a finite planar set. Pattern Recognit 12(4):261–268
Jaromczyk JW, Toussaint GT (1992) Relative neighborhood graphs and their relatives. In: Proceedings of IEEE 1992, pp 1502–1517
Karp B (2000) GPSR: greedy perimeter stateless routing for wireless networks. In: MOBICOM 2000, pp 243–254
Su TH, Chang RC (1991) Computing the k-relative neighborhood graphs in Euclidean plane. Pattern Recognit 24(91):231–239
Su T-H, Chang R-Ch (1990) The k-gabriel graphs and their applications. In: Proceedings of international symposium, SIGAL’90, August 1990, pp 66–75
Zhou ZB et al (2015) A three-dimensional sub-region query processing mechanism in underwater WSNs. Personal Ubiquitous Comput 19(7):1075–1086
Acknowledgments
This research is supported by Fundamental Research Funds for the Central Universities (2015YJS027), National Natural Science Foundation under Grant 61371071.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Liu, Y., Fu, JS. & Zhang, Z. k-Nearest neighbors tracking in wireless sensor networks with coverage holes. Pers Ubiquit Comput 20, 431–446 (2016). https://doi.org/10.1007/s00779-016-0918-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00779-016-0918-8