Title: Adaptive tabu search-based core selection algorithm in heterogeneous network

Authors: Satya Prakash Sahoo; Manas Ranjan Kabat

Addresses: Department of Computer Science and Engineering, Burla Engineering College, Veer Surendra Sai University of Technology, Burla, Sambalpur, Odisha, 768018, India ' Department of Computer Science and Engineering, Burla Engineering College, Veer Surendra Sai University of Technology, Burla, Sambalpur, Odisha, 768018, India

Abstract: Nowadays, several networks like mobile ad hoc networks (MANETs), wireless sensor networks (WSNs), satellite networks, etc. are attached to the backbone internet through gateways. When a group of people work in a cooperative way, there is a stringent quality of service (QoS) requirement on delay and delay variation. This problem is called delay and delay variation multicast tree (DVBMT) problem. The main problem concerning the construction of shared multicast tree is to efficiently select the core point that is the root of the multicast tree. In this paper, we propose an adaptive tabu search-based core selection (ATS-CS) algorithm for multicast routing. The algorithm aims to minimise the delay variation subject to an end-to-end delay bound. The proposed algorithm is evaluated through simulation. It is observed that the proposed algorithm gives better and consistent performance than the existing algorithms. The actual execution time of the proposed algorithm is comparable to the existing algorithm.

Keywords: adaptive tabu search; multicast routing; delay variation; end-to-end delay; shared multicast tree; core selection algorithm; heterogeneous networks; simulation; quality of service; QoS.

DOI: 10.1504/IJSI.2014.066538

International Journal of Swarm Intelligence, 2014 Vol.1 No.3, pp.209 - 225

Accepted: 22 Nov 2013
Published online: 14 Jan 2015 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article