The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - March (2011 vol.60)
pp: 386-399
Xiang-Yang Li , Illinois Institute of Technology, Chicago
Yajun Wang , Microsoft Research Asia, Beijing
Yu Wang , University of North Carolina at Charlotte, Charlotte
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.
INDEX TERMS
Wireless sensor networks, data collection, data selection, complexity analysis.
CITATION
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
REFERENCES
[1] S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, "TAG: A Tiny AGgregation Service for Ad-Hoc Sensor Networks," Proc. Fifth USENIX Symp. Operating Systems Design and Implementation (OSDI), 2002.
[2] S. Kashyap, S. Deb, K.V.M. Naidu, R. Rastogi, and A. Srinivasan, "Efficient Gossip-Based Aggregate Computation," Proc. ACM Symp. Principles of Database Systems (PODS), 2006.
[3] D. Kempe, A. Dobra, and J. Gehrke, "Gossip-Based Computation of Aggregate Information," Proc. IEEE Symp. Foundations of Computer Science (FOCS), 2003.
[4] A. Kesselman and D.R. Kowalski, "Fast Distributed Algorithm for Convergecast in Ad Hoc Geometric Radio Networks," J. Parallel and Distributed Computing, vol. 66, no. 4, pp. 578-585, 2006.
[5] J. Han and M. Kamber, Data Mining: Concepts and Techniques. Morgan Kaufmann, 2006.
[6] T.J. Cormen, C.E. Leiserson, and R.L. Rivest, Introduction to Algorithms. MIT Press and McGraw-Hill, 1990.
[7] K. Alzoubi, X.Y. Li, Y. Wang, P.J. Wan, and O. Frieder, "Geometric Spanners for Wireless Ad Hoc Networks," IEEE Trans. Parallel and Distributed Processing, vol. 14, no. 4, pp. 408-421, Apr. 2003.
[8] K. Alzoubi, P.J. Wan, and O. Frieder, "Message-Optimal Connected Dominating Sets in Mobile Ad Hoc Networks," Proc. ACM MobiHoc, 2002.
[9] M. Faloutsos and M. Molle, "Optimal Distributed Algorithm for Minimum Spanning Trees Revisited," Proc. ACM Symp. Principles of Distributed Computing (PODC), 1995.
[10] C. Ambuhl, "An Optimal Bound for the MST Algorithm to Compute Energy Efficient Broadcast Trees in Wireless Networks," Proc. Int'l Colloquium Automata, Languages and Programming, 2005.
[11] F. Kuhn, T. Locher, and R. Wattenhofer, "Tight Bounds for Distributed Selection," Proc. ACM Symp. Parallelism in Algorithms and Architectures (SPAA), 2007.
[12] F. Chin and H.F. Ting, "An Improved Algorithm for Finding the Median Distributively," Algorithmica, vol. 2, no. 1, pp. 235-249, 1987.
[13] M. Rodeh, "Finding the Median Distributively," J. Computer and System Sciences, vol. 24, no. 2, pp. 162-166, 1982.
[14] P. Gupta and P.R. Kumar, "Critical Power for Asymptotic Connectivity in Wireless Networks," Stochastic Analysis, Control, Optimization and Applications, W.M. McEneaney et al., eds., 1998.
[15] A. Negro, N. Santoro, and J. Urrutia, "Efficient Distributed Selection with Bounded Messages," IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 4, pp. 397-401, Apr. 1997.
[16] J. Bentley and A. Yao, "An Almost Optimal Algorithm for Unbounded Searching," Information Processing Letters, vol. 5, no. 3, pp. 82-87, 1976.
[17] M. Arumugam and S.S. Kulkarni, "Tradeoff between Energy and Latency for Convergecast," Proc. Second Int'l Workshop Networked Sensing Systems, 2005.
[18] S. Gandham, Y. Zhang, and Q. Huang, "Distributed Minimal Time Convergecast Scheduling in Wireless Sensor Networks," Proc. IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2006.
[19] S. Upadhyayula, V. Annamalai, and S. Gupta, "A Low-Latency and Energy-Efficient Algorithm for Convergecast in Wireless Sensor Networks," Proc. IEEE Global Telecomm. Conf. (GLOBECOM), 2003.
[20] Y. Zhang and Q. Huang, "Coordinated Convergecast in Wireless Sensor Networks," Proc. IEEE Military Comm. Conf., 2005.
[21] S. Madden, M.J. Franklin, J.M. Hellerstein, and W. Hong, "The Design of an Acquisitional Query Processor for Sensor Networks," Proc. ACM SIGMOD, 2003.
[22] Y. Yao and J. Gehrke, "Query Processing in Sensor Networks," Proc. Conf. Innovative Data System Research (CIDR), 2003.
[23] J. Considine, F. Li, G. Kollios, and J. Byers, "Approximate Aggregation Techniques for Sensor Databases," Proc. IEEE Int'l Conf. Data Eng. (ICDE), 2004.
[24] S. Nath, P.B. Gibbons, S. Seshan, and Z.R. Anderson, "Synopsis Diffusion for Robust Aggregation in Sensor Networks," Proc. ACM Int'l Conf. Embedded Networked Sensor Systems (Sensys), 2004.
[25] A. Manjhi, S. Nath, and P.B. Gibbons, "Tributaries and Deltas: Efficient and Robust Aggregation in Sensor Network Streams," Proc. ACM SIGMOD, 2005.
[26] X. Xu, X.-Y. Li, X. Mao, S. Tang, and S. Wang, "A Delay Efficient Algorithm for Data Aggregation in Multi-Hop Wireless Sensor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 22, no. 1, pp. 163-175, Jan. 2011.
[27] B. Patt-Shamir, "A Note on Efficient Aggregate Queries in Sensor Networks," Proc. ACM Symp. Principles of Distributed Computing (PODC), 2004.
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool