PAM: FRAMEWORK FOR CONTINUOUSLY TRACKING OBJECTS

SUBMITTED BY G.KANMANI
GUIDED BY Mrs.A.SAGAYARANI M.Tech

ABSTRACT
We

consider in this paper how to leverage heterogeneous mobile computing capability for efficient processing of realtime range-monitoring queries. In our environment, each mobile object is associated with a resident domain and when an object moves, it monitors its spatial relationship with its resident domain and the monitoring areas inside it.
An

object reports its location to server whenever its movement affects any query results (i.e., crossing any query boundaries) or it moves out of its resident domain. In the first case, the server updates the affected query results accordingly while in the second case, the server determines a new resident domain for the object.

This

distributive approach is able to provide accurate query results and real-time monitoring updates with minimal location update and server processing costs. In addition, the new scheme allows a mobile object to negotiate a resident domain based on its computing capability.
Thus,

a more capable object can have a larger resident domain reducing its chance of having to request a new resident domain because of moving out of it. This feature makes the new approach highly adaptive to the heterogeneity of mobile objects.
In

our performance study, we compare it with an existing approach using simulation. The study shows that the new technique is many times better in reducing mobile communication and server processing costs

INTRODUCTION ABOUT THE PROJECT Consider a computing environment with a large number of locationaware mobile objects. We want to retrieve the mobile objects inside a set of user-defined spatial regions and continuously monitor the population of these windows over a time period. In this paper, we refer to such continuous queries as range-monitoring queries.
Efficient

processing of range-monitoring queries could enable many useful applications. For instances, a teacher, on a field trip, can monitor several groups of children in different rooms of a museum; a pilot, as part of the preparation for landing, might want to be informed of other airplanes in the airport area for the next several minutes; digital battlefields, a commander might want to continuously monitor the imminent bombing areas and alert the friendly vehicles within those regions; In such applications, it is highly desirable and sometime critical to provide accurate results and update them in real time whenever mobile objects enter or exit the regions of interest.

Unlike

conventional range queries, a range-monitoring query is a continuous query. It stays active until it is terminated explicitly by the user. As objects continue to move, the query results change accordingly and require continuous updates.
This

simple approach requires excessive location updates, and obviously is not scalable. Each location update consists of two expenses - mobile communication cost and server processing cost.
If

a battery-powered object has to constantly report its location, the battery would be exhausted very quickly.

EXISTING SYSTEM

The fundamental problem in a monitoring system is when and how a mobile client should send location updates to the server because it determines three principal performance measures of monitoringaccuracy, efficiency, and privacy. Accuracy means how often the monitored results are correct, and it heavily depends on the frequency and accuracy of location updates. As for efficiency, two dominant costs are: the wireless communication cost for location updates and the query evaluation cost at the database server, both of which depend on the frequency of location updates. As for privacy, the accuracy of location updates determines how much the clients privacy is exposed to the server.

DISADVANTAGES

No accuracy, efficiency and privacy Query results are correct only at the time instances of periodic updates, but not in between them or at any time of deviation updates A high update frequency may improve the monitoring accuracy, but is at the cost of unnecessary updates and query reevaluation Server workload using periodic update is not balanced over time

PROPOSED SYSTEM

Our basic idea is to maintain a rectangular area, called safe region, for each object. The safe region is computed based on the queries in such a way that the current results of all queries remain valid as long as all objects reside inside their respective safe regions. A client updates its location on the server only when the client moves out of its safe region. This significantly improves the monitoring efficiency and accuracy compared to the periodic or deviation update methods. ADVANTAGES Improve the monitoring efficiency and accuracy compared to the periodic or deviation update methods Efficient query processing algorithms for common spatial query types Addresses the issue of location updating holistically with monitoring accuracy, efficiency, and privacy altogether Reduces location updates to only when an object is moving out of the safe region

