{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,30]],"date-time":"2025-07-30T14:53:39Z","timestamp":1753887219572,"version":"3.41.2"},"reference-count":27,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T00:00:00Z","timestamp":1531958400000},"content-version":"vor","delay-in-days":199,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["onlinelibrary.wiley.com"],"crossmark-restriction":true},"short-container-title":["Wireless Communications and Mobile Computing"],"published-print":{"date-parts":[[2018,1]]},"abstract":"<jats:p>We consider the problem of increasing the data collection frequency of aggregation convergecast. Previous studies attempt to increase the data collection frequency by shortening the completion of a single data collection cycle. We aim at increasing the frequency at which data collection updates are collected by the use of pipelining and, consequently, increasing the overall data collection frequency and throughput. To achieve this, we overlap the propagation schedule of multiple data snapshots within the same overall schedule cycle, thus increasing parallelism through pipelining. Consequently, the effective data collection time of an individual snapshot may span over multiple, successive, schedule cycles. To this end, we modify the aggregation convergecast model, decoupling schedule length, and data collection delay, by relaxing its precedence constraints. Our solution for this new problem involves the unconventional approach of constructing the schedule before finalizing the exact form of the data aggregation tree, which, in turn, requires that the schedule construction phase guarantees that every node can reach the sink. We compare our results using snapshot pipelining against a previously proposed algorithm that also uses a form of pipelining, as well as against an algorithm that though lacking pipelining, exhibits the ability to produce very short schedules. The results confirm the potential to achieve a substantial throughput increase, at the cost of some increase in latency.<\/jats:p>","DOI":"10.1155\/2018\/1539642","type":"journal-article","created":{"date-parts":[[2018,7,19]],"date-time":"2018-07-19T23:30:58Z","timestamp":1532043058000},"update-policy":"https:\/\/doi.org\/10.1002\/crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Increasing Aggregation Convergecast Data Collection Frequency through Pipelining"],"prefix":"10.1155","volume":"2018","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7214-6242","authenticated-orcid":false,"given":"Evandro","family":"de Souza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1469-5280","authenticated-orcid":false,"given":"Ioanis","family":"Nikolaidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2018,7,19]]},"reference":[{"key":"e_1_2_10_1_2","doi-asserted-by":"crossref","unstructured":"De SouzaE.andNikolaidisI. On the application of pipelining in aggregation convergecast scheduling Proceedings of the 2013 IEEE 14th International Symposium on a World of Wireless Mobile and Multimedia Networks WoWMoM 2013 June 2013 1\u20139 2-s2.0-84883705356.","DOI":"10.1109\/WoWMoM.2013.6583392"},{"key":"e_1_2_10_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/11599463_14"},{"key":"e_1_2_10_3_2","doi-asserted-by":"publisher","DOI":"10.1080\/15501320701585527"},{"key":"e_1_2_10_4_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.12.004"},{"key":"e_1_2_10_5_2","doi-asserted-by":"crossref","unstructured":"YuB. LiJ. andLiY. Distributed data aggregation scheduling in wireless sensor networks Proceedings of the 28th Conference on Computer Communications (INFOCOM \u203209) April 2009 Rio de Janeiro Brazil 2159\u20132167 https:\/\/doi.org\/10.1109\/INFCOM.2009.5062140 2-s2.0-70349658421.","DOI":"10.1109\/INFCOM.2009.5062140"},{"key":"e_1_2_10_6_2","doi-asserted-by":"crossref","unstructured":"HuangS. C.-H. WanP.-J. VuC. T. LiY. andYaoF. Nearly constant approximation for data aggregation scheduling in wireless sensor networks Proceedings of the 26th IEEE International Conference on Computer Communications (IEEE INFOCOM \u203207) May 2007 IEEE 366\u2013372 https:\/\/doi.org\/10.1109\/infcom.2007.50 2-s2.0-34548324833.","DOI":"10.1109\/INFCOM.2007.50"},{"key":"e_1_2_10_7_2","doi-asserted-by":"crossref","unstructured":"LiX.-Y. XuX. WangS. TangS. DaiG. ZhaoJ. andQiY. Efficient data aggregation in multi-hop wireless sensor networks under physical interference model Proceedings of the IEEE 6th International Conference on Mobile Adhoc and Sensor Systems 2009. MASS \u201909 October 2009 353\u2013362.","DOI":"10.1109\/MOBHOC.2009.5336978"},{"key":"e_1_2_10_8_2","doi-asserted-by":"crossref","unstructured":"Incei\u00d6. D.andKrishnamachariB. Enhancing the data collection rate of tree-based aggregation in wireless sensor networks Proceedings of the 5th Annual IEEE Communications Society Conference on Sensor Mesh and Ad Hoc Communications and Networks (SECON \u203208) June 2008 San Francisco Calif USA IEEE 569\u2013577 https:\/\/doi.org\/10.1109\/sahcn.2008.74 2-s2.0-51749116307.","DOI":"10.1109\/SAHCN.2008.74"},{"key":"e_1_2_10_9_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-010-0282-y"},{"key":"e_1_2_10_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2146273"},{"key":"e_1_2_10_11_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2006.04.004"},{"key":"e_1_2_10_12_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2012.08.015"},{"key":"e_1_2_10_13_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31638-8_11"},{"key":"e_1_2_10_14_2","doi-asserted-by":"crossref","unstructured":"JiS. BeyahR. andCaiZ. Snapshot\/continuous data collection capacity for large-scale probabilistic wireless sensor networks Proceedings of the IEEE Conference on Computer Communications INFOCOM 2012 March 2012 1035\u20131043 2-s2.0-84861616471.","DOI":"10.1109\/INFCOM.2012.6195459"},{"key":"e_1_2_10_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-007-0050-9"},{"key":"e_1_2_10_16_2","doi-asserted-by":"crossref","unstructured":"Gr\u00f6nkvistJ. Assignment methods for spatial reuse tdma Proceedings of the 1st ACM international symposium on Mobile ad hoc networking & computing MobiHoc 00 2000 Piscataway NJ USA IEEE Press 119\u2013124.","DOI":"10.1109\/MOBHOC.2000.869219"},{"key":"e_1_2_10_17_2","doi-asserted-by":"publisher","DOI":"10.1057\/jors.1986.86"},{"volume-title":"Introduction to Algorithms","year":"2001","author":"Cormen T. H.","key":"e_1_2_10_18_2"},{"key":"e_1_2_10_19_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-998-1"},{"key":"e_1_2_10_20_2","doi-asserted-by":"publisher","DOI":"10.6028\/jres.071B.032"},{"key":"e_1_2_10_21_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230070103"},{"key":"e_1_2_10_22_2","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230090403"},{"key":"e_1_2_10_23_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579168"},{"key":"e_1_2_10_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/tit.2005.847717"},{"key":"e_1_2_10_25_2","doi-asserted-by":"crossref","unstructured":"ToumpisS.andGoldsmithA. J. Large wireless networks under fading mobility and delay constraints 1 Proceedings of the INFOCOM 2004. Twenty-third Annual Joint Conference of the IEEE Computer and Communications Societies March 2004.","DOI":"10.1109\/INFCOM.2004.1354532"},{"key":"e_1_2_10_26_2","doi-asserted-by":"crossref","unstructured":"De SouzaE.andNikolaidisI. Modeling aggregation convergecast scheduling using constraints Proceedings of the 14th ACM International Conference on Modeling Analysis and Simulation of Wireless and Mobile Systems MSWiM\u203211 November 2011 New York NY USA 231\u2013234 2-s2.0-83055169645.","DOI":"10.1145\/2068897.2068937"},{"key":"e_1_2_10_27_2","unstructured":"GamalA. E. MammenJ. PrabhakarB. andShahD. Throughput-delay trade-off in wireless networks 1 Proceedings of the INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies March 2004."}],"container-title":["Wireless Communications and Mobile Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/1539642.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/downloads.hindawi.com\/journals\/wcmc\/2018\/1539642.xml","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1155\/2018\/1539642","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T22:25:09Z","timestamp":1751754309000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1155\/2018\/1539642"}},"subtitle":[],"editor":[{"given":"Dongkyun","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"editor","vocabulary":"crossref"}]}],"short-title":[],"issued":{"date-parts":[[2018,1]]},"references-count":27,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["10.1155\/2018\/1539642"],"URL":"https:\/\/doi.org\/10.1155\/2018\/1539642","archive":["Portico"],"relation":{},"ISSN":["1530-8669","1530-8677"],"issn-type":[{"type":"print","value":"1530-8669"},{"type":"electronic","value":"1530-8677"}],"subject":[],"published":{"date-parts":[[2018,1]]},"assertion":[{"value":"2018-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-04","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-07-19","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}],"article-number":"1539642"}}