| Summary: | 碩士 === 國立高雄應用科技大學 === 電子工程系碩士班 === 101 === Data aggregation has received a great deal of attentions in wireless sensor net-
works because the sensing data have to be collected eciently for analysis. The
eectiveness of data aggregation is mainly determined by the routing structure while
tree is an important structure for data aggregation. Many researchers have studied
the problem of how to construct a routing tree for maximizing the network lifetime
in a wireless sensor network while only partial information is required. In many ap-
plications, complete information is often required to be collected. In this thesis, we
study the problem of nding a routing tree for collecting complete information and
maximizing the network lifetime in wireless sensor networks, termed the maximum
network lifetime data aggregation tree problem. We propose an ecient algorithm,
termed the load-balanced data aggregation tree construction algorithm (LBDATCA),
for maximizing the network lifetime in wireless sensor networks. Simulation results
show that our proposed algorithm has good performance than other methods.
|
|---|
