LI Wuyungerile, OKAMURA Daisuke, BANDAI Masaki, WATANABE Takashi
IEICE technical report, Oct 8, 2009, The Institute of Electronics, Information and Communication Engineers
Recently, wireless sensor networks attract researcher's attention due to its applicability to many fields for effective collection of sensing data with less cost. In wireless sensor networks, due to battery-powered nodes, energy saving is important issue. As one of techniques for energy saving, the data aggregation has been proposed. In this paper, we discuss the trade off between communication delay and energy consumption of the technique. At first, we analyze the full aggregation, non-aggregation and partial aggregation with Markovian chain. Analytical results show that non-aggregation method suffers large energy consumption while full aggregation suffers large transmitting delay. And our proposed partial aggregation method called WRP (Waterfalls Random partial aggregation) can trade off the energy and delay. For getting the better balance of energy and delay, we get several groups of random pushing vectors and investigate them on two criteria based on delay energy products. We find that less arrival data should be aggregated for small data generation rate at nodes to minimize both criteria, and vice versa. For moderate generation rate we must choose a sophisticated random pushing vector depending on the criterion.