LBDEA: A Load Balanced and Delay Efficient Algorithm for Tree-based Data Aggregation in WSNs

摘要

Data aggregation is an essential operation in many applications of Wireless Sensor Networks (WSNs). For energy constrained and delay sensitive WSNs, how to prolong the lifetime and reduce the latency of the network are two critical problems. We deal with these two problems together in data aggregation by proposing a Load Balanced and Delay Efficient Algorithm (LBDEA), which consists of two phases. First, construct a load-balanced data aggregation tree based on Semi-Matching algorithm in the graph theory. Second, seek a collision-free scheduling based on greedy strategy for the transmission links in the aggregation tree. Through balancing the load of the sensor nodes, the lifetime of the network is optimized. By avoiding collisions and retransmissions of data delivery, the total latency is decreased. Simulations show that LBDEA not only improves the lifetime but also cuts down the delay for data aggregation in WSNs, compared with other related algorithms.