Design and analysis of distributed power scheduling for data aggregation in wireless sensor networks
International Journal of Sensor Networks
| Hi-index | 0.01 |
One major challenge in sensor networks is to maximize network life under the constraint of extremely limited power supply. Thus, an important design issue of routing and data-gathering protocols is minimizing energy. This paper investigates the energy efficiency of two data gathering protocols, based on distributed versions of Shortest Path Tree (SPT) and Maximum Leaf Tree (MLT) algorithms [1]. The two have been extended to be dynamic by applying localized tree-reconstruction mechanism [2] to handle joining and leaving (death) of sensor nodes. Accurate energy consumption has been carefully modeled for both leaf-nodes and intermediate nodes, when sending and receiving data. Performance is evaluated through detailed simulation, including exchange of control messages among sensor nodes. Simulation results have shown that SPT, due to its simplicity and smaller number of control messages, achieves better energy efficiency and less delay in tree constructions, data transmissions, and dynamic tree reconstructions.