{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T15:25:06Z","timestamp":1780500306769,"version":"3.54.1"},"reference-count":28,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2008,3,1]],"date-time":"2008-03-01T00:00:00Z","timestamp":1204329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000145","name":"Division of Information and Intelligent Systems","doi-asserted-by":"publisher","award":["0325459IIS-04482640312038"],"award-info":[{"award-number":["0325459IIS-04482640312038"]}],"id":[{"id":"10.13039\/100000145","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["0325459IIS-04482640312038"],"award-info":[{"award-number":["0325459IIS-04482640312038"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Sen. Netw."],"published-print":{"date-parts":[[2008,3]]},"abstract":"<jats:p>\n            The ability to efficiently aggregate information\u2014for example compute the average temperature\u2014in large networks is crucial for the successful employment of sensor networks. This article addresses the problem of designing\n            <jats:italic>truly scalable<\/jats:italic>\n            protocols for computing aggregates in the presence of faults, protocols that can enable million node sensor networks to work efficiently. More precisely, we make four distinct contributions. First, we introduce a simple fault model and analyze the behavior of two existing protocols under the fault model:\n            <jats:italic>tree aggregation<\/jats:italic>\n            and\n            <jats:italic>gossip aggregation<\/jats:italic>\n            . Second, since the behavior of the two protocols depends on the size of the network and probability of failure, we introduce a hybrid approach that can leverage the strengths of the two protocols and minimize the weaknesses; the new protocol is analyzed under the same fault model. Third, we propose methodology for determining the\n            <jats:italic>optimal<\/jats:italic>\n            mix between the two basic protocols; the methodology consists in formulating an optimization problem, using models of the protocol behavior, and solving it. Fourth, we perform extensive experiments to evaluate the performance of the hybrid protocol and show that it usually performs better, sometimes orders of magnitude better, than both the tree and gossip aggregation.\n          <\/jats:p>","DOI":"10.1145\/1340771.1340775","type":"journal-article","created":{"date-parts":[[2008,4,8]],"date-time":"2008-04-08T15:40:00Z","timestamp":1207669200000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":40,"title":["Aggregation methods for large-scale sensor networks"],"prefix":"10.1145","volume":"4","author":[{"given":"Laukik","family":"Chitnis","sequence":"first","affiliation":[{"name":"University of Florida, Gainesville, FL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alin","family":"Dobra","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sanjay","family":"Ranka","sequence":"additional","affiliation":[{"name":"University of Florida, Gainesville, FL"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2008,4,8]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Proceedings of IEEE INFOCOM","author":"Amis A. D.","unstructured":"Amis , A. D. , Prakash , R. , Huynh , D. , and Vuong , T . 2000. Max-min d-cluster formation in wireless ad hoc networks . In Proceedings of IEEE INFOCOM ( Tel Aviv, Israel). 32--41. Amis, A. D., Prakash, R., Huynh, D., and Vuong, T. 2000. Max-min d-cluster formation in wireless ad hoc networks. In Proceedings of IEEE INFOCOM (Tel Aviv, Israel). 32--41."},{"key":"e_1_2_1_2_1","volume-title":"Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom","volume":"3","author":"Bandyopadhyay S.","year":"2003","unstructured":"Bandyopadhyay , S. and Coyle , E . 2003. An energy efficient hierarchical clustering algorithm for wireless sensor networks . In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom 2003 ). Vol. 3 . Springer-Verlag, San Franciso, CA, 1713--1723. Bandyopadhyay, S. and Coyle, E. 2003. An energy efficient hierarchical clustering algorithm for wireless sensor networks. In Proceedings of the 22nd Annual Joint Conference of the IEEE Computer and Communications Societies (Infocom 2003). Vol. 3. Springer-Verlag, San Franciso, CA, 1713--1723."},{"key":"e_1_2_1_3_1","unstructured":"Bawa M. Garcia-Molina H. Gionis A. and Motwani R. 2003. Estimating aggregates on a peer-to-peer network. Tech. rep. Computer Science Department Stanford University Stanford CA.  Bawa M. Garcia-Molina H. Gionis A. and Motwani R. 2003. Estimating aggregates on a peer-to-peer network. Tech. rep. Computer Science Department Stanford University Stanford CA."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the Fourth International Conference on Information Processing in Sensor Networks (IPSN). IEEE Computer Society Press","author":"Chen J.-Y.","unstructured":"Chen , J.-Y. , Pandurangan , G. , and Xu , D . 2005. Robust aggregates computation in wireless sensor networks . In Proceedings of the Fourth International Conference on Information Processing in Sensor Networks (IPSN). IEEE Computer Society Press , Los Alamitos, CA. Chen, J.-Y., Pandurangan, G., and Xu, D. 2005. Robust aggregates computation in wireless sensor networks. In Proceedings of the Fourth International Conference on Information Processing in Sensor Networks (IPSN). IEEE Computer Society Press, Los Alamitos, CA."},{"key":"e_1_2_1_5_1","volume-title":"Proceedings of the Vehicular Technology Conference","author":"Ding M.","unstructured":"Ding , M. , Cheng , X. , and Xue , G . 2003. Aggregation tree construction in sensor networks . In Proceedings of the Vehicular Technology Conference ( Orlando, FL). Ding, M., Cheng, X., and Xue, G. 2003. Aggregation tree construction in sensor networks. In Proceedings of the Vehicular Technology Conference (Orlando, FL)."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.21136\/CMJ.1973.101168"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3149.214121"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90041-8"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the USENIX Technical Conference","author":"Girod L.","unstructured":"Girod , L. , Elson , J. , Cerpa , A. , Stathopoulas , T. , Ramanathan , N. , and Estrin , D . 2004. Emstar: A software environment for developing and deploying wireless sensor networks . In Proceedings of the USENIX Technical Conference ( Boston, MA). Girod, L., Elson, J., Cerpa, A., Stathopoulas, T., Ramanathan, N., and Estrin, D. 2004. Emstar: A software environment for developing and deploying wireless sensor networks. In Proceedings of the USENIX Technical Conference (Boston, MA)."},{"key":"e_1_2_1_10_1","volume-title":"Proceedings of the 2001 International Conference on Dependable Systems and Networks. 433--442","author":"Gupta I.","unstructured":"Gupta , I. , van Renesse , R. , and Birman , K . 2001. Scalable fault-tolerant aggregation in large process groups . In Proceedings of the 2001 International Conference on Dependable Systems and Networks. 433--442 . Gupta, I., van Renesse, R., and Birman, K. 2001. Scalable fault-tolerant aggregation in large process groups. In Proceedings of the 2001 International Conference on Dependable Systems and Networks. 433--442."},{"key":"e_1_2_1_11_1","volume-title":"DISC '00: Proceedings of the 14th Conference on Distributed Computing. Springer-Verlag","author":"Gupta I.","unstructured":"Gupta , I. , van Renesse , R. , and Birman , K. P . 2000. A probabilistically correct leader election protocol for large groups . In DISC '00: Proceedings of the 14th Conference on Distributed Computing. Springer-Verlag , London, U.K. 89--103. Gupta, I., van Renesse, R., and Birman, K. P. 2000. A probabilistically correct leader election protocol for large groups. In DISC '00: Proceedings of the 14th Conference on Distributed Computing. Springer-Verlag, London, U.K. 89--103."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11776178_18"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/345910.345953"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science","author":"Kempe D.","unstructured":"Kempe , D. , Dobra , A. , and Gehrke , J . 2003. Gossip-based computation of aggregate information . In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science ( Cambridge, MA). Kempe, D., Dobra, A., and Gehrke, J. 2003. Gossip-based computation of aggregate information. In Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (Cambridge, MA)."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/958491.958506"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/844128.844142"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872817"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/570738.570751"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066191"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031525"},{"key":"e_1_2_1_22_1","volume-title":"Proceedings of the Design, Automation and Test in Europe Conference and Exhibition.","author":"Pastor E.","unstructured":"Pastor , E. and Pena , M. A . 2003. Combining simulation and guided traversal for the verification of concurrent systems . In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition. ( Messe Munich, Germany). Pastor, E. and Pena, M. A. 2003. Combining simulation and guided traversal for the verification of concurrent systems. In Proceedings of the Design, Automation and Test in Europe Conference and Exhibition. (Messe Munich, Germany)."},{"key":"e_1_2_1_23_1","volume-title":"SECON'04","author":"Polley J.","unstructured":"Polley , J. , Blazakis , D. , McGee , J. , Rusk , D. , and Baras , J. S . 2004. Atemu: A fine-grained sensor network simulator . In SECON'04 , The First IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (Santa Clara, CA). Polley, J., Blazakis, D., McGee, J., Rusk, D., and Baras, J. S. 2004. Atemu: A fine-grained sensor network simulator. In SECON'04, The First IEEE Communications Society Conference on Sensor and Ad Hoc Communications and Networks (Santa Clara, CA)."},{"key":"e_1_2_1_24_1","volume-title":"RANDOM '98: Proceedings of the Second Workshop on Randomization and Approximation Techniques in Computer Science. Springer-Verlag","author":"Raab M.","unstructured":"Raab , M. and Steger , A. 1998. \u201cBalls into bins\u201d\u2014a simple and tight analysis . In RANDOM '98: Proceedings of the Second Workshop on Randomization and Approximation Techniques in Computer Science. Springer-Verlag , London, U.K., 159--170. Raab, M. and Steger, A. 1998. \u201cBalls into bins\u201d\u2014a simple and tight analysis. In RANDOM '98: Proceedings of the Second Workshop on Randomization and Approximation Techniques in Computer Science. Springer-Verlag, London, U.K., 159--170."},{"key":"e_1_2_1_25_1","volume-title":"Mathematical Statistics, 2 ed","author":"Shao J.","unstructured":"Shao , J. 2003. Mathematical Statistics, 2 ed . Springer Texts in Statistics, Springer , Berlin, Germany. Shao, J. 2003. Mathematical Statistics, 2 ed. Springer Texts in Statistics, Springer, Berlin, Germany."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1031495.1031518"},{"key":"e_1_2_1_27_1","volume-title":"IPSN '05: Proceedings of the 4th International Symposium on Information Processing in Sensor Networks. IEEE Computer Society Press","author":"Subramanian S.","unstructured":"Subramanian , S. and Shakkottai , S . 2005. Geographic routing with limited information in sensor networks . In IPSN '05: Proceedings of the 4th International Symposium on Information Processing in Sensor Networks. IEEE Computer Society Press , Los Alamitos, CA, 36. Subramanian, S. and Shakkottai, S. 2005. Geographic routing with limited information in sensor networks. In IPSN '05: Proceedings of the 4th International Symposium on Information Processing in Sensor Networks. IEEE Computer Society Press, Los Alamitos, CA, 36."},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (April 24--27","author":"Werner-Allen G.","unstructured":"Werner-Allen , G. , Swieskowski , P. , and Welsh , M . 2005. MoteLab: A wireless sensor network testbed . In Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (April 24--27 , Los Angeles, CA). Werner-Allen, G., Swieskowski, P., and Welsh, M. 2005. MoteLab: A wireless sensor network testbed. In Proceedings of the 4th International Symposium on Information Processing in Sensor Networks (April 24--27, Los Angeles, CA)."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11042-006-0013-7"}],"container-title":["ACM Transactions on Sensor Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1340771.1340775","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1340771.1340775","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:39:13Z","timestamp":1750253953000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1340771.1340775"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["10.1145\/1340771.1340775"],"URL":"https:\/\/doi.org\/10.1145\/1340771.1340775","relation":{},"ISSN":["1550-4859","1550-4867"],"issn-type":[{"value":"1550-4859","type":"print"},{"value":"1550-4867","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3]]},"assertion":[{"value":"2006-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2007-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-04-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}