Research On Energy-efficient Data Collection Mechanism Of Wireless Sensor Networks

The successful application of wireless sensor technology in all walks of life has made wireless sensor networks an irreplaceable technology in the information age,and it has been widely used in many fields such as biomedicine,environmental monitoring,and military investigation.Many tiny sensor nodes form a data sharing network through self-organization,that is,wireless sensor network.In order to ensure that all areas of the network can be monitored,nodes are generally evenly distributed.Each sensor node has storage,communication and computing capabilities,but its energy is limited.Therefore,research on more energy-efficient and more efficient network protocols has become the top priority in sensor technology.This thesis first proposes an improved algorithm for the non-uniform clustering protocol EEUC,optimizes its competitive radius calculation formula,and proposes a multi-hop transmission method based on the shortest offset;then introduces the mobile sink,and designs and plans mobile the movement trajectory of the sink on the basis of clustering.Mainly reflected in the following two aspects.(1)The method proposed in this thesis first derives the optimal number of cluster heads for nonuniform clustering based on the sensor energy consumption model,and then optimizes the EEUC competition radius formula.When selecting candidate cluster heads,random values and energy are used as weights.At the same time,a multi-hop method based on the shortest path is proposed for information transmission between clusters;the overall guarantee of the long-term operation of the network.The experimental results show that the improved clustering routing protocol based on EEUC proposed in this thesis balances the energy consumption of nodes.(2)In this thesis,the DBSCAN based mobile sink data collection path planning method is proposed.Firstly,the sensor network is divided into several large clusters by DBSCAN clustering algorithm,and then divided into several small clusters in the large cluster;several small cluster heads in the large cluster form cluster head node sequence according to the distance order,and the mobile sink nodes in a large cluster to collect data according to the cluster head node sequence.Among the large clusters,the next large cluster is selected as the moving target of the mobile sink by calculating the priority of each large cluster.The priority formula comprehensively considers the value of the data and the distance factor.The experimental results show that the length of the mobile sink data collection trajectory formed by the algorithm is reduced,which reduces the time delay of data collection,and at the same time considers the value of the data.