Research On Clustering Route Based On Feedback And Coverage In Wireless Sensor Network

Wireless Sensor Network(WSN)considered as a tool of collecting data deployed in a particular region to monitor,collect and transmit various types of useful parameters.Wireless sensor network consists of a large number of sensor nodes to work together and accomplish a unified task.One or more receivers(base stations)are committed to collect data from all sensor nodes and forward it to the end user.It combines the technologies of sensors,computer networks and communications to perceive environmental parameters,such as temperature,humidity,and gravity.Wireless sensor network provide various services and also face some challenges.Many controllable and uncontrollable factors make wireless sensor network seriously affected during the implementation of work,and energy consumption is one of them.Therefore,this thesis do some research on LEACH protocol considering of cluster formation and cluster head selection,and propose a A feedback based K-means clustering protocol to achieve the prolongation of network lifetime.In this protocol,the feedback score function is applied to dynamically select the cluster heads of each round,and the concept of the main cluster head is introduced to slow down the workload of cluster heads.In addition,the randomness of node distribution results in randomness of coverage performance.Therefore,coverage control measures are adopted to minimize nodes utilization and maximize coverage,so as to achieve the purpose of energy saving.Firstly,routing protocols in wireless sensor network are analyzed in this paper,The architecture and energy saving strategy of WSN are studied.The characteristics,key technologies and challenges of WSN and its routing protocols are discussed.The existing typical routing protocols are classified and the performance of each routing protocol has been compared.Secondly,the typical LEACH protocol has been analyzed.Aiming at the undesirable clustering status of LEACH protocol,a clustering algorithm based on K-means is proposed.The number of clusters is divided by K-means algorithm.The cluster heads are selected by the scoring function,and a number of nodes are selected as the main cluster heads,which are used to fuse and transmit the data volume of cluster heads.In order to show the energy saving performance of this algorithm,this paper not only compare with the traditional LEACH protocol but also the traditional routing protocol based on K-means.The simulation proves that the improved K-means algorithm based on feedback extends network lifetime,and network stability.Lastly,in ensuring quality of service(QoS)and maximizing the network coverage,this thesis schedule nodes sleep/wake-up in order to reduce the network redundancy,adjust the coverage density and ensure the effectiveness of monitoring,data collection which is an aspect of such network.Based on this,the WSN coverage optimization strategy based on artificial fish swarm algorithm is proposed.Because the artificial fish swarm algorithm has the advantages of good global convergence and high real time,it can solve the problem in network coverage well.The results show that the utilization rate of network coverage nodes based on fish swarm algorithm is reduced,the network coverage rate is not changed,and the energy consumption is reduced.