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+ Δ-11. Here R is the network radius and Δ is the maximum node degree in …

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 …