Compressive Sensing Based Distributed Data Collection Scheme In Wireless Sensor Networks

With the rapid development of wireless sensor network technology,it has been widely used in industry and agriculture automation,military reconnaissance,biological and medical treatment,intelligent tutoring,ocean exploration and other fields for its large scale,self-organization,dynamic deployment features.Because of the sensor network need to transfer large amounts of data in the perception of communication,the nodes will consume a lot of energy.Thus,the service life of wireless sensor network will be shortened.Concerning this issue,this thesis did research on routing protocol and data collection protocol in data collection process for clustered wireless sensor network.Firstly,this thesis did research on the routing protocol of wireless sensor network.The Steiner tree imbalance problem which existed in the Steiner tree based routing protocol has been solved.The sensor nodes are sorted as ascending order from center to edge according to the position of the cluster nodes first.Then,the Hierarchical well-Separated Tree is constructed from the sorted nodes.Finally,the Steiner tree which contains cluster nodes is generated.The average hop of cluster nodes will be reduced.Secondly,this thesis did research on the data collection protocol.Aiming at the problem of large amount of data transmission during data collection,this thesis introduced the compressed sensing algorithm into the process of data collection.For its temporal and spatial correlations of sensing data,a distributed data reconstruction scheme based on approximate Top-|K| in the process of data reconstruction has been proposed.In the process of querying Top-|K| elements,only three times of data interaction is needed.Therefore,the proposed scheme effectively reduces the amount of data transmitted during the distributed reconstruction process.The data collection scheme proposed in this paper contains routing protocol and data collection protocol.And the distributed approximate Top-|K| algorithm is based on the optimized Steiner tree routing scheme.The experimental results show that the data collection scheme can reduce routing hop and the amount of interaction data in the process of data collection and reconstruction.