Issue No. 10 - Oct. (2012 vol. 23)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2011.312
Cheng Wang , Tongji University, Shanghai and Ministry of Education, China
Changjun Jiang , Tongji University, Shanghai and Ministry of Education, China
Shaojie Tang , Illinois Institute of Technology, Chicago
Xiang-Yang Li , Tsinghua University and Illinois Institute of Technology, Chicago
In this work, for a wireless sensor network (WSN) of n randomly placed sensors with node density \lambda \in [1,n], we study the tradeoffs between the aggregation throughput and gathering efficiency. The gathering efficiency refers to the ratio of the number of the sensors whose data have been gathered to the total number of sensors. Specifically, we design two efficient aggregation schemes, called single-hop-length (SHL) scheme and multiple-hop-length (MHL) scheme. By novelly integrating these two schemes, we theoretically prove that our protocol achieves the optimal tradeoffs, and derive the optimal aggregation throughput depending on a given threshold value (lower bound) on gathering efficiency. Particularly, we show that under the MHL scheme, for a practically important set of symmetric functions called divisible perfectly compressible (DPC) functions, including the mean, max, and various kinds of indicator functions, etc., the data from \Theta (n) sensors can be aggregated to the sink at the throughput of a constant order \Theta (1), implying that, our MHL scheme is indeed scalable.
Throughput, Wireless sensor networks, Temperature measurement, Protocols, Lattices, Temperature sensors, aggregation capacity, Wireless sensor networks, data aggregation, percolation theory
S. Tang, C. Jiang, C. Wang and X. Li, "SelectCast: Scalable Data Aggregation Scheme in Wireless Sensor Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 23, no. , pp. 1958-1969, 2012.