In this paper we present an energy efficient framework for processing spatial alarms on mobile clients, while maintaining low computation and storage costs. Our approach to spatial alarms provides two systematic methods for minimizing energy consumption on mobile clients. First, we introduce the concept of safe distance to reduce the number of unnecessary mobile client wakeups for spatial alarm evaluation. This mechanism not only reduces the amount of unnecessary processing of the spatial alarms but also significantly minimizes the energy consumption on mobile clients, compared to periodic wakeups, while preserving the accuracy and timeliness of the spatial alarms. Second, we develop a suite of techniques for minimizing the number of location triggers to be checked for spatial alarm evaluation upon each wakeup. This further reduces the computation cost and energy expenditure on mobile clients. We evaluate the scalability and energy-efficiency of our approach using a road network simulator. Our client based framework for spatial alarms offers significant improvements on both system performance and battery lifetime of mobile clients, while maintaining high quality of spatial alarm services, especially compared to the conventional approach of periodic wakeup and checking all alarms upon wakeup.
[1]
Franz Aurenhammer,et al.
Voronoi diagrams—a survey of a fundamental geometric data structure
,
1991,
CSUR.
[2]
Edsger W. Dijkstra,et al.
A note on two problems in connexion with graphs
,
1959,
Numerische Mathematik.
[3]
Martin Erwig,et al.
The graph Voronoi diagram with applications
,
2000,
Networks.
[4]
Walid G. Aref,et al.
Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects
,
2002,
IEEE Trans. Computers.
[5]
Joel F. Bartlett,et al.
The Itsy Pocket Computer
,
2000
.
[6]
Steven Fortune,et al.
Voronoi Diagrams and Delaunay Triangulations
,
2004,
Handbook of Discrete and Computational Geometry, 2nd Ed..
[7]
Antonin Guttman,et al.
R-trees: a dynamic index structure for spatial searching
,
1984,
SIGMOD '84.
[8]
John S. Heidemann,et al.
Location-Aware Scheduling with Minimal Infrastructure
,
2000,
USENIX Annual Technical Conference, General Track.