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

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.

Download Full-text

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

APTIKOM Journal on Computer Science and Information Technologies ◽

10.11591/aptikom.j.csit.143 ◽

2018 ◽

Vol 3 (3) ◽

pp. 100-105

Author(s):

Sengathir Janakiraman

Keyword(s):

Data Dissemination ◽

Data Transfer ◽

Multicast Routing ◽

Direct Interaction ◽

Reliable Data ◽

Multicast Tree ◽

Reliable Multicast ◽

Vehicular Communication ◽

Estimation Scheme ◽

Tree Estimation

Download Full-text

Fuzzy COmplex PRoportional ASsessment of alternatives‐based Node Cooperation Enforcing Trust Estimation Scheme for enhancing Quality of Service during reliable data dissemination in Mobile Ad hoc Networks

International Journal of Communication Systems ◽

10.1002/dac.4767 ◽

2021 ◽

Author(s):

Srinivasulu Sirisala ◽

S. Rama Krishna

Keyword(s):

Quality Of Service ◽

Mobile Ad Hoc Networks ◽

Ad Hoc ◽

Data Dissemination ◽

Reliable Data ◽

Node Cooperation ◽

Estimation Scheme ◽

Mobile Ad Hoc ◽

Hoc Networks

Download Full-text

Multi-Source Reliable Multicast Routing with QoS Constraints of NFV in Edge Computing

Electronics ◽

10.3390/electronics8101106 ◽

2019 ◽

Vol 8 (10) ◽

pp. 1106 ◽

Cited By ~ 4

Author(s):

Shiming He He ◽

Kun Xie ◽

Xuhui Zhou ◽

Thabo Semong ◽

Jin Wang

Keyword(s):

Heuristic Algorithms ◽

Multicast Routing ◽

Multicast Tree ◽

Edge Computing ◽

Network Function Virtualization ◽

Reliable Multicast ◽

Network Function ◽

Tree Construction ◽

Service Function Chain ◽

The Cost

Edge Computing (EC) allows processing to take place near the user, hence ensuring scalability and low latency. Network Function Virtualization (NFV) provides the significant convenience of network layout and reduces the service operation cost in EC and data center. Nowadays, the interests of the NFV layout focus on one-to-one communication, which is costly when applied to multicast or group services directly. Furthermore, many artificial intelligence applications and services of cloud and EC are generally communicated through groups and have special Quality of Service (QoS) and reliable requirements. Therefore, we are devoted to the problem of reliable Virtual Network Function (VNF) layout with various deployment costs in multi-source multicast. To guarantee QoS, we take into account the bandwidth, latency, and reliability constraints. Additionally, a heuristic algorithm, named Multi-Source Reliable Multicast Tree Construction (RMTC), is proposed. The algorithm aims to find a common link to place the Service Function Chain (SFC) in the multilevel overlay directed (MOD) network of the original network, so that the deployed SFC can be shared by all users, thereby improving the resource utilization. We then constructed a Steiner tree to find the reliable multicast tree. Two real topologies are used to evaluate the performance of the proposed algorithm. Simulation results indicate that, compared to other heuristic algorithms, our scheme effectively reduces the cost of reliable services and satisfies the QoS requirements.

Download Full-text