The Study On Clustering Routing Algorithm For Wireless Sensor Networks

Wireless sensor network (WSN) is a organization distributed network system consists of a large number of micro-sensors in monitoring area, and WSN aims to complete the formation of information detection, collection and processing in a monitoring area, and eventually will transmit information to the observer side used to analysis. WSN is a combination of several frontier disciplines, such as wireless communication technology, the sensor technology microelectronics technology and so on. WSN has a broad application prospect in the fields of military, scientific research, civilian affairs and so on.Because WSNs are often deployed in extreme natural conditions, and sensor node energy is limited, therefore, how to effectively use the node energy, extend WSNs survival time, is the current main research contents; And Routing protocol for WSN is one of the core technology to solve the problem, has the relationship of the whole sensor network work efficiency. Clustering routing protocol is becoming a hot research topic in recent years with advantages of strong management, low energy consumption, easy maintenance and so on.The traditional clustering routing protocol for WSNs usually not takes into energy load balancing of the entire network in the data forwarding phase, resulting a regional sensors failure early for energy consumption, which is called the problem of hotspot. Based on the characteristics of clustering routing protocol, for the purpose of balancing network energy loading and prolonging the network life, this paper puts forward a hybrid routing algorithm based on uniform clustering. The algorithm restricts the number of cluster member nodes to form more clusters near by sink for forwarding task, and makes WSN produces uneven clusters, which can some extent inhibit the problem of hotspot. Meanwhile, for clustering members, the algorithm references plane routing scheduling mechanism to make redundant nodes work alternately, and further save energy. Eventually, the cluster head use greedy algorithm to choose the nearest neighbor node as a relay, and pass the data out.At last, this paper further proposes a clustering routing algorithm based on energy consumption balanced, make the cluster head distribution more reasonable, and improve the relay node selecting mechanism. The algorithm introduces node energy and distance to limit cluster competition radius. Nodes exchange information with the surround nodes to produce cluster head, make cluster head distribution more reasonable, and inform uneven clusters. Member nodes work alternately. According to the relationship between distance and energy, clusters of routing the distance between data and energy relationship, the algorithm selects the best relay node to guarantee that the network load balance and save energy. The experiments show that the algorithm is well balanced the energy of the network load and prolong the network life time.