The Study Of Electricity Information Collection-oriented Routing Strategy In Wireless Sensor Network

Directly connected to customers,distribution network is the key link to assure power supply quality,enhance power network’s operating efficiency and innovate user services. The communication of smart distribution grid is the basis of the economic and reliable operation of the power system, and it is the key to distribution automation system. As the distribution network has the problems of complex network structure and large-scale terminal information acquisition, the use of advanced wireless communications technology to build power wireless communication network becomes the key to smart distribution network. This thesis aims at the network routing problems of the distribution network communication services and study wireless sensor network routing algorithm in the application background of the distribution network communication services requirements. It designs the routing optimization algorithms based on wireless sensor network to meet the requirements.Firstly, in this paper, by analyzing the current situation and the business of the local communication network, the paper draws the requirements and typical characteristics of the communication service of the electric information acquisition system, and the local communication network as the research background, and the LEACH-BL algorithm based on LEACH algorithm is proposed. This algorithm optimizes the selection of the cluster head, so that each round can choose the cluster head, and the node density and the distance from node to node Sink are two factors, which makes the nodes are elected as the cluster head. The nodes are negatively related to the Sink distance. In the fourth chapter, we propose a clustering routing algorithm based on AODV-clustering, which is based on the consideration of energy efficiency and time delay. In the path selection, we consider the energy factor, load factor, delay factor, establish the optimal route from the cluster head to the Sink node. The algorithm reduces the time delay of the cluster head node to the Sink node, and reduces the energy consumption of the nodes. The simulation shows that the algorithm can prolong the network life cycle and optimize the network performance under the large area environment.