EcoTop: An Economic Model for Dynamic Processing of Top-k Queries in Mobile-P2P Networks

Top-k queries, which retrieve the k data items with the highest scores, have been receiving considerable attention because of their utility for many real life applications. In this paper, we propose an efficient query routing scheme enabling top-k data retrieval by only necessary nodes, named CTR. CTR employs a new clustering framework for top-k query processing, and 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 record of hop counts between itself and high rank data items, enabling it to judge whether or not to transmit a query on the fly. As a result, CTR reduces overhead while keeping high accuracy of the query result. Extensive experiments have demonstrated that CTR functions well in terms of accuracy of the query result, overhead, and delay.

show abstract

“…To the best of our knowledge, [3,4,15,20,[22][23][24] are the only existing studies focusing on top-k query processing in MANETs.…”

Section: Top-k Query Processingmentioning

confidence: 98%

CTR

Amagata

Sasaki

Hara

et al. 2014

Proceedings of the 12th International Conference on Advances in Mobile Computing and Multimedia

View full text Add to dashboard Cite

show abstract

“…The data and service availability can be increased by associating a price with data items and services [8], [16], [17]. In such schemes, peers can bid for better services, intermediate peers can earn incentives by providing relay services and in fact, outgoing peers can lease data items to others to still earn incentives while disconnected.…”

Section: Economic Incentive Models For Datamentioning

confidence: 98%

Crowdsourcing: Dynamic Data Management in Mobile P2P Networks

Madria

Mondal

2012

2012 IEEE 13th International Conference on Mobile Data Management

Self Cite

View full text Add to dashboard Cite

“…To the best of our knowledge, Amagata et al (2013a, b); Hagihara et al (2009);Padhariya et al (2011);Sasaki et al (2010Sasaki et al ( , 2011Sasaki et al ( , 2014 are the only existing studies focusing on top-k query processing in MANETs. However, the method proposed in Padhariya et al (2011) assumes an economic scheme (e.g., virtual currency) based on essentially different assumptions to ours.…”

Section: Top-k Query Processingmentioning

confidence: 98%

“…However, the method proposed in Padhariya et al (2011) assumes an economic scheme (e.g., virtual currency) based on essentially different assumptions to ours. The methods proposed in Hagihara et al (2009);Sasaki et al (2010Sasaki et al ( , 2011Sasaki et al ( , 2014 estimate the kth score of data items in the network for minimizing unnecessary data replies as possible.…”

Section: Top-k Query Processingmentioning

confidence: 98%

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

et al. 2015

View full text Add to dashboard Cite

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.

show abstract

EcoTop: An Economic Model for Dynamic Processing of Top-k Queries in Mobile-P2P Networks

Cited by 13 publications

References 12 publications

CTR

CTR

Crowdsourcing: Dynamic Data Management in Mobile P2P Networks

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

Contact Info

Product

Resources

About