Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 2015, Article ID 657431, 20 pages
Research Article

Efficient Multidimensional Top- Query Processing in Wireless Multihop Networks

1Graduate School of Information Science and Technology, Osaka University, Osaka 565-0871, Japan
2Institute of Innovation for Future Society, Nagoya University, Aichi 464-8601, Japan

Received 29 August 2014; Accepted 1 September 2014

Academic Editor: David Taniar

Copyright © 2015 Daichi Amagata et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


Top- queries, which retrieve the 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.