期刊文献+

基于参数可变遗传算法的炮兵通信网络覆盖控制优化 被引量:1

Optimal Coverage Strategy Based on Alterable Parameter Genetic Algorithm in Artillery Commutation Networks
下载PDF
导出
摘要 针对节点高密度部署的炮兵通信网络中优化工作节点集的选取问题,提出一种基于参数可变遗传算法的覆盖控制优化方法。设计了密度检测机制优化初始种群,并设计了即考虑到进化代数对算法影响,又考虑到每代中不同个体适应度对算法作用的自适应交叉概率和变异概率。仿真实验及分析表明,该优化方法快速有效地实现了工作节点数目少、节点集覆盖率高的工作节点集的选取,可有效地降低能耗,延长网络生存时间。 An optimal coverage strategy based on adaptive genetic algorithm in wireless sensor networks is proposed for solving the problem of selecting the optimal coverage set of nodes for artillery commutation networks with high density nodes.The mechanism of density detection is designed to optimize the initial population.The adaptive crossover probability and adaptive mutation probability are proposed,which consider the influence of every generation to algorithm and the effect individual fitness in every generation.Simulation and analysis results show that the optimal coverage set of nodes with less nodes and high coverage percentage is achieved by the proposed algorithm.Under the condition,sleeping chance is ensured adequately,which decreases the energy expenditure effectively and prolongs the lifetime of the network.
作者 夏化冰 潘伟
机构地区 沈阳炮兵学院
出处 《计算技术与自动化》 2014年第3期35-38,共4页 Computing Technology and Automation
基金 国家自然科学基金资助项目(60974091)
关键词 炮兵通信网络 覆盖 工作节点集 参数可变遗传算法 artillery commutation networks coverage coverage set of nodes alterable parameter genetic algorithm
  • 相关文献

参考文献2

二级参考文献21

  • 1苏春光,徐杰,王鸿谷.地图及工程图纸的智能矢量化方法[J].小型微型计算机系统,1996,17(5):6-11. 被引量:6
  • 2Wu Hua-yi, Gong Jian-ya, Li De-ren et al. An algebraic al- gorithm for point inclusion query[J]. Computers ~ Graph- ics,2000, 24(4):517-522 .
  • 3Thian-Huat Ong, Hsinchun Chen, Wai--ki Sung, et al. News map: a knowledge map for online news[J]. Decision Support Systems, 2005, (39) :583-597.
  • 4RUNARSSON T P, XIN Yao. Stochastic ranking for con- strained evolutionary optimization[J]. IEEE Transactions on Evolutionary Computation,2000, 4(3) :284-294.
  • 5Akyildiz I F, Su W L, Sankarasubramaniam Y, Cayirci E. A survey on sensor networks. IEEE Communications Magazine, 2002, 40(8): 102-114.
  • 6Wang L, XiaoY. A survey of energy-efficient scheduling mechanisms in sensor networks. Mobile Networks and Applications, 2006, 11(5): 723-740.
  • 7Meguerdichian S, Koushanfar F, Potkonjak M, Srivastava M B. Coverage problems in wireless Ad-Hoc sensor network. In: Proceedings of the 20th International Annual Joint Conference of the IEEE Computer and Communications Societies. Anchorage, USA: IEEE, 2001. 1380-1387.
  • 8Slijepcevic S, Potkonjak M. Power efficient organization of wireless sensor networks. In: Proceedings of the IEEE Conference on Communications. Helsinki, Finland: IEEE, 2001. 472-476.
  • 9Tian D, Georganas N D. A coverage-preserving node scheduling scheme for large wireless sensor networks. In: Proceedings of the 1st ACM International Workshop on Wireless Sensor Networks and Applications. Atlanta, USA: ACM, 2002. 32-41.
  • 10Zhang H H, Hou J C. Maintaining sensing coverage and connectivity in large sensor networks. Ad-Hoc and Sensor Wireless Networks, 2005, 1(1-2): 89-124.

共引文献9

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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