Data-Aggregation and Dual-Sinks Based Routing Algorithm in Event-Driven Wireless Sensor Networks

In order to optimize the total energy consumption, this paper proposes a routing algorithm based on data-aggregation and dual-sinks. The algorithm can cluster nodes within event areas in a distributed manner and build a data aggregation tree with good aggregation ratio rooted at the primary sink in the help of a routing aggregation center with low control overhead. The aided sink moves to the proximity of nodes with heavier load to intercept aggregated data, balancing and decreasing network load further. Algorithm analysis and experiments show that the algorithm leads to less control overhead associated with routing construction and maintenance, better data aggregation and more balanced load, promoting network performance