Name
Abstract | ||
|---|---|---|
Relay technology is necessary for Power Line Carrier communication because of the harsh characteristics of the power line channel, including time-variance, strong noise and high attenuation. The Ant Colony Algorithm is a promising approach for implementing relay technology. However, the execution time for the conventional Ant Colony Algorithm is very long. This paper provides a novel approach to speed up the search process using a database together with Dijkstra's algorithm. The experimental results show that the new algorithm can decrease the convergence time significantly in most types of topologies. In addition, robustness and invulnerability properties of the algorithm are also improved. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1587/elex.11.20140957 | IEICE ELECTRONICS EXPRESS |
Keywords | Field | DocType |
PLC networking, Ant Colony Algorithm, relay technology, Dijkstra's algorithm | Ant colony optimization algorithms,Computer science,Artificial intelligence,Dijkstra's algorithm | Journal |
Volume | Issue | ISSN |
11 | 22 | 1349-2543 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yu Zeng | 1 | 0 | 0.34 |
| Xiaofang Zhou | 2 | 11 | 4.11 |
| Linshan Zhang | 3 | 0 | 0.34 |
| Nianrong Zhou | 4 | 0 | 0.34 |
| Gerald E. Sobelman | 5 | 0 | 0.34 |