Nearly Constant Approximation for Data Aggregation Scheduling in Wireless Sensor Networks

Abstract— Data aggregation is a fundamental yet timeconsuming 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 + ∆ − 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.

• Type: Conference
• Year: 2007
• Where: INFOCOM
• Authors: Scott C.-H. Huang, Peng-Jun Wan, Chinh T. Vu, Yingshu Li, F. Frances Yao
• Keywords: Algorithms, Communications, Data Aggregation, INFOCOM 2007, Latency Bound