Research And Simulation Of Wireless Sensor Network

In this paper, based on the introduction of Wireless Sensor Network(WSN) and the research directions about it we study and analyze recent routing protocols for WSN, as well as a comparison with some representative protocols. At last, we improve the performance of the hierarchical clustering LEACH algorithm. The results which simulate on the matlab show that we achieved the design goal.Every node in WSN has limited energy. So the design of WSN routing protocol is the main part of this dissertation. The important aim of designing WSN routing protocol is to reduce and balance the overall energy dissipated in the network and to maximize the network lifetime. LEACH is a cluster-based protocol, which designed for WSN as a low energy adaptive clustering hierarchy routing algorithm, and introduced by MIT scholar.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. Adopt k-means to choose clusterheads.This paper proves the network have a longer lifetime under a level of low energy consume.The results which simulated on the matlab show that: The implementation of new solution is able to increase the lifetime of the network one point four times as longer as that under the traditional LEACH protocol and make the distribution of dead heads more reasonable.