Several Repacking Algorithms For Data Aggregation in Wireless Sensor Network

In wireless sensor network, data aggregation is a novel scheme to improve the energy efficiency, which includes loss and lossless aggregation. Although loss aggregation could save energy more efficiently, some detail information may be discarded. It would be more serious when the failure of the transmission emerges close to the sink node. Herein lossless aggregate might be a good candidate. In this paper, we present several lossless aggregate algorithms for cluster-model wireless sensor networks. The average performance of the first repacking algorithm is evaluated by theoretical analysis, which is then verified by simulation. Although the optimal repacking algorithm implemented by dynamic programming could achieve the best performance, it may not be feasible in wireless sensor networks owning to the high computation complexity. Computation results show that other repacking algorithms work much better than the first-come-first-serve packing algorithm subjected to the constraint of computation complexity