Dynamic safe regions for moving range queries in mobile navigation Online publication date: Fri, 19-Sep-2014
by Haidar Al-Khalidi; David Taniar; John Betts; Sultan Alamri
International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC), Vol. 16, No. 4, 2014
Abstract: The cost of monitoring and updating the location of Moving Queries is very high, as the calculation of a range query needs to be re-evaluated whenever the query moves. Previous efforts to reduce this cost have proposed reducing the frequency of communication between query and server. However, because all possible objects continue to be surveyed using these approaches, substantial cost reduction is not possible. This paper introduces two novel techniques: the continuous basic safe region, by calculating the closest objects to the border of the moving query, and the continuous extended safe region, by calculating the intersections among several range objects. Inside these safe regions there is no need to update the query as the set of objects of interest does not change. We compare the size of the safe regions obtained using these two methods and show their potential to greatly reduce computations and communications cost in client-server architectures.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Ad Hoc and Ubiquitous Computing (IJAHUC):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook