WSN分簇路由协议的改进与仿真

In this paper,we study and analyze recent routing protocols for WSN and improve the performance of the hierarchical clustering LEACH algorithm. The results which simulate on the matlab show that we achieved the design goal. LEACH is a cluster-based protocol, which designed for WSN as a low energy adaptive clustering hierarchy routing algorithm, and introduced by MIT scholar. The main features of LEACH are as follows: 1. The clusterheads are elected dynamically. 2. It partition the network to different clusters. 3. The technique of data compress is integrated in the respective cluster. LEACH assumes that all nodes can transmit with enough power to reach the BS if needed, therefore, it is only applicable to network deployed in a small region and the distance of transmission doesn’t allow being very long. We enhance the LEACH protocol in the following two aspects: 1. Created a new MTE routing within clusterheads, which transmit data by multi-jump, and consider how to choose transmitting node both in ideal conditions and a realistic channel model for Lossy sensor networks. 2. The data can be compressed when they are transmitted between clusterheads. Thus, ensure the network have a longer lifetime under a level of low energy consume. The results which simulated on the matlab show that: 1. The implementation of the MTE routing and the data compression technique is able to increase the lifetime of the network one time as longer as under the traditional LEACH protocol. 2. Using MTE routing but no data compression, the network lifetime may decreased. 3. In the environment of Lossy sensor network, employing Dist*PRR algorithm for the reasonable selection of the next node is able to increase the lifetime of the network.