Research On Clustering Routing Prot Ocol In Wireless Sensor Network

Wireless sensor network is composed of a large number of sensor nodes with perceptual,computational and communication capabilities.It can monitor the surrounding natural environment and present the monitoring information to people.It is a network communication technology for information collection,processing and transmission.With the rapidly increasing demand for digital information,the application of wireless sensor network is more and more widely used in every field.But because the node's battery energy is limited,the network survival lifetime is not enough to meet the requirement of network applications,especially for wireless sensor networks deployed in harsh environments.So designing energy-efficient routing protocol to extend the survival lifetime of the network is very necessary.In the network energy-saving routing protocol,clustering routing protocol is a very effective method,which is the research direction of this paper.Firstly,the paper introduces the background,significance and research status of the clustering routing protocol of wireless sensor networks,and then expounds the basic knowledge of the network system,features,related technologies and performance indexes in wireless sensor networks.Afterwards,through the research and analysis of some classical clustering routing protocols in wireless sensor network,the paper summarizes the characteristics,advantages and shortcomings of each classical clustering routing protocol.Then this paper summarizes the main problems and loopholes in the current clustering routing protocols,and gives the corresponding reasonable solutions.In order to solve the main problems and loopholes in the current clustering routing protocols,this paper proposes MPO-EECHP,an energy-saving clustering routing protocol based on multiple clustering factors weighting and multiple parameters optimization.The protocol considers multiple clustering factors,and the weight W is used to construct the weighting function(i.e.score)for electing cluster heads.Based on the neighbor communication radius R and the weighting function,this paper proposes the cluster head election algorithm of MPOEECHP protocol,and optimizes the parameters R and W in each round to obtain the optimal parameters(i.e.and),then,some features of MPO-EECHP protocol are analyzed in this paper,and the problems in the protocol are described at length in this paper.Finally,MPOEECHP protocol is simulated in this paper using Matlab on the number of surviving nodes,the remaining energy of the network,the number of received packets and the energy efficiency,and compared with the clustering routing protocol EECF and EACHP proposed in recent years.Moreover,in the process of comparison,this paper also analyzes the performance of MPOEECHP protocol,combining the solution to the problems and loopholes of protocols.At the same time,the accuracy of the protocol is analyzed and described.The simulation results show that the proposed MPO-EECHP protocol can significantly extend the lifetime of the network,which is more than 1.4 times as much as that of EECF and EACHP.And in terms of the energy efficiency,compared with EACHP,MPO-EECHP improves the energy efficiency by 47.9%,and compared with EECF,it improves the energy efficiency by 58.1%.So MPO-EECHP protocol can effectively reduce network energy consumption and have a good performance.