Data Fusion Algorithm Based on Event-Driven and Minimum Delay Aggregation Path in Wireless Sensor Network

摘要

Emergent event detection is one of the most important applications in event-driven wireless sensor network. In order to save energy, a dynamic clustering routing algorithm based on event severity degree is presented rather than period monitoring in the paper. The lifetime and the scale of clusters lie on the emergent event severity degree. On the other hand, the data must be collected, fused and transmitted in real time for the emergencies. Most existing data aggregation methods in wireless sensor networks just have longer network delay. The minimal delay aggregation path mechanism is put forward to reduce the network delay. The hop-count from itself to its cluster head and the degree determine the waiting time for a fusing node. With every waiting time for the fusing nodes in the path, the minimal delay aggregation path can be obtained. The simulation results show that our algorithm can save energy efficiently, and reduce the network delay remarkably. It achieved a better tradeoff between the energy and delay. Moreover, it provides a good method for wireless sensor network applied to monitoring emergencies.