Top-k Query Evaluation in Sensor Networks with the Guaranteed Accuracy of Query Results

Chen, Baichen; Liang, Weifa; Min, Geyong

doi:10.1007/978-3-642-23088-2_11

Cited by 4 publications

(3 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Efficient top-k query processing methods for distributed environments such as P2P networks (Akbarinia et al 2006;Michel et al 2005;Vlachou et al 2008Vlachou et al , 2012 and wireless sensor networks (WSNs) (Chen et al 2010(Chen et al , 2011Jiang et al 2011;Liu et al 2010;Niedermayer et al 2010;Wu et al 2007) have also been proposed. However, P2P networks assume neither packet collisions nor movement of nodes and typically assume that any peers can communicate directly with other peers.…”

Section: Motivationmentioning

confidence: 99%

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

Section: Motivationmentioning

confidence: 99%

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

et al. 2015

View full text Add to dashboard Cite

show abstract

“…Figure 1: Application example packet losses, meaning that such a centralized approach is unsuitable for MANETs. Efficient top-k query processing methods for distributed environments such as P2P networks [1,18,27,28] and wireless sensor networks (WSNs) [10,11,16,17,19,29] have also been proposed. However, P2P networks assume neither packet collision nor movement of nodes and typically assume that any peers can communicate directly with other peers.…”

Section: Introductionmentioning

confidence: 99%

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

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

“…Although the method proposed in [23] processes a top-query as in [11], this method replies to not only parent node but also its brother node to provide them with more information on the scores of data objects, which can prune more unnecessary data objects. In [24], the authors proposed a method that suppresses energy consumption which sacrifices the accuracy of the query result. The method proposed in [22] optimizes top-queries by employing a sampling-based approximation.…”

Section: Related Workmentioning

confidence: 99%

Efficient Multidimensional Top-kQuery Processing in Wireless Multihop Networks

Amagata

Sasaki

Hara

et al. 2015

Mobile Information Systems

View full text Add to dashboard Cite

Top-queries, which retrieve the k most preferable data objects, have been receiving much attention. An emerging challenge is to support efficient top-query processing in a wireless distributed network. In this study, we investigated how to process multidimensional top-queries efficiently in a wireless multihop network. A major challenge for multidimensional top-queries is that answers for different users are typically different, because each user has a unique preference and search range. Meanwhile, it is desirable for wireless networks to reduce unnecessary traffic even if users issue top-queries with their own unique preferences. Therefore, we address the above problem and propose a top-query processing method in wireless multihop networks, called ClusTo. ClusTo performs a novel clustering scheme for multidimensional top-query processing and routes queries based on the cluster while guaranteeing the user's specified search range. Moreover, ClusTo takes a dynamic threshold approach to suppress unnecessary query transmissions to nodes which do not contribute to top-data retrieval. Extensive experiments on both real and synthetic data have demonstrated that ClusTo outperforms existing methods in terms of traffic and delay.

show abstract

Top-k Query Evaluation in Sensor Networks with the Guaranteed Accuracy of Query Results

Cited by 4 publications

References 16 publications

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

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

CTR

Efficient Multidimensional Top-kQuery Processing in Wireless Multihop Networks

Contact Info

Product

Resources

About