期刊文献+

基于动态路网的分布式邻近目标查询算法

Distributed nearneighbor search algorithm based on real-time traffic information in dynamic road network
下载PDF
导出
摘要 提出了一种基于实时路况信息的分布式邻近目标查询算法,采用基于Voronoi图的划分将地理信息存储在离它最近路口的智能摄像头上,实时路况信息由智能摄像头采集,通过对路口的畅通程度进行建模,估算出路口间通行所需要的时间。当有车辆查询邻近目标时,网络中的智能摄像头根据所在路口的畅通程度和到邻近路口的距离,在分布式查询过程中加入延时转发机制,广播目标路径询问的数据分组,使数据分组的发送能模拟当前的路况进行传输,从而获得到达邻近目标的路径。基于真实数据的实验结果表明算法是有效的,处理大量并发查询时的性能优于现有方法。 A novel distributed near neighbor search algorithm that makes use of real-time traffic information is presented.The geographic information are stored in the nearest smart camera using Voronoi partition,and cameras are located in the intersection.The intersection unimpeded degree is modeled and the time which vehicle travel between adjacent intersections is estimated.When a vehicle search for some near neighbors,smart cameras set a delay to broadcast the near neighbor search packet based on the traffic parameters collected by smart camera networks.In this way,the near neighbor search packet can be transmitted according to current road conditions.Thus get the path to near targets quickly and effectively.Extensive experiments are londucted on real data sets,and the results show that proposed algorithm is efficient and scalable to large number of concurrent query,significantly outperforming state-of-the-art methods.
出处 《通信学报》 EI CSCD 北大核心 2014年第12期116-123,135,共9页 Journal on Communications
基金 国家国际科技合作专项基金资助项目(2012DFG11580)~~
关键词 动态路网 最邻近查询 k邻近查询 分布式查询 延迟路由 dynamic road network nearest neighbor search k-nearest neighbor search distributed search delay routing
  • 相关文献

参考文献13

  • 1SCHILLER J H, VOISARD A. Location-Based Services[M]. San Francisco: Morgan Kaufmann, 2004.
  • 2XU H, TEO H H, TAN B C Y, et al. Research note-effects of individual self-protection, industry self-regulation, and govern-ment regulation on privacy concerns: a study of location-based services[J]. Information Systems Research, 2012, 23(4): 1342-1363.
  • 3ZHANG N, WANG Y, FENG J. Saturn: a Fast Keyword k-NN Search System in Road Networks[M]. Web-Age Information Management. Springer Berlin Heidelberg, 2013: 203-215.
  • 4KU W S, ZIMMERMANN R, WANG H, et al. Adaptive nearest neighbor queries in travel time networks[A]. Proceedings of the 13th annual ACM international workshop on Geographic information systems[C]. ACM, 2005.210-219.
  • 5GUTTMAN A. R-Trees: a Dynamic Index Structure for Spatial Searching[M]. ACM, 1984.
  • 6KAMEL I, FALOUTSOS C. Hilbert R-Tree: an improved R-Tree using fractals[A]. 20th International Conference on Very Large Data Bases[C]. 1994.500-509.
  • 7YANG C, RASKIN R. Introduction to distributed geographic information processing research[J]. International Journal of Geographical Information Science, 2009, 23(5): 553-560.
  • 8SUNG K, BELL M G H, SEONG M, et al. Shortest paths in a network with time-dependent flow speeds[J]. European Journal of Operational Research, 2000, 121(1): 32-39.
  • 9KANOULAS E, DU Y, XIA T, et al. Finding fastest paths on a road network with speed patterns[A]. Data Engineering, 2006, ICDE'06, Proceedings of the 22nd International Conference[C]. IEEE, 2006.10.
  • 10DU Q, FABER V, GUNZBURGER M. Centroidal Voronoi tessellations: applications and algorithms[J]. SIAM Review, 1999,41(4): 637-676.

二级参考文献25

  • 1陈行星,崔伟宏.城市快速反应系统实验研究[J].环境遥感,1996,11(3):227-233. 被引量:10
  • 2Dantzig G B, Ramser J H. The truck dispatching problem [ J]. Management Science, 1959, 6(1) :80 -91.
  • 3Beasley J. Adapting the savings algorithm for varying inter - customer travel times [ J]. Omega International Journal of Management Science, 1981,9(6) :685 -659.
  • 4Fox K R. Production scheduling on parallel lines with dependencies [ D]. Johns Hopkins University, 1973.
  • 5Fischetti M, Laporte G, Martello S. The delivery man problem and cumulative metroids[ J]. ORSA Journal on Computing. 1990,2(4):353 -364.
  • 6Fischetti M, Laporte G, Martello S. The delivery man problem and cumulative metroids [ J]. ORSA Journal on Computing. 1990, 2(4):353 -364.
  • 7Bianco L, Mingozzi A, Ricciardelli S. The traveling salesman problem with cumulative cost[ J]. Networks, 1993 ,23 (2 ) ;81 -91.
  • 8Malandraki C,Daskin M S. Time dependent vehicle routing problems: Formulations properties and heuristic algorithms[ J]. Transportation Science, 1992, 26:185 -200.
  • 9Ichoua S, Gendreau M, Potvin J Y. Vehicle dispatching with time -dependent travel times[ J]. European Journal of Operational Research, 2003, 144(2) :379 -396.
  • 10Donati A V,Gambardella L M, Casagrande N, et al. Time dependent vehicle routing problem with an ant colony system [ A]. Istituto Dalle Molle di Studisull Intelligenza Artificiale ( IDSIA ) Galleria 2,Manno, 2003.

共引文献11

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部