Research On The Dynamic-clustering Energy-efficient Routing Algorithm In Wireless Sensor Network

Recent advances in micro-electronics,wireless communications,micro-processor and micro-electro mechanical systems have motivated the development of wireless sensor networks.It doesn't need any fixation network support.As it's fast-spreading and indefectible,it is being used in a variety of commercial and military applications and becomes a new research field of modem technology.Cluster-head selection algorithm of hierarchical wireless sensor networks and energy consumption are two primary problems in wireless sensor networks.This thesis focuses on energy-efficient cluster-head selection in wireless sensor networks.First,this thesis introduces the basic conception and the structure of the WSN as well as some applications.We abreact the target of design for routing protocols.Then we give the classification of the routing protocols for WSN and summarize the characteristic of routing protocols.In this dissertation,we deeply analyze the classic clustering routing protocol-leach and improve it.In the cluster-head selection of LEACH,it may select the less energy node.This problem can be solved by the routing protocols which select the cluster-head based on the remaining energy of nodes.We present an improved protocol which based on the remaining energy of nodes and the whirling round mechanism. Simulation results show its good performance.Finally,some improvements are proposed aimed at correcting the deficiency of the LEACH protocol.It selects the cluster-head based on the cluster-head's average consumed energy and the remaining energy of the nodes.Only the nodes whose remaining energy greater than the average of cluster-head's consumed energy are honored to be selected for the cluster-head.We also present the minor-cluster-head which is the node transmits the data to the base station.The simulation results show its effectiveness in prolonging the network lifetime and balancing load among nodes in the WSN.