A Study On The Routing Algorithm Based With The Unequal Clustering

Wireless sensor network (WSN) is a very popular major in the field of wireless communications network, it can change people’s daily lives according to the development of it. The technology of WSN is related with many technologies, including sensor technology, wireless communication technology and distributed computing technology, with the rapid development of them, the sensor network’s research and development has been promoted. The WSN with large-scale is self-organizated by thousands of sensors, they can be deployed in the environment which is closed to human, or even deployed in the dangerous places. Each sensor can sense a lot of information, then they tranmit this information to the sink node by the wireless communication, and finally the observer can obtain this information through the internet or satellite.WSN’s routing protocol affects the network’s survival time, in order to prolong the survival time, it is necessary to choose a appropriate routing protocol. LEACH protocol is a hierarchical protocol, it exist some defects, such as sensor’s energy is limited, the number of node in the cluster is unequal, this problem are seriously affected the network’s survival time. In order to solve this problems, this paper analyzes many unequal clustering algorithms, and then propose a new protocol, which is called N-LEACH. N-LEACH is improved according to energy and load-balanced, so the farther the distanced from the sink node, the number of node in the cluster is more, so that it can balance the node’s energy, and then achieve the target of unequal clustering. Then, accroding to the MATLAB, it is show that the improved algorithm can prolong the network’s survival time.In order to design a routing protocol that is applied in the event-driven environment, the routing protocol has serious effects on the network’ survival time, this paper propose a improved multipath clustering routing protocol(IMCRP), which is based on the clustering and improved ant colony optimization(ACO). IMCRP can divided into three phase, which is cluster formation, constructing multipath and data transmission. In the cluster formatiom phase, the way to clustering is based on the event-driven, then the CH node is selected by the node’s energy, the number of node’s neighbor and the signal strength, in the constructing multipath phase, it use the ACO algorithm to construct the multipath, in the data transmission, it use the load balancing function to choose the path to transmit the data, which can balance the node’s energy consumption. This paper use the NS2to formulate the IMCRP, then compare the IMCRP and AODV, the result show that the IMCRP can save and balance the energy, it alse can prolong the network’s survival time, which is achieve the designed goal.