期刊文献+

各向异性传感环境下的移动对象反监控算法

Anti-Monitoring Algorithm for Mobile Object in Anisotropic Sensory Networks
下载PDF
导出
摘要 研究异构传感环境下移动对象的反监控问题,提出一种暴露模型,该模型可用于近似估算移动对象穿越各向异性传感器网络时的风险.并在此基础上,结合各向异性Voronoi图提出了一种路径判定算法,该算法能够保障移动对象选择一条具有近似最小风险的路径穿越各向异性传感器网络区域.理论分析和实验结果表明,算法具有良好的反监控性能.另外,算法只需知道移动对象侦测半径之内的局部信息,因此也具有分布式和实用性等良好特性. After researching the anti-monitoring problem on mobile objects in the heterogeneous sensory field,a new Exposure model is proposed,which can be used to estimate the approximate risk of a mobile object moving along a path to traverse the sensory field deployed with anisotropic sensor nodes.Based on the newly proposed Exposure model,a novel decision algorithm for path selection is designed by combing the Anisotropic Voronoi Tessellation schemes,which guarantee that the mobile object can select a suitable path with a minimal approximately risk of traveling across the anisotropic sensory field.Theoretical analyses and simulation results show that the new algorithm has a good anti-monitoring performance and requires only that the mobile object should know the local information in its detection radius,so it is distributed and practical.
出处 《软件学报》 EI CSCD 北大核心 2011年第6期1389-1397,共9页 Journal of Software
基金 湖南大学"中央高校基本科研业务费" 福建工程学院科研基金(GY-Z10050 GY-Z10070)
关键词 反监控 各向异性传感器网络 各向异性Voronoi图 暴露模型 anti-monitoring; anisotropic sensor network; anisotropic Voronoi tessellation; exposure model;
  • 相关文献

参考文献1

二级参考文献13

  • 1Sedgewick R,Vitter J S.Shortest paths in Euclidean graphs[J].Algorithmica,1986,1(1):31 ~48.
  • 2Ikeda T,Hsu M Y,Imai H,et al.A fast algorithm for finding better routes by AI search techniques[A].In:Proceedings of IEEE Vehicle Navigation and Information Systems Conference[C],Yokohama,Japan,1994:291 ~ 296.
  • 3Goldberg A V,Harrelson C.Computing the shortest path:A * search meets graph theory[A].In:16th Annual ACM-SIAM Symposium on Discrete Algorithms(SODA'05)[C],Vancouver,Canada,2005:156 ~ 165.
  • 4Philip Klein,Satish Rao,Monika Rauch,et al.Faster shortest-path algorithms for planar graphs[A].In:Proceedings of Annual ACM Symposium on Theory of Com puting[C],Montreal,Quebec,Canada,1994:27 ~37.
  • 5Johnson D B.Priority queues with update and finding minimum spanning trees[J].Information Processing Letters,1975,4 (3):53 ~ 57.
  • 6Brown M R.Implementation and analysis of binomial queue algorithms[J].SIAM Journal on Computing,1978,7(3):298 ~319.
  • 7Fredman M L,Tarjan R E.Fibonacci heaps and their uses in improved network optimization algorithms[J].Journal of the ACM,1987,34(3):596 ~615.
  • 8Fredman M L,Sedgewick R,Sleator D D,et al.The pairing heap:A new form of self-adjusting heap[J].Algorithmica,1986,1(1):111 ~129.
  • 9Stasko J T,Vitter J S.Pairing heaps:experiments and analysis[J].Communications of the ACM,1987,30(3):234 ~249.
  • 10[美]Mark Allen Weiss 著.冯舜玺译.数据结构与算法分析--C语言描述(第二版)[M].北京:机械工业出版社,2005:372~376.

共引文献15

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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