The Design Of Wireless Sensor Network For Automatic Meter Reading System

As the demand for power resources scattered in various cities, regions, or even every corner, power management has considerable difficulties. Meanwhile, in order to improve efficiency of po-wer supply and to achieve the purpose of the "whole society saving power", the implementation of the different tariff, TOU electricity pricing is imperative. Therefore, studying the automatic meter reading system that has wide range covering, high performance and low cost is important, and has practical significance. Due to the low complexity, low power and low cost, wireless sensor network technology is considered to be the means of networking technology of AMR system by growing number of scholars. However, there are a lot of differences between the WSN based on the AMR system and the common WSN. Therefore, it is necessary to construct the wireless sensor network for the AMR system, and study its key technologies. Because of the limited time, this paper only focuses on the protocol design of the MAC layer.In reference with the composition of the traditional meter reading system, and actual environment of the residential sub-districts, the wireless sensor network topology for the AMR system is designed in this paper. The network uses clustering structure, in which the tree structure for the inter-cluster communication and the star structure for the communication between clusters. Because it’s only focused on MAC layer in this paper, we only consider the relevant differences between the WSN for AMR system and the common WSN. Compared to the common WSN, The WSN for AMR system has special features of not sensitive to power, no analysis in data aggregation, non-redundant nodes and delay tolerable.In this paper, the protocol for wireless sensor network MAC layer is TDMA with fixed time slot algorithm. Considering the "non-redundant nodes" feature of WSN for AMR system, the protocol includes an effective fault detection mechanism, and can do control the message delay in a certain acceptable range. In this paper, the fixed time slot allocation problem is abstracted to a strong edge coloring problem. The node slot assignment is abstracted to the vertices coloring of the graph. By six states, UNSET, UNSET_l, GRANT, REQUEST, SET, DONE, the vertices can determine their own time slot (color). At last, we do performance simulation and analysis for the time-slot assignment algorithm. Generates different simulation scenarios by setting different building, level, maxNeighbor values. We do simulation for the operating efficiency of the algorithm under different network size. The analysis and comparison shows that the algorithm efficiency is mostly affected by the actual maximum number of neighboring nodes, and is little affected by the expansion of the network size.