Proceedings International Parallel and Distributed Processing Symposium
DOI: 10.1109/ipdps.2003.1213470
|View full text |Cite
|
Sign up to set email alerts
|

A parallel ant colony optimization algorithm for all-pair routing in MANETs

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
22
0

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 35 publications
(22 citation statements)
references
References 12 publications
0
22
0
Order By: Relevance
“…[20] proposed a Source Update algorithm which suggests new ways to update pheromones. Figure 8a illustrates the way pheromone update in general ACO algorithm.…”
Section: Source Updatementioning
confidence: 99%
See 3 more Smart Citations
“…[20] proposed a Source Update algorithm which suggests new ways to update pheromones. Figure 8a illustrates the way pheromone update in general ACO algorithm.…”
Section: Source Updatementioning
confidence: 99%
“…path field is used to know shortest path. visited field comes from [20] and prevents revisit and the graph cycle. …”
Section: Design Of Aco Packetmentioning
confidence: 99%
See 2 more Smart Citations
“…Central node is divided into secondary nodes. These secondary nodes handle the load sent by overloaded primary nodes [12] [24].…”
Section: Figure 1: Load Balancer Implementationmentioning
confidence: 99%