| Summary: | 碩士 === 逢甲大學 === 資訊工程所 === 97 === Data gathering is an important issue in wireless sensor networks. Most existing proposed schemes focus on periodic data gathering or query-driven data gathering. However, both of them are not suitable for dynamic event data gathering. Although there are several schemes which are designed for event-driven data gathering, but most of them are inefficient for dynamic events. Therefore, we propose an energy efficient event-driven data gathering protocol in wireless sensor networks which focuses on dynamic events. Based on the grid structure, our pro tocol constructs and maintains a data gathering tree to adapt to dynamic events. The energy is preserved by avoiding redundant forwarding nodes to join the data gathering tree. In the dynamic event environment, tree update mechanisms are also presented to ensure the efficiency of the proposed scheme. Finally, we compare our scheme with EADA, Dual-Tree Based, and Range Query. Simulation results show that our scheme has better performances in terms of network lifetime, total energy consumption and overhead.
|
|---|
