Skip to main content

K Nearest Neighbour Query Processing in Wireless Sensor and Robot Networks

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 8487))

Abstract

In wireless sensor and robot networks (WSRNs), static sensors report event information to one of robots. In the k nearest neighbour query processing problem in WSRN, robot receiving event report needs to find k nearest robots (KNN) to react to the event, among those connected to it. In this article, we propose a new method to estimate a search boundary, which is a circle centred at query point. Two algorithms are presented to disseminate the message to robots of interest and aggregate their data (e.g. the distance to query point). Multiple Auction Aggregation (MAA) is an algorithm based on auction protocol, with multiple copies of query message being disseminated into the network to get the best bidding from each robot. Partial Depth First Search (PDFS) algorithm attempts to traverse all the robots of interest with a query message to gather the data by depth first search. In this article, we also optimize a traditional itinerary-based KNN query processing method called IKNN and compare it with our proposed algorithms. The experimental results indicate that the overall performance of MAA outweighs IKNN.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Roussopoulos, N., Kelley, S., Vincent, F.: Nearest neighbor queries. ACM Sigmod Record 24(2), 71–79 (1995)

    Article  Google Scholar 

  2. Song, Z., Roussopoulos, N.: K-nearest neighbor search for moving query point. In: Jensen, C.S., Schneider, M., Seeger, B., Tsotras, V.J. (eds.) SSTD 2001. LNCS, vol. 2121, pp. 79–96. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  3. Winter, J., Lee, W.C.: Kpt: a dynamic knn query processing algorithm for location-aware sensor networks. In: Proceeedings of the 1st International Workshop on Data Management for Sensor Networks: in Conjunction with VLDB 2004, pp. 119–124. ACM (2004)

    Google Scholar 

  4. Winter, J., Xu, Y., Lee, W.C.: Energy efficient processing of k nearest neighbor queries in location-aware sensor networks. In: The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services, MobiQuitous 2005, pp. 281–292. IEEE (2005)

    Google Scholar 

  5. Xu, Y., Lee, W.C., Xu, J., Mitchell, G.: Processingwindow queries in wireless sensor networks. In: Proceedings of the 22nd International Conference on Data Engineering, ICDE 2006, p. 70. IEEE (2006)

    Google Scholar 

  6. da Silva, R.I., Macedo, D.F., Nogueira, J.M.S.: Spatial query processing in wireless sensor networks-a survey. In: Information Fusion (2012)

    Google Scholar 

  7. Bose, P., Morin, P., Stojmenović, I., Urrutia, J.: Routing with guaranteed delivery in ad hoc wireless networks. Wireless Networks 7(6), 609–616 (2001)

    Article  MATH  Google Scholar 

  8. Jayaraman, P.P., Zaslavsky, A., Delsing, J.: Cost-efficient data collection approach using k-nearest neighbors in a 3d sensor network. In: 2010 Eleventh International Conference on Mobile Data Management (MDM), pp. 183–188. IEEE (2010)

    Google Scholar 

  9. Xu, Y., Fu, T.Y., Lee, W.C., Winter, J.: Processing k nearest neighbor queries in location-aware sensor networks. Signal Processing 87(12), 2861–2881 (2007)

    Article  MATH  Google Scholar 

  10. 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: IEEE 23rd International Conference on Data Engineering, ICDE 2007, pp. 456–465. IEEE (2007)

    Google Scholar 

  11. Fu, T.Y., Peng, W.C., Lee, W.C.: Parallelizing itinerary-based knn query processing in wireless sensor networks. IEEE Transactions on Knowledge and Data Engineering 22(5), 711–729 (2010)

    Article  Google Scholar 

  12. Akyildiz, I.F., Su, W., Sankarasubramaniam, Y., Cayirci, E.: Wireless sensor networks: a survey. Computer Networks 38(4), 393–422 (2002)

    Article  Google Scholar 

  13. Chang, C.Y., Chang, C.T., Chen, Y.C., Chang, H.R.: Obstacle-resistant deployment algorithms for wireless sensor networks. IEEE Transactions on Vehicular Technology 58(6), 2925–2941 (2009)

    Article  Google Scholar 

  14. Wang, G., Cao, G., La Porta, T., Zhang, W.: Sensor relocation in mobile sensor networks. In: Proceedings of the IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies, INFOCOM 2005, vol. 4, pp. 2302–2312. IEEE (2005)

    Google Scholar 

  15. Ivan, M., Veljko, M., Stojmenovic, I.: Robot to robot: communication aspects of coordination in robot wireless networks. Robotics Automation Magazine 17(4), 63–69 (2010)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Xie, W., Li, X., Narasimhan, V., Nayak, A. (2014). K Nearest Neighbour Query Processing in Wireless Sensor and Robot Networks. In: Guo, S., Lloret, J., Manzoni, P., Ruehrup, S. (eds) Ad-hoc, Mobile, and Wireless Networks. ADHOC-NOW 2014. Lecture Notes in Computer Science, vol 8487. Springer, Cham. https://doi.org/10.1007/978-3-319-07425-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-07425-2_19

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-07424-5

  • Online ISBN: 978-3-319-07425-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics