Title :
Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks
Author :
Xiang-Yang Li ; Yajun Wang ; Yu Wang
Author_Institution :
Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
fDate :
3/1/2011 12:00:00 AM
Abstract :
Processing the gathered information efficiently is a key functionality for wireless sensor networks. In this paper, we study the time complexity, message complexity (number of messages used by all nodes), and energy cost complexity (total energy used by all nodes for transmitting messages) of some tasks, such as data collection (collecting raw data of all nodes to a sink), data aggregation (computing the aggregated value of data of all nodes), and queries for a multihop wireless sensor network of n nodes. We first present a lower bound on the complexity for the optimal methods, and then, for most of the tasks studied in this paper, we provide an (asymptotically matching) upper bound on the complexity by presenting efficient distributed algorithms to solve these problems.
Keywords :
data analysis; distributed algorithms; query processing; wireless sensor networks; data aggregation; data collection; data selection; distributed algorithms; energy cost complexity; message complexity; optimal methods; queries; time complexity; wireless sensor networks; Algorithm design and analysis; Approximation algorithms; Approximation methods; Complexity theory; Schedules; Sensors; Wireless sensor networks; Wireless sensor networks; complexity analysis.; data collection; data selection;
Journal_Title :
Computers, IEEE Transactions on