无线数据广播环境下路网最近邻居节点的查询  

Nearest Neighbor Query in Road Networks Via Wireless Data Broadcast

作　　者：毛鼎鼎[1] 孙未未[1] 陈楚南[1] 吴晶晶[1] 刘未末[1] 荆一楠[1] 

机构地区：[1]复旦大学计算机科学技术学院,上海201203

出　　处：《小型微型计算机系统》2011年第6期1049-1054,共6页Journal of Chinese Computer Systems

基　　金：国家自然科学基金项目(61073001)资助

摘　　要：针对大规模用户数量,首次提出结合无线数据广播技术,在路网环境中进行最近邻居节点查询.该方法使用基于Voronoi图的算法转化路网信息,将处理后的路网信息作为广播数据,不仅提高了用户的查询效率,还减少广播数据中的冗余信息.在数据调度上,采用Hilbert曲线对数据排序,从而保持广播数据的空间临近性.实验表明,上述方法在为用户提供高效查询的情况下有效减少了访问时间.Proposed a novel approach to the Nearest Neighbor（NN） query in road networks via wireless data broadcast.It especially fits into situations where a large amount of concurrent users need to access the data.We apply the Voronoi Graph Algorithm to transform road network information into broadcast data,which improves the efficiency of user queries as well reduces redundant broadcast data.We also employ the Hilbert Curve to sort the broadcasting data so that its spatial proximity is maintained.The experimental results show that it provides users with efficient queries with significantly reduced access time.

关 键 词：道路网络 无线数据广播 最近邻居节点查询 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]