Nearest surrounder searching in mobile computing environments

Jaehwa Chung, Hong Jun Jang, Kyoung Ho Jung, Soon Young Jung

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

The key issue in mobile computing environments (MCEs) is how to relieve communication congestion and provide accurate information through location-based services (LBSs). The nearest surrounder (NS) query, used to find all visible objects around a given location, is a type of spatial query that suggests broad application base in LBS domain. However, because existing works for NS query only take into account static query points, the application of the NS query is limited to various LBSs in MCEs requiring frequent location updates. Motivated by this limitation, this paper introduces the continuous nearest surrounder (CNS) query, which uses a decentralized system framework to continuously maintain updated query results in MCEs. In this framework, the LBS server executes an initial NS query to prepare a region, termed non-provoked polygon (NPP), defines a set of visible objects that cannot be changed. Conversely, a client caches the NPP and does not update request unless it leaves its NPP. We performed extensive experiments using synthetic and real datasets with various data cardinality, and query mobility to validate the accurate performance of the proposed strategy. The results show that the CNS algorithm outperforms NS, in terms of computation and communication costs as well as scalability.

Original languageEnglish
Pages (from-to)770-791
Number of pages22
JournalInternational Journal of Communication Systems
Volume26
Issue number6
DOIs
Publication statusPublished - 2013 Jun 1

Fingerprint

Location based services
Mobile computing
Communication
Scalability
Servers
Costs
Experiments

Keywords

  • location-based services
  • mobile computing environment
  • nearest surrounder
  • spatial query

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Networks and Communications

Cite this

Nearest surrounder searching in mobile computing environments. / Chung, Jaehwa; Jang, Hong Jun; Jung, Kyoung Ho; Jung, Soon Young.

In: International Journal of Communication Systems, Vol. 26, No. 6, 01.06.2013, p. 770-791.

Research output: Contribution to journalArticle

Chung, Jaehwa ; Jang, Hong Jun ; Jung, Kyoung Ho ; Jung, Soon Young. / Nearest surrounder searching in mobile computing environments. In: International Journal of Communication Systems. 2013 ; Vol. 26, No. 6. pp. 770-791.
@article{99ba930849b7474981d34c9827b3818b,
title = "Nearest surrounder searching in mobile computing environments",
abstract = "The key issue in mobile computing environments (MCEs) is how to relieve communication congestion and provide accurate information through location-based services (LBSs). The nearest surrounder (NS) query, used to find all visible objects around a given location, is a type of spatial query that suggests broad application base in LBS domain. However, because existing works for NS query only take into account static query points, the application of the NS query is limited to various LBSs in MCEs requiring frequent location updates. Motivated by this limitation, this paper introduces the continuous nearest surrounder (CNS) query, which uses a decentralized system framework to continuously maintain updated query results in MCEs. In this framework, the LBS server executes an initial NS query to prepare a region, termed non-provoked polygon (NPP), defines a set of visible objects that cannot be changed. Conversely, a client caches the NPP and does not update request unless it leaves its NPP. We performed extensive experiments using synthetic and real datasets with various data cardinality, and query mobility to validate the accurate performance of the proposed strategy. The results show that the CNS algorithm outperforms NS, in terms of computation and communication costs as well as scalability.",
keywords = "location-based services, mobile computing environment, nearest surrounder, spatial query",
author = "Jaehwa Chung and Jang, {Hong Jun} and Jung, {Kyoung Ho} and Jung, {Soon Young}",
year = "2013",
month = "6",
day = "1",
doi = "10.1002/dac.2409",
language = "English",
volume = "26",
pages = "770--791",
journal = "International Journal of Communication Systems",
issn = "1074-5351",
publisher = "John Wiley and Sons Ltd",
number = "6",

}

TY - JOUR

T1 - Nearest surrounder searching in mobile computing environments

AU - Chung, Jaehwa

AU - Jang, Hong Jun

AU - Jung, Kyoung Ho

AU - Jung, Soon Young

PY - 2013/6/1

Y1 - 2013/6/1

N2 - The key issue in mobile computing environments (MCEs) is how to relieve communication congestion and provide accurate information through location-based services (LBSs). The nearest surrounder (NS) query, used to find all visible objects around a given location, is a type of spatial query that suggests broad application base in LBS domain. However, because existing works for NS query only take into account static query points, the application of the NS query is limited to various LBSs in MCEs requiring frequent location updates. Motivated by this limitation, this paper introduces the continuous nearest surrounder (CNS) query, which uses a decentralized system framework to continuously maintain updated query results in MCEs. In this framework, the LBS server executes an initial NS query to prepare a region, termed non-provoked polygon (NPP), defines a set of visible objects that cannot be changed. Conversely, a client caches the NPP and does not update request unless it leaves its NPP. We performed extensive experiments using synthetic and real datasets with various data cardinality, and query mobility to validate the accurate performance of the proposed strategy. The results show that the CNS algorithm outperforms NS, in terms of computation and communication costs as well as scalability.

AB - The key issue in mobile computing environments (MCEs) is how to relieve communication congestion and provide accurate information through location-based services (LBSs). The nearest surrounder (NS) query, used to find all visible objects around a given location, is a type of spatial query that suggests broad application base in LBS domain. However, because existing works for NS query only take into account static query points, the application of the NS query is limited to various LBSs in MCEs requiring frequent location updates. Motivated by this limitation, this paper introduces the continuous nearest surrounder (CNS) query, which uses a decentralized system framework to continuously maintain updated query results in MCEs. In this framework, the LBS server executes an initial NS query to prepare a region, termed non-provoked polygon (NPP), defines a set of visible objects that cannot be changed. Conversely, a client caches the NPP and does not update request unless it leaves its NPP. We performed extensive experiments using synthetic and real datasets with various data cardinality, and query mobility to validate the accurate performance of the proposed strategy. The results show that the CNS algorithm outperforms NS, in terms of computation and communication costs as well as scalability.

KW - location-based services

KW - mobile computing environment

KW - nearest surrounder

KW - spatial query

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

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

U2 - 10.1002/dac.2409

DO - 10.1002/dac.2409

M3 - Article

AN - SCOPUS:84879210222

VL - 26

SP - 770

EP - 791

JO - International Journal of Communication Systems

JF - International Journal of Communication Systems

SN - 1074-5351

IS - 6

ER -