This Article 
 Bibliographic References 
 Add to: 
MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries
October 2006 (vol. 5 no. 10)
pp. 1384-1402
Ling Liu, IEEE
With the growing popularity and availability of mobile communications, our ability to stay connected while on the move is becoming a reality instead of science fiction as it was just a decade ago. An important research challenge for modern location-based services is the scalable processing of location monitoring requests on a large collection of mobile objects. The centralized architecture, though studied extensively in literature, would create intolerable performance problems as the number of mobile objects grows significantly. This paper presents a distributed architecture and a suite of optimization techniques for scalable processing of continuously moving location queries. Moving location queries can be viewed as standing location tracking requests that continuously monitor the locations of mobile objects of interest and return a subset of mobile objects when certain conditions are met. We describe the design of MobiEyes, a distributed real time location monitoring system in a mobile environment. The main idea behind the MobiEyes' distributed architecture is to promote a careful partition of a real time location monitoring task into an optimal coordination of server-side processing and client-side processing. Such a partition allows evaluating moving location queries with a high degree of precision using a small number of location updates, thus providing highly scalable location monitoring services. A set of optimization techniques are used to limit the amount of computation to be handled by the mobile objects and enhance the overall performance and system utilization of MobiEyes. Important metrics to validate the proposed architecture and optimizations include messaging cost, server load, and amount of computation at individual mobile objects. We evaluate the scalability of the MobiEyes location monitoring approach using a simulation model based on a mobile setup. Our experimental results show that MobiEyes can lead to significant savings in terms of server load and messaging cost when compared to solutions relying on central processing of location information.

