A Brief Analysis on Routing Models for Efficent Data Transmission in Smart Grid

Recent years have seen a surge of interest in the concept of a Smart Grid (SG) from scientists and power companies alike. Smart meters, energy companies, and service providers have a difficult problem to establish secure communication between them. The electric power communication network's data gathering system is a critical component of the system. For a data gathering system, it's important to have an acceptable routing mechanism in place. Burst congestion is the primary risk of the original routing system. The new source of risk in the smart grid data gathering network is that some nodes may suffer greater congestion than others and possibly become the network bottleneck. Area Network (NAN) and Wide Area Network (WAN) zones should each have their own wired dynamic routing mechanism. The energy routing issue arises from the two-way flow of electricity and information, as well as the incorporation of decentralized renewable energy sources into the SG. In an effort to lower transmission costs without sacrificing the smart grid's dependability or efficiency, researchers have focused a lot of emphasis on the energy routing problem. Graph theory, automated systems, and game theory are just a few of the classic approaches that have been used to address this issue in the past. This research presents a brief analysis on numerous routing models for efficient data transmission in smart grid. This research helps researchers and academicians to help in gaining knowledge in smart grid routing mechanisms.