The Research And Design Of The Clustering-based Routing Algorithm In Wireless Sensor Networks

Wireless sensor networks (WSN) consists of a large number of sensor nodes which integrate the function of sense, data processing and short distance wireless communication. The networks is a kind of wireless Ad hoc networks with a distinct data-centric property, and the object of wireless sensor networks is to sense, collect and process the information of the various environments or the detected objects in the coverage area of the networks, and then send the sensing information to the user. Wireless sensor networks, together with utility computation, plastic electronics and body bionics, are considered as the four high-tech industries in the future around the world. As a new generation of the detecting and control system, the data routing in wireless sensor networks is the most important function, and its performance directly influences the energy consumption in wireless sensor networks.The research of the dissertation focuses on data routing mechanism in wireless sensor networks. Based on the systematic analysis of the present data routing mechanisms, a new data routing algorithm is design and implemented with the consideration of saving the energy resource and balancing the load in networks to the largest extent. And the algorithm presented will perfect data routing mechanism research in wireless sensor networks. The main work is as follow:First, the dissertation summarizes the routing mechanisms in wireless sensor networks, and the routing protocols are classified according to different standards.After comparing and analyzing the performances and characteristics of these routing protocols, the advantages of clustering based routing protocol are pointed out.Second, the clustering based routing mechanisms in exist are deeply researched, especially the classical routing protocols named LEACH and PEGASIS. The dissertation describes their network and communication models, the process of the algorithms, and then their disadvantages are pointed out and the improve schemes are presented.Third, based on the analysis of the disadvantages of LEACH with large energy spending by cluster reconstruction, random choice of cluster head, single-hop communication with base station and the problems of PEGASIS with large energy spending by chain construction through greedy algorithm in networks and a large amount of delay during data deliverying, a novel clustering based energy efficient routing algorithm for wireless sensor networks (NCEER) is proposed.NCEER choses the node with more neighbour and residual energy as cluster heads, and formes a short chain through greedy algorithm within every cluster. Then, a hierarchical routing tree is established according to the hop to the base station and energy-level of the cluster heads. Clusters are reconstructed after a certain rounds in order to alleviate the energy spending of cluser reconstruction, and the self-healing mechanism of the cluster is also introduced.Finally, the dissertation summarizes the characteristics of all kinds of simulation platform for wireless sensor networks, and the energy module is extended on the existing wireless sensor networks framework of simulation platform of J-Sim.Then the new algorithm NCEER and LEACH, PEGASIS are implemented on the extended platform from network lifecycle, the total energy cumption, the data the base station received, load banlancing and delay five aspects. After that, the simulation results are compared and anylized, theory anlysis and simulation experiments prove the efficiency of the new algorithm.