An enhanced hybrid Pareto metaheuritic algorithm-based multicast tree estimation for reliable multicast routing in VANETs

Sengathir Janakiraman


Prompt and reliable data dissemination among the vehicular nodes of the network is indispensable as its mobility rate and limited coverage characteristics introduce the possibility of frequent topology changes. The effective and efficient sharing of critical information in the event of emergency necessitates either direct interaction or Road Side Units (RSUs)-based vehicular communication in the primitive place. Multicast routing is confirmed to be the significant scheme of data transfer since they establish reliable data dissemination between the source and destination vehicular nodes by estimating an optimal multicast tree. Moreover, QoS-constraint enforced meta-heuristic approaches are considered to be excellent for determining optimal multicast tree under multicasting. An Enhanced Hybrid Pareto Metaheuritic Algorithm-based Multicast Tree Estimation Scheme (EHPMA-MTES) is contributed for reliable multicast routing. The proposed EHPMA-MTES is confirmed to reduce the cost of transmission by 28% through the minimization of the multicast tree count formed during the process of multicast routing.

Full Text:



Wang, H, Xu, H, Yi, S, Shi, Z. A tree-growth based ant colony algorithm for QoS multicast routing problem. Expert Systems with Applications. 2011; 38(9): 11787-11795.

Tseng, S, Lin, C, Huang, Y. Ant colony-based algorithm for constructing broadcasting tree with degree and delay constraints. Expert Systems with Applications. 2008; 35(3): 1473-1481.

Bitam, S, Mellouk, A. Routing for Vehicular Ad Hoc Networks. Bio-Inspired Routing Protocols for Vehicular Ad Hoc Networks. 2014; 2(1): 29-50.

Armaghan, M, Haghighat, AT, Armaghan, M. QoS multicast routing algorithms based on Tabu Search with Elite candidate list. 2009 International Conference on Application of Information and Communication Technologies, 2009; 2(1): 77-86.

Sun, J, Fang, W, Wu, X, Xie, Z, Xu, W. QoS multicast routing using a quantum-behaved particle swarm optimization algorithm. Engineering Applications of Artificial Intelligence. 2011; 24(1): 123-131.

Yen, Y, Chao, H, Chang, R, Vasilakos, A. Flooding-limited and multi-constrained QoS multicast routing based on the genetic algorithm for MANETs. Mathematical and Computer Modelling. 2011; 53(11-12): 2238-2250.

Haghighat, A, Faez, K, Dehghan, M, Mowlaei, A, Ghahremani, Y. GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing. Computer Communications. 2004; 27(1): 111-127.

Ghaboosi, N, Haghighat, AT. Tabu search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Telecommunication Systems. 2007; 34(3-4): 147-166.

Forsati, R, Haghighat, A, Mahdavi, M. Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing. Computer Communications. 2008; 31(10): 2505-2519.

Bitam, S, Mellouk, A. Bee life-based multi constraints multicast routing optimization for vehicular ad hoc networks. Journal of Network and Computer Applications. 2013; 36(3): 981-991.

Bitam, S, Mellouk, A, Fowler, S. MQBV: multicast quality of service swarm bee routing for vehicular ad hoc networks. Wireless Communications and Mobile Computing. 2013; 15(9): 1391-1404.

Zhang, X, Zhang, X, Gu, C. A micro-artificial bee colony based multicast routing in vehicular ad hoc networks. Ad Hoc Networks. 2017; 58: 213-221.



  • There are currently no refbacks.

Copyright (c) 2019 APTIKOM Journal on Computer Science and Information Technologies

ISSN: 2722-323X, e-ISSN: 2722-3221

CSIT Stats


Creative Commons License
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.