Examining Impact of Sequential Access for Nearest Neighbor Search in Wireless Data Broadcast

Myong-Soo LEE  SangKeun LEE  

IEICE TRANSACTIONS on Communications   Vol.E91-B   No.9   pp.2964-2971
Publication Date: 2008/09/01
Online ISSN: 1745-1345
DOI: 10.1093/ietcom/e91-b.9.2964
Print ISSN: 0916-8516
Type of Manuscript: PAPER
Category: Energy in Electronics Communications
location-based services,  wireless data broadcast,  nearest neighbor query,  energy conservation,  

Full Text: PDF>>
Buy this Article

It is observed, surprisingly, that existing nearest neighbor search methods in wireless data broadcast may not work effectively on mobile clients with very limited memory space. To resolve this problem, a novel method for nearest neighbor search is introduced in the context of a representative of indexes, the grid-partition index, in wireless data broadcast. In the proposed scheme, a mobile client performs the nearest neighbor search by making a sequential access to index packets according to their broadcast order over a wireless channel. The performance evaluation demonstrates that our approach substantially outperforms limited memory versions of existing methods in terms of access time, while retaining a good energy conservation.