A Novel Routing Algorithm for Power Line Communication over a Low-voltage Distribution Network in a Smart Grid

Abstract

A novel artificial cobweb routing algorithm (ACRA) for routing the tree-type physical topology of a low-voltage distribution network in a smart grid is proposed and analyzed in this paper. The establishment, maintenance and reconstruction of the route are presented. The artificial cobweb routing algorithm is shown to have broad general applicability for power line communication. To provide a theoretical foundation for further research, the communication delay of the network is calculated accurately. Simulation analysis of the communication delay and throughputs, which were based on Opnet14.5, demonstrate the accuracy of the theoretical calculation. For the performance evaluation of ACRA, a test-bed that includes PLC nodes with the ACRA is set up in a noisy environment. Experimental results show the feasibility of the ACRA algorithm. These indicate that ACRA is effective for guaranteeing Quality of Service (QoS) and reliability in power line communication.

Reliability and Survivability Analysis of Artificial Cobweb Network Model Used in the Low-Voltage Power-Line Communication System

“…According to the Konnex standard [24], the command data size of narrowband PLC is 1-15 bits; hence , the corresponding data packet size should be less than 25 bits., we We set the data packet size in this paper isin the simulations to 24 bits. The delay characteristics and channel conflicts of cobweb routing In referencehave been analyzed in [17], we have detailed analyzed the delay character and channel conflict of cobweb routing, but the throughput and delay characteristics of the character of rerouting algorithm was have not been analyzed, which we do in reference [15], so we analyze throughput and delay character of rerouting algorithm in this paper. …”

“…Equation (20) shows the delay time of the computer receiving the first data from the terminal nodes under different conditions. T d is the delay time, T N is the networking time, which is 0 in the without routing network, T R is the transmission delay between the terminal nodes and computer, which is calculated in detail in [17]. Fig.20 shows that when there is no noise source in the without routing network, the receiving first delay is about 1.2 s, which is about 8 s in the with routing network.…”

“…Reference [17] gives Aa detailed description of the routing route -establishingment process of in LVPLC employing single-layer artificial cobweb can be found in [17]in LVPLC.…”

“…Thus Complementing [17], this paper only makes an analysiszes of the all terminalall-terminal reliability of the network topology after the routing initialization is completed. Figs.…”

Design and Implementation of Control Unit for Railways using Power Line Data Transmission

“…We shall use it to communicate with the PC via the RS232 port of the PC. Assuming that the physical link is connected , we stipulate that [6]:…”