Abstract
Counting and tracking multiple targets by binary proximity sensors (BPS) is known difficult because a BPS in βonβ state cannot distinguish how many targets are presenting in its sensing range. Existing approaches investigated target counting by utilizing joint readings of a network of BPSs, called a snapshot [2,11]. A recent work [14] presented a snapshot-based target counting lower bound. But counting by individual snapshot has not fully utilized the information between the sequential readings of BPSs. This paper exploits the spatial and temporal dependency introduced by a sequence of snapshots to improve the counting bounds and resolution. In particular, a dynamic counting scheme which considers the dependency among the snapshots were developed. It leads to a dynamic lower bound and a dynamic upper bound respectively. Based on them, an improved precisely counting condition was presented. Simulations were conducted to verify the improved counting limits, which showed the improvements than the snapshot-based methods.
Keywords
- Separation Distance
- Static Counting
- Target Number
- Polynomial Time Approximation Scheme
- Random Deployment
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was supported by in part by National Natural Science Foundation of China Grant 61202360, 61073174, 61033001, 61061130540, the Hi-Tech research and Development Program of China Grant 2006AA10Z216, and the National Basic Research Program of China Grant 2011CBA00300, 2011C-BA00302.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Busnel, Y., Querzoni, L., Baldoni, R., Bertier, M., Kermarrec, A.-M.: On the deterministic tracking of moving objects with a binary sensor network. In: Nikoletseas, S.E., Chlebus, B.S., Johnson, D.B., Krishnamachari, B. (eds.) DCOSS 2008. LNCS, vol.Β 5067, pp. 46β59. Springer, Heidelberg (2008), http://link.springer.com/chapter/10.1007/978-3-540-69170-9_4
Busnel, Y., Querzoni, L., Baldoni, R., Bertier, M., Kermarrec, A.-M.: Analysis of deterministic tracking of multiple objects using a binary sensor network. ACM Trans. Sen. Netw. 8(1), 8:1β8:27 (2011)
Cao, D., Jin, B., Das, S.K., Cao, J.: On collaborative tracking of a target group using binary proximity sensors. Journal of Parallel and Distributed ComputingΒ 70(8), 825β838 (2010)
De, D., Song, W.-Z., Xu, M., Wang, C.-L., Cook, D., Huo, X.: FindingHuMo: real-time tracking of motion trajectories from anonymous binary sensing in smart environments. In: ICDCS, pp. 163β172 (2012)
Dumitrescu, A., Pach, J.: Minimum clique partition in unit disk graphs. Graphs and CombinatoricsΒ 27(3), 399β411 (2011)
He, T., Bisdikian, C., Kaplan, L., Wei, W., Towsley, D.: Multi-target tracking using proximity sensors. In: MILCOM, pp. 1777β1782 (2010)
Humyn, A.: Maximal Clique (May 2008)
Liu, H., Darabi, H., Banerjee, P., Liu, J.: Survey of wireless indoor positioning techniques and systems. Trans. Sys. Man Cyber Part CΒ 37(6), 1067β1080 (2007)
Shrivastava, N., Madhow, R.M.U., Suri, S.: Target tracking with binary proximity sensors: fundamental limits, minimal descriptions, and algorithms. In: SenSys 2006, pp. 251β264. ACM, New York (2006)
Shrivastava, N., Mudumbai, R., Madhow, U., Suri, S.: Target tracking with binary proximity sensors. ACM Trans. Sen. Netw. 5(4), 30:1β30:33 (2009)
Singh, J., Madhow, U., Kumar, R., Suri, S., Cagley, R.: Tracking multiple targets using binary proximity sensors. In: IPSN 2007, pp. 529β538. ACM, New York (2007)
Singh, J., Madhow, U., Kumar, R., Suri, S., Cagley, R.: Tracking multiple targets using binary proximity sensors. In: IPSN 2007. ACM (April 2007)
Song, L.: PSensorSimulator, https://bitbucket.org/leisong03/PSensorSimulator
Song, L., Wang, Y.: Multiple target counting and tracking using binary proximity sensors: Bounds, coloring, and filter. In: Proceedings of the 15th ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc 2014, pp. 397β406. ACM, New York (2014)
Thue, A.: Γber die dichteste Zusammenstellung von kongruenten Kreisen in einer Ebene. na (1910)
Wahl, F., Milenkovic, M., Amft, O.: A distributed PIR-based approach for estimating people count in office environments. In: CSE 2012, pp. 640β647 (2012)
Wang, C., De, D., Song, W.-Z.: Trajectory mining from anonymous binary motion sensors in smart environment. Knowledge-Based Systems 37, 346β356 (2013)
Wang, Y., Song, L.: An algorithmic and systematic approach for improving robustness of TOA-based localization. In: 2013 IEEE 10th International Conference on High Performance Computing and Communications 2013 IEEE International Conference on Embedded and Ubiquitous Computing (HPCC_EUC), pp. 2066β2073 (November 2013)
Zhang, B., Cheng, X., Zhang, N., Cui, Y., Li, Y., Liang, Q.: Sparse target counting and localization in sensor networks based on compressive sensing. In: 2011 Proceedings IEEE INFOCOM, pp. 2255β2263 (April 2011)
Zhao, J., Wang, Y.: Autonomous ultrasonic indoor tracking system. In: International Symposium on Parallel and Distributed Processing with Applications, ISPA 2008, pp. 532β539 (December 2008)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Β© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Li, T., Wang, Y., Song, L., Tan, H. (2015). On Target Counting by Sequential Snapshots of Binary Proximity Sensors. In: Abdelzaher, T., Pereira, N., Tovar, E. (eds) Wireless Sensor Networks. EWSN 2015. Lecture Notes in Computer Science, vol 8965. Springer, Cham. https://doi.org/10.1007/978-3-319-15582-1_2
Download citation
DOI: https://doi.org/10.1007/978-3-319-15582-1_2
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-15581-4
Online ISBN: 978-3-319-15582-1
eBook Packages: Computer ScienceComputer Science (R0)