Research On Clustering Routing Protocol In Wireless Sensor Networks

In wireless sensor networks, the routing protocol research has never been interrupted. Reducingenergy consumption and prolonging the network lifetime has been a key element of the routing protocolresearch on condition that the amount of information remained unchanged.By analyzed and summarized the advantages and disadvantages of the existing routing protocols, thispaper researches the deficiency of cluster head energy consumption, some nodes to premature death andcluster head distribution is not uniform and introduces two routing protocols based on static and dynamicwireless sensor network. The main efforts are as follows:Firstly, in the static wireless sensor network, LEACH uses a pure probabilistic model to select clusterhead and causes the nodes premature death. In order to solve this problem, we introduce a new cluster-headelection algorithm that the cluster head election process is divided into primary cluster heads stage andformal cluster head election stage. In the primary cluster head election phase, according to the residualenergy of nodes and other information of nodes, we adjusts the competition radius of node by using fuzzylogic. Within the effective competition radius of the cluster head, there is only one cluster head node so asto ensure the rational distribution of the cluster head node. In the formal cluster head election phase, wedetermine the probability that the node to become a cluster-head by fuzzy logic. We compare the LEACHalgorithm with our design using the MATLAB, the experiment results show that new mechanism performsbetter than LEACH in terms of the distribution density of cluster-head node,first node dies and networklifetime.Secondly, in mobile wireless sensor networks, we propose method to solve the network outages andloss of data problem causing randomly mobility on the basis of M-LEACH. It selects cluster head usingfuzzy logic based on three descriptors-energy, the distance between sensor node and sink node and nodedensity. In the data transmission phase, the cluster heads transmitted information to sink node using headmuti-hop method. We propose a new communication cost function when choosing the next-hop clusterhead. Then we calculate minimum communication cost function and get the reasonable next-hop nodes.We compare our algorithms with some popular algorithms using the MATLAB, the simulation resultsshow that new protocols can effectively control the cluster head distribution density, balance network load,reduce energy consumption, and extend the network lifetime.