A novel Ant Colony Algorithm for multicast routing in wireless ad hoc networks

Prasad, Sunita

doi:10.5121/csit.2012.2231

Cited by 2 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm in this paper is compared with the ACOF algorithm [4] and the Novel-ACO algorithm [6] on the B class graph. In Table I, Optimal is the current or known optimal solution of the test case.…”

Section: Experiments and Results Analysismentioning

confidence: 99%

“…For the larger problem, although the running time of the algorithm is significantly reduced when increases the number of clusters, but the solution will be worse. In the algorithm proposed by Prasad S et al [6], the number of ants is set to be the same as the number of terminal nodes. Each ant starts from a terminal node and finds the shortest path from the terminal node to the source node, and finally merge into a steiner tree.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An Approximate Algorithm for the Steiner Tree Problem based on Ant Colony Algorithm

Jia¹,

Huang²

2017

dtcse

View full text Add to dashboard Cite

Ant colony optimization (ACO) is a well-known heuristic intelligent method which is used to solve combinatorial optimization problem and can obtain high-quality results in a reasonable execution time. Steiner Tree Problem (STP) is a classic NPcomplete problem. The computational complexity of the exact algorithm increases exponentially with the increment of the size of the problem. In this paper, we propose an ant colony optimization algorithm with data parallelism to solve the STP. The simulation results show that the algorithm has good performance in result quality.

show abstract

Section: Experiments and Results Analysismentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%