Ad hoc网络中基于遗传算法求解QoS组播路由问题被引量：2

下载PDF

导出

摘要本文在分析了原有适应度函数导致不合理解的机理后,探索了如何避免产生不合理解,并提出了一种新的适应度函数公式。通过仿真试验,试验结果充分的说明了本文提出的适应度函数在任意的网络环境以及QoS约束下,都始终能够搜索到合理的QoS组播路由。

作者彭建国

机构地区湖南化工职业技术学院自动化系

出处《福建电脑》 2010年第7期95-96,共2页 Journal of Fujian Computer

关键词 Ad HOC网络 QOS多播路由多播树遗传算法

参考文献8

1王新红,王光兴.基于遗传算法的时延受限代价最小组播路由选择方法[J].通信学报,2002,23(3):112-117. 被引量：52
2李云强,王念平,余昭平.基于遗传算法的时延受限组播路由优化[J].计算机工程,2003,29(12):21-22. 被引量：6
3Kompella V P,Pasquale J C,Polyzos G C.Multicasting for multi-media applications[C].Proc of IEEE Infocom 92,Florence,Italy,1992,3:2078-2085.
4李腊元,李春林.QoS multicast routing algorithm based on GA[J].Journal of Systems Engineering and Electronics,2004,15(1):90-97. 被引量：10
5Xiang F,Luo Jun-zhou,Wu Jie-yi,et al.QoS routing based on ge-netic algorithm[J].Computer Communications,1999,2(29):1394-1399.
6Raidl G R,Julstrom B A.Edge sets:an effective evolutionary cod-ing of spanning tree[J].IEEE Transactions on Evolutionary Compu-tation,2003,7(3):225-239.
7WangXW,ChengH,Cao JN,etal.A Simulated-annealingbased QoS multicasting algorithm[A].Proceedings of InternationalConfer-ence on Communication Technology[C].Beijing:IEEE,2003.469-473.
8ESBENSEN H.Computing Near-Optimal Solutiom to the Steiner Problem in a Graph Using a Genetic Algorithm[J].Networks,1995,26:173-185..

1Sriram R,Manimaran G, Murthy C.Algorithms for Delay-constrained Low-cost Multicast Tree Construction[J].Computer Communications,1998,21 ( 18): 1693-1706.
2Kompella V P, Pasquale J C,Polyzos G C.Multicast Routing for Multimedia Communication[J].IEEE/ACM Trans.Networking,1996,4(2):181-190.
3Zhu Q, Parsa M,Garcia-luna-aceves J J.A Source-based Algorithm for Aelay-constrained Minimum-cost Multicasting[A].Proc.of IEEE INFOCOM'95 [C],Boston, Massachusetts,1995-04:377-385.
4Ravikumar C P,Bajpai R.Source-based Delay-bounded Multicasting in Multimedia Networks[J].Computer Communications, 1998,21 (2): 126- 132.
5SRIRAM R, MANIMARAN G, SIVA RAM MURTHY C. Algorithms for delay-constrained low-cost multicast tree construction[J]. Computer Communications, 1998,21(18):1693-1706.
6HWANG F K, RICHARDS D S. Steiner tree problems[J]. IEEE Networks,1992,22(1):55-89.
7ROUSKAS 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.
8KOU L, MARKOWSKY G, BERMAN L. A fast algorithm for steiner trees[J]. Acta Information,1981,15(2):141-145.
9WINTER P. Steiner problem in networks: a survey[J]. Networks, 1987, 17(2):129-167.
10BAUER F, VARMA A. Distributed algorithms for multicast path setup in data networks[J]. IEEE/ACM Trans networking ,1996,4 (2):181-190.

1姚兰.基于最小生成树的时延约束多播路由算法[J].湖南城市学院学报（自然科学版）,2005,14(1):43-45. 被引量：1
2R.M. Karp. "Reducibility among combinatorial problems," in Complexity of Computer Computations[M]. New York, NY: Plenum, 1972, 85-103.
3M.R. Carey and D.S. Johnson, Computers and Intracrabilin: A Guide to the Theory of NP-Completeness[M]. New York, NY: Freeman, 1979.
4Coley, David A. In: An Introduction to Genetic Algorithms for Scienlists and Engineers[M]. Singapore: River Edge, NJ World Scientific Publishing Co, 1999, 23-24.
5R. Bellman. Dynamic Programming [M]. Princeton University Press, 1957.
6J.A.Dossey, A.D.Otto, L.E.Spence,and C.V.Eynden. Discrete Mathematics, Second Edition[M].Harper Collins College Publishers, 1993.
7王新生,史钗.基于蚁群算法的Ad Hoc网组播路由算法[J].小型微型计算机系统,2008,29(4):602-606. 被引量：3
8张晖,董育宁,杨龙祥,朱洪波.移动Ad hoc网络中基于稳定性的QoS路由算法综述[J].计算机工程与应用,2009,45(1):1-6. 被引量：10
9刘毅,钟诚.一种考虑节点剩余能量及其消耗率的AdHoc组播路由算法[J].广西科学院学报,2009,25(2):98-100. 被引量：1
10刘涛,林琳,周贤伟,彭莱.Ad hoc网络中基于标号的组播路由算法[J].计算机工程,2010,36(2):108-109. 被引量：3

福建电脑

2010年第7期

内容加载中请稍等...