Skip to main content
SpringerLink
Log in

Efficient framework for processing top-k queries with replication in mobile ad hoc networks

  • Published:
GeoInformatica Aims and scope Submit manuscript

Abstract

This article addresses the top-k query processing problem on mobile ad hoc networks (MANETs). Top-k query processing is common to retrieve only highly important data items. However, methods for top-k query processing are not enough efficient and accurate in MANET environments. For improving the efficiency and accuracy, replication is a promising technique that each node in MANETs replicates data items retained by other nodes into its storage. Therefore, we fully combine the top-k query processing with data replication. We propose a framework that efficiently processes top-k queries based on a new replication strategy. We develop new replication strategy FReT (topology-Free Replication for Top-k query). FReT determines near-optimal allocations of replicas. It advantages efficient top-k query processing from limited search area without maintenance costs even if mobile nodes move. Our top-k query processing methods retrieve the exact answer with small overhead and delay by gradually increasing the search area based on FReT. We demonstrate, through extensive experiments, that FReT and query processing methods function well in terms of small delay and overhead without sacrificing exactness of the query result.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14

Similar content being viewed by others

Notes

  1. Although the proposed method in [8] is named a replication method, this method is essentially a caching protocol because each node stores data items when it receives data items.

  2. The reason that we select the top-k query processing method proposed in [6] is that this method does not require any information in advance of query processing

  3. Scalable Networks: makers of QualNet and EXata, the only multi-core enabled network simulation and emulation software. [Online]. Available: http://www.scalable-networks.com/.

References

  1. Amagata D, Sasaki Y, Hara T, Nishio S (2013) A robust routing method for top-k queries in mobile ad hoc networks. In: MDM, pp 251–256

  2. Börzsöny S, Kossmann D, Stocker K (2001) The skyline operator. In: ICDE, pp 421–430

  3. Cohen E, Shenker S (2002) Replication strategies in unstructured peer-to-peer networks. In: SIGCOMM, pp 177–190

  4. Dimakis AG, Godfrey PB, Wu Y, Wainwright MJ, Ramchandran K (2010) Network coding for distributed storage systems. IEEE TIT 56(9):4539–4551

    Google Scholar 

  5. Fiore M, Casetti C, Chiasserini C (2011) Caching strategies based on information density estimation in wireless ad hoc networks. IEEE TVT 60(5):2194–2208

    Google Scholar 

  6. Hagihara R, Shinohara M, Hara T, Nishio S (2009) A message processing method for top-k query for traffic reduction in ad hoc networks. In: MDM, pp 11–20

  7. Hara T (2001) Effective replica allocation in ad hoc networks for improving data accessibility. In: INFOCOM, pp 1568–1576

  8. Hara T, Hagihara R, Nishio S (2010) Data replication for top-k query processing in mobile wireless sensor networks. In: SUTC, pp 115–122

  9. Ilyas I, Beskales G, Soliman M (2008) A survey of top-k query processing techniques in relational database systems. ACM CSUR 40(4):11

    Google Scholar 

  10. Jiang H, Cheng J, Wang D, Wang C, Tan G (2012) A general framework for efficient continuous multidimensional top-k query processing in sensor networks. IEEE TPDS 23(9):1668–1680

    Google Scholar 

  11. Kong J, Lu S, Zhang L, Zerfos P, Luo H (2001) Providing robust and ubiquitous security support for mobile ad hoc networks. In: ICNP, IEEE Computer Society, pp 0251–0251

  12. Lee S, Wong S, Lee K (2011) S. Lu. Content management in a mobile ad hoc network Beyond opportunistic strategy. In: INFOCOM, pp 266–270

  13. Lu Z, Sun X, La Porta T (2016) Cooperative data offloading in opportunistic mobile networks. In: INFOCOM, pp 1–9

  14. Lv Q, Cao P, Cohen E, Li K, Shenker S (2002) Search and replication in unstructured peer-to-peer networks. In: Supercomputing, pp 84–95

  15. Ni S, Tseng Y, Chen Y, Sheu J (1999) The broadcast storm problem in a mobile ad hoc network. In: Mobicom, pp 151–162

  16. Padhariya N, Mondal A, Goyal V, Shankar R, Madria S (2011) Ecotop: an economic model for dynamic processing of top-k queries in mobile-p2p networks. In: DASFAA, pp 251–265

  17. Padmanabhan P, Gruenwald L, Vallur A, Atiquzzaman M (2008) A survey of data replication techniques for mobile ad hoc network databases. VLDB J 17 (5):1143–1164

    Article  Google Scholar 

  18. Perkins CE, Royer EM (1999) Ad-hoc on-demand distance vector routing. In: Mobile Computing Systems and Applications (WMCSA), IEEE, pp 90–100

  19. Ryeng N, Vlachou A, Doulkeridis C, Nørvåg K (2011) Efficient distributed top-k query processing with caching. In: DASFAA, pp 280–295

  20. Sasaki Y, Hagihara R, Hara T, Shinohara M, Nishio S (2010) A top-k query method by estimating score distribution in mobile ad hoc networks. In: Advanced Information Networking and Applications Workshops (WAINA), pp 944–949

  21. Sasaki Y, Hara T, Ishikawa Y (2018) Top-k query processing with replication strategy in mobile ad hoc networks. In: MDM, pp 217–226

  22. Sasaki Y, Hara T, Nishio S (2011) Two-phase top-k query processing in mobile ad hoc networks. In: Network-based Information Systems (NBiS), pp 42–49

  23. Sasaki Y, Hara T, Nishio S (2014) Top-k query processing for replicated data in mobile peer to peer networks. System and Software 92:45–58

    Article  Google Scholar 

  24. Vlachou A, Doulkeridis C, Nørvåg K (2012) Distributed top-k query processing by exploiting skyline summaries. Distributed and Parallel Databases 30(3-4):239–271

    Article  Google Scholar 

  25. Vlachou A, Doulkeridis C, Nørvåg K, Kotidis Y (2012) Peer-to-peer query processing over multidimensional data. Springer Science & Business Media

  26. Wu M, Xu J, Tang X, Lee W-C (2007) Top-k monitoring in wireless sensor networks. IEEE TKDE 19(7):962–976

    Google Scholar 

  27. Zou L, Chen L (2008) Dominant graph: an efficient indexing structure to answer top-k queries. In: ICDE, pp 536–545

Download references

Acknowledgements

This research is partially supported by the Grant-in-Aid for Scientific Research (A)(JP16H01722), Scientific Research (S)17H06099, and Young Scientists (B)(JP15K21069).

Author information

Authors and Affiliations

  1. Graduate School of Information Science and Technology, Osaka University, Osaka, Japan

    Yuya Sasaki & Takahiro Hara

  2. Graduate School of Informatics, Nagoya University, Nagoya, Japan

    Yoshiharu Ishikawa

Authors
  1. Yuya Sasaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takahiro Hara
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yoshiharu Ishikawa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuya Sasaki.

Additional information

Publisher’s note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Sasaki, Y., Hara, T. & Ishikawa, Y. Efficient framework for processing top-k queries with replication in mobile ad hoc networks. Geoinformatica 23, 591–620 (2019). https://doi.org/10.1007/s10707-019-00363-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10707-019-00363-0

Keywords

Search

Navigation