Journal article Open Access

A Graph Theory Based Energy Routing Algorithm in Energy Local Area Network (e-LAN)

Wang, Ruichi; Wu, Jiande; Qian, Zhongnan; Lin, Zhengyu; He, Xiangning

The energy internet concept has been considered as a new development stage of the Smart Grid, which aims to increase the energy transmission efficiency and optimise the energy dispatching in time and space. Energy router is a core device in the energy internet and it connects all the devices together into a net structure and manages power flows among them. The research work presented in this paper described the energy router’s structure and function expectations from the network perspective, and improved the existing energy router design. Open-shortest-path first (OSPF) protocol and virtual circuit switching mode are referenced from the Internet in the energy local area network (e-LAN) design. This paper proposed a design of an energy routing algorithm based on graph theory in an e-LAN. A lowest-cost routing selection algorithm is designed according to the features of power transmission, and a source selection and routing design algorithm is proposed for very heavy load conditions. Both algorithms have been verified by case analyses.

© 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers.
Files (799.7 kB)
Name Size
799.7 kB Download
All versions This version
Views 300212
Downloads 369107
Data volume 281.5 MB85.6 MB
Unique views 275199
Unique downloads 342103


Cite as