Balanced Tree Based Data Collection Algorithm in Smart Grid

Abstract

In smart grid, one of the important issues that should be solved is how to establish a reasonable and efficient data collection routing mechanism to adapt to the characteristics of smart grid. Compared with traditional routing algorithms a different point is that the major risk of power communication data collection is not sudden congestion caused by bursty traffic, but too much data streams converged at critical nodes. To solve this problem, this paper proposes a routing algorithm based on balanced tree to overcome network congestion, thereby ensuring the reliability of data collecting. First, the algorithm has established a mathematical model for power communication network. The routing metric model that constituted by queue length and buffer capacity of network nodes, together with the balanced tree algorithm, are used to establish routing algorithm. At the end, the difference between the two algorithms were compared in the MATLAB environment. The experimental results show that RA-DBMM algorithm can effectively solve the problem of data congestion problems, so as to improve reliability and throughput of the electric power communication data acquisition network.