|
|
|
                                           
|
Return to Location-Aware Services
While the K-Nearest-Neighbor (KNN) problem is well studied in the traditional wired, disk-based client-server environment, it has not been tackled in a wireless broadcast environment. In this paper, the problem of organizing location dependent data and answering KNN queries on air are investigated. The linear property of wireless broadcast media and power conserving requirement of mobile devices make this problem particularly interesting and challenging. An efficient data organization, called sorted list, and the corresponding search algorithm are proposed and compared with the well-known spatial index, R-Tree. In addition, we develop an approximate search scope to guide the search at the very beginning of the search process and a learning algorithm to adapt the search scope during the search to improve energy and access efficiency. Simulation based performance evaluation is conducted to compare sorted list and R-Tree. The results show that the utilization of search scope and learning algorithm improves search efficiency of both index mechanisms significantly. While R-Tree is more power efficient when a large number of nearest neighbors is requested, the sorted list has better access efficiency and less power consumption when the number of nearest neighbors is small.
@inproceedings {DBLP:conf/mdm/ZhengLL03, author = {Baihua Zheng and Wang-Chien Lee and Dik Lun Lee}, booktitle = {Mobile Data Management}, title = {Search K Nearest Neighbors on Air.}, pages = {181-195}, year = {2003}, url = {db/conf/mdm/mdm2003.html#ZhengLL03}, ee = {http://link.springer.de/link/service/series/0558/bibs/2574/25740181.htm}, crossref = {conf/mdm/2003}, bibsource = {DBLP, http://dblp.uni-trier.de} }  ©2005 Association for Computing Machinery |
