{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,8]],"date-time":"2024-04-08T00:52:25Z","timestamp":1712537545347},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2007,3,31]],"date-time":"2007-03-31T00:00:00Z","timestamp":1175299200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2007,8,16]]},"DOI":"10.1007\/s10878-007-9058-4","type":"journal-article","created":{"date-parts":[[2007,3,30]],"date-time":"2007-03-30T21:04:30Z","timestamp":1175288670000},"page":"229-248","source":"Crossref","is-referenced-by-count":3,"title":["Transport schemes for topology-transparent scheduling"],"prefix":"10.1007","volume":"14","author":[{"given":"Violet R.","family":"Syrotiuk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiqiang","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charles J.","family":"Colbourn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,31]]},"reference":[{"key":"9058_CR1","unstructured":"Bloemer J, Kalfane M, Karpinski M, Karp R, Luby M, Zuckerman D (1995) An XOR-based erasure-resilient coding scheme. Technical report TR-95-048, ICSI, August 1995"},{"issue":"1","key":"9058_CR2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1109\/90.282605","volume":"2","author":"I Chlamtac","year":"1994","unstructured":"Chlamtac I, Farag\u00f3 A (1994) Making transmission schedules immune to topology changes in multi-hop packet radio networks. IEEE\/ACM Trans Netw 2(1):23\u201329","journal-title":"IEEE\/ACM Trans Netw"},{"issue":"6","key":"9058_CR3","doi-asserted-by":"crossref","first-page":"728","DOI":"10.1109\/TC.1987.1676965","volume":"36","author":"I Chlamtac","year":"1987","unstructured":"Chlamtac I, Pinter S (1987) Distributed node organization algorithm for channel access in a multi-hop packet radio network. IEEE Trans Comput 36(6):728\u2013737","journal-title":"IEEE Trans Comput"},{"key":"9058_CR4","unstructured":"Chu W, Colbourn CJ, Syrotiuk VR (2004) Topology transparent scheduling, synchronization and maximum delay. In: Proceedings of the 18th international parallel and distributed processing symposium (IPDPS\u201904), April 2004, pp 223\u2013228"},{"issue":"4","key":"9058_CR5","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.comcom.2004.12.026","volume":"29","author":"W Chu","year":"2006","unstructured":"Chu W, Colbourn CJ, Syrotiuk VR (2006a) Slot synchronized topology-transparent scheduling for sensor networks. Comput Commun 29(4):421\u2013428","journal-title":"Comput Commun"},{"key":"9058_CR6","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1007\/s11276-006-6528-z","volume":"12","author":"W Chu","year":"2006","unstructured":"Chu W, Colbourn CJ, Syrotiuk VR (2006b) The effects of synchronization on topology-transparent scheduling. Wirel Netw 12:681\u2013690","journal-title":"Wirel Netw"},{"key":"9058_CR7","first-page":"86","volume":"73","author":"CJ Colbourn","year":"2005","unstructured":"Colbourn CJ, Syrotiuk VR (2005) Cover-free families and topology-transparency. Bayreuther Math Schr 73:86\u2013106","journal-title":"Bayreuther Math Schr"},{"key":"9058_CR8","first-page":"37","volume-title":"Surveys in Combinatorics","author":"CJ Colbourn","year":"1999","unstructured":"Colbourn CJ, Dinitz JH, Stinson DR (1999) Applications of combinatorial designs to communications, cryptography, and networking. In: Lamb JD, Preece DA (eds) Surveys in Combinatorics. Cambridge University Press, Cambridge, pp 37\u2013100"},{"key":"9058_CR9","doi-asserted-by":"crossref","unstructured":"Colbourn CJ, Syrotiuk VR, Ling ACH (2003) Steiner systems for topology-transparent access control in MANETs. In: Proceedings of the second international conference on ad hoc networks and wireless (Ad hoc Now\u201903), October 2003, pp 247\u2013258","DOI":"10.1007\/978-3-540-39611-6_22"},{"issue":"1\u20133","key":"9058_CR10","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1023\/B:DESI.0000029213.74879.e0","volume":"32","author":"CJ Colbourn","year":"2004","unstructured":"Colbourn CJ, Ling ACH, Syrotiuk VR (2004) Cover-free families and topology-transparent scheduling for MANETs. Des Codes Cryptogr 32(1\u20133):65\u201396","journal-title":"Des Codes Cryptogr"},{"key":"9058_CR11","unstructured":"Digital Fountain (2004) Breakthrough reliable transport technology for data and live streaming delivery over imperfect networks. Technology licensing white paper. Available at http:\/\/www.digitalfountain.com"},{"key":"9058_CR12","volume-title":"Combinatorial group testing and its applications","author":"DZ Du","year":"2000","unstructured":"Du DZ, Hwang FK (2000) Combinatorial group testing and its applications. 2nd edn. World Scientific, Singapore","edition":"2"},{"key":"9058_CR13","doi-asserted-by":"crossref","unstructured":"Dukes PJ, Colbourn CJ, Syrotiuk VR (2006) Topology-transparent schedules for energy limited ad hoc networks. In: Proceedings of the IEEE international workshop on foundations and algorithms for wireless networking (FAWN\u201906), March 2006, pp 85\u201390","DOI":"10.1109\/PERCOMW.2006.132"},{"key":"9058_CR14","doi-asserted-by":"crossref","unstructured":"Dukes PJ, Colbourn CJ, Syrotiuk VR (2007) Directed complete bipartite graph decompositions: indirect constructions. Discret Math (to appear)","DOI":"10.1016\/j.disc.2006.11.050"},{"key":"9058_CR15","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1006\/jcta.2002.3257","volume":"99","author":"A D\u2019yachkov","year":"2002","unstructured":"D\u2019yachkov A, Vilenkin P, Macula A, Torney D (2002) Families of finite sets in which no intersection of \u2113 sets is covered by the union of s others. J Comb Theory Ser A 99:195\u2013218","journal-title":"J Comb Theory Ser A"},{"key":"9058_CR16","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/BF02772959","volume":"51","author":"P Erd\u00f6s","year":"1985","unstructured":"Erd\u00f6s P, Frankl P, F\u00fcredi Z (1985) Families of finite sets in which no set is covered by the union of r others. Israel J Math 51:79\u201389","journal-title":"Israel J Math"},{"key":"9058_CR17","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1478-6","volume-title":"Orthogonal arrays, theory and applications","author":"AS Hedayat","year":"1999","unstructured":"Hedayat AS, Sloane NJA, Stufken J (1999) Orthogonal arrays, theory and applications. Springer, Berlin"},{"key":"9058_CR18","volume-title":"IEEE 802.11 standard","author":"IEEE Standards Committee","year":"1996","unstructured":"IEEE Standards Committee (1996) Wireless LAN medium access control (MAC) and physical layer (PHY) specifications. In: IEEE 802.11 standard. IEEE, New York, ISBN 1-55937-935-9"},{"key":"9058_CR19","doi-asserted-by":"crossref","unstructured":"Jacobson V (1988) Congestion avoidance and control. In: Proceedings SIGCOMM, August 1988, pp 314\u2013329","DOI":"10.1145\/52324.52356"},{"key":"9058_CR20","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/978-0-585-29603-6_5","volume-title":"Mobile computing","author":"D Johnson","year":"1996","unstructured":"Johnson D, Maltz D (1996) Dynamic source routing in ad hoc wireless networks. In: Imelinsky T, Korth\u00a0H (eds) Mobile computing. Kluwer Academic, Dordrecht, pp 153\u2013181"},{"issue":"3","key":"9058_CR21","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/90.700893","volume":"6","author":"J-H Ju","year":"1998","unstructured":"Ju J-H, Li VOK (1998) An optimal topology-transparent scheduling method in multihop packet radio networks. IEEE\/ACM Trans Netw 6(3):298\u2013306","journal-title":"IEEE\/ACM Trans Netw"},{"key":"9058_CR22","doi-asserted-by":"crossref","unstructured":"Luby MG (2002) LT codes. In: Proceedings of the 43rd symposium on foundations of computer science (FOCS\u201902), November 2002, pp 271\u2013280","DOI":"10.1109\/SFCS.2002.1181950"},{"key":"9058_CR23","unstructured":"Postel JB (1981) RFC 793: Transmission control protocol. ftp:\/\/ds.internic.net\/rfc\/rfc793.txt . September 1981"},{"issue":"2","key":"9058_CR24","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1145\/263876.263881","volume":"27","author":"L Rizzo","year":"1997","unstructured":"Rizzo L (1997) Effective erasure codes for reliable computer communication protocols. Comput Commun Rev 27(2):24\u201336","journal-title":"Comput Commun Rev"},{"key":"9058_CR25","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","volume":"66","author":"M Ruszink\u00f3","year":"1994","unstructured":"Ruszink\u00f3 M (1994) On the upper bound of the size of the r-cover-free families. J Comb Theory Ser A 66:302\u2013310","journal-title":"J Comb Theory Ser A"},{"key":"9058_CR26","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1006\/jcta.1999.3036","volume":"90","author":"DR Stinson","year":"2000","unstructured":"Stinson DR, Wei R, Zhu L (2000) Some new bounds for cover-free families. J Comb Theory Ser A 90:224\u2013234","journal-title":"J Comb Theory Ser A"},{"key":"9058_CR27","doi-asserted-by":"crossref","unstructured":"Syrotiuk VR, Colbourn CJ, Ling ACH (2003) Topology-transparent scheduling for MANETs using orthogonal arrays. In: Proceedings of the DIALM-POMC joint workshop on foundations of mobile computing, September 2003, pp 43\u201349","DOI":"10.1145\/941079.941086"},{"key":"9058_CR28","unstructured":"The Virtual InterNetwork Testbed (VINT) Project (1995) The network simulator\u2014ns-2. http:\/\/www.isi.edu\/nsnam\/vint\/index.html"},{"key":"9058_CR29","unstructured":"Zhu C, Corson S (1998) A five-phase reservation protocol (FPRP) for mobile ad hoc networks. In: Proceedings of 17th annual joint conference of the IEEE computer and communication societies (Infocom\u201998), March\u2013April 1998, pp 315\u2013321"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9058-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9058-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9058-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,11]],"date-time":"2023-05-11T07:11:42Z","timestamp":1683789102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9058-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,31]]},"references-count":29,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2007,8,16]]}},"alternative-id":["9058"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9058-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,31]]}}}