In mobile ad hoc networks (MANETs), to acquire only necessary data items, it is effective for
each mobile node to retrieve data items using a top-k query. In our previous work, we …

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 …

In mobile ad hoc networks (MANETs), it is effective to retrieve data items using top-k query.
However, accurate results may not be acquired in environments when malicious nodes are …

Since clustering algorithms are heuristic, multiple clustering algorithms applied to the same
dataset will typically not generate the same sets of clusters. This is especially true for …

In mobile ad hoc networks (MANETs), it is effective for mobile nodes to retrieve data items
using top-k queries, in which data items are ordered according to a particular attribute score …

With the increase of data generation in distributed fashions such as peer-to-peer systems
and sensor networks, top-k query processing which is a way to aggregate only a small set of …

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 …

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 …

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 …

In this paper, we propose a method that fully combines top-k query processing with
replication strategy in mobile ad hoc networks (MANETs). The goal is to acquire perfect …