Skip to main content
Springer Nature Link
Log in

Efficient cluster-based top-k query routing with data replication in MANETs

  • Focus
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Top-k queries, which retrieve k data items with the best score, have been receiving considerable attention because they can support many real life applications. In this paper, we propose an efficient query routing scheme in mobile ad hoc networks (MANETs), namely CTR. CTR enables top-k data retrieval by only necessary nodes by employing a new clustering framework for top-k query processing. In this framework, nodes holding high rank data items become ClusterHeads (CHs), and top-k queries are transmitted between CHs via gateway nodes which belong to multiple clusters. Each CH maintains a set of hop counts between itself and high rank data items, so that it can judge whether or not to transmit a query on the fly. We further propose a query routing method, CTR\(^{2}\), which integrates the clustering framework of CTR and a data replication approach. CTR\(^{2}\) improves the performance by retrieving the top-k data from nearby nodes. Extensive experiments have demonstrated that the proposed approaches function well in terms of accuracy of the query result, traffic, and delay.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

Notes

  1. We define “hop count” here as the number of GWs which relay a query message to a particular CH. In Fig. 2, the hop-count from A to H, B, and X is 1, 0, and 2 respectively.

  2. http://www.scalable-networks.com/.

References

  • Akbarinia R, Pacitti E, Valduriez P (2006) Reducing network traffic in unstructured p2p systems using top-k queries. Distrib Parallel Databases 19(2):67–86

  • Akbarinia R, Pacitti E, Valduriez P (2007) Best position algorithms for top-k queries. In: VLDB, pp 495–506

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

  • Amagata D, Sasaki Y, Hara T, Nishio S (2013b) A routing method for top-k query processing in mobile ad hoc networks. In: AINA, pp 161–168

  • Amagata D, Sasaki Y, Hara T, Nishio S (2014) CTR: an efficient cluster-based top-k query routing in manets. In: MoMM, pp 225–234

  • Basu P, Khan N, Little TD (2001) A mobility based metric for clustering in mobile ad hoc networks. In: ICDCS workshop, pp 413–418

  • Buckley C, Voorhees EM (2000) Evaluating evaluation measure stability. In: SIGIR, pp 33–40

  • Camp T, Boleng J, Davies V (2002) A survey of mobility models for ad hoc network research. Wirel Commun Mob Comput 2(5):483–502

    Article  Google Scholar 

  • Cao P, Wang Z (2004) Efficient top-k query calculation in distributed networks. In: PODC, pp 206–215

  • Chen B, Liang W, Zhou R, Yu JX (2010) Energy-efficient top-k query processing in wireless sensor networks. In: CIKM, pp 115–122

  • Chen B, Liang W, Min G (2011) Top-k query evaluation in sensor networks with the guaranteed accuracy of query results. In: DEXA, pp 156–171

  • Chinara S, Rath SK (2009) A survey on one-hop clustering algorithms in mobile ad hoc networks. J Netw Syst Manag 17(1–2):183–207

    Article  Google Scholar 

  • Chow CY, Leong HV, Chan AT (2007) Grococa: group-based peer-to-peer cooperative caching in mobile environment. IEEE J Sel Areas Commun 25(1):179–191

    Article  Google Scholar 

  • Cugola G, Migliavacca M (2009) A context and content-based routing protocol for mobile sensor networks. In: Wireless sensor networks, pp 69–85

  • Das G, Gunopulos D, Koudas N, Sarkas N (2007) Ad-hoc top-k query answering for data streams. In: VLDB, pp 183–194

  • Ephremides A, Wieselthier JE, Baker DJ (1987) A design concept for reliable mobile radio networks with frequency hopping signaling. Proc IEEE 75(1):56–73

    Article  Google Scholar 

  • Fiore M, Mininni F, Casetti C, Chiasserini C (2009) To cache or not to cache? In: INFOCOM, pp 235–243

  • 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 

  • 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

  • Hara T (2001) Effective replica allocation in ad hoc networks for improving data accessibility. INFOCOM 3:1568–1576

    Google Scholar 

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

  • Huang Z, Jensen CS, Lu H, Ooi BC (2007) Collaborative spatial data sharing among mobile lightweight devices. In: SSTD, pp 366–384

  • Ilyas IF, Beskales G, Soliman MA (2008) A survey of top-k query processing techniques in relational database systems. ACM Comput Surv (CSUR) 40(4):11

    Article  Google Scholar 

  • Jiang H, Cheng J, Wang D, Wang C, Tan G (2011) Continuous multi-dimensional top-k query processing in sensor networks. In: INFOCOM, pp 793–801

  • Lee SB, Wong SHY, Lee KW, Lu S (2011) Content management in a mobile ad hoc network: beyond opportunistic strategy. In: INFOCOM, pp 266–270

  • Lim S, Lee WC, Cao G, Das CR (2006) A novel caching scheme for improving internet-based mobile ad hoc networks performance. Ad Hoc Netw 4(2):225–239

    Article  Google Scholar 

  • Liu X, Xu J, Lee WC (2010) A cross pruning framework for top-k data collection in wireless sensor network. In: MDM, pp 157–166

  • Menchaca-Mendez R, Garcia-Luna-Aceves J (2008) An interest-driven approach to integrated unicast and multicast routing in manets. In: ICNP, pp 248–257

  • Menchaca-Mendez R, Garcia-Luna-Aceves J (2010) Robust and scalable integrated routing in manets using context-aware ordered meshes. In: INFOCOM, pp 1–9

  • Michel S, Peter T, Weikum G (2005) Klee: a framework for distributed top-k query algorithms. In: VLDB, pp 637–648

  • Mottola L, Cugola G, Picco GP (2008) A self-repairing tree topology enabling content-based routing in mobile ad hoc networks. IEEE TMC 7(8):946–960

    Google Scholar 

  • Niedermayer J, Nascimento MA, Renz M, krøger P, Kriegel HP (2010) Exploiting local node cache in top-k queries within wireless sensor networks. In: ACM Sigspatial GIS, pp 434–437

  • 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

  • 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 

  • Parekh AK (1994) Selecting routers in ad-hoc wireless networks. In: Proceedings of the international telecommunications symposium, pp 420–424

  • Royer EM, Perkins CE (1999) Multicast operation of the ad-hoc on-demand distance vector routing protocol. In: Mobicom, pp 207–218

  • 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: AINA workshop, pp 944–949

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

  • Sasaki Y, Hara T, Nishio S (2014) Top-k query processing for replicated data in mobile peer to peer networks. J Syst Softw 92:45–58

    Article  Google Scholar 

  • Tang B, Gupta H, Das SR (2008) Benefit-based data caching in ad hoc networks. IEEE TMC 7(3):289–304

    Google Scholar 

  • Torkestani JA, Meybodi MR (2011) A mobility-based cluster formation algorithm for wireless mobile ad-hoc networks. Clust Comput 14(4):311–324

    Article  Google Scholar 

  • Tseng YC, Ni SY, Chen YS, Sheu JP (2002) The broadcast storm problem in a mobile ad hoc network. Wirel Netw 8(2–3):153–167

    Article  MATH  Google Scholar 

  • Vlachou A, Doulkeridis C, Nørvåg K, Vazirgiannis M (2008) On efficient top-k query processing in highly distributed environments. In: SIGMOD, pp 753–764

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

    Article  Google Scholar 

  • Wu M, Jianliang XuJ, Xueyan Tang X, Wang-Chien Lee WC (2007) Top-k monitoring in wireless sensor networks. IEEE TKDE 7:962–976

    Google Scholar 

  • Yang W, Zhang G (2007) A weight-based clustering algorithm for mobile ad hoc network. In: International conference on wireless and mobile communications, p 3

  • Yin L, Cao G (2006) Supporting cooperative caching in ad hoc networks. IEEE TMC 5(1):77–89

    Google Scholar 

  • Yoo S, Son JH, Kim MH (2009) A scalable publish/subscribe system for large mobile ad hoc networks. J Syst Softw 82(7):1152–1162

    Article  Google Scholar 

  • Zhu Q, Lee DL, Lee WC (2011) Collaborative caching for spatial queries in mobile p2p networks. In: ICDE, pp 279–290

Download references

Acknowledgments

This research is partially supported by the Grant-in-Aid for Scientific Research (A)(26240013) of MEXT, Japan and and JST, Strategic International Collaborative Research Program, SICORP.

Author information

Authors and Affiliations

  1. Department of Multimedia Engineering, Graduate School of Information Science and Technology, Osaka University, 1-5 Yamadaoka, Suita, Osaka, 565-0871, Japan

    Daichi Amagata, Takahiro Hara & Shojiro Nishio

  2. Department of Systems and Social Informatics, Graduate School of Information Science, Nagoya University, Furo-cho, Chikusa, Nagoya, 464-8601, Japan

    Yuya Sasaki

Authors
  1. Daichi Amagata
    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. Yuya Sasaki
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Shojiro Nishio
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Daichi Amagata.

Ethics declarations

Conflict of interest

None.

Additional information

Communicated by W.-Y. Lin, H.-C. Yang, T.-P. Hong and L.S.L. Wang.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Amagata, D., Hara, T., Sasaki, Y. et al. Efficient cluster-based top-k query routing with data replication in MANETs. Soft Comput 21, 4161–4178 (2017). https://doi.org/10.1007/s00500-015-1867-2

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-015-1867-2

Keywords

Search

Navigation