Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

Energy-Efficient Data Dissemination Schemes for Nearest Neighbor Query Processing

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.

The purchase and pricing options are temporarily unavailable. Please try again later.
2 Author(s)

Indexing provides for selective tuning but suffers from the drawback that, in order to conserve battery power, the client has to wait for and tune to the index segment. In location-aware mobile services (LAMSs), it is important to reduce the query response time since a late query response may contain out-of-date information. In this paper, we present a broadcast-based spatial query processing scheme designed to support nearest neighbor (NN) query processing. With the proposed schemes, broadcast data items are sorted sequentially based on their locations and the clients can selectively tune to the desired data item without the need for an index segment. For the purpose of selective tuning, we present the exponential sequence scheme (ESS) and cluster-based Fibonacci sequence scheme (CFS) schemes. The ESS and CFS schemes attempt to conserve battery power. The performance of our schemes is investigated in relation to various environmental variables such as the distributions of data objects, the average speed of the clients, and the size of the service area. The resulting latency and tuning time are close to the optimum values, as our analysis and simulation results indicate

Published in:

Computers, IEEE Transactions on  (Volume:56 ,  Issue: 6 )