An Algorithm of Constructing Virtual Data Aggregation Trees for Maximizing Lifetime in Wireless Sensor Networks
| Autor: | Yi-Sheng Luo, 羅義勝 |
|---|---|
| Rok vydání: | 2014 |
| Druh dokumentu: | 學位論文 ; thesis |
| Popis: | 102 Data aggregation is a basic operation in many applications of wireless sensor networks (WSNs). In WSNs, each sensor is responsible to periodically report its generated data to a specific node, called sink. Because the energy power of sensors is limited, the data aggregation process must be carefully designed to save the energy consumption of sensors and prolong the network lifetime. In this thesis, we study the problem of constructing data aggregation trees for different time to maximizing the network lifetime, termed maximum lifetime data aggregation tree scheduling problem. We propose an algorithm that is based on the $k$-hop local information to the sink to construct data aggregation trees for different time. While constructing a data aggregation tree, the tree topology within the k-hop of the sink is reconstructed by the lifetime and collected data of sensors. The simulation results demonstrate that the proposed algorithm provides significantly performance compared to a shortest-path-tree-based solution in terms of the network lifetime. |
| Databáze: | Networked Digital Library of Theses & Dissertations |
| Externí odkaz: |
|