Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 10 (2014), Issue 4, Pages 385-405
http://dx.doi.org/10.3233/MIS-140189

k-Nearest Neighbor Search based on Node Density in MANETs

Yuka Komai, Yuya Sasaki, Takahiro Hara, and Shojiro Nishio

Department of Multimedia Engineering, Graduate School of Information Science and Technology, Osaka University, Osaka, Japan

Received 30 May 2014; Accepted 30 May 2014

Copyright © 2014 Hindawi Publishing Corporation. 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.

Abstract

In a kNN query processing method, it is important to appropriately estimate the range that includes kNNs. While the range could be estimated based on the node density in the entire network, it is not always appropriate because the density of nodes in the network is not uniform. In this paper, we propose two kNN query processing methods in MANETs where the density of nodes is ununiform; the One-Hop (OH) method and the Query Log (QL) method. In the OH method, the nearest node from the point specified by the query acquires its neighbors' location and then determines the size of a circle region (the estimated kNN circle) which includes kNNs with high probability. In the QL method, a node which relays a reply of a kNN query stores the information on the query result for future queries.