Skip to main content
Erschienen in: Natural Computing 1/2017

29.03.2016

A new genetic algorithm based on modified Physarum network model for bandwidth-delay constrained least-cost multicast routing

verfasst von: Mingxin Liang, Chao Gao, Zili Zhang

Erschienen in: Natural Computing | Ausgabe 1/2017

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

A mobile ad hoc network is a kind of popular self-configuring network, in which multicast routing under the quality of service constraints, is a significant challenge. Many researchers have proved that such problem can be formulated as a NP-complete problem and proposed some swarm-based intelligent algorithms to solve the optimal solution, such as the genetic algorithm (GA), bees algorithm. However, a lower efficiency of local search ability and weak robustness still limit the computational effectiveness. Aiming to those shortcomings, a new hybrid algorithm inspired by the self-organization of Physarum, is proposed in this paper. In our algorithm, an updating scheme based on Physarum network model (PM) is used for improving the crossover operator of traditional GAs, in which the same parts of parent chromosomes are reserved and the new offspring by the PM is generated. In order to estimate the effectiveness of our proposed optimized scheme, some typical genetic algorithms and their updating algorithms (PMGAs) are compared for solving the multicast routing on four different datasets. The simulation experiments show that PMGAs are more efficient than original GAs. More importantly, the PMGAs are more robustness that is very important for solving the multicast routing problem. Moreover, a series of parameter analyses is used to find a set of better setting for realizing the maximal efficiency of our algorithm.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Abbass HA (2001) A single queen single worker honey-bees approach to 3-SAT. In: The genetic and evolutionary computation conference, pp 807–814 Abbass HA (2001) A single queen single worker honey-bees approach to 3-SAT. In: The genetic and evolutionary computation conference, pp 807–814
Zurück zum Zitat Adamatzky A (2009) Developing proximity graphs by Physarum polycephalum: does the plasmodium follow the Toussaint hierarchy? Parallel Process Lett 19(1):105–127MathSciNetCrossRef Adamatzky A (2009) Developing proximity graphs by Physarum polycephalum: does the plasmodium follow the Toussaint hierarchy? Parallel Process Lett 19(1):105–127MathSciNetCrossRef
Zurück zum Zitat Chow CH (1991) On multicast path finding algorithms. In: 10th Annual joint conference of the IEEE computer and communications societies, pp 1274–1283 Chow CH (1991) On multicast path finding algorithms. In: 10th Annual joint conference of the IEEE computer and communications societies, pp 1274–1283
Zurück zum Zitat Huang TL, Lee DT (2007) A distributed multicast routing algorithm for real-time applications in wide area networks. J Parallel Distrib Comput 67(5):516–530CrossRefMATH Huang TL, Lee DT (2007) A distributed multicast routing algorithm for real-time applications in wide area networks. J Parallel Distrib Comput 67(5):516–530CrossRefMATH
Zurück zum Zitat Hwang RH, Do WY, Yang SC (2000) Multicast routing based on genetic algorithms. J Inf Sci Eng 16(6):885–901 Hwang RH, Do WY, Yang SC (2000) Multicast routing based on genetic algorithms. J Inf Sci Eng 16(6):885–901
Zurück zum Zitat Karthikeyan P, Baskar S (2015) Genetic algorithm with ensemble of immigrant strategies for multicast routing in ad hoc networks. Soft Comput 19(2):489–498CrossRef Karthikeyan P, Baskar S (2015) Genetic algorithm with ensemble of immigrant strategies for multicast routing in ad hoc networks. Soft Comput 19(2):489–498CrossRef
Zurück zum Zitat Liu YX, Gao C, Wu YH, Tao L, Lu YX, Zhang ZL (2014) A Physarum-inspired multi-agent system to solve maze. In: The fifth international conference on Swarm intelligence, pp 424–430 Liu YX, Gao C, Wu YH, Tao L, Lu YX, Zhang ZL (2014) A Physarum-inspired multi-agent system to solve maze. In: The fifth international conference on Swarm intelligence, pp 424–430
Zurück zum Zitat Liu YX, Zhang ZL, Gao C, Wu YH, Qian T (2013) A Physarum network evolution model based on IBTM. In: The fourth international conference on Swarm intelligence, pp 19–26 Liu YX, Zhang ZL, Gao C, Wu YH, Qian T (2013) A Physarum network evolution model based on IBTM. In: The fourth international conference on Swarm intelligence, pp 19–26
Zurück zum Zitat Liu L, Song Y, Ma H, Zhang X (2015) Physarum optimization: a biology-inspired algorithm for minimal exposure path problem in wireless sensor networks. IEEE Trans Comput 64(3):819–832MathSciNet Liu L, Song Y, Ma H, Zhang X (2015) Physarum optimization: a biology-inspired algorithm for minimal exposure path problem in wireless sensor networks. IEEE Trans Comput 64(3):819–832MathSciNet
Zurück zum Zitat Lu T, Zhu J (2013) Genetic algorithm for energy-efficient QoS multicast routing. Commun Lett 17(1):31–34CrossRef Lu T, Zhu J (2013) Genetic algorithm for energy-efficient QoS multicast routing. Commun Lett 17(1):31–34CrossRef
Zurück zum Zitat Mahmoud TM, El Nashar AI, Eman M (2014) An efficient genetic algorithm based clonal selection and hill climbing for solving QoS multicast routing problem. Int J Comput Sci Issues. 11(3):83–88 Mahmoud TM, El Nashar AI, Eman M (2014) An efficient genetic algorithm based clonal selection and hill climbing for solving QoS multicast routing problem. Int J Comput Sci Issues. 11(3):83–88
Zurück zum Zitat Nakagaki T, Yamada H, Tóth Á (2000) Intelligence: Maze-solving by an amoeboid organism. Nature 407(6803):470–470CrossRef Nakagaki T, Yamada H, Tóth Á (2000) Intelligence: Maze-solving by an amoeboid organism. Nature 407(6803):470–470CrossRef
Zurück zum Zitat Oliveira CA, Pardalos PM (2005) A survey of combinatorial optimization problems in multicast routing. Comput Oper Res 32(8):1953–1981CrossRefMATH Oliveira CA, Pardalos PM (2005) A survey of combinatorial optimization problems in multicast routing. Comput Oper Res 32(8):1953–1981CrossRefMATH
Zurück zum Zitat Peng B, Li L (2013) Combination of genetic algorithm and ant colony optimization for QoS multicast routing. In: 14th International symposium on advanced intelligent systems, pp 49–56 Peng B, Li L (2013) Combination of genetic algorithm and ant colony optimization for QoS multicast routing. In: 14th International symposium on advanced intelligent systems, pp 49–56
Zurück zum Zitat Pham DT, Kog E, Ghanbarzadeh A, Otri S, Rahim S, Zaidi M (2006) The bees algorithm—a novel tool for complex optimisation problems. In: The 2nd international virtual conference on intelligent production machines and systems, p 454 Pham DT, Kog E, Ghanbarzadeh A, Otri S, Rahim S, Zaidi M (2006) The bees algorithm—a novel tool for complex optimisation problems. In: The 2nd international virtual conference on intelligent production machines and systems, p 454
Zurück zum Zitat Ratnasamy S, Ermolinskiy A, Shenker S (2006) Revisiting IP multicast. ACM SIGCOMM Comput Commun Rev 36(4):15–16CrossRef Ratnasamy S, Ermolinskiy A, Shenker S (2006) Revisiting IP multicast. ACM SIGCOMM Comput Commun Rev 36(4):15–16CrossRef
Zurück zum Zitat Salama HF (1996) Multicast routing for real-time communication of high-speed networks. Ph.D. Thesis. North Carolina State University Salama HF (1996) Multicast routing for real-time communication of high-speed networks. Ph.D. Thesis. North Carolina State University
Zurück zum Zitat Salama HF, Reeves DS, Viniotis Y (1997) Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE J Sel Areas Commun 15(3):32–45CrossRef Salama HF, Reeves DS, Viniotis Y (1997) Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE J Sel Areas Commun 15(3):32–45CrossRef
Zurück zum Zitat Salim B, Abdelhamid M (2013) Bee life-based multi constraints multicast routing optimization for vehicular ad hoc networks. J Netw Comput Appl 36(3):981–991CrossRef Salim B, Abdelhamid M (2013) Bee life-based multi constraints multicast routing optimization for vehicular ad hoc networks. J Netw Comput Appl 36(3):981–991CrossRef
Zurück zum Zitat Sesay S, Yang ZK, He JH (2004) A survey on mobile ad hoc wireless network. Inf Technol J 3(2):168–175CrossRef Sesay S, Yang ZK, He JH (2004) A survey on mobile ad hoc wireless network. Inf Technol J 3(2):168–175CrossRef
Zurück zum Zitat Tero A, Kobayashi R, Nakagaki T (2007) A mathematical model for adaptive transport network in path finding by true slime mold. J Theor Biol 244(4):553–564MathSciNetCrossRef Tero A, Kobayashi R, Nakagaki T (2007) A mathematical model for adaptive transport network in path finding by true slime mold. J Theor Biol 244(4):553–564MathSciNetCrossRef
Zurück zum Zitat Tero A, Takagi S, Saigusa T, Ito K, Bebber DP, Fricker MD, Yumiki K, Kobayashi R, Nakagaki T (2010) Rules for biologically inspired adaptive network design. Sci Signal 327(5964):439MathSciNetMATH Tero A, Takagi S, Saigusa T, Ito K, Bebber DP, Fricker MD, Yumiki K, Kobayashi R, Nakagaki T (2010) Rules for biologically inspired adaptive network design. Sci Signal 327(5964):439MathSciNetMATH
Zurück zum Zitat Wang ZY, Shi BX, Zhao E (2001) Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Comput Commun 24(7):685–692 Wang ZY, Shi BX, Zhao E (2001) Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Comput Commun 24(7):685–692
Zurück zum Zitat Wang Z, Szolnoki A, Perc M (2012) If players are sparse social dilemmas are too: importance of percolation for evolution of cooperation. Sci Rep 2:369 Wang Z, Szolnoki A, Perc M (2012) If players are sparse social dilemmas are too: importance of percolation for evolution of cooperation. Sci Rep 2:369
Zurück zum Zitat Wang Z, Crowcroft J (1996) Quality-of-service routing for supporting multimedia applications. IEEE J Sel Areas Commun 14(7):1228–1234CrossRef Wang Z, Crowcroft J (1996) Quality-of-service routing for supporting multimedia applications. IEEE J Sel Areas Commun 14(7):1228–1234CrossRef
Zurück zum Zitat Watanabe S, Tero A, Takamatsu A, Nakagaki T (2011) Traffic optimization in railroad networks using an algorithm mimicking an amoeba-like organism. Physarum plasmodium. Biosystems 105(3):225–232CrossRef Watanabe S, Tero A, Takamatsu A, Nakagaki T (2011) Traffic optimization in railroad networks using an algorithm mimicking an amoeba-like organism. Physarum plasmodium. Biosystems 105(3):225–232CrossRef
Zurück zum Zitat Yen Y, Chao H, Chang R, Vasilakos A (2011) Flooding-limited and multi-constrained QoS multicast routing based on the genetic algroithms. Math Comput Model 53(11):2238–2250CrossRef Yen Y, Chao H, Chang R, Vasilakos A (2011) Flooding-limited and multi-constrained QoS multicast routing based on the genetic algroithms. Math Comput Model 53(11):2238–2250CrossRef
Zurück zum Zitat Yin P, Chang R, Chao C, Chu Y (2014) Niched ant colony optimization with colony guides for QoS multicast routing. J Netw Comput Appl 40:61–72CrossRef Yin P, Chang R, Chao C, Chu Y (2014) Niched ant colony optimization with colony guides for QoS multicast routing. J Netw Comput Appl 40:61–72CrossRef
Zurück zum Zitat Yu Z, Wong H, Wang D, Wei M (2011) Neighborhood knowledge-based evolutionary algorithm for multiobjective optimization problems. IEEE Trans Evol Comput 15(6):812–831CrossRef Yu Z, Wong H, Wang D, Wei M (2011) Neighborhood knowledge-based evolutionary algorithm for multiobjective optimization problems. IEEE Trans Evol Comput 15(6):812–831CrossRef
Zurück zum Zitat Yu Z, Chen H, You J, Wong H, Liu J, Li L, Han G (2014) Double selection based semi-supervised clustering ensemble for tumor clustering from gene expression profiles. IEEE/ACM Trans Comput Biol Bioinfor 11(4):727–740CrossRef Yu Z, Chen H, You J, Wong H, Liu J, Li L, Han G (2014) Double selection based semi-supervised clustering ensemble for tumor clustering from gene expression profiles. IEEE/ACM Trans Comput Biol Bioinfor 11(4):727–740CrossRef
Zurück zum Zitat Yu Z, Chen H, You J, Wong H, Liu J, Han G, Li L (2015) Adaptive fuzzy consensus clustering framework for clustering analysis of cancer data. IEEE/ACM Trans Comput Biol Bioinform 12(3):568–582CrossRef Yu Z, Chen H, You J, Wong H, Liu J, Han G, Li L (2015) Adaptive fuzzy consensus clustering framework for clustering analysis of cancer data. IEEE/ACM Trans Comput Biol Bioinform 12(3):568–582CrossRef
Zurück zum Zitat Zhang L, Cai L, Li M, Wang F (2009) A method for least-cost QoS multicast routing based on genetic simulated annealing algorithm. Comput Commun 32(1):105–110CrossRef Zhang L, Cai L, Li M, Wang F (2009) A method for least-cost QoS multicast routing based on genetic simulated annealing algorithm. Comput Commun 32(1):105–110CrossRef
Zurück zum Zitat Zhang ZL, Gao C, Liu YX, Qian T (2014) A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model. Bioinspir Biomim 9(3):036006CrossRef Zhang ZL, Gao C, Liu YX, Qian T (2014) A universal optimization strategy for ant colony optimization algorithms based on the Physarum-inspired mathematical model. Bioinspir Biomim 9(3):036006CrossRef
Metadaten
Titel
A new genetic algorithm based on modified Physarum network model for bandwidth-delay constrained least-cost multicast routing
verfasst von
Mingxin Liang
Chao Gao
Zili Zhang
Publikationsdatum
29.03.2016
Verlag
Springer Netherlands
Erschienen in
Natural Computing / Ausgabe 1/2017
Print ISSN: 1567-7818
Elektronische ISSN: 1572-9796
DOI
https://doi.org/10.1007/s11047-016-9545-6

Weitere Artikel der Ausgabe 1/2017

Natural Computing 1/2017 Zur Ausgabe