This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Energy-Efficient Data Dissemination Schemes for Nearest Neighbor Query Processing
June 2007 (vol. 56 no. 6)
pp. 754-768
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.
Index Terms:
Mobile computing, location-aware mobile services, wireless data broadcasting, nearest neighbor search.
Citation:
Kwangjin Park, Hyunseung Choo, "Energy-Efficient Data Dissemination Schemes for Nearest Neighbor Query Processing," IEEE Transactions on Computers, vol. 56, no. 6, pp. 754-768, June 2007, doi:10.1109/TC.2007.1031
Usage of this product signifies your acceptance of the Terms of Use.