File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Continuous spatial assignment of moving users

TitleContinuous spatial assignment of moving users
Authors
KeywordsContinuous query
Optimal assignment
Spatial monitoring
Issue Date2010
PublisherSpringer Verlag. The Journal's web site is located at http://link.springer.de/link/service/journals/00778/index.htm
Citation
VLDB Journal, 2010, v. 19 n. 2, p. 141-160 How to Cite?
AbstractConsider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest quality of service, we wish to minimize the average distance between users and their assigned server. This is an instance of a well-studied problem in operations research, termed optimal assignment. Even though there exist several solutions for the static case (where user locations are fixed), there is currently no method for dynamic settings. In this paper, we consider the continuous assignment problem (CAP), where an optimal assignment must be constantly maintained between mobile users and a set of servers. The fact that the users are mobile necessitates real-time reassignment so that the quality of service remains high (i.e., their distance from their assigned servers is minimized). The large scale and the time-critical nature of targeted applications require fast CAP solutions. We propose an algorithm that utilizes the geometric characteristics of the problem and significantly accelerates the initial assignment computation and its subsequent maintenance. Our method applies to different cost functions (e.g., average squared distance) and to any Minkowski distance metric (e.g., Euclidean, L 1 norm, etc.). © Springer-Verlag 2009.
Persistent Identifierhttp://hdl.handle.net/10722/129992
ISSN
2015 Impact Factor: 1.744
2015 SCImago Journal Rankings: 0.899
ISI Accession Number ID
Funding AgencyGrant Number
Hong Kong RGCHKU714907E
Research Center, School of Information Systems, Singapore Management University
Funding Information:

This work was supported by grant HKU714907E from Hong Kong RGC and by the Research Center, School of Information Systems, Singapore Management University.

References

 

DC FieldValueLanguage
dc.contributor.authorU, LHen_HK
dc.contributor.authorMouratidis, Ken_HK
dc.contributor.authorMamoulis, Nen_HK
dc.date.accessioned2010-12-23T08:45:11Z-
dc.date.available2010-12-23T08:45:11Z-
dc.date.issued2010en_HK
dc.identifier.citationVLDB Journal, 2010, v. 19 n. 2, p. 141-160en_HK
dc.identifier.issn1066-8888en_HK
dc.identifier.urihttp://hdl.handle.net/10722/129992-
dc.description.abstractConsider a set of servers and a set of users, where each server has a coverage region (i.e., an area of service) and a capacity (i.e., a maximum number of users it can serve). Our task is to assign every user to one server subject to the coverage and capacity constraints. To offer the highest quality of service, we wish to minimize the average distance between users and their assigned server. This is an instance of a well-studied problem in operations research, termed optimal assignment. Even though there exist several solutions for the static case (where user locations are fixed), there is currently no method for dynamic settings. In this paper, we consider the continuous assignment problem (CAP), where an optimal assignment must be constantly maintained between mobile users and a set of servers. The fact that the users are mobile necessitates real-time reassignment so that the quality of service remains high (i.e., their distance from their assigned servers is minimized). The large scale and the time-critical nature of targeted applications require fast CAP solutions. We propose an algorithm that utilizes the geometric characteristics of the problem and significantly accelerates the initial assignment computation and its subsequent maintenance. Our method applies to different cost functions (e.g., average squared distance) and to any Minkowski distance metric (e.g., Euclidean, L 1 norm, etc.). © Springer-Verlag 2009.en_HK
dc.languageengen_US
dc.publisherSpringer Verlag. The Journal's web site is located at http://link.springer.de/link/service/journals/00778/index.htmen_HK
dc.relation.ispartofVLDB Journalen_HK
dc.rightsThe original publication is available at www.springerlink.comen_US
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.subjectContinuous queryen_HK
dc.subjectOptimal assignmenten_HK
dc.subjectSpatial monitoringen_HK
dc.titleContinuous spatial assignment of moving usersen_HK
dc.typeArticleen_HK
dc.identifier.emailMamoulis, N:nikos@cs.hku.hken_HK
dc.identifier.authorityMamoulis, N=rp00155en_HK
dc.description.naturepostprint-
dc.identifier.doi10.1007/s00778-009-0144-3en_HK
dc.identifier.scopuseid_2-s2.0-77951939091en_HK
dc.identifier.hkuros176417en_US
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-77951939091&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume19en_HK
dc.identifier.issue2en_HK
dc.identifier.spage141en_HK
dc.identifier.epage160en_HK
dc.identifier.eissn0949-877X-
dc.identifier.isiWOS:000276437900001-
dc.publisher.placeGermanyen_HK
dc.identifier.scopusauthoridU, LH=25647036700en_HK
dc.identifier.scopusauthoridMouratidis, K=9637493700en_HK
dc.identifier.scopusauthoridMamoulis, N=6701782749en_HK
dc.identifier.citeulike4863753-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats