{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T21:57:13Z","timestamp":1725746233061},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,6]]},"DOI":"10.1109\/icc.2011.5962641","type":"proceedings-article","created":{"date-parts":[[2011,8,4]],"date-time":"2011-08-04T01:44:20Z","timestamp":1312422260000},"page":"1-5","source":"Crossref","is-referenced-by-count":4,"title":["Dynamic and Scalable Routing to Perform Efficient Data Aggregation in WSNs"],"prefix":"10.1109","author":[{"given":"Leandro A.","family":"Villas","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Guidoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Azzedine","family":"Boukerche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Regina B.","family":"Araujo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonio A. F.","family":"Loureiro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2008.10.009"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2006.110"},{"journal-title":"2010 Distributed Computing Group - ETH-Zurich last visited","article-title":"Simulator for network algorithms","year":"2010","key":"ref10"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/90.490746"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/1641804.1641846","article-title":"A reliable and data aggregation aware routing protocol for wireless sensor networks","author":"villas","year":"2009","journal-title":"MSWiM ‘09 Proceedings of the 12th ACM international conference on Modeling analysis and simulation of wireless and mobile systems"},{"key":"ref8","first-page":"448","article-title":"A 1.598 approximation algorithm for the steiner problem in graphs","author":"hougardy","year":"1999","journal-title":"SODA ‘99 Proceedings of the 10th annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/HPSR.2004.1303478"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1062689.1062720"},{"key":"ref9","first-page":"770","article-title":"Improved steiner tree approximation in graphs","author":"robins","year":"2000","journal-title":"SODA ‘00 Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2006.1637928"}],"event":{"name":"ICC 2011 - 2011 IEEE International Conference on Communications","start":{"date-parts":[[2011,6,5]]},"location":"Kyoto, Japan","end":{"date-parts":[[2011,6,9]]}},"container-title":["2011 IEEE International Conference on Communications (ICC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5962386\/5962409\/05962641.pdf?arnumber=5962641","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,9]],"date-time":"2024-04-09T14:56:10Z","timestamp":1712674570000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5962641\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/icc.2011.5962641","relation":{},"subject":[],"published":{"date-parts":[[2011,6]]}}}