Font Size: a A A

Data Aggregation Scheduling Algorithms In Wireless Sensor Networks

Posted on:2012-08-17Degree:MasterType:Thesis
Country:ChinaCandidate:X L XuFull Text:PDF
GTID:2178330335490668Subject:Computer Science and Technology
Abstract/Summary:PDF Full Text Request
Wireless sensor networks (WSNs) consist of a large number of sensor nodes distributed in the interesting area to form a class of self-organizing network, which have been widely used in a variety of special monitoring tasks. All the applications are essentially related to collect sensed data and transmit them to the sink node for further analysis and decisions. Data can be aggregated at the intermediate node, which means computing and transmitting partially aggregated data rather than transmitting raw data, thus decreasing the amount of data transmission and reducing energy consumption. Therefore, we focus on effective aggregation scheduling in the process of data transmission.Since existing scheduling algorithms have the problem of excessive energy consumption for nodes, this thesis proposes an energy efficient algorithm called contiguous data aggregation scheduling (CDAS), which generates a collision-free schedule by computing the competitor sets of nodes. As nodes need to consume energy for state transitions, CDAS assigns brother nodes with consecutive time slots to reduce the frequency of state transitions. The simulation results show that CDAS outperforms the existing scheduling algorithms in terms of energy consumption with no increment on latency when the network scale is large.Since existing scheduling algorithms have the problem of high latency for data collection, this thesis proposes an efficient algorithm called latency-constraints data aggregation scheduling (LDAS). Based on the local information of aggregation tree, LDAS determines when a node should stop receiving data from its children and send the aggregation result to its parent within a latency deadline imposed by the sink node. The simulation results show that LDAS could improve the data aggregation revenue with no increment on state transitions when the sink node set appropriate constraints on time slots.Energy is mainly consumed for data transmission in WSNs, so we should reduce the amount of data transmission in the routing process in order to save energy. The proposed scheduling algorithms in this thesis can effectively improve the aggregation quality, increase energy efficiency and reduce latency. It is valuable to the related works for data aggregation in WSNs.
Keywords/Search Tags:wireless sensor networks, data aggregation, scheduling, state transitions, aggregation revenue
PDF Full Text Request
Related items