期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于改进的Voronoi划分的集中式算法的无线传感器网络覆盖问题研究 被引量：3

An Improved Centralized Voronoi Tessellation Algorithm for Wireless Sensor Network Coverage Problem
下载PDF
导出
摘要 设计了一种基于目标区域Voronoi划分的改进的集中式近似算法,用于计算完全覆盖目标区域所需要的近似最小节点集.仿真结果表明,该算法能够有效地找到更少的连通覆盖节点,降低能耗,延长网络的生命周期. An improved centralized approximation algorithm based on target domain Voronoi tessellation is designed to construct a near minimal node set required to cover the target region completely. The simulation result shows that this algorithm can find fewer connected cover nodes effectively, which reduce power consumption and extends network life period.
作者 鲍喜荣 张石 薛定宇 李宁
机构地区 东北大学信息科学与工程学院 东北大学理学院
出处 《信息与控制》 CSCD 北大核心 2009年第5期620-623,共4页 Information and Control
关键词 无线传感器网络 最小连通覆盖集 VORONOI划分 最大独立集 WSN （wireless sensor network） MCCS （minimal connected cover set） Voronoi tessellation MIS （maximal independent set）
分类号 TP39 [自动化与计算机技术—计算机应用技术]
  • 相关文献

参考文献10

  • 1赵建军,丛海鹏,刘培培,雷久德.Ad Hoc网络区域最小覆盖方法研究[J].微计算机信息,2007,23(27):173-174. 被引量：5
  • 2任彦,张思东,张宏科.无线传感器网络中覆盖控制理论与算法[J].软件学报,2006,17(3):422-433. 被引量：156
  • 3陈丹.无线传感器网络中覆盖性问题的研究[J].华中师范大学研究生学报,2006(4):166-168. 被引量：4
  • 4毛莺池,陈力军,陈道蓄.无线传感器网络覆盖控制技术研究[J].计算机科学,2007,34(3):20-22. 被引量：12
  • 5Slijepcevic S, Potkonjak M. Power efficient organization of wireless sensor networks[A]. Proceedings of the IEEE International Conference on Communications[C]. Piscataway, NJ, USA: IEEE, 2001. 472-476.
  • 6Ye F, Zhong G, Cheng J, et al. PEAS: A robust energy conserving protocol for long-lived sensor networks[A]. Proceedings of the International Conference on Distributed Computing Systems[C]. Piscataway, NJ, USA: IEEE, 2003.28-37.
  • 7Tian D, Georganas ND. A coverage-preserving node scheduling scheme for large wireless sensor networks[A]. Proceedings of the ACM International Workshop on Wireless Sensor Networks and Applications[C]. New York, NJ, USA: ACM, 2002. 32-41.
  • 8Gupta H, Zhou Z, Das S R, et al. Connected sensor cover: Self- organization of sensor networks for efficient query execution[J]. IEEE/ACM Transactions on Networking, 2006, 14(1): 55-67.
  • 9蒋杰,方力,张鹤颖,窦文华.无线传感器网络最小连通覆盖集问题求解算法[J].软件学报,2006,17(2):175-184. 被引量：90
  • 10Zhang H, Hou J C. Maintaining sensing coverage and connectivity in large sensor networks[J]. Ad Hoc and Sensor Networks, 2005, 1(1/2): 89-124.

二级参考文献30

共引文献240

同被引文献32

  • 1Hlstad J. Clique is hard to approximate within n(1 - e)[J]. Acta Mathematica, 1999, 182(1): 105-142.
  • 2Singh A, Gupta A K. A hybrid heuristic for the maximum clique problem[J]. Journal of Heuristics, 2006, 12(1): 5-22.
  • 3Battiti R, Protasi M. Reactive local search for the maximum clique problem[J]. Algorithmica, 2001, 29(4): 610-637.
  • 4Hansen P, Mladenovic N, Urosevic D. Variable neighborhood search for the maximum clique[J]. Discrete Applied Mathematics, 2004, 145(1): 117-125.
  • 5Katayama K, Hamamoto A, Narihisa H. An effective local search for the maximum clique problem[J]. Information Processing Letters, 2005, 95(5): 503-511.
  • 6Pullan W, Hoos H H. Dynamic local search for the maximum clique problem[J]. Journal of Artificial Intelligence Research, 2006, 25: 159-185.
  • 7Pullan W. Phased local search for the maximum clique problem[J]. Journal of Combinatorial Optimization, 2006, 12(3): 303-323.
  • 8Guturu P, Dantu R. An impatient evolutionary algorithm with probabilistic tabu search for unified solution of some NP-hard problems in graph and set theory via clique finding[J]. IEEE Transactions on Systems, Man and Cybernetics, Part B: Cybernetics, 2008, 38(3): 645-666.
  • 9Wolpert D H, Macready W G, Center I, et al. No free lunch theorems for optimization[J]. IEEE Transactions on Evolutionary Computation, 1997, 1(1): 67-82.
  • 10He J, Yao X, Li J. A comparative study of three evolutionary algorithms incorporating different amounts of domain knowledge for node covering problem[J]. IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews, 2005, 35(2): 266-271.

引证文献3

二级引证文献15

信息与控制
2009年 第5期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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