Academic
Publications
Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks

Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks,10.1109/TC.2010.50,IEEE Transactions on Computers,Xiang-Yang Li

Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks   (Citations: 4)
BibTex | RIS | RefWorks Download
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.
Journal: IEEE Transactions on Computers - TC , vol. 60, no. 3, pp. 386-399, 2011
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: