Delay and energy efficiency tradeoffs for data collections and aggregation in large scale wireless sensor networks

Abstract

In this paper, we study efficient data collection and aggregation problem in wireless sensor networks. We first propose efficient distributed algorithms for data collection problem with approximately the minimum delay, or the minimum number of messages to be sent by all wireless nodes, or the minimum total energy consumption by all wireless nodes respectively. For example, given an algorithm A for data collection, let ϱT, ϱM, and ϱE be the approximation ratio of A in terms of time complexity, message complexity, and energy complexity respectively. We then show that, for data collection, there are networks of n nodes and maximum degree Δ, such that ϱMϱE = Ω(Δ) for any algorithm. In addition, we analytically proved that all our proposed methods are either optimum or within constants factor of the optimum. We further present the message, energy, time complexity and studied the complexity tradeoffs for data aggregation problem.