Advertisement

C-kNN Query Processing in Object Tracking Sensor Networks

  • Jinghua Zhu
  • Jianzhong Li
  • Jizhou Luo
  • Wei Zhang
  • Hongzhi Wang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5258)

Abstract

Wireless sensor networks (WSNs) are being developed for a variety of applications. Continuous k nearest neighbors (C-kNN) query is an essential class of spatial query in object tracking applications. Due to the limited power of individual node, energy is the most critical resource in sensor networks. In order to always report the up-to-date results, a centralized solution requires the transmission of a large number of location update messages. Intuitively, current information is necessary only for objects that may influence some query results. Motivated by this observation, we propose a threshold-based C-kNN search algorithm with the minimal message transmissions. The key idea is to set thresholds for moving objects corresponding to each query so that only the location updates which affect the final results are transmitted. The proposed method can be used with multiple, static or moving queries. The experiments results show the effectiveness and efficiency of our approach in terms of energy and latency.

Keywords

Wireless sensor networks Moving object tracking C-kNN query processing Localized algorithm 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Akyildiz, I.F., et al.: Wireless sensor networks: A survey. Computer Networks 38(4), 392–422 (2002)CrossRefGoogle Scholar
  2. 2.
    Kim, W., Mechitov, K., Choi, J.-Y., Ham, S.: On target tracking with binary proximity sensors. In: Proc. IPSN (2005)Google Scholar
  3. 3.
    Demirbas, M., Ferhatosmanoglus, H.: Peer-to-peer spatial queries in sensor networks. In: Proceedings of the 3rd IEEE International Conference on Peer-to-Peer Computing, Linkoping, Sweden (2003)Google Scholar
  4. 4.
    Winter, J., Lee, W.-C.: KPT: A dynamic KNN query processing algorithm for location-aware sensor networks. In: The 1st VLDB Workshop DMSN 2004, Toronto, Canada (2004)Google Scholar
  5. 5.
    Winter, J., Xu, Y., Lee, W.: Energy efficient processing of k nearest neighbor queries in location-aware sensor networks. In: Proceedings of MobiQuitous (2005)Google Scholar
  6. 6.
    Xu, Y., Lee, W., Xu, J., Mitchell, G.: Processing window queries in wireless sensor networks. In: Proceedings of International Conference on Data Engineering (2006)Google Scholar
  7. 7.
    Wu, S.-H., Chuang, K.-T., Chen, C.-M., Chen, M.-S.: DIKNN: An Itinerary-based KNN Query Processing Algorithm for Mobile Sensor Networks. In: Proceedings of the 23rd IEEE International Conference on Data Engineering (ICDE 2007), April 16-20 (2007)Google Scholar
  8. 8.
    Yu, X., Pu, K., Koudas, N.: Monitoring k-nearest neighbor queries over moving objects. In: Proceedings of ICDE 2005 (2005)Google Scholar
  9. 9.
    Mouratidis, K., Hadjieleftheriou, M., Papadias, D.: Conceptual partitioning: An efficient method for continous nearest neighbor monitoring. In: Proceedings SIGMOD 2005 (2005)Google Scholar
  10. 10.
    Prabhakar, S., Xia, Y., Kalashnikov, D., Aref, W., Hambrusch, S.: Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects. IEEE Trans. Computers 51(10), 1124–1140 (2002)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Jinghua Zhu
    • 1
  • Jianzhong Li
    • 1
  • Jizhou Luo
    • 1
  • Wei Zhang
    • 1
  • Hongzhi Wang
    • 1
  1. 1.School of Computer Science & TechnologyHarbin Institute of TechnologyHarbinChina

Personalised recommendations