The Research Of Clustering Routing Based On The Graph Theory And Gradient For Wireless Sensor Network

Wireless sensor network is a comprehensive cutting-edge technology, wireless sensor networks have many advantages that many other network systems do not have, which are self-organization, survivability, smart and convenient. This paper first given to introduce the basic knowledge of the wireless sensor network, including the concept of wireless sensor networks, features, architecture, and some of the key technologies. Analysis and comparison some of the existing routing protocols, highlighting introduce the clustering routing protocol based on the graph theory, and also analyze its basic performance and advantages.This paper mainly studies the clustering routing protocol based on the gradient, this protocol is the improvement protocol of EAMCT_G routing protocol. First, analyze the deficiencies of the EAMCT_G routing protocols in the choice of cluster head, because this algorithm depend on the surplus energy to choose the cluster head, and cause the head of certain node easily. In order to prolong the life cycle of the network. The new algorithm to choose the new way of the weight, with the new weight value as a choice method of cluster head. Clustering based on maximal independent set and minimum dominating set in graph theory. In this new routing protocol, perception gradient has been joined, making the whole network routing is more directional and higher efficiency. The special case of simulation is done to contrast the new routing protocol with the EAMCT_G protocol, and the results show that the new protocol is better than EAMCT_G protocol.In the paper, NS2experiments are done to compare the algorithm with EAMCT_G on their end-to-end delay and network throughput and life cycle. The simulation results show that the new protocol routing algorithm is performance than the EAMCT G algorithm.