To read this content please select one of the options below:

A multi-objective multicast routing optimization based on differential evolution in MANET

Wenhong Wei (School of Computer Science, Dongguan University of Technology, Dongguan, China)
Yong Qin (School of Computer Science, Dongguan University of Technology, Dongguan, China)
Zhaoquan Cai (Department of Computer Science, Huizhou University, Huizhou, China)

International Journal of Intelligent Computing and Cybernetics

ISSN: 1756-378X

Article publication date: 12 March 2018

164

Abstract

Purpose

The purpose of this paper is to propose a multi-objective differential evolution algorithm named as MOMR-DE to resolve multicast routing problem. In mobile ad hoc network (MANET), multicast routing is a non-deterministic polynomial -complete problem that deals with the various objectives and constraints. Quality of service (QoS) in the multicast routing problem mainly depends on cost, delay, jitter and bandwidth. So the cost, delay, jitter and bandwidth are always considered as multi-objective for designing multicast routing protocols. However, mobile node battery energy is finite and the network lifetime depends on node battery energy. If the battery power consumption is high in any one of the nodes, the chances of network’s life reduction due to path breaks are also more. On the other hand, node’s battery energy had to be consumed to guarantee high-level QoS in multicast routing to transmit correct data anywhere and at any time. Hence, the network lifetime should be considered as one objective of the multi-objective in the multicast routing problem.

Design/methodology/approach

Recently, many metaheuristic algorithms formulate the multicast routing problem as a single-objective problem, although it obviously is a multi-objective optimization problem. In the MOMR-DE, the network lifetime, cost, delay, jitter and bandwidth are considered as five objectives. Furthermore, three QoS constraints which are maximum allowed delay, maximum allowed jitter and minimum requested bandwidth are included. In addition, we modify the crossover and mutation operators to build the shortest-path multicast tree to maximize network lifetime and bandwidth, minimize cost, delay and jitter.

Findings

Two sets of experiments are conducted and compared with other algorithms for these problems. The simulation results show that our proposed method is capable of achieving faster convergence and is more preferable for multicast routing in MANET.

Originality/value

In MANET, most metaheuristic algorithms formulate the multicast routing problem as a single-objective problem. However, this paper proposes a multi-objective differential evolution algorithm to resolve multicast routing problem, and the proposed algorithm is capable of achieving faster convergence and more preferable for multicast routing.

Keywords

Acknowledgements

Research of the authors was supported by the National Nature Science Foundation of China (No. 61370185), Nature Science Foundation of Guangdong Province (No. 2016A030313135), Guangdong Higher School Scientific Innovation Project (No. 2013KJCX0174, 2013KJCX0178, 2014KTSCX188), the outstanding young teacher training program of the Education Department of Guangdong Province (YQ2015158), Guangdong Provincial Science and Technology Plan Projects (No. 2016A010101034, 2016A010101035) and Guangdong Provincial High School of International and Hong Kong, Macao and Taiwan cooperation and innovation platform and major international cooperation projects (No. 2015KGJHZ027).

Citation

Wei, W., Qin, Y. and Cai, Z. (2018), "A multi-objective multicast routing optimization based on differential evolution in MANET", International Journal of Intelligent Computing and Cybernetics, Vol. 11 No. 1, pp. 121-140. https://doi.org/10.1108/IJICC-02-2017-0016

Publisher

:

Emerald Publishing Limited

Copyright © 2018, Emerald Publishing Limited

Related articles