Research On Cluster Routing Oriented To Reliable Transmission Forevent Monitoring In Wireless Sensor Networks

The wireless sensor network has been widely used in many fields because of its low cost and self-organization.The cluster structure network has high research value because of its easy management.However,due to the bad monitoring environment and network congestion,the reliability of data transmission is often not unreliable in the network.We take the event driven wireless sensor network as the research object,analyzes the problem of reliable uploading of monitoring data and congestion of network nodes,and proposes corresponding solutions.(1)Aiming at the problem of reliable uploading of data,firstly,differentiated service is used to distinguish common data from emergency data.For common data,the cluster head will select the best single link to upload.For emergency data,the number of transmission links between clusters is increased with the increase of grade.In addition,when the data threshold is divided,k-means algorithm is used to adjust the threshold under different circumstances.An emergency detection method based on Riemann decision rule is proposed to realize the accurate perception of monitoring events.(2)Aiming at the problem of network congestion,we first establish the GM(1,1)grey model at the cluster head to analyze the current traffic of each cluster head.and predict the future congestion degree of cluster heads.Through the NSS acquisition scheme,the data transmission pressure of cluster heads is reduced by adjusting the data acquisition frequency of cluster nodes,so as to achieve the purpose of controlling network congestion.Simulation experiments show that,for reliable data upload,the transmission reliability of the new algorithm is significantly higher than the traditional LEACH protocol when the communication quality is very low,and it does not increase too much overhead.In network congestion control performance,the GM(1,1)prediction model has better traffic prediction accuracy.The new algorithm can deal with the upcoming network congestion ahead of time,and can effectively alleviate the link pressure when the network is busy.Compared with CODA algorithm,it has better stability and energy consumption characteristics.