Issue No.03 - March (2011 vol.60)
Xiang-Yang Li , Dept. of Comput. Sci., Illinois Inst. of Technol., Chicago, IL, USA
Yajun Wang , Microsoft Res. Asia, Beijing, China
Yu Wang , Dept. of Comput. Sci., Univ. of North Carolina at Charlotte, Charlotte, NC, USA
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2010.50
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.
Complexity theory, Approximation algorithms, Wireless sensor networks, Schedules, Sensors, Algorithm design and analysis, Approximation methods,complexity analysis., Wireless sensor networks, data collection, data selection
Xiang-Yang Li, Yajun Wang, Yu Wang, "Complexity of Data Collection, Aggregation, and Selection for Wireless Sensor Networks", IEEE Transactions on Computers, vol.60, no. 3, pp. 386-399, March 2011, doi:10.1109/TC.2010.50