Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem

Raka Jovanovic, Milan Tuba

Research output: Contribution to journalArticle

64 Citations (Scopus)

Abstract

In this paper an ant colony optimization (ACO) algorithm for the minimum connected dominating set problem (MCDSP) is presented. The MCDSP become increasingly important in recent years due to its applicability to the mobile ad hoc networks (MANETs) and sensor grids. We have implemented a one-step ACO algorithm based on a known simple greedy algorithm that has a significant drawback of being easily trapped in local optima. We have shown that by adding a pheromone correction strategy and dedicating special attention to the initial condition of the ACO algorithm this negative effect can be avoided. Using this approach it is possible to achieve good results without using the complex two-step ACO algorithm previously developed. We have tested our method on standard benchmark data and shown that it is competitive to the existing algorithms.

Original languageEnglish
Pages (from-to)133-149
Number of pages17
JournalComputer Science and Information Systems
Volume10
Issue number1
DOIs
Publication statusPublished - 1 Jan 2013

Fingerprint

Ant colony optimization
Mobile ad hoc networks
Sensors

Keywords

  • Ant colony optimization (ACO)
  • Minimum connected dominating set problem
  • Optimization metaheuristics
  • Swarm intelligence

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

@article{9952ff87579f43a0b660dc1c4fb17382,
title = "Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem",
abstract = "In this paper an ant colony optimization (ACO) algorithm for the minimum connected dominating set problem (MCDSP) is presented. The MCDSP become increasingly important in recent years due to its applicability to the mobile ad hoc networks (MANETs) and sensor grids. We have implemented a one-step ACO algorithm based on a known simple greedy algorithm that has a significant drawback of being easily trapped in local optima. We have shown that by adding a pheromone correction strategy and dedicating special attention to the initial condition of the ACO algorithm this negative effect can be avoided. Using this approach it is possible to achieve good results without using the complex two-step ACO algorithm previously developed. We have tested our method on standard benchmark data and shown that it is competitive to the existing algorithms.",
keywords = "Ant colony optimization (ACO), Minimum connected dominating set problem, Optimization metaheuristics, Swarm intelligence",
author = "Raka Jovanovic and Milan Tuba",
year = "2013",
month = "1",
day = "1",
doi = "10.2298/CSIS110927038J",
language = "English",
volume = "10",
pages = "133--149",
journal = "Computer Science and Information Systems",
issn = "1820-0214",
publisher = "ComSIS Consortium",
number = "1",

}

TY - JOUR

T1 - Ant colony optimization algorithm with pheromone correction strategy for the minimum connected dominating set problem

AU - Jovanovic, Raka

AU - Tuba, Milan

PY - 2013/1/1

Y1 - 2013/1/1

N2 - In this paper an ant colony optimization (ACO) algorithm for the minimum connected dominating set problem (MCDSP) is presented. The MCDSP become increasingly important in recent years due to its applicability to the mobile ad hoc networks (MANETs) and sensor grids. We have implemented a one-step ACO algorithm based on a known simple greedy algorithm that has a significant drawback of being easily trapped in local optima. We have shown that by adding a pheromone correction strategy and dedicating special attention to the initial condition of the ACO algorithm this negative effect can be avoided. Using this approach it is possible to achieve good results without using the complex two-step ACO algorithm previously developed. We have tested our method on standard benchmark data and shown that it is competitive to the existing algorithms.

AB - In this paper an ant colony optimization (ACO) algorithm for the minimum connected dominating set problem (MCDSP) is presented. The MCDSP become increasingly important in recent years due to its applicability to the mobile ad hoc networks (MANETs) and sensor grids. We have implemented a one-step ACO algorithm based on a known simple greedy algorithm that has a significant drawback of being easily trapped in local optima. We have shown that by adding a pheromone correction strategy and dedicating special attention to the initial condition of the ACO algorithm this negative effect can be avoided. Using this approach it is possible to achieve good results without using the complex two-step ACO algorithm previously developed. We have tested our method on standard benchmark data and shown that it is competitive to the existing algorithms.

KW - Ant colony optimization (ACO)

KW - Minimum connected dominating set problem

KW - Optimization metaheuristics

KW - Swarm intelligence

UR - http://www.scopus.com/inward/record.url?scp=84874631029&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84874631029&partnerID=8YFLogxK

U2 - 10.2298/CSIS110927038J

DO - 10.2298/CSIS110927038J

M3 - Article

VL - 10

SP - 133

EP - 149

JO - Computer Science and Information Systems

JF - Computer Science and Information Systems

SN - 1820-0214

IS - 1

ER -