Nearly constant approximation for data aggregation scheduling in wireless sensor networks

Abstract

Data aggregation is a fundamental yet time-consuming task in wireless sensor networks. We focus on the latency part of data aggregation. Previously, the data aggregation algorithm of least latency [1] has a latency bound of (Δ - 1)R, where Δ is the maximum degree and R is the network radius. Since both Δ and R could be of the same order of the network size, this algorithm can still have a rather high latency. In this paper, we designed an algorithm based on maximal independent sets which has an latency bound of 23R + A -18. Here Δ contributes to an additive factor instead of a multiplicative one; thus our algorithm is nearly constant approximation and it has a significantly less latency bound than earlier algorithms especially when Δ is large. © 2007 IEEE.