An Efficient and Robust Reliable Data Aggregation in Wireless Sensor Networks

Abstract

Data aggregation is an important, yet time-consuming feature that has been developed to preserve energy in wireless sensor networks (WSNs). To reduce time delay, this work focuses on the aggregation scheduling problem and proposes an effective distributed method that creates a collision-free schedule with the least number of time allotments. Rather than others, the FAST efficient technique fundamentally contributes to both tree building (where previous investigations used related 2-hop dominant Sets) and aggregation scheduling (which was previously addressed through the Competitor Sets computation). The proposed method prove that the latency of FAST under the protocol interference model is upper-limited by <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$12R+\Delta-2$</tex> , where <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$R$</tex> is the network radius and <tex xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">$\Delta$</tex> is the maximum node degree in the communication graph of the original network. Both the hypothetical examination and experimental results show that, FAST beats the cutting edge conglomeration aggregation scheduling algorithms.