TECPRO

Applications of recent developments in the research world such as traffic control system, military campaign etc., demands the development of continuous monitoring over moving objects. From the enormous research which has been carried out on this problem is NP-hard. Several approximate algorithms have been proposed and used in practice. In this moving objects monitoring thesis, the study of continuous k-means computation at a server that monitors a set of moving objects is done. Whenever there is an object update re-evaluation of k-means is needed every time that imposes a heavy burden on the server (for computing the centers from scratch) and the clients (for continuously sending location updated).

These problems are overcome with a novel approach that significantly reduces the computation and communication costs guaranteeing the quality of the solution with respect of the re-evaluation approach, which is bounded by a user-defined tolerance. The proposed method assigns a threshold (i.e., range) for each moving object is such that the object sends a location update only when it crosses the range boundary. First, an efficient technique for maintaining the k-means is developed. Then, the mathematical formulae and algorithms for deriving the individual thresholds are presented. Finally, the performance claims with extensive experiments are justified. Our academicians supervise our students during preparation of their moving objects monitoring methods project at very nominal costs.

R.Gajalakshmi