Efficient time latency of data aggregation based on neighboring dominators in WSNs

Data Aggregation is a fundamental activity in wireless sensor networks. Recent studies in this area focus on giving collision-free scheduling and finding the upper bound of delay time in aggregation. In this paper, we propose a new scheduling strategy, based on Neighboring Dominators, to minimize the time latency in data aggregation. With the new scheduling strategy, we mathematically prove that the upper bound of delay time in Data Aggregation is at most 12R+A-11. Here R is the network radius and A is the maximum node degree in communication graph of network. Theoretical analysis proves that our strategy is significantly better than the previously well known results with the upper bounds at 16R+A-14 or 24D+6A +16 time slots, where D is network diameter (D could be as large as 2R).