Cart (Loading....) | Create Account
Close category search window
 

k-Closest Pair Query Monitoring Over Moving Objects

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

3 Author(s)
Manli Zhu ; Institute for Infocomm Research, Singapore ; Lee, D.L. ; Jun Zhang

k-closest pair query is a useful type of query in many practical applications involving spatial data for decision making. The traditional techniques to handle k-closest pair queries generally assume that the objects are static. In this paper, we study the problem of k-closest pair monitoring (kCPM) over moving objects. Aiming at reducing communication cost for location updates between the clients and the server, our proposed kCPM approach achieves high monitoring accuracy with less CPU utilization compared to existing periodical location update schemes.

Published in:

Mobile Data Management, 2006. MDM 2006. 7th International Conference on

Date of Conference:

10-12 May 2006

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.