Scalable processing of spatial alarms

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Spatial alarms can be modeled as location-based triggers which are fired whenever the subscriber enters the spatial region around the location of interest associated with the alarm. Alarm processing requires meeting two demanding objectives: high accuracy, which ensures zero or very low alarm misses, and system scalability, which requires highly efficient processing of spatial alarms. Existing techniques like periodic evaluation or continuous query-based approach, when applied to the spatial alarm processing problem, lead to unpredictable inaccuracy in alarm processing or unnecessarily high computational costs or both. In order to deal with these weaknesses, we introduce the concept of safe period to minimize the number of unnecessary spatial alarm evaluations, increasing the throughput and scalability of the server. Further, we develop alarm grouping techniques based on locality of the alarms and motion behavior of the mobile users, which reduce safe period computation costs at the server side. An evaluation of the scalability and accuracy of our approach using a road network simulator shows that the proposed approach offers significant performance enhancements for the alarm processing server. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Bamba, B., Liu, L., Yu, P. S., Zhang, G., & Doo, M. (2008). Scalable processing of spatial alarms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5374 LNCS, pp. 232–244). Springer Verlag. https://doi.org/10.1007/978-3-540-89894-8_23

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free