A database-driven Ant Colony Algorithm for PLC networking

Yu Zeng; Xiaofang Zhou; Linshan Zhang; Nianrong Zhou; Gerald E. Sobelman

doi:10.1587/elex.11.20140957

A database-driven Ant Colony Algorithm for PLC networking

Yu Zeng, Xiaofang Zhou, Linshan Zhang, Nianrong Zhou, Gerald E. Sobelman

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

2 Scopus citations

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.

Original language	English (US)
Article number	20140957
Journal	IEICE Electronics Express
Volume	11
Issue number	22
DOIs	https://doi.org/10.1587/elex.11.20140957
State	Published - Oct 30 2014

Bibliographical note

Publisher Copyright:
© IEICE 2014.

Keywords

Ant Colony Algorithm
Dijkstra’s algorithm
PLC networking
Relay technology

Access

10.1587/elex.11.20140957

OpenUrl availability

Full text

Cite this

@article{23e7d86e3be3459da650ec5b04c180c6,

title = "A database-driven Ant Colony Algorithm for PLC networking",

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{\textquoteright}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.",

keywords = "Ant Colony Algorithm, Dijkstra{\textquoteright}s algorithm, PLC networking, Relay technology",

author = "Yu Zeng and Xiaofang Zhou and Linshan Zhang and Nianrong Zhou and Sobelman, {Gerald E.}",

note = "Publisher Copyright: {\textcopyright} IEICE 2014.",

year = "2014",

month = oct,

day = "30",

doi = "10.1587/elex.11.20140957",

language = "English (US)",

volume = "11",

journal = "IEICE Electronics Express",

issn = "1349-2543",

publisher = "The Institute of Electronics, Information and Communication Engineers (IEICE)",

number = "22",

}

TY - JOUR

T1 - A database-driven Ant Colony Algorithm for PLC networking

AU - Zeng, Yu

AU - Zhou, Xiaofang

AU - Zhang, Linshan

AU - Zhou, Nianrong

AU - Sobelman, Gerald E.

N1 - Publisher Copyright: © IEICE 2014.

PY - 2014/10/30

Y1 - 2014/10/30

N2 - 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.

AB - 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.

KW - Ant Colony Algorithm

KW - Dijkstra’s algorithm

KW - PLC networking

KW - Relay technology

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

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

U2 - 10.1587/elex.11.20140957

DO - 10.1587/elex.11.20140957

M3 - Article

AN - SCOPUS:84911863846

SN - 1349-2543

VL - 11

JO - IEICE Electronics Express

JF - IEICE Electronics Express

IS - 22

M1 - 20140957

ER -

A database-driven Ant Colony Algorithm for PLC networking

Abstract

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this