SYSTEM SPECIFICATION MINIMUM HARDWARE SPECIFICATION The hardware used for the development of the project is: PROCESSOR: Pentium III and Above (or) Equivalent RAM :Minimum 256MB HARD DISK:20 GB MONITOR:15' Color with VGI card support PROCESSOR SPEED: Minimum 500 MHz MINIMUM SOFTWARE SPECIFICATION The software used for the development of the project is: OPERATING SYSTEM:WINDOWS XP PLATFORM:VISUAL STUDIO 2005 LANGUAGE:C# DATABASE:SQL SERVER 2000

SYSTEM ARCHITECTURE DIAGRAM 1

IMPLEMENTATION INPUT DESIGN Input design is the process of converting user-originated inputs to a computer-based format. Input design is one of the most expensive phases of the operation of computerized system and is often the major problem of a system.
Modules:

User Sub Server Main server Monitoring

User Client updates its location on the server only when the client moves out of its safe region. This significantly improves the monitoring efficiency and accuracy compared to the periodic or deviation update methods.

Sub Server Login Choose the area Monitoring the clients Temporarily stored the client details Update the important details to the main server
Main server Check the sub server login Receive the datas from sub server
Maintain the all client details

Monitoring First, with the introduction of bounding boxes, the result of a query is no longer unique. Among all possible results, we argue that the most probable result, i.e., the one with the highest probability, is most promising for approximating the genuine result. Second, the most probable result also adds complexity to the definition of safe region. New algorithms must be designed to compute maximum safe regions in order to reduce the number of location updates, and thus, improve efficiency. Third, as the location updater decides when and how a bounding box is updated, its strategy determines the accuracy, privacy, and efficiency of the framework.

SCREEN SHOTS

CONCLUSION
This paper proposes a framework for monitoring continuous spatial

queries over moving objects. The framework is the first to holistically address the issue of location updating with regard to monitoring accuracy, efficiency, and privacy. We provide detailed algorithms for query evaluation/reevaluation and safe region computation in this framework. We also devise threeclient update strategies that optimize accuracy, privacy, and efficiency, respectively. The performance of our framework is evaluated through a series of experiments. The results show that it substantially outperforms periodic monitoring in terms of accuracy and CPU cost while achieving a close-to-optimal communication cost. Furthermore, the framework is robust and scales well with various parameter settings, such as privacy requirement, moving speed, and the number of queries and moving objects

FUTURE ENHANCEMENT
As

for future work, we plan to incorporate other types of queries into the framework, such as spatial joins and aggregate queries.
We

also plan to further optimize the performance of the framework. In particular, the minimum cost update strategy shows that the safe region is a crude approximation of the ideal safe area, mainly because we separately optimize the safe region for each query, but not globally.
A

possible solution is to sequentially optimize the queries but maintain the safe region accumulated by the queries optimized so far.
Then,

the optimal safe region for each query should depend not only on the query, but also on the accumulated safe region.

REFERENCES S. Babu and J. Widom, Continuous Queries over Data Streams, Proc. ACM SIGMOD, 2001. N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger, The R*-Tree: An Efficient and Robust Access Method for Points and Rectangles, Proc. ACM SIGMOD, pp. 322-331, 1990. R. Benetis, C.S. Jensen, G. Karciauskas, and S. Saltenis, Nearest Neighbor and Reverse Nearest Neighbor Queries for Moving Objects, Proc. Intl Database Eng. and Applications Symp. (IDEAS), 2002. Beresford and F. Stajano, Location Privacy in Pervasive Computing, IEEE Pervasive Computing, vol. 2, no. 1, pp. 46-55, Jan.-Mar. 2003. J. Broch, D.A. Maltz, D. Johnson, Y.-C. Hu, and J. Jetcheva, A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols, Proc. ACM/IEEE MobiCom, pp. 85-97, 1998. Y. Cai, K.A. Hua, and G. Cao, Processing Range-Monitoring Queries on Heterogeneous Mobile Objects, Proc. IEEE Intl Conf.Mobile Data Management (MDM), 2004.