Energy Efficient Data Aggregation Scheduling in Wireless Sensor Networks

Data aggregation is a critical functionality in wire- less sensor networks. This paper focuses on enhancing energy and delay efficiency for the data aggregation scheduling problem. In the existing data aggregation scheduling algorithms, a sensor node has to start its radio numerous times to receive all data from its children nodes in a period, and this will waste lots of extra energy and time due to the transceiver turning on and off. According to interference of multiple data transmission and competitor sets of the sensor nodes, we propose an energy and delay efficient algorithm to generate a collision-free schedule called contiguous data aggregation scheduling. Since the sensor nodes consume energy and time for state transitions(transceiver turns on and off), this algorithm assigns to sensor nodes of the same parent node consecutive time slots to reduce the frequency of state transitions. Theoretical analysis and simulation results are used to demonstrate the efficiency of our proposed algorithm. Specifically, compared to the existing data aggregation scheduling algorithms, our proposed algorithm achieves a good tradeoff between energy consumption and delay performance.