Research On Real Time Data Transmission Algorithms For Wireless Sensor Networks

Wireless Sensor Network(WSN) is a kind of self-organizied network,which is composed of a group of sensor nodes. This group of sensor nodes has the advantages of lo-w cost and high yield and so on. The nodes can collect data, simple calculate and transmit data, which has a lot of space for development in the military, environment and other fields. At present, civil development of sensors,such as smart home and Smart Band has greatly improved the quality people’s life. In the background of the development and wide application of wireless sensor network technology, a lot of topics,which is related to wireless sensor network, have been highly valued.Real time data transmission algorithm for wireless sensor networks is an important research aspect in wireless sensor networks. Data aggregation is the scheduling of the data information collected by the distributed sensor network nodes through a certain transmission path, which makes the data information in the shortest possible time delay to reach the transmission center Sink node. The problem has been proved to be NP-Hard problem, so that the resulting solution can only be close to the optimal solution, but it can not be the optimal solution. The research of real-time sensor networks both in routing layer and transmission scheduling layer. The former is based on the research of the hardware routing protocol, and the latter is based on the distributed method of the dependency clustering, and the method of generating the main tree based on the tree structure.This thesis is based on the discussion of the centralized algorithm of spanning tree and research, the purpose is to make the data gathered can get a smaller delay time. First of all, this thesis analyzed advantages and disadvantages of the implementation method of the existing algorithm, discussed the research status based clustering algorithm which is based on the tree structure, gives the implementation with representative algorithms, validation and demonstration.The First-Fit algorithm is used in many papers,but the algorithm was not as correct as the author’s thought,we analyzes the error. Then we give a new algorithm,which is not based on the shorted path and the maximal independent set,but based on the degree centrality theory,for created a unbalance spanning tree,baed on th spanning tree we can get the largest parallel sets directly,so as to reduce the data gathering delay time of the process. At the end of this thesis, the energy is considered based on the STDCA algorithm spanning three, and the concurrent set selection is optimized, and the performance analysis is given.