A Chain-based Fast Data Aggregation Algorithm Based on Suppositional Cells for wireless sensor networks
Hao Wu, Yi-ming Ding, Zhangdui D. Zhong · 2009
It is important to gather sensed information with an energy efficient method in sensor networks. Although data collection may save energy and improve information accuracy, it must get this at the cost of decreasing other performances, such as the delay increment. This paper proposes a Chain-based Fast Data Aggregation Algorithm Based on Suppositional Cells (CFDASC) to solve this problem. In this algorithm, we attributed each node to one suppositional cell according to the node location information. The nodes which are in one suppositional cell act as the cluster head of data collection in turn, then the head gathers and transmits data along the cells chain to the sink node. As a result, it accelerates the data aggregation process. Simulation results also show that CFDASC algorithm performs better than PEGASIS algorithm by 50.03% in average packet transmission delay, and takes the cost of tiny energy increment, only 6.07% than that in PEGASIS.