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

Myong Soo Lee, Sang-Geun Lee

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)2964-2971
Number of pages8
JournalIEICE Transactions on Communications
Issue number9
Publication statusPublished - 2008


  • Energy conservation
  • Location-based services
  • Nearest neighbor query
  • Wireless data broadcast

ASJC Scopus subject areas

  • Software
  • Computer Networks and Communications
  • Electrical and Electronic Engineering


Dive into the research topics of 'Examining impact of sequential access for nearest neighbor search in wireless data broadcast'. Together they form a unique fingerprint.

Cite this