Search

In this paper, we address the problem of data aggregation scheduling problem to minimize the latency in wireless sensor networks (WSNs). An efficient distributed synchronous aggregation scheduling method is proposed to structure a collision-free schedule for data aggregation in WSNs. By using a connected dominating set (CDS) as an aggregation tree, we implement the synchronous aggregation scheduling. We prove that the latency of the aggregation schedule generated by our algorithm is at most 4 15 16 R    time-slots where R is the network radius and  is the maximum node degree in the communication graph of the original network. Analysis and simulation results show the validity and superiority of the algorithm.