Advertisement

Wireless Networks

, Volume 16, Issue 4, pp 1011–1031 | Cite as

A scalable energy-efficient continuous nearest neighbor search in wireless broadcast systems

  • Kwangjin Park
  • Hyunseung Choo
  • Patrick Valduriez
Article

Abstract

When the mobile environment consists of light-weight devices, the energy consumption of location-based services (LBSs) and the limited bandwidth of the wireless network become important issues. Motivated by this, we propose new spatial query processing algorithms to support Mobile Continuous Nearest Neighbor Query (MCNNQ) in wireless broadcast environments. Our solution provides a general client–server architecture for answering MCNNQ on objects with unknown, and possibly variable, movement types. Our solution enables the application of spatio-temporal access methods specifically designed for a particular type, to arbitrary movements without any false misses. Our algorithm does not require any conventional spatial index for MCNNQ processing. It can be adapted to static or moving objects, and does not require additional knowledge (e.g., direction of moving objects) beyond the maximum speed and the location of each object. Extensive experiments demonstrate that our location-based data dissemination algorithm significantly outperforms index-based solutions.

Keywords

Moving objects Mobile computing Wireless data broadcasting Continuous nearest neighbor search 

Notes

Acknowledgment

The authors would like to thank the editor Ivan Stojmenovic and anonymous reviewers for their valuable comments and suggestions that improved the quality of this paper. This paper was supported by Wonkwang university in 2008.

