文章基本信息

标题：<i>k</i>-Nearest Neighbor Search based on Node Density in MANETs
本地全文：下载
作者：Yuka Komai, Yuya Sasaki, Takahiro Hara ; Shojiro Nishio
期刊名称：Mobile Information Systems
印刷版ISSN：1574-017X
出版年度：2014
卷号：10
DOI：10.3233/MIS-140189
出版社：Hindawi Publishing Corporation
摘要：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.