Approximate multiple count in Wireless Sensor Networks

COUNT is a typical aggregation operation in Wireless Sensor Networks (WSNs). In such an operation, the total number of the items which are of the same kind is obtained and only one numerical value is returned as the result. This paper identifies the multiple count problem which counts items belonging to multiple categories. For each category, the total number of the items belonging to this category is calculated. Therefore, the returned result is a set of values instead of a single value. The multiple count problem is more challenging than the traditional count problem as the former incurs more communication overhead. This paper proposes a distributed approximate multiple count algorithm which can derive an error bounded result under a specified communication cost constraint for each node. The error of the derived result is hN/L, where h is the depth of the routing tree, N is the total number of all the items belonging to all the categories, and L is a representation of the communication cost constraint for each node. Furthermore, the weighted multiple count problem is investigated where different kinds of items to be counted have different weights. The proposed algorithms are evaluated through TOSSIM, a widely used simulation tool for WSNs. The theoretical analysis and simulation results both demonstrate the correctness and effectiveness of the proposed algorithms.

[1]  Guohui Lin,et al.  Improved Approximation Algorithms for the Capacitated Multicast Routing Problem , 2005, COCOON.

[2]  Yong Yao,et al.  The cougar approach to in-network query processing in sensor networks , 2002, SGMD.

[3]  Francesca Cuomo,et al.  A MAC protocol for Delay-Bounded applications in Wireless Sensor Networks , 2004 .

[4]  Jianzhong Li,et al.  Sampling Based (epsilon, delta)-Approximate Aggregation Algorithm in Sensor Networks , 2009, 2009 29th IEEE International Conference on Distributed Computing Systems.

[5]  Divyakant Agrawal,et al.  Medians and beyond: new aggregation techniques for sensor networks , 2004, SenSys '04.

[6]  Johannes Gehrke,et al.  Query Processing in Sensor Networks , 2003, CIDR.

[7]  Kyung Joon Kwak,et al.  Stochastic Counting in Sensor Networks, or: Noise Is Good , 2008, DCOSS.

[8]  Gurmeet Singh Manku,et al.  Approximate counts and quantiles over sliding windows , 2004, PODS.

[9]  Jianzhong Li,et al.  Approximate Physical World Reconstruction Algorithms in Sensor Networks , 2014, IEEE Transactions on Parallel and Distributed Systems.

[10]  Jianzhong Li,et al.  O(ε)-Approximation to physical world by sensor networks , 2013, 2013 Proceedings IEEE INFOCOM.

[11]  Zhi-Zhong Chen,et al.  A 3.4713-approximation algorithm for the capacitated multicast tree routing problem , 2009, Theor. Comput. Sci..

[12]  Xiuzhen Cheng,et al.  A statistical approach for target counting in sensor-based surveillance systems , 2012, 2012 Proceedings IEEE INFOCOM.

[13]  Anantha P. Chandrakasan,et al.  An application-specific protocol architecture for wireless microsensor networks , 2002, IEEE Trans. Wirel. Commun..

[14]  Rajeev Motwani,et al.  Approximate Frequency Counts over Data Streams , 2012, VLDB.

[15]  Zhi-Zhong Chen,et al.  An Improved Approximation Algorithm for the Capacitated Multicast Tree Routing Problem , 2008, COCOA.

[16]  Nicolas Vidot,et al.  Acoustic counting algorithms for wireless sensor networks , 2009, PE-WASUN '09.

[17]  Jörg Widmer,et al.  In-network aggregation techniques for wireless sensor networks: a survey , 2007, IEEE Wireless Communications.

[18]  Srinivasan Seshan,et al.  Synopsis diffusion for robust aggregation in sensor networks , 2004, SenSys '04.

[19]  Wei Cheng,et al.  A Monte Carlo Method for Mobile Target Counting , 2011, 2011 31st International Conference on Distributed Computing Systems.

[20]  David A. Wagner,et al.  Resilient aggregation in sensor networks , 2004, SASN '04.

[21]  Sing Yiu Cheung,et al.  Traffic Surveillance by Wireless Sensor Networks: Final Report , 2007 .

[22]  Krishna M. Sivalingam,et al.  Data Gathering Algorithms in Sensor Networks Using Energy Metrics , 2002, IEEE Trans. Parallel Distributed Syst..

[23]  Wei Hong,et al.  Proceedings of the 5th Symposium on Operating Systems Design and Implementation Tag: a Tiny Aggregation Service for Ad-hoc Sensor Networks , 2022 .

[24]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

[25]  Yunhao Liu,et al.  MOCUS: moving object counting using ultrasonic sensor networks , 2008, Int. J. Sens. Networks.

[26]  Xiuzhen Cheng,et al.  Aggregation tree construction in sensor networks , 2003, 2003 IEEE 58th Vehicular Technology Conference. VTC 2003-Fall (IEEE Cat. No.03CH37484).

[27]  Lei Yu,et al.  Bernoulli sampling based (ε, δ)-approximate aggregation in large-scale sensor networks , 2010, INFOCOM 2010.

[28]  Yingshu Li,et al.  Sparse target counting and localization in sensor networks based on compressive sensing , 2011, 2011 Proceedings IEEE INFOCOM.