Skip to main content
Top
Published in: Neural Computing and Applications 7/2019

30-10-2017 | Original Article

QoS multicast routing for wireless mesh network based on a modified binary bat algorithm

Authors: Yassine Meraihi, Dalila Acheli, Amar Ramdane-Cherif

Published in: Neural Computing and Applications | Issue 7/2019

Log in

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

The quality of service multicast routing problem is a very important research issue for transmission in wireless mesh networks. It is known to be NP-complete problem, so many heuristic algorithms have been employed for solving the multicast routing problem. This paper proposes a modified binary bat algorithm applied to solve the QoS multicast routing problem for wireless mesh network which satisfies the requirements of multiple QoS constraints such as delay, delay jitter, bandwidth and packet loss rate to get low-cost multicasting tree. The binary bat algorithm has been modified by introducing the inertia weight w in the velocity update equation, and then the chaotic map, uniform distribution and gaussian distribution are used for choosing the right value of w. The aim of these modifications is to improve the effectiveness and robustness of the binary bat algorithm. The simulation results reveal the successfulness, effectiveness and efficiency of the proposed algorithms compared with other algorithms such as genetic algorithm, particle swarm optimization, quantum-behaved particle swarm optimization algorithm, bacteria foraging-particle swarm optimization, bi-velocity discrete particle swarm optimization and binary bat algorithm.

Dont have a licence yet? Then find out more about our products and how to get one now:

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!

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+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!

