Efficient data aggregation in wireless sensor networks: An entropy-driven analysis
Laura Galluccio, Sergio Palazzo, Andrew Thomas Campbell · 2008
Sensor networks are characterized by limited energy, processing power, and bandwidth capabilities. These limitations become particularly critical in the case of event-based sensor networks where multiple collocated nodes are likely to notify the sink about the same event, at almost the same time. The propagation of redundant highly correlated data is costly in terms of system performance, and results in energy depletion, network overloading, and congestion. Data aggregation is regarded as an effective technique to reduce energy consumption and prevent congestion. In this paper, we derive a number of significant insights concerning the data aggregation process, which have not been discussed in the literature so far. We first estimate the conditions under which aggregation is a costly process as compared to a no-aggregation approach, by considering a realistic scenario where processing costs related to aggregation of data are not neglected. We also consider that aggregation should preserve the integrity of data, and therefore, the entropy of the correlated data sent by sources can be considered in order to both decrease the amount of redundant data forwarded to the sink and perform an overall lossless process. Our framework can be used to investigate the tradeoff between the increase in data aggregation required to reduce energy consumption, and the need to maximize information integrity.