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

Myong Soo Lee, Sang-Geun Lee

Research output: Contribution to journalArticle

Abstract

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
VolumeE91-B
Issue number9
DOIs
Publication statusPublished - 2008 Dec 1

Fingerprint

Data storage equipment
Energy conservation
Nearest neighbor search

Keywords

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

ASJC Scopus subject areas

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

Cite this

Examining impact of sequential access for nearest neighbor search in wireless data broadcast. / Lee, Myong Soo; Lee, Sang-Geun.

In: IEICE Transactions on Communications, Vol. E91-B, No. 9, 01.12.2008, p. 2964-2971.

Research output: Contribution to journalArticle

@article{8af67b135804455da621567f93e71a79,
title = "Examining impact of sequential access for nearest neighbor search in wireless data broadcast",
abstract = "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.",
keywords = "Energy conservation, Location-based services, Nearest neighbor query, Wireless data broadcast",
author = "Lee, {Myong Soo} and Sang-Geun Lee",
year = "2008",
month = "12",
day = "1",
doi = "10.1093/ietcom/e91-b.9.2964",
language = "English",
volume = "E91-B",
pages = "2964--2971",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "9",

}

TY - JOUR

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

AU - Lee, Myong Soo

AU - Lee, Sang-Geun

PY - 2008/12/1

Y1 - 2008/12/1

N2 - 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.

AB - 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.

KW - Energy conservation

KW - Location-based services

KW - Nearest neighbor query

KW - Wireless data broadcast

UR - http://www.scopus.com/inward/record.url?scp=67651085463&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=67651085463&partnerID=8YFLogxK

U2 - 10.1093/ietcom/e91-b.9.2964

DO - 10.1093/ietcom/e91-b.9.2964

M3 - Article

VL - E91-B

SP - 2964

EP - 2971

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 9

ER -