Font Size: a A A

Research Of Data Aggregation In Three-Dimensional Wireless Sensor Networks

Posted on:2014-06-22Degree:MasterType:Thesis
Country:ChinaCandidate:F F LiFull Text:PDF
GTID:2308330461473939Subject:Computer system architecture
Abstract/Summary:PDF Full Text Request
The Wireless Sensor Network is a new wireless network technology with low cost, easily deployment, low-energy, small size, and many others advantages. It is considered as one of the key technologies, which has significant impact on the future and will lead to the network reform. With its deployment expand from the traditional plane deployment to underwater, space and other three dimensional environment, and as well as deeper research and the expansion of the practical application demand, it is still a challenge issue to develop efficient solutions with the three-dimensional wireless sensor networks.The sensor nodes are generally deployed in dense manner and the sensed data of adjacent nodes existed correlation. If the data is directly transmitted to the sink node, the closer to the sink node, the more redundancy of data, which will cause traffic jams and consume a lot of energy. Data aggregation technology was aggregated the raw data originated from multiple sources, and then further processed and forwarded. Using the method can efficiently minimize transmission packets in the network, reduce the energy consumption and prolong the network lifetime accordingly. Nodes cannot forward data to their parents until they have gathered all data from their descendants. It has difficulty in some real-time applications, especially for end-to-end delay constraints. The existing works on data aggregation have made great achievements, but they are poor in reducing the end-to-end delay. This paper has taken delay as metric and designed algorithms with different perspectives to solve the problem of delay constraints in data aggregation.(1) The paper has designed a layer-based data aggregation algorithm. This paper presented a Minimum-latency Data Aggregation algorithm. The basic idea of the algorithm is that we first build an aggregation tree by selects the connected dominating set. And then we proposed a scheduling algorithm on the basis of the aggregation tree to determine the transmission time for all nodes in the network with collision avoiding. The current existing problems of high latency can be solved effectively through this algorithm. Due to the rapid development of three-dimensional wireless sensor network application, we have extended our efficient scheme to three-dimensional space. Extensive simulation results have demonstrated that the proposed algorithm has better practical performance compared with related works.(2) The paper has designed a heuristic algorithm for data aggregation problem. In the aggregation scheduling phase, most of the previous algorithms scheduling leaf nodes firstly, and then scheduling non-leaf nodes, which might result in high latency. We proposed a heuristic algorithm to construct a more optimal scheduling scheme which can schedule leaf and non-leaf nodes simultaneously, to solve the unreasonable schedule of previous work. Likewise, we have extended this efficient scheme to three-dimensional space. Extensive simulation results have demonstrated that the performance is generally better compared with related works.
Keywords/Search Tags:Wireless sensor networks, Data aggregation, Minimum-latency scheduling, Three-dimensional networks, Heuristic algorithm
PDF Full Text Request
Related items