References

  1. 1.
    Lee, D. L., Lee, W.-C., Xu, J., & Zheng, B. (2002). Data management in location-dependent information services: Challenges and issues. IEEE Pervasive Computing, 1(3), 65–72.CrossRefGoogle Scholar
  2. 2.
    Zheng, B., Xu, J., Lee, W.-C., & Lee, D. L. (2006). Grid-partition index: A hybrid approach to nearest-neighbor queries in wireless location-based services. The International Conference on Very Large Data Bases (VLDB) Journal, 15(1), 21–39.CrossRefGoogle Scholar
  3. 3.
    Zhang, J., & Gruenwald, L. (2002). Prioritized sequencing for efficient query on broadcast geographical information in mobile-computing. In Proceedings of SIGSPATIAL International Conference on Advances in Geographic Information Systems (GIS), pp. 88–93.Google Scholar
  4. 4.
    Zheng, B., Lee, W.-C., & Lee, D. L. (2004). Spatial queries in wireless broadcast systems. Wireless Network, 10(6), 723–736.CrossRefGoogle Scholar
  5. 5.
    Imielinski, T., Viswanathan, S., & Badrinath, B. R. (1997). Data on air: Organization and access. IEEE Transactions on Knowledge and Data Engineering, 9(3), 353–372.CrossRefGoogle Scholar
  6. 6.
    Zheng, B., Lee, W.-C., & Lee, D. L. (2003). Spatial index on air. In Proceedings of Pervasive Computing and Communication (PerCom), pp. 297–304.Google Scholar
  7. 7.
    Lee, W.-C., & Zheng, B. (2005). DSI: A fully distributed spatial index for location-based wireless broadcast services. In Proceedings of International Conference on Distributed Computing Systems (ICDCS), pp. 349–358.Google Scholar
  8. 8.
    Saltenis, S., Jensen, C. S., Leutenegger, S. T., & Lopez, M. A. (2000). Indexing the positions of continuously moving objects. In Proceedings of International Conference on Management of Data (SIGMOD), pp. 331–342.Google Scholar
  9. 9.
    Hu, H., Xu, J., & Lee, D. L. (2005). A generic framework for monitoring continuous spatial queries over moving objects. In Proceedings of International Conference on Management of Data (SIGMOD), pp. 479–490.Google Scholar
  10. 10.
    Tao, Y., & Papadias, D. (2003). Spatial queries in dynamic environments. ACM Transactions on Database Systems, 28(2), 101–139.CrossRefGoogle Scholar
  11. 11.
    Mouratidis, K., Papadias, D., Bakiras, S., & Tao, Y. (2005). A threshold-based algorithm for continuous monitoring of k nearest neighbors. IEEE Transactions on Knowledge and Data Engineering, 17(11), 1451–1464.CrossRefGoogle Scholar
  12. 12.
    Mokbel, M. F. (2004). Continuous query processing in spatio-temporal databases. In Proceedings of International Conference on Extending Database Technology (EDBT), pp. 100–111.Google Scholar
  13. 13.
    Prasad Sistla, A., Wolfson, O., Chamberlain, S., & Dao, S. (1997). Modeling and querying moving objects. In Proceedings of International Conference on Data Engineering (ICDE), pp. 422–432.Google Scholar
  14. 14.
    Song, Z., & Roussopoulos, N. (2001). K-nearest neighbor search for moving query point. In Proceedings of Symposium on Spatial and Temporal Databases (SSTD), pp. 79–96.Google Scholar
  15. 15.
    Zhang, J., Zhu, M., Papadias, D., Tao, Y., & Lee, D. L. (2003). Location-based spatial queries. In Proceedings of International Conference on Management of Data (SIGMOD), pp. 443–454.Google Scholar
  16. 16.
    Zheng, B., & Lee, D. L. (2001). Semantic caching in location-dependent query processing. In Proceedings of Symposium on Spatial and Temporal Databases (SSTD), pp. 97–116.Google Scholar
  17. 17.
    Gedik, B., & Liu, L. (2004). MobiEyes: Distributed processing of continuously moving queries on moving objects in a mobile system. In Proceedings of International Conference on Extending Database Technology (EDBT), pp. 67–87.Google Scholar
  18. 18.
    Xiong, X., Mokbel, M. F., & Aref, W. G. (2005). SEA-CNN: Scalable processing of continuous k-nearest neighbor queries in spatio-temporal databases. In Proceedings of International Conference on Data Engineering (ICDE), pp. 643–654.Google Scholar
  19. 19.
    Prabhakar, S., Xia, Y., Kalashnikov, D., Aref, W. G., & Hambrusch, S. E. (2002). Query indexing and velocity constrained indexing: Scalable techniques for continuous queries on moving objects. IEEE Transactions on Computers, 51(10), 1124–1140.Google Scholar
  20. 20.
    Zheng, B., Lee, W.-C., & Lee, D. L. (2004). Search continuous nearest neighbors on the air. In Proceedings of International Conference on Mobile and Ubiquitous Systems (MobiQuitous), pp. 236–245.Google Scholar
  21. 21.
    Hambrusch, S. E., Liu, E., Aref, W. G., & Prabhakar, S. (2001). Query processing in broadcasted spatial index trees. In Proceedings of Symposium on Spatial and Temporal Databases (SSTD), pp. 502–521.Google Scholar
  22. 22.
    Zheng, B., Lee, W.-C., & Lee, D. L. (2007). On searching continuous k nearest neighbors in wireless data broadcast systems. IEEE Transactions on Mobible Computing, 6(7), 748–761.CrossRefGoogle Scholar
  23. 23.
    Park, K., Song, M., & Hwang, C.-S. (2006). Adaptive data dissemination schemes for location-aware mobile services. Journal of Systems and Software, 79(5), 674–688.CrossRefGoogle Scholar
  24. 24.
    Park, K., & Choo, H. (2007). Energy-efficient data dissemination schemes for nearest neighbor query processing. IEEE Transactions on Computers, 56(6), 754–768.CrossRefMathSciNetGoogle Scholar
  25. 25.
    Zheng, B., & Lee, D. L. (2005). Information dissemination via wireless broadcast. Communications of the ACM, 48(5), 105–110.CrossRefGoogle Scholar
  26. 26.
    Guttman, A. (1984). R-trees: A dynamic index structure for spatial searching. In Proceedings of International Conference on Management of Data (SIGMOD), pp. 47–57.Google Scholar
  27. 27.
    Xu, J., Zheng, B., Lee, W.-C., & Lee, D. L. (2004). D-tree: An index structure for planar point queries in location-based wireless services. IEEE Transactions on Knowledge and Data Engineering, 16(12), 1526–1542.CrossRefGoogle Scholar
  28. 28.
    Shih, E., Cho, S.-H., Ickes, N., Min, R., Sinha, A., Wang, A., & Chandrakasan, A. (2001). Physical layer driven protocol and algorithm design for energy-efficient wireless sensor networks. In Proceedings of International Conference on Mobile Computing and Networking (MOBICOM), pp. 272–287.Google Scholar
  29. 29.
    Lu, G., Krishnamachari, B., & Raghavendra, C. S. (2004). An adaptive energy-efficient and low-latency MAC for data gathering in sensor networks. In Proceedings of International Workshop on Algorithms for Wireless, Mobile, Ad Hoc and Sensor Networks (WMAN), pp. 1–12.Google Scholar
  30. 30.
    Ruzzelli, A. G., O’Hare, G. M. P., Tynan, R., Cotan, P., & Havinga, P. J. M. (2006). Protocol assessment issues in low duty cycle sensor networks: The switching energy. In Proceedings of International Conference on Sensor Networks, Ubiquitous, and. Trustworthy Computing (SUTC), pp. 136–143.Google Scholar
  31. 31.
    Kollios, G., Gunopulos, D., & Tsotras, V. J. (1999). On indexing mobile objects. In Proceedings of Symposium on Principles of Database Systems (PODS), pp. 261–272.Google Scholar
  32. 32.
    Tao, Y., Papadias, D., & Shen, Q. (2002). Continuous nearest neighbor search. In Proceedings of international Conference on Very Large Data Bases (VLDB), pp. 287–298.Google Scholar
  33. 33.
    Camp, T., Boleng, J., & Davies, V. (2002). A survey of mobility models for ad hoc network research. Wireless Communication and Mobile Computing, 2(5), 483–502.CrossRefGoogle Scholar
  34. 34.
    Kasten, O. Energy consumption. ETH-Zurich, Swiss Federal Institute of Technology. Available at http://people.inf.ethz.ch/~kasten/research/bathtub/energy_consumption.htm

Copyright information

© Springer Science+Business Media, LLC 2009

Authors and Affiliations

  • Kwangjin Park
    • 1
  • Hyunseung Choo
    • 2
  • Patrick Valduriez
    • 3
  1. 1.School of Electrical Electronics and Information EngineeringWonkwang UniversityIksan-ShiRepublic of Korea
  2. 2.School of Information and Communication EngineeringSungkyunkwan UniversitySuwon-ShiRepublic of Korea
  3. 3.INRIA and LINA, Université de NantesNantes Cedex 03France

Personalised recommendations