Adaptive tabu search-based core selection algorithm in heterogeneous network Online publication date: Wed, 14-Jan-2015
by Satya Prakash Sahoo; Manas Ranjan Kabat
International Journal of Swarm Intelligence (IJSI), Vol. 1, No. 3, 2014
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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Swarm Intelligence (IJSI):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook