Study on cluster-based dynamic routing algorithm in Power Line Communication network

Author

Chenchen Huang ; Yonghai Ning

Author_Institution

Electron. & Inf. Eng. Coll., Henan Univ. of Sci. & Technol., Luoyang, China

fYear

2012

fDate

15-17 Aug. 2012

Firstpage

461

Lastpage

465

Abstract

Power Line Communication (PLC) networks have some characters, such as unpredictable physical topology and time-varying channel. In order to enhance the reliability of PLC networks, cluster-based dynamic routing algorithm is proposed and thoroughly discussed in this paper. This algorithm uses the ideology of minimum identification (ID) clustering algorithm to establish routing and maintain effective routing on-demand. It can reduce the routing overhead to ensure the reliability and stability of the communication routing, and thus enhance the overall performance and efficiency of power line communication network. Simulation result shows that the algorithm has certain validity.

Keywords

carrier transmission on power lines; pattern clustering; telecommunication network reliability; telecommunication network routing; ID clustering algorithm; PLC networks; cluster-based dynamic routing algorithm; communication routing reliability; communication routing stability; minimum identification clustering algorithm; power line communication network; time-varying channel; unpredictable physical topology; Algorithm design and analysis; Clustering algorithms; Heuristic algorithms; Logic gates; Peer to peer computing; Power line communications; Routing; clustering algorithm; dynamic route; power line communication; self-adaptive;

fLanguage

English

Publisher

ieee

Conference_Titel

Automation and Logistics (ICAL), 2012 IEEE International Conference on

Conference_Location

Zhengzhou

ISSN

2161-8151

Print_ISBN

978-1-4673-0362-0

Electronic_ISBN

2161-8151

Type

conf

DOI

10.1109/ICAL.2012.6308250

Filename

6308250