Font Size: a A A

Research On Wireless Network Data Acquisition And Data Aggregation Algorithms

Posted on:2018-12-26Degree:MasterType:Thesis
Country:ChinaCandidate:X M SunFull Text:PDF
GTID:2358330515457127Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
In recent years,wireless sensor networks(WSNs)with low-cost,self-organization,dynamic topology,multi-hop routing and other features,have been a leading solution in many important applications such as,intrusion detection,target tracking,industrial automation and so on.Sensor nodes in WSNs can sense the data in the surrounding environment.When the sensor nodes transmit the data to the terminal,the technology of data collection appears.However,the same area may be detected by several sensors,then the sensor nodes may collect duplicate data,in addition,for the same region of data,if it is collected many times,it will consume a lot of energy of the sensor nodes and sometimes we just need particular data,thus,the data aggregation technology appears.Data collection and data aggregation are very basic but very important applications in wireless sensor networks.In this thesis,we study the delay of data collection and data aggregation in WSNs,that is,to ensure that the data sent by the sensor nodes receive as much time as possible when they are received by the receiving node,so as to ensure the timeliness of data transmission.Two kinds of interference models are commonly used in WSNs,i.e.,protocol interference model and physical interference model.Both models are studied in this thesis.Under these two models,different algorithms of data aggregation are presented and we obtain the aggregation task can be finished in limited number of rounds.Due to the existence of many probabilistic loss links in WSNs,it is more practical to obtain a data aggregation tree under the realistic probabilistic network model.Therefore,for the problem of data collection and data aggregation in the protocol interference model,we have studied the problem of low-latency data aggregation.We propose an algorithm for data aggregation tree construction.Compared with the previous work,this algorithm can guarantee a higher efficiency of transmission success.In addition,in this thesis,we propose a low-delay data aggregation scheduling algorithm for data aggregation based on the data aggregation scheduling performed on the generated data aggregation tree.For the problem of data aggregation under SINR,we use gird partition and sleep mode to avoid interference and reduce energy consumption respectively.Firstly,we create a data aggregation tree in WSNs based on the SINR model.Secondly,we use the idea of gird partition and then put forward the aggregation link scheduling algorithm based on the grid.Finally,we combine the data aggregation tree and the link scheduling algorithm,and add the node sleep mechanism,and then complete the aggregation algorithm DA.In addition,we also propose an improved distributed data aggregation algorithm IDDA,the main idea is similar with DA,thedifference of the IDDA is the gird partition standard.Besides,IDDA can perform by distributed way.In the end,we prove the efficiency of DA and analyze that the algorithm IDDA performs better than the existing algorithm DAS by simulation.
Keywords/Search Tags:Wireless sensor networks, Data collection, Data aggregation, Protocol Interference model, SINR Model, Latency, Gird partition
PDF Full Text Request
Related items