期刊文献+

Ad hoc网络路由优化的微粒群方法 被引量:4

Particle Swarm Optimization for Routing Design in Ad hoc Networks
下载PDF
导出
摘要 A d hoc网络是由彼此对等的、自主的无线节点组成的自组织多跳网络.由于A d hoc网络的特点,使得网络拓扑设计的优化问题变得更加复杂,传统的方法甚至难于实现.本文应用微粒群算法,构造了一个适合自组网网络架构设计的运算法则,建立了一个新的对约束的处理技巧,通过引入共生机制,实现了网络设计在约束下的多目标优化设计,其微粒群的解关于约束是理想的,解集间是非次等的,不分优劣.仿真结果表明,该方法是有效的,它的实时性适应了A d hoc网络结构动态的变化. Ad hoe network is a special self-organized multi-hop network with a collection of peer-to-peer independent mobile nodes. Because of its particular character tits design becomes more important and more complex. The realization cannot be gotten by the classical techniques. In this paper, we present a suitable principle and a network model for the Ad hoc network truss by using PSO algorithm. We create a new constraint handling technique by introducing symbiosis mechanism to PSO, to deal with the multiple constrains. A multi-objective optimization is realized. A set of solutions is optimal with respect to the con- strained conditions and nor-inferior to each other. The simulation results show that this approach is efficient and effective, especially for the dynamic network design.
出处 《小型微型计算机系统》 CSCD 北大核心 2006年第7期1193-1196,共4页 Journal of Chinese Computer Systems
基金 国家高科技研究发展计划项目(2002AA784030)资助 辽宁省自然科学基金项目(20052027)资助.
关键词 自组网络 微粒群算法 遗传算法 拓扑设计 Ad hoc network PSO GA Topology design
  • 相关文献

参考文献10

  • 1WANG Z,Crowercroft J.Quality of service for supporting multimedia application[J].IEEE JSAC,1996,14(7):1228-1234.
  • 2Xiaohui Hu,Russell Eberhart.Multiobjective optimization using dynamic neighborhood particle swarm optimization[C].Proceedings of the IEEE Congress on Evolutionary Computation,2002,1677-1681.
  • 3James Kennedy,Russell Eberhart.Particle swarm optimization[C].Proceedings of IEEE International Conference on Neural Networks,1995,1942-1948.
  • 4Russell Eberhart,James Kennedy.A new optimizer using particle swarm theory[C].Proceedings of the Sixth International Symposium on Micromachine and Human Science,1995,39-43.
  • 5Coello Coello,Carlos A,Salazar Lechuga Maximino.MOPSO:a proposal for multiple objective particle swarm optimization[C].Proceedings of the IEEE Congress on Evolutionary Computation,2002,1051-1056.
  • 6Parsopoulos K.E,Vrahatis M.N.Particle swarm optimization method in multiobjective problems[C].Proceedings of the ACM Symposium on Applied Computing,2002,603-607.
  • 7Haiming Lu.Dynamic population strategy assisted particle swarm optimization in multiobjective evolutionary algorithm design[R].Oklahoma:IEEE NNS Student Research Grants 2002 Final Reports,2003,1-19.
  • 8Yuan P,JI C,Zhang Y,et al.Optimal multicast routing in wireless Ad Hoc sensor networks[C].Proceedings of the 2004 IEEE International Conference on Networking,Sensing and Control.2004,367-371.
  • 9Rong-Hong Jan,Fung-Jen Hwang,Sheng-Tzong Cheng.Topological optimization of communication networks subject to a reliability constraint[J].IEEE Trans.Reliability,1993,42(1):63-69.
  • 10王新红,王光兴.基于遗传算法的时延受限代价最小组播路由选择方法[J].通信学报,2002,23(3):112-117. 被引量:52

二级参考文献11

  • 1SRIRAM R, MANIMARAN G, SIVA RAM MURTHY C. Algorithms for delay-constrained low-cost multicast tree construction[J]. Computer Communications, 1998,21(18):1693-1706.
  • 2HWANG F K, RICHARDS D S. Steiner tree problems[J]. IEEE Networks,1992,22(1):55-89.
  • 3ROUSKAS G N, BALDINE I. Multicast routing with end-to-end delay and delay variation constraints[J]. IEEE Journal on Selected Areas in communications, 1997,15(3):346-356.
  • 4KOU L, MARKOWSKY G, BERMAN L. A fast algorithm for steiner trees[J]. Acta Information,1981,15(2):141-145.
  • 5WINTER P. Steiner problem in networks: a survey[J]. Networks, 1987, 17(2):129-167.
  • 6BAUER F, VARMA A. Distributed algorithms for multicast path setup in data networks[J]. IEEE/ACM Trans networking ,1996,4 (2):181-190.
  • 7KOMPELLA V P, PASQUALE J C, POLYZOS G C. Multicast routing for multimedia communication[J]. IEEE/ACM Transaction on Networking, 1993, 1(3):286-292.
  • 8ZHU Q, PARSA M, GARCIA-LUNA-ACEVES J J. A source-based algorithm for delay-constrained minimum-cost multicasting[A]. Proc of IEEE INFOCOM'95[C]. Boston, Massachusetts, April 1995. 377-385.
  • 9RAVIKUMAR C P, BAJPAI R. Source-baced delay-bounded multicasting in multimedia networks[J]. Computer Communications, 1998,21(2): 126-132.
  • 10孙文生,刘泽民.组播路由调度的神经网络方法[J].通信学报,1998,19(11):1-6. 被引量:22

共引文献51

同被引文献22

引证文献4

二级引证文献20

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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