Examining impact of sequential access for nearest neighbor search in wireless data broadcast

초록

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, tire 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.

키워드