By Topic

Generic Adaptive Moving Object Tracking Algorithms

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Zhou, Jing ; Dept. of Comput., Hong Kong Polytech. Univ. ; Leong, H.V. ; Qin Lu ; Lee, K.C.K.

Moving object databases (MODs), the core component of location server to support location-related applications, keep track of the locations of moving objects which submit location update reports to the centralized server. In resource-limited wireless environments, the frequency and conditions for generating location update messages exert a strong impact on system performance in terms of update message cost and object location accuracy, hence the query result precision. Conceptually, moving objects are the sources of the location data while the MOD caches recently reported object locations for query processing. Owing to the inherent imprecision of the cached values, we impose a bounded level of inconsistency for the cached values, realized in the form of a "safe range" for a moving object. The cached value needs not be invalidated so long as the deviation of the object's current location from its reported location is within the safe range. A smaller safe range results in a higher accuracy of the cached value and hence more accurate query result at the expense of higher update cost, and vice versa. Since the size of the safe range is the key to system performance, we derive a system cost model to determine its appropriate value. Furthermore, to cater for highly dynamic environments in which object movement, query access pattern and system workload always change, we propose two adaptive safe range adjustment algorithms. Through extensive simulation experiments, the benefits brought about by our algorithms are evidenced

Published in:

Parallel Processing, 2006. ICPP 2006. International Conference on

Date of Conference:

14-18 Aug. 2006