{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T02:08:13Z","timestamp":1742954893494,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319196619"},{"type":"electronic","value":"9783319196626"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19662-6_4","type":"book-chapter","created":{"date-parts":[[2015,6,18]],"date-time":"2015-06-18T15:56:53Z","timestamp":1434643013000},"page":"48-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Schedule Template Construction Technique for Duty Cycled Sensor Networks"],"prefix":"10.1007","author":[{"given":"Van","family":"Ho","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioanis","family":"Nikolaidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,6,19]]},"reference":[{"key":"4_CR1","unstructured":"Zuyuan, F., Bensaou, B.: Fair bandwidth sharing algorithms based on game theory frameworks for wireless ad-hoc networks. In: INFOCOM 2004, pp. 1284\u20131295 (2004)"},{"issue":"2","key":"4_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.comnet.2003.12.017","volume":"45","author":"A Bar-Noy","year":"2004","unstructured":"Bar-Noy, A., Dreizin, V., Patt-Shamir, B.: Efficient algorithms for periodic scheduling. Comput. Netw. 45(2), 155\u2013173 (2004)","journal-title":"Comput. Netw."},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1007\/978-3-642-22450-8_27","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"A Casteigts","year":"2011","unstructured":"Casteigts, A., Flocchini, P., Quattrociocchi, W., Santoro, N.: Time-varying graphs and dynamic networks. In: Frey, H., Li, X., Ruehrup, S. (eds.) ADHOC-NOW 2011. LNCS, vol. 6811, pp. 346\u2013359. Springer, Heidelberg (2011)"},{"issue":"1","key":"4_CR4","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1239\/aap\/1035227997","volume":"30","author":"H Willie","year":"1998","unstructured":"Willie, H.: Periodic steady state of loss systems with periodic inputs. Adv. Appl. Probab. 30(1), 152\u2013166 (1998)","journal-title":"Adv. Appl. Probab."},{"key":"4_CR5","doi-asserted-by":"crossref","unstructured":"Shabdanov, S., et al.: Joint routing, scheduling, and network coding for wireless multihop networks. In: WiOpt 2011, pp. 33\u201340 (2011)","DOI":"10.1109\/WIOPT.2011.5930037"},{"issue":"4","key":"4_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/SURV.2008.080403","volume":"10","author":"D Nace","year":"2008","unstructured":"Nace, D., Pioro, M.: Max-min fairness and its applications to routing and load-balancing in communication networks: a tutorial. IEEE Comm. Surv. tutor. 10(4), 5\u201317 (2008)","journal-title":"IEEE Comm. Surv. tutor."},{"key":"4_CR7","volume-title":"Data Networks","author":"D Bertsekas","year":"1992","unstructured":"Bertsekas, D., Gallager, R.: Data Networks, 2nd edn. Prentice Hall, Englewood Cliffs (1992)","edition":"2"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Eickhoff, M., McNickle, D., Pawlikowski, K.: Detecting the duration of initial transient in steady state simulation of arbitrary performance measures. In: ValueTools 2007 (2007). Article #42","DOI":"10.4108\/valuetools.2007.1937"},{"issue":"2\u20133","key":"4_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0166-218X(02)00205-6","volume":"126","author":"S Sakai","year":"2003","unstructured":"Sakai, S., Togasaki, M., Yamazaki, K.: A note on greedy algorithm for the maximum weighted independent set problem. Discret. Appl. Math. 126(2\u20133), 313\u2013322 (2003)","journal-title":"Discret. Appl. Math."},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Ho, V., Nikolaidis, I.: Tradeoffs of combining network coding and duty cycling in WSNs. In: CNSR 2011, pp. 231\u2013238 (2011)","DOI":"10.1109\/CNSR.2011.41"}],"container-title":["Lecture Notes in Computer Science","Ad-hoc, Mobile, and Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19662-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:04:09Z","timestamp":1674907449000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19662-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319196619","9783319196626"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19662-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"19 June 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}