Open AccessReliable and resilient access network design for advanced metering infrastructures in smart grid
Author(s) -
Xu Shengjie,
Qian Yi,
Qingyang Hu Rose
Publication year - 2018
Publication title -
iet smart grid
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.612
H-Index - 11
ISSN - 2515-2947
DOI - 10.1049/iet-stg.2018.0008
Subject(s) - computer science , redundancy (engineering) , computer network , robustness (evolution) , network topology , distributed computing , network architecture , telecommunications network , network planning and design , grid , software deployment , smart grid , engineering , biochemistry , chemistry , geometry , mathematics , gene , operating system , electrical engineering
Maintaining a high overall network reliability remains one of the most critical requirements for advanced metering infrastructures (AMIs) in smart grid. Ensuring reliable networks not only determines the robust communications of an AMI, but also guarantees assured information delivery in the access network. To prevent any communication failures, incremental designs based on legacy networks should be carried out in advance to improve the overall redundancy. Current communication architecture of an AMI follows a traditional access network structure with a tree‐based topology, which does not always satisfy high robustness and is prone to network failures. To address the challenge, this study conducts a reliability study of the access network in an AMI. Specifically, this study first examines the basic network topology adopted in an AMI access network and its underlying connectivity issues. Secondly, this study proposes two practical solutions as parts of incremental network design to improve the communication robustness of existing communication architectures. Thirdly, mathematical models are formulated to solve network connectivity problems, for maintaining a high overall network reliability, while minimising the communication deployment cost at the same time. Simulation results are provided from the aspects of minimal path sets and minimal cut sets to demonstrate the redundancy analysis.