Title: Energy routing algorithm based on OSPF protocol and virtual circuit switching mode in energy local area network

Authors: Babar Ali; Ghulam Murtaza; Tariq Mahmood; Hafiz Muhammad Bilal; Rizwan Zahoor; Saleemullah Memon

Addresses: School of Information and Communication Engineering, Beijing University of Post and Telecommunication, 10 Xitucheng Road, Haidian, Beijing, 100876, China ' School of Electronic Engineering, Beijing University of Post and Telecommunication, 10 Xitucheng Road, Haidian, Beijing, 100876, China ' Faculty of Information Technology, Beijing University of Technology, Beijing 100124, China; Division of Science and Technology, The University of Education, Lahore 54000, Pakistan ' School of Electronic Engineering, Beijing University of Post and Telecommunication, 10 Xitucheng Road, Haidian, Beijing, 100876, China ' School of Electronic Engineering, Beijing University of Post and Telecommunication, 10 Xitucheng Road, Haidian, Beijing, 100876, China ' School of Information and Communication Engineering, Beijing University of Post and Telecommunication, 10 Xitucheng Road, Haidian, Beijing, 100876, China

Abstract: The advance management of the power supply to load such as in homes, offices, etc. and power from the source to central network in a smart grid system with lowest possible loss is considered here in this paper using the concept of energy internet. It also includes the complete details of power flow and control. In this paper, the efficiency of transmission is increased by using energy routers based on open shortest path first (OSPF) protocol, a new concept in the field of energy internet. By using energy local area network (e-LAN) concept, all the energy routers are connected by using OSPF protocols and virtual circuit concept theory. An algorithm is proposed for efficient power transmission and effective selection of sources to minimise the overall cost in the network.

Keywords: smart grid; energy local area network; e-LAN; open shortest path first; OSPF; energy routers.

DOI: 10.1504/IJCCIA.2019.10024515

International Journal of Computational Complexity and Intelligent Algorithms, 2020 Vol.1 No.3, pp.292 - 310

Received: 09 Jan 2019
Accepted: 19 May 2019

Published online: 28 Feb 2020 *

Full-text access for editors Access for subscribers Purchase this article Comment on this article