[1] US Naval Observatory GPS Operations, milgps.html, Apr. 2003.
[2] P.K. Agarwal, L. Arge, and J. Erickson, “Indexing Moving Points,” Proc. ACM Symp. Principles of Database Systems (PODS), 2000.
[3] C.C. Aggarwal and D. Agrawal, “On Nearest Neighbor Indexing of Nonlinear Trajectories,” Proc. ACM Symp. Principles of Database Systems (PODS), 2003.
[4] I. Akyildiz and W. Wang, “A Dynamic Location Management Scheme for Next Generation Multi-Tier Pcs Systems,” IEEE Trans. Wireless Comm., vol. 1, no. 1, pp. 178-190, 2002.
[5] A. Bar-Noy, I. Kessler, and M. Sidi, “Mobile Users: To Update or Not to Update,” ACM Wireless Networks, vol. 1, no. 2, pp. 175-185, 1995.
[6] N. Beckmann, H.-P. Kriegel, R. Schneider, and B. Seeger, “The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles,” Proc. ACM SIGMOD Conf., 1990.
[7] R. Benetis, C.S. Jensen, G. Karciauskas, and S. Saltenis, “Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects,” Proc. Int'l Database Eng. and Applications Symp., 2002.
[8] F. Bennett, D. Clarke, J. Evans, A. Hopper, A. Jones, and D. Leask, “Piconet: Embedded Mobile Networking,” IEEE Personal Comm., vol. 4, no. 5, pp. 8-15, 1997.
[9] A. Bhattacharya and S.K. Das, “Lezi-Update: An Information-Theoretic Approach to Track Mobile Users in PCS Networks,” Proc. ACM MobiCom Conf., 1999.
[10] Y. Cai, K. Hua, and G. Cao, “Processing Range-Monitoring Queries on Heterogeneous Mobile Objects,” Proc. IEEE Conf. Mobile Data Management, 2004.
[11] Y. Cai and K.A. Hua, “An Adaptive Query Management Technique for Efficient Real-Time Monitoring of Spatial Regions In Mobile Database Systems,” Proc. IEEE Int'l Performance Computing and Comm. Conf., 2002.
[12] R.M. Fujimoto, Parallel and Distributed Simulation Systems. Wiley-Interscience, 2000.
[13] B. Gedik, K.-L. Wu, P.S. Yu, and L. Liu, “Motion Adaptive Indexing for Moving Continual Queries over Moving Objects,” Proc. ACM Conf. Information and Knowledge Management, 2004.
[14] Z.J. Has, “Panel Report on Ad Hoc Networks,” Mobile Computing and Comm. Rev., vol. 2, no. 1, 1998.
[15] Q. Huang, C. Lu, and G.C. Roman, “Spatiotemporal Multicast in Sensor Networks,” Proc. ACM MobiSys Conf., 2003.
[16] T. Imielinski, S. Viswanathan, and B. Badrinath, “Energy Efficient Indexing on Air,” Proc. ACM SIGMOD Conf., 1994.
[17] J. Kucera and U. Lott, “Single Chip 1.9 GHz Transceiver Frontend MMIC Including Rx/Tx Local Oscillatorrs and 300 mw Power Amplifier,” MTT Symp. Digest, vol. 4, pp. 1405-1408, June 1999.
[18] G. Kollios, D. Gunopulos, and V.J. Tsotras, “On Indexing Mobile Objects,” Proc. ACM Symp. Principles of Database Systems, 1999.
[19] I. Lazaridis, K. Porkaew, and S. Mehrotra, “Dynamic Queries over Mobile Objects,” Proc. Int'l Conf. Extending Database Technology (EDBT), 2002.
[20] L. Liu, C. Pu, and W. Tang, “Continual Queries for Internet Scale Event-Driven Information Delivery,” IEEE Trans. Knowledge and Data Eng., pp. 610-628, 1999.
[21] D.L. Mills, “Internet Time Synchronization: The Network Time Protocol,” IEEE Trans. Comm., pp. 1482-1493, 1991.
[22] M.F. Mokbel, X. Xiong, and W.G. Aref, “SINA: Scalable Incremental Processing of Continuous Queries in Spatio-Temporal Databases,” Proc. ACM SIGMOD Conf., 2004.
[23] Z. Naor and H. Levy, “Minimizing the Wireless Cost of Tracking Mobile Users: An Adaptive Threshold Scheme,” Proc. IEEE INFOCOM Conf., 1998.
[24] D. Pfoser, C.S. Jensen, and Y. Theodoridis, “Novel Approaches in Query Processing for Moving Object Trajectories,” Proc. Conf. Very Large Databases, 2000.
[25] S. Prabhakar, Y. Xia, D.V. Kalashnikov, W.G. Aref, and S.E. Hambrusch, “Query Indexing and Velocity Constrained Indexing: Scalable Techniques for Continuous Queries on Moving Objects,” IEEE Trans. Computers, vol. 51, no. 10, pp. 1124-1140, Oct. 2002.
[26] QualComm, “Wireless Access Solutions Using 1xEV-DO,” webpaperswp_ wirelessaccess.pdf, 2005.
[27] S. Saltenis, C.S. Jensen, S.T. Leutenegger, and M.A. Lopez, “Indexing the Positions of Continuously Moving Objects,” Proc. ACM SIGMOD Conf., 2000.
[28] F.B. Schneider, “Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial,” ACM Computing Surveys, vol. 22, no. 4, pp. 299-319, 1990.
[29] A.P. Sistla, O. Wolfson, S. Chamberlain, and S. Dao, “Modeling and Querying Moving Objects,” Proc. IEEE Int'l Conf. Data Eng., 1997.
[30] Y. Tao and D. Papadias, “Time-Parameterized Queries in Spatio-Temporal Databases,” Proc. ACM SIGMOD Conf., 2002.
[31] Y. Tao, D. Papadias, and Q. Shen, “Continuous Nearest Neighbor Search,” Proc. Conf. Very Large Databases, 2002.
[32] Y. Tao, D. Papadias, and J. Sun, “The $\rm TPR^*{\hbox{-}}\rm Tree$ : An Optimized Spatio-Temporal Access Method for Predictive Queries,” Proc. Conf. Very Large Databases, 2003.
[33] O. Wolfson, “The Opportunities and Challenges of Location Information Management,” Proc. Intersections of Geospatial Information and Information Technology Workshop, 2001.
[34] O. Wolfson, “Moving Objects Information Management: The Database Challenge,” Proc. Conf. Next Generation Information Technologies and Systems (NGITS), 2002.
[35] O. Wolfson, P. Sistla, S. Chamberlain, and Y. Yesha, “Updating and Querying Databases that Track Mobile Units,” Distributed and Parallel Databases, vol. 7, no. 3, pp. 257-387, 1999.
[36] O. Wolfson, B. Xu, S. Chamberlain, and L. Jiang, “Moving Objects Databases: Issues and Solutions,” Statistical and Scientific Database Management, 1998.

Index Terms:
Spatial queries over mobile objects, distributed algorithms, mobile data management.
Bugra Gedik, Ling Liu, "MobiEyes: A Distributed Location Monitoring Service Using Moving Location Queries," IEEE Transactions on Mobile Computing, vol. 5, no. 10, pp. 1384-1402, Oct. 2006, doi:10.1109/TMC.2006.153
Usage of this product signifies your acceptance of the Terms of Use.