A load-balanced data aggregation scheduling for duty-cycled wireless sensor networks

摘要

To bridge the gap between limited energy supplies of the sensor nodes and the system lifetime, duty-cycle Wireless Sensor Networks (WSNs) with data aggregation are studied in this paper. We proposed a load-balanced and latency-efficient data aggregation scheduling for duty-cycled WSNs. A shortest path tree (SPT) is used as the routing structure for data aggregation scheduling. In SPT, parent-children assignments are well-designed to assign nodes from level h+1 to the parents at level h such that every parent has a balanced load, while reducing the sleep latency which is a period of time for a sender to wait for its parent to be active. Finally, through the simulation and comparisons, we prove the effectiveness of our approach.