Literature
1.
go back to reference 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
2.
go back to reference 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
3.
go back to reference Haghighat AT, Faez K, Dehghan M, Mowlaei A, Ghahremani Y (2003) GA-based heuristic algorithms for QoS based multicast routing. Knowl-Based Syst 16(5):305–312CrossRef Haghighat AT, Faez K, Dehghan M, Mowlaei A, Ghahremani Y (2003) GA-based heuristic algorithms for QoS based multicast routing. Knowl-Based Syst 16(5):305–312CrossRef
4.
go back to reference Sun B, Pi S, Gui C, Zeng Y, Yan B, Wang W, Qin Q (2008) Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA. Prog Nat Sci 18(3):331–336CrossRef Sun B, Pi S, Gui C, Zeng Y, Yan B, Wang W, Qin Q (2008) Multiple constraints QoS multicast routing optimization algorithm in MANET based on GA. Prog Nat Sci 18(3):331–336CrossRef
5.
go back to reference Yen YS, Chao HC, Chang RS, Vasilakos A (2011) Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Math Comput Modell 53(11):2238–2250CrossRef Yen YS, Chao HC, Chang RS, Vasilakos A (2011) Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Math Comput Modell 53(11):2238–2250CrossRef
6.
go back to reference Tseng SY, Lin CC, Huang YM (2008) Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints. Expert Syst Appl 35(3):1473–1481CrossRef Tseng SY, Lin CC, Huang YM (2008) Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints. Expert Syst Appl 35(3):1473–1481CrossRef
7.
go back to reference Wang H, Xu H, Yi S, Shi Z (2011) A tree-growth based ant colony algorithm for QoS multicast routing problem. Expert Syst Appl 38(9):11787–11795CrossRef Wang H, Xu H, Yi S, Shi Z (2011) A tree-growth based ant colony algorithm for QoS multicast routing problem. Expert Syst Appl 38(9):11787–11795CrossRef
8.
go back to reference Ghaboosi N, Haghighat AT (2007) Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Telecommun Syst 34(3–4):147–166CrossRef Ghaboosi N, Haghighat AT (2007) Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Telecommun Syst 34(3–4):147–166CrossRef
9.
go back to reference Wang H, Meng X, Zhang M, Li Y (2010) Tabu search algorithm for RP selection in PIM-SM multicast routing. Comput Commun 33(1):35–42CrossRef Wang H, Meng X, Zhang M, Li Y (2010) Tabu search algorithm for RP selection in PIM-SM multicast routing. Comput Commun 33(1):35–42CrossRef
10.
go back to reference Liu J, Sun J, Xu W-B (2006) QoS multicast routing based on particle swarm optimization. In: Corchado E, Yin H, Botti V, Fyfe C (eds) IDEAL 2006. LNCS, vol 4224, Springer, Heidelberg, pp 936–943 Liu J, Sun J, Xu W-B (2006) QoS multicast routing based on particle swarm optimization. In: Corchado E, Yin H, Botti V, Fyfe C (eds) IDEAL 2006. LNCS, vol 4224, Springer, Heidelberg, pp 936–943
11.
go back to reference Wang H, Meng X, Li S, Xu H (2010) A tree-based particle swarm optimization for multicast routing. Comput Netw 54(15):2775–2786MATHCrossRef Wang H, Meng X, Li S, Xu H (2010) A tree-based particle swarm optimization for multicast routing. Comput Netw 54(15):2775–2786MATHCrossRef
12.
go back to reference Sun J, Fang W, Wu X, Xie Z, Xu W (2011) QoS multicast routing using a quantum-behaved particle swarm optimization algorithm. Eng Appl Artif Intell 24(1):123–131CrossRef Sun J, Fang W, Wu X, Xie Z, Xu W (2011) QoS multicast routing using a quantum-behaved particle swarm optimization algorithm. Eng Appl Artif Intell 24(1):123–131CrossRef
13.
go back to reference Pradhan R, Kabat M-R, Sahoo S-P (2013) A bacteria foraging-particle swarm optimization algorithm for QoS multicast routing. In: Panigrahi BK et al (eds) SEMCCO 2013. LNCS. vol 8297, Springer, Berlin, pp 590-600 Pradhan R, Kabat M-R, Sahoo S-P (2013) A bacteria foraging-particle swarm optimization algorithm for QoS multicast routing. In: Panigrahi BK et al (eds) SEMCCO 2013. LNCS. vol 8297, Springer, Berlin, pp 590-600
14.
go back to reference Shen M, Zhan ZH, Chen WN, Gong YJ, Zhang J, Li Y (2014) Bi-velocity discrete particle swarm optimization and its application to multicast routing problem in communication networks. IEEE Trans Ind Electr 61(12):7141–7151CrossRef Shen M, Zhan ZH, Chen WN, Gong YJ, Zhang J, Li Y (2014) Bi-velocity discrete particle swarm optimization and its application to multicast routing problem in communication networks. IEEE Trans Ind Electr 61(12):7141–7151CrossRef
15.
go back to reference Abdel-Kader RF (2011) An improved discrete PSO with GA operators for efficient QoS-multicast routing. Int J Hybrid Inf Technol 4(2):23–38 Abdel-Kader RF (2011) An improved discrete PSO with GA operators for efficient QoS-multicast routing. Int J Hybrid Inf Technol 4(2):23–38
16.
go back to reference Yang X-S (2010). A new metaheuristic bat-inspired algorithm. In: Gonzalez JR et al (eds) Nature inspired cooperative strategies for optimization (NICSO 2010). SCI vol 284, Springer, Berlin, pp. 65–74 Yang X-S (2010). A new metaheuristic bat-inspired algorithm. In: Gonzalez JR et al (eds) Nature inspired cooperative strategies for optimization (NICSO 2010). SCI vol 284, Springer, Berlin, pp. 65–74
17.
go back to reference Nakamura RY, Pereira LA, Costa KA, Rodrigues D, Papa JP, Yang XS (2012). BBA: a binary bat algorithm for feature selection. In: 2012 25th SIBGRAPI conference on graphics, patterns and images, IEEE, pp 291–297 Nakamura RY, Pereira LA, Costa KA, Rodrigues D, Papa JP, Yang XS (2012). BBA: a binary bat algorithm for feature selection. In: 2012 25th SIBGRAPI conference on graphics, patterns and images, IEEE, pp 291–297
18.
go back to reference Yilmaz S, Kucuksille EU (2013) Improved bat algorithm (IBA) on continuous optimization problems. Lect Notes Softw Eng 1(3):279CrossRef Yilmaz S, Kucuksille EU (2013) Improved bat algorithm (IBA) on continuous optimization problems. Lect Notes Softw Eng 1(3):279CrossRef
19.
go back to reference Gandomi AH, Yang XS, Alavi AH, Talatahari S (2013) Bat algorithm for constrained optimization tasks. Neural Comput Appl 22(6):1239–1255CrossRef Gandomi AH, Yang XS, Alavi AH, Talatahari S (2013) Bat algorithm for constrained optimization tasks. Neural Comput Appl 22(6):1239–1255CrossRef
20.
go back to reference Tamiru AL, Hashim FM (2013) Application of bat algorithm and fuzzy systems to model exergy changes in a gas turbine. In: Artificial intelligence, evolutionary computing and metaheuristics, Springer, Berlin Heidelberg, pp 685–719 Tamiru AL, Hashim FM (2013) Application of bat algorithm and fuzzy systems to model exergy changes in a gas turbine. In: Artificial intelligence, evolutionary computing and metaheuristics, Springer, Berlin Heidelberg, pp 685–719
21.
go back to reference Cai X, Wang L, Kang Q, Wu Q (2014) Bat algorithm with Gaussian walk. Int J Bio-Inspir Comput 6(3):166–174CrossRef Cai X, Wang L, Kang Q, Wu Q (2014) Bat algorithm with Gaussian walk. Int J Bio-Inspir Comput 6(3):166–174CrossRef
22.
go back to reference Sabba S, Chikhi S (2014) A discrete binary version of bat algorithm for multidimensional knapsack problem. Int J Bio-Inspir Comput 6(2):140–152CrossRef Sabba S, Chikhi S (2014) A discrete binary version of bat algorithm for multidimensional knapsack problem. Int J Bio-Inspir Comput 6(2):140–152CrossRef
23.
go back to reference Abdel-Raouf O, Abdel-Baset M, El-Henawy I (2014) An improved chaotic bat algorithm for solving integer programming problems. Int J Mod Educ Comput Sci 6(8):18CrossRef Abdel-Raouf O, Abdel-Baset M, El-Henawy I (2014) An improved chaotic bat algorithm for solving integer programming problems. Int J Mod Educ Comput Sci 6(8):18CrossRef
24.
go back to reference Yilmaz S, Kucuksille EU (2015) A new modification approach on bat algorithm for solving optimization problems. Appl Soft Comput 28:259–275CrossRef Yilmaz S, Kucuksille EU (2015) A new modification approach on bat algorithm for solving optimization problems. Appl Soft Comput 28:259–275CrossRef
25.
go back to reference Byksaat S (2015) Bat algorithm application for the single row facility layout problem. In: Recent advances in swarm intelligence and evolutionary computation, Springer International Publishing, Berlin, pp 101–120 Byksaat S (2015) Bat algorithm application for the single row facility layout problem. In: Recent advances in swarm intelligence and evolutionary computation, Springer International Publishing, Berlin, pp 101–120
26.
go back to reference Fister I, Rauter S, Yang XS, Ljubi K (2015) Planning the sports training sessions with the bat algorithm. Neurocomputing 149:993–1002CrossRef Fister I, Rauter S, Yang XS, Ljubi K (2015) Planning the sports training sessions with the bat algorithm. Neurocomputing 149:993–1002CrossRef
27.
go back to reference Saji Y, Riffi ME (2016) A novel discrete bat algorithm for solving the travelling salesman problem. Neural Comput Appl 27(7):1853–1866CrossRef Saji Y, Riffi ME (2016) A novel discrete bat algorithm for solving the travelling salesman problem. Neural Comput Appl 27(7):1853–1866CrossRef
28.
go back to reference Oshaba AS, Ali ES, Elazim SA (2017) PI controller design for MPPT of photovoltaic system supplying SRM via BAT search algorithm. Neural Comput Appl 28(4):651–667CrossRef Oshaba AS, Ali ES, Elazim SA (2017) PI controller design for MPPT of photovoltaic system supplying SRM via BAT search algorithm. Neural Comput Appl 28(4):651–667CrossRef
29.
go back to reference Zhao D, He Y (2015) Chaotic binary bat algorithm for analog test point selection. Analog Integr Circ Sig Process 84(2):201–214CrossRef Zhao D, He Y (2015) Chaotic binary bat algorithm for analog test point selection. Analog Integr Circ Sig Process 84(2):201–214CrossRef
30.
go back to reference Mirjalili S, Mirjalili SM, Yang X-S (2014) Binary bat algorithm. Neural Comput Appl 25(3–4):663–681CrossRef Mirjalili S, Mirjalili SM, Yang X-S (2014) Binary bat algorithm. Neural Comput Appl 25(3–4):663–681CrossRef
31.
go back to reference Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evolut Comput 9:1–14CrossRef Mirjalili S, Lewis A (2013) S-shaped versus V-shaped transfer functions for binary particle swarm optimization. Swarm Evolut Comput 9:1–14CrossRef
32.
go back to reference Saremi S, Mirjalili S, Lewis A (2014) How important is a transfer function in discrete heuristic algorithms. Neural Comput Appl 26(3):625–640CrossRef Saremi S, Mirjalili S, Lewis A (2014) How important is a transfer function in discrete heuristic algorithms. Neural Comput Appl 26(3):625–640CrossRef
34.
go back to reference Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE international conference on computational cybernetics and simulation, pp 4104–4108 Kennedy J, Eberhart RC (1997) A discrete binary version of the particle swarm algorithm. In: IEEE international conference on computational cybernetics and simulation, pp 4104–4108
35.
go back to reference Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization. In: Proceedings of the congress on evolutionary computation (CEC), pp 1945–1950 Shi Y, Eberhart RC (1999) Empirical study of particle swarm optimization. In: Proceedings of the congress on evolutionary computation (CEC), pp 1945–1950
36.
go back to reference Caponetto R, Fortuna L, Fazzino S, Xibilia MG (2003) Chaotic sequences to improve the performance of evolutionary algorithms. IEEE Trans Evolut Comput 7(3):289–304CrossRef Caponetto R, Fortuna L, Fazzino S, Xibilia MG (2003) Chaotic sequences to improve the performance of evolutionary algorithms. IEEE Trans Evolut Comput 7(3):289–304CrossRef
37.
go back to reference Chuang LY, Yang CH, Li JC (2011) Chaotic maps based on binary particle swarm optimization for feature selection. Appl Soft Comput 11(1):239–248CrossRef Chuang LY, Yang CH, Li JC (2011) Chaotic maps based on binary particle swarm optimization for feature selection. Appl Soft Comput 11(1):239–248CrossRef
38.
go back to reference Heidari AA, Abbaspour RA, Jordehi AR (2015) An efficient chaotic water cycle algorithm for optimization tasks. Neural Comput Appl 1–29 Heidari AA, Abbaspour RA, Jordehi AR (2015) An efficient chaotic water cycle algorithm for optimization tasks. Neural Comput Appl 1–29
39.
go back to reference Saremi S, Mirjalili S, Lewis A (2014) Biogeography-based optimisation with chaos. Neural Comput Appl 25(5):1077–1097CrossRef Saremi S, Mirjalili S, Lewis A (2014) Biogeography-based optimisation with chaos. Neural Comput Appl 25(5):1077–1097CrossRef
40.
go back to reference Lei X, Du M, Xu J, Tan Y (2014) Chaotic Fruit Fly Optimization Algorithm. In : Tan, Y. et al. (eds) ICSI 2014. LNCS vol 8794, Springer Switzerland, pp 74–85 Lei X, Du M, Xu J, Tan Y (2014) Chaotic Fruit Fly Optimization Algorithm. In : Tan, Y. et al. (eds) ICSI 2014. LNCS vol 8794, Springer Switzerland, pp 74–85
41.
go back to reference Kanso A, Smaoui N (2009) Logistic chaotic maps for binary numbers generations. Chaos, Solitons Fractals 40(5):2557–2568MATHCrossRef Kanso A, Smaoui N (2009) Logistic chaotic maps for binary numbers generations. Chaos, Solitons Fractals 40(5):2557–2568MATHCrossRef
42.
go back to reference dos Santos Coelho L, Sauer JG, Rudek M (2009) Differential evolution optimization combined with chaotic sequences for image contrast enhancement. Chaos, Solitons Fractals 42(1):522–529CrossRef dos Santos Coelho L, Sauer JG, Rudek M (2009) Differential evolution optimization combined with chaotic sequences for image contrast enhancement. Chaos, Solitons Fractals 42(1):522–529CrossRef
43.
go back to reference Waxman BM (1988) Routing of multipoint connections. IEEE J Sel Areas Commun 6(9):1617–1622CrossRef Waxman BM (1988) Routing of multipoint connections. IEEE J Sel Areas Commun 6(9):1617–1622CrossRef
Metadata
Title
QoS multicast routing for wireless mesh network based on a modified binary bat algorithm
Authors
Yassine Meraihi
Dalila Acheli
Amar Ramdane-Cherif
Publication date
30-10-2017
Publisher
Springer London
Published in
Neural Computing and Applications / Issue 7/2019
Print ISSN: 0941-0643
Electronic ISSN: 1433-3058
DOI
https://doi.org/10.1007/s00521-017-3252-9

Other articles of this Issue 7/2019

Neural Computing and Applications 7/2019 Go to the issue

Premium Partner