{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:24:26Z","timestamp":1740133466390,"version":"3.37.3"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2016,9,1]],"date-time":"2016-09-01T00:00:00Z","timestamp":1472688000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100002914","name":"Concordia University Research Chair","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002914","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada Discovery Grant","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Wireless Commun."],"published-print":{"date-parts":[[2016,9]]},"DOI":"10.1109\/twc.2016.2585490","type":"journal-article","created":{"date-parts":[[2016,6,29]],"date-time":"2016-06-29T18:23:26Z","timestamp":1467224606000},"page":"6513-6523","source":"Crossref","is-referenced-by-count":5,"title":["A Column Generation Method for Constructing and Scheduling Multiple Forwarding Trees in Wireless Sensor Networks"],"prefix":"10.1109","volume":"15","author":[{"given":"Dariush","family":"Ebrahimi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Samir","family":"Sebbah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chadi","family":"Assi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5934947"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2045896"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1109\/TC.2002.1004596","article-title":"On finding feasible solutions for the delay constrained group multicast routing problem","volume":"51","author":"low","year":"2002","journal-title":"IEEE Trans Comput"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/WICON.2005.24"},{"key":"ref14","first-page":"141","article-title":"An algorithm for data aggregation scheduling with long-lifetime and low-latency in wireless sensor networks","volume":"5","author":"chen","year":"2012","journal-title":"International Journal of Future Generation Communication and Networking"},{"key":"ref15","first-page":"224","article-title":"Energy-latency tradeoffs for data gathering in wireless sensor networks","volume":"1","author":"yu","year":"2004","journal-title":"Proc 23rd Annu Joint Conf IEEE Comput Commun Soc (INFOCOM)"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2163877"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5462134"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SAHCN.2008.74"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2012.245"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2013.13.0621130828"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195659"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/1614320.1614337"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2007.4379693"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1288107.1288122"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.adhoc.2013.12.004"},{"key":"ref2","first-page":"224","article-title":"An adaptive energy-efficient and low-latency MAC for data gathering in wireless sensor networks","author":"lu","year":"2004","journal-title":"Proc 18th Int Parallel Distrib Process Symp"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502565"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1070"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1868521.1868581"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2013.30"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TST.2012.6314526"},{"journal-title":"The Steiner Tree Problem","year":"1992","author":"hwang","key":"ref24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2015.2512272"},{"journal-title":"Linear Programming","year":"1983","author":"chvatal","key":"ref26"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2014.042114.130347"}],"container-title":["IEEE Transactions on Wireless Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7693\/7563476\/07501887.pdf?arnumber=7501887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:43:29Z","timestamp":1641987809000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7501887\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":26,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/twc.2016.2585490","relation":{},"ISSN":["1536-1276"],"issn-type":[{"type":"print","value":"1536-1276"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}