Efficient Top-k Query Processing in Mobile Ad Hoc Networks

##plugins.themes.academic_pro.article.sidebar##

Published Nov 1, 2010
https://doi.org/10.47164/ijngc.v1i2.19
Download
PDF
Statistic

Downloads

Download data is not yet available.

Metrics

Metrics Loading ...
Volume 1, Issue 2, November 2010

##plugins.themes.academic_pro.article.main##

Takahiro Hara
Department of Multimedia Engineering, Osaka University
Ryo Hagihara
Department of Multimedia Engineering, Osaka University
Yuya Sasaki
Department of Multimedia Engineering, Osaka University
Masako Shinohara
Department of Multimedia Engineering, Osaka University
Shojiro Nishio
Department of Multimedia Engineering, Osaka University

Abstract

In mobile ad hoc networks (MANETs), to acquire only necessary data items, it is effective that each mobile node retrieves data items using a top-k query, in which data items are ordered by the score of a particular attribute, and the query issuing mobile node acquires data items with the k highest scores. In this paper, we propose a top-k query processing method in MANETs for reducing traffic and keeping the accuracy of the query result. In this method, each mobile node estimates data items with the k highest scores and sets a part of those scores to the standard scores. When a mobile node transmits query and reply messages, it reduces the number of candidates that are included in the top-k result by referring to the standard scores. We also present results of some simulation studies to evaluate the performance of our proposed method. The simulation results show that our method can reduce traffic for processing top-k queries as well as keeping high accuracy.

##plugins.themes.academic_pro.article.details##

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite
Takahiro Hara, Ryo Hagihara, Yuya Sasaki, Masako Shinohara, & Shojiro Nishio. (2010). Efficient Top-k Query Processing in Mobile Ad Hoc Networks. International Journal of Next-Generation Computing, 1(2), 193–210. https://doi.org/10.47164/ijngc.v1i2.19
Crossref
Scopus
Google Scholar
Europe PMC

References

  1. Akbarinia, R., Pacitti, E., AND Valduriez, P. 2006. Reducing network trac in unstructured P2P systems using top-k queries. In Distributed and Parallel Databases 19(2-3).,67-86.
  2. Baker, D.J., Wieselthier,J., AND Ephremides, A. 1982. A distributed algorithm for scheduling the activation of links in a self-organizing, mobile, radio network. In Proceedings of ICC., 1982, 2F6.1-2F6.5.
  3. Balke, W.-T., Nejdl, W., Siberski, W., AND Thaden, U. 2005. Progressive distributed top-k retrieval in peer-to-peer networks. In Proceedings of ICDE., 2005. 174-185.
  4. Broch, J., Maltz, D.A., Johnson, D.B.,Hu, Y.C. AND Jetcheva, J. 1998. A performance comparison of multi-hop wireless ad hoc network routing protocols. In Proceedings of MobiCom., 1998, 159-164.
  5. Camp, T., Boleng, J., AND Davies, V. 2002. A survey of mobility models for ad hoc network research In Wireless Communications and Mobile Computing 2(5), 483-502.
  6. Hagihara, R., Shinohara, M.,Hara, T. AND Nishio, S. 2009. A message processing method for top-k query for trac reduction in ad hoc networks, In Proceedings of International Conference on Mobile Data Management, 2009, 11-20.
  7. Hara, T. AND Madria, S.K. 2006. Data replication for improving data accessibility in ad hoc networks. In IEEE Transactions on Mobile Computing 5(11), 1515-1532.
  8. Hara, T., Hagihara, R., AND Nishio, S. 2010. Data replication for top-k query processing in mobile wireless sensor networks. In Proceedings of International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing, 2010, 115-122.
  9. Kalnis, P., Ng, W.S.,Ooi, B.C. AND Tan, K.-L. 2006. Answering similarity queries in peer-to-peer networks. In Information Systems 31(1), 57-72.
  10. Klamm, A., Lindemann, C., AND Waldhorst, O.P. 2003. A special-purpose peer-to-peer le sharing system for mobile ad hoc networks, In Proceedings of Vehicular Technology Conference, 2003, 2758-2763.
  11. Mase, K., Sato, T., Nakano, K., Sengoku, M., AND Shinoda, S. 2001. Ecient ooding schemes in mobile ad hoc networks, In Proceedings of International Conference on Multi-Dimensional Mobile Communications, 2001, 152-157.
  12. Matsunami, H., Terada, T., AND Nishio, S. 2005. A query processing mechanism for top-k query in P2P networks. In Proceedings of International Special Workshop on Databases for Next Generation Researchers, 2005, 84-87.
  13. Padmanabhan, P., Gruenwald, L., Vallur, A., AND Atiquzzaman, M. 2008. A survey of data replication techniques for mobile ad hoc network databases. VLDB Journal 17(5), 1143-1164.
  14. Pagani, E., AND Rossi, G.P. 1999. Providing reliable and fault tolerant broadcast delivery in mobile ad-hoc networks, Mobile Networks and Applications 4(3), 175-192.
  15. Sasaki, Y., Hagihara, R., Hara, T., Shinohara, M., AND Nishio, S. 2010. A top-k query method by estimating
  16. score distribution in mobile ad hoc networks. In Proceedings of International Workshop on Data Management for Wireless and Pervasive Communications, 2010, 944-949.
  17. Silberstein, A., Munagala, K., AND Yang, J. 2006. Energy-ecient monitoring of extreme values in sensor networks, In Proceeding of ACM SIGMOD Conference, 2006, 169-180.
  18. Shinohara, M., Hara, T., AND Nishio, S. 2009. A data transmission method using multicast in mobile ad hoc networks, In Proceedings of International Conference on Mobile Data Management, 2009, 232-237.
  19. Yazti, D.Z., Andreou, P., Chrysanthis, P.K., AND Samaras, G. 2007. MINT views: Materialized in-network top-k views in sensor networks, In Proceeding of International Conference on Mobile Data Management, 2007, 182-189.