Font Size: a A A

Research Of Data Aggregation In Multi-sink Wireless Sensor Networks

Posted on:2015-10-26Degree:MasterType:Thesis
Country:ChinaCandidate:Y Z ChenFull Text:PDF
GTID:2308330461474948Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Wireless Sensor Network(WSN), which is made by the convergence of digital electronics, micro-electro-mechanical system and wireless communications, is a novel technology about acquiring and processing information. A wireless sensor network consists of many micro sensors with capabilities of perception, computing and communication and is widely used in many applications such as military defense, environmental monitoring, medical health, and so on. As the size of the sensor network grows, more and more attention has been paid to the environment which multi-sink was deployed.Since the sensor nodes are generally deployed densely, the data sensed by neighboring sensors is highly correlated. Data aggregation is proposed to reduce redundant transmission and become a key technique in WSN. In many real-time applications, end-to-end delay is considered as an important criterion for time-efficient schedules of data aggregation. Most of related works usually adopt two separate processes to solve aggregation scheduling problem, firstly constructing the tree and then allocating the time-slot, which cannot guarantee the time-slot reuse and might result in high aggregation latency. In addition, most of current works are based on reliable communication environment and it’s more interesting to study the energy efficiency data aggregation under unreliable communication environment for energy limited in WSN. For these considerations, we study the minimum latency data aggregation scheduling problem and the maximum network lifetime data aggregation problem under the unreliable communication environment in multi-sink WSN.(1) We study the minimum latency data aggregation scheduling problem and propose the layer-based algorithm which could reduce the data aggregation of network effectively. In this paper, the sensor nodes are divided into layers with breadth first search. Then, the parent selection process which takes both the initial time-slot and maximizing time-slot utilization into account is executed layer-by-layer for each node. On the basis of above works, we propose two aggregation scheduling algorithms, one is based on maximal independent set and the other is not to expand the range of parent selection. Besides, we theoretically analyze the performance of the algorithms. Experiment results show that the proposed algorithms can make full use of time-slot and finish the data aggregation scheduling with low latency.(2) We study the maximum network lifetime data aggregation problem in the unreliable communication environment and propose a tree topology based algorithm and a directed acyclic graph based algorithm. Both algorithms could improve the network lifetime effectively. Firstly, we analyze the communication between adjacent nodes and point out the best transmission radius to minimize the excepted energy consumption. Then, we analyze the problem that how to choose the sink node for sensor nodes. On the basis of above works, from the point of balancing the energy consumption, considering the residual energy and communication cost of each node, we propose a tree topology based aggregation algorithm and a directed acyclic graph based aggregation algorithm which could improve the data receiving probability. Experiment results show that the proposed algorithms could obtain better perpormance in network lifetime.
Keywords/Search Tags:multi-sink wireless sensor networks, data aggregation, minimum latency scheduling, unreliable communication environment, maximum network lifetime
PDF Full Text Request
Related items