.png){kind=icon}
返回
Energy-efficient data dissemination schemes for nearest neighbor query processing
.png){kind=icon}
PRE
AI
DOI：10.1109/TC.2007.1031.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
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.
Keyword:
mobile computing
location-aware mobile services
wireless data broadcasting
nearest neighbor search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Cache invalidation and replacement strategies for location-dependent data in mobile environments
OAAI
OAAI分享收藏
查看更多内容