Advertisement

Wireless Networks

, Volume 19, Issue 4, pp 477–494 | Cite as

Spatial query processing in road networks for wireless data broadcast

  • Yanqiu Wang
  • Chuanfei Xu
  • Yu Gu
  • Mo Chen
  • Ge Yu
Article

Abstract

Recently, wireless broadcast environments have attracted significant attention due to its high scalability to broadcast information to a large number of mobile subscribers. It is especially a promising and desirable dissemination method for the heavily loaded environment where a great number of the same type of requests are sent from the users. There have been many studies on processing spatial queries via broadcast model recently. However, not much attention is paid to the spatial queries in road networks on wireless broadcast environments. In this paper, we focus on three common types of spatial queries, namely, k nearest neighbor (kNN) queries, range queries and reverse nearest neighbor (RNN) queries in spatial networks for wireless data broadcast. Specially, we propose a novel index for spatial queries in wireless broadcast environments (ISW). With the reasonable organization and the effectively pre-computed bounds, ISW provides a powerful framework for spatial queries. Furthermore, efficient algorithms are designed to cope with kNN, range and RNN queries separately based on ISW. The search space can be obviously reduced and subsequently the client can download as less as possible data for query processing, which can conserve the energy while not significantly influence the efficiency. The detailed theory analysis of cost model and the experimental results are presented for verifying the efficiency and effectiveness of ISW and our methods.

Keywords

Wireless data broadcast Spatial queries Road networks ISW 

Notes

Acknowledgments

This work was supported in part by the the National Natural Science Foundation of China under grants Nos. 60933001, 61003058, and the Fundamental Research Funds for the Central Universities under grants No.N100604014 and No. N110604001.

References

  1. 1.
    Zheng, B., Xu, J., Lee, W.-C., & Lee, L. (2006). Grid-partition index: A hybrid method for nearest-neighbor queries in wireless location-based services. Journal on Very Large Data Bases, 15, 21–39.CrossRefGoogle Scholar
  2. 2.
    Park, K., Choo, H., & Valduriez, P. (2010). A scalable energy-efficient continuous nearest neighbor search in wireless broadcast systems. Wireless Networks, 16, 1011–1031.CrossRefGoogle Scholar
  3. 3.
    Lin, L.-F., Chen, C.-C., & Lee, C. (2010). Benefit-oriented data retrieval in data broadcast environments. Wireless Networks, 16(1):1–15.MathSciNetCrossRefGoogle Scholar
  4. 4.
    Gedik, B., Singh, A., & Liu, L. (2004). Energy efficient exact knn search in wireless broadcast environments. In GIS (pp. 137–146).Google Scholar
  5. 5.
    Zheng, B., Lee, W.-C., Lee, K., Lee, D. L., & Shao, M. (2009). A distributed spatial index for error-prone wireless data broadcast. The VLDB Journal, 18, 959–986.CrossRefGoogle Scholar
  6. 6.
    Ambient information network. http://www.ambientdevices.com/cat/index.html.
  7. 7.
    Zheng, B., Lee, W.-C., Lee, & D. L. (2004). Spatial queries in wireless broadcast systems. Wireless Networks, 10, 723–736.CrossRefGoogle Scholar
  8. 8.
    Zhang, X., Lee, W.-C., Mitra, P., & Zheng, B. (2008). Processing transitive nearest-neighbor queries in multi-channel access environments. In Proceedings of EDBT (pp. 452–463).Google Scholar
  9. 9.
    Zheng, B., Lee, W.-C., Lee, & D. L. (2007). On searching continuous k nearest neighbors in wireless data broadcast systems. IEEE Transactions on Mobile Computing, 6, 748–761.CrossRefGoogle Scholar
  10. 10.
    Shahabi, C., Kolahdouzan, M. R., & Sharifzadeh, M. (2002). A road network embedding technique for k-nearest neighbor search in moving object databases. In GIS (pp. 94–100).Google Scholar
  11. 11.
    Papadias, D., Zhang, J., Mamoulis, N., & Tao, Y. (2003). Query processing in spatial network databases. In VLDB (pp. 802–813).Google Scholar
  12. 12.
    Kolahdouzan, M., & Shahabi, C. (2004). Voronoi-based k nearest neighbor search for spatial network databases. In VLDB (pp. 840–851).Google Scholar
  13. 13.
    Samet, H., Sankaranarayanan, J., & Alborzi, H. (2008). Scalable network distance browsing in spatial databases. In SIGMOD (pp. 43–54).Google Scholar
  14. 14.
    Kellaris, G., & Mouratidis, K. (2010). Shortest path computation on air indexes. In VLDB (pp. 747–757).Google Scholar
  15. 15.
    Anticaglia, S., Barsi, F., Bertossi, A., Lamele, L., & Pinotti, M. (2008). Efficient heuristics for data broadcasting on multiple channels. Wireless Networks, 14(2), 219–231.CrossRefGoogle Scholar
  16. 16.
    Imielinski, T., Viswanathan, S., & Badrinath, B. (1997). Data on air: Organization and access. IEEE Transactions on Knowledge and Data Engineering, 9, 353–372.CrossRefGoogle Scholar
  17. 17.
    Mouratidis, K., Bakiras, S., & Papadias, D. (2009). Continuous monitoring of spatial queries in wireless broadcast environments. IEEE Transactions on Mobile Computing, 8, 1297–1311.CrossRefGoogle Scholar
  18. 18.
    Lee, W.-C., & Zheng, B. (2005). Dsi: A fully distributed spatial index for location-based wireless broadcast services. In ICDCS (pp. 349–358).Google Scholar
  19. 19.
    Xu, J., Lee, W.-C., & Tang, X. (2004). Exponential index: a parameterized distributed indexing scheme for data on air. In Proceedings of MobiSys (pp. 153–164).Google Scholar
  20. 20.
    Shen, J.-H., & Chang, Y.-I. (2008). An efficient nonuniform index in the wireless broadcast environments. Journal of Systems and Software, 81, 2091–2103.CrossRefGoogle Scholar
  21. 21.
    Zhong, J., Wu, W., Shi, Y., & Gao, X. (2011). Energy-efficient tree-based indexing schemes for information retrieval in wireless data broadcast. In Proceedings of DASFAA (pp. 335–351).Google Scholar
  22. 22.
    Yiu, M. L., Papadias, D., Mamoulis, N., & Tao, Y. (2006). Reverse nearest neighbors in large graphs. IEEE Transactions on Knowledge and Data Engineering, 18(4), 540–553.CrossRefGoogle Scholar
  23. 23.
    Möhring, R., Schilling, H., Schütz, B., Wagner, D., & Willhalm, T. (2006). Partitioning graphs to speedup dijkstra’s algorithm. Journal of Experimental Algorithmics, 11, 1–29.Google Scholar
  24. 24.
    Xiao, X., Yao, B., & Li, F. (2011). Optimal location queries in road network databases. In ICDE (pp. 804–815).Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2012

Authors and Affiliations

  • Yanqiu Wang
    • 1
  • Chuanfei Xu
    • 1
  • Yu Gu
    • 1
  • Mo Chen
    • 1
  • Ge Yu
    • 1
  1. 1.College of Information Science and EngineeringNortheastern UniversityShenyangChina

Personalised recommendations