Research Of Clustering Routing Algorithms In Wireless Sensor Networks

Wireless sensor networks, which is made the convergence of sensor, micro-electro-mechanism system and networks technologies, adopts a novel technology about acquiring and processing information. It can be used in many applications, such as health, military, national security, habitat monitoring, managing inventory, monitoring product quality, and monitoring disaster areas etc. . Wireless sensor network is a new research area of multiple disciplines and has a wide application future. Both academia and industries are very interested in it. There are various kinds of application-specific routing protocols devised for wireless sensor networks researchers around the world.First the concept and research status of wireless sensor networks are introduced. Then we focus on routing protocol and give them a summary describe. Self-organization clustering routing algorithms are generally classified into two categories: flat and hierarchical structure. Compared with the flat network topology, the hierarchical structure has many advantageous features, such as high scalability, convenient network management, energy consumption reduction, better QoS support etc. . As a result, hierarchical topology has been used more widely in large-scale wireless sensor networks. Research on key technologies of hierarchical self-organization algorithms is emphasized in this thesis.The research on clustering algorithms is presented in the third part of the thesis. We have proposed new algorithms in its three parts. Cluster selection algorithm, cluster making algorithm and communication algorithm in cluster.In the third chapter, we firstly analyze a representative clustering algorithm-LEACH. The fact that the randomness of LEACH may result in faster death of some nodes i.e. shorten the system life is proved. A distributed cluster selection algorithm based on energy-considered strategy is presented. The node which has higher energy has the higher probability to be a cluster head. Simulation shows that the new algorithm is proved to be more effective in the network energy equilibria and prolong the life of the network.In the fourth chapter, during the cluster making, we first analyze the disadvantage of traditional cluster making algorithm. Then we consider not only the distance between node and cluster, but also the energy when making a decision of cluster head. As the importance of the cluster head, also we make a backup cluster head in order to strength the robust of the cluster communication. When the energy of cluster is lower than defined, the backup cluster head is changed to cluster head, the cluster head is changed backup cluster head. Simulation results show that this clustering protocol can reduce the energy consuming under different traffic load, strength the robust of the cluster communication, get improvement on the life of the network.In the fifth chapter, during the cluster communication, A traffic-adaptive clustering algorithm based TDMA for wireless sensor networks is proposed. This algorithm can adjust the slot length of the wireless sensor node adaptively, when the traffic on the node is changed, so the energy of idle consuming and state changing is reduced. Simulation results show that the traffic-adaptive clustering algorithm can reduce the energy consuming under different traffic load and get improvement on the life of the network.At the last part of this dissertation, the whole work of the dissertation is outlined and the further research issues are discussed.