{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:14:28Z","timestamp":1725552868640},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642129629"},{"type":"electronic","value":"9783642129636"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12963-6_26","type":"book-chapter","created":{"date-parts":[[2010,4,25]],"date-time":"2010-04-25T23:37:47Z","timestamp":1272238667000},"page":"327-338","source":"Crossref","is-referenced-by-count":0,"title":["End-to-End Throughput with Cooperative Communication in Multi-channel Wireless Networks"],"prefix":"10.1007","author":[{"given":"Zheng","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baochun","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"3062","DOI":"10.1109\/TIT.2004.838089","volume":"50","author":"J.N. Laneman","year":"2004","unstructured":"Laneman, J.N., Tse, D.N.C., Wornell, G.W.: Cooperative diversity in wireless networks: Efficient protocols and outage behavior. IEEE Trans. Inf. Theory\u00a050, 3062\u20133080 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"26_CR2","doi-asserted-by":"publisher","first-page":"3037","DOI":"10.1109\/TIT.2005.853304","volume":"51","author":"G. Kramer","year":"2005","unstructured":"Kramer, G., Gastpar, M., Gupta, P.: Cooperative strategies and capacity theorems for relay networks. IEEE Transactions on Information Theory\u00a051(9), 3037\u20133063 (2005)","journal-title":"IEEE Transactions on Information Theory"},{"key":"26_CR3","doi-asserted-by":"publisher","first-page":"120","DOI":"10.2307\/1426331","volume":"3","author":"E.C.V. Meulen der","year":"1971","unstructured":"der Meulen, E.C.V.: Three-terminal communication channels. Adv. Appl. Probab.\u00a03, 120\u2013154 (1971)","journal-title":"Adv. Appl. Probab."},{"doi-asserted-by":"crossref","unstructured":"Jakllari, G., Krishnamurthy, S.V., Faloutsos, M.: A framework for distributed spatio-temporal communications in mobile ad hoc networks. In: Proc. IEEE INFOCOM (2006)","key":"26_CR4","DOI":"10.1109\/INFOCOM.2006.28"},{"issue":"10","key":"26_CR5","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/MCOM.2004.1341264","volume":"42","author":"A. Nosratinia","year":"2004","unstructured":"Nosratinia, A., Hunter, T.E., Hedayat, A.: Cooperative communication in wireless networks. IEEE Communications Magazine\u00a042(10), 74\u201380 (2004)","journal-title":"IEEE Communications Magazine"},{"doi-asserted-by":"crossref","unstructured":"Laneman, J.N., Wornell, G.W., Tse, D.: An efficient protocol for realizing cooperative diversity in wireless networks. In: Proc. IEEE Inter. Symp. Inform. Theory (June 2001)","key":"26_CR6","DOI":"10.1109\/ISIT.2001.936157"},{"issue":"5","key":"26_CR7","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1109\/TIT.1979.1056084","volume":"25","author":"T. Cover","year":"1979","unstructured":"Cover, T., Gamal, A.E.: Capacity theorems for the relay channel. IEEE Transactions on Information Theory\u00a025(5), 572\u2013584 (1979)","journal-title":"IEEE Transactions on Information Theory"},{"doi-asserted-by":"crossref","unstructured":"Nazer, B., Gastpar, M.: Compute-and-forward: Harnessing interference with structured codes. In: Proceedings of the IEEE International Symposium on Information Theory (ISIT 2008), Toronto, Canada (July 2008)","key":"26_CR8","DOI":"10.1109\/ISIT.2008.4595091"},{"doi-asserted-by":"crossref","unstructured":"Castura, J., Mao, Y.: Rateless coding over fading channels. IEEE Comm. Lett.\u00a010 (January 2006)","key":"26_CR9","DOI":"10.1109\/LCOMM.2006.1576565"},{"doi-asserted-by":"crossref","unstructured":"Zhang, X., Li, B.: On the benefits of network coding in multi-channel wireless networks. In: Proc. IEEE SECON (2008)","key":"26_CR10","DOI":"10.1109\/SAHCN.2008.49"},{"doi-asserted-by":"crossref","unstructured":"Tang, J., Xue, G., Zhang, W.: Interference-aware topology control and qos routing in multi-channel wireless mesh networks. In: Proc. ACM MobiHoc (2005)","key":"26_CR11","DOI":"10.1145\/1062689.1062700"},{"issue":"6","key":"26_CR12","doi-asserted-by":"publisher","first-page":"2041","DOI":"10.1109\/TIT.2005.847731","volume":"51","author":"P. Mitran","year":"2005","unstructured":"Mitran, P., Ochiai, H., Tarokh, V.: Space-time diversity enhancements using collaborative commnications. IEEE Trans. Inf. Theory\u00a051(6), 2041\u20132057 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"doi-asserted-by":"crossref","unstructured":"Shokrollahi, A.: Raptor codes. In: Proc. IEEE Inter. Symp. Inform. Theory, p. 36 (2004)","key":"26_CR13","DOI":"10.1109\/ISIT.2004.1365073"},{"doi-asserted-by":"crossref","unstructured":"Luby, M.: LT codes. In: Proc. 43rd Annual IEEE Symp. Fundations Computer Science (FOCS), pp. 271\u2013282 (2002)","key":"26_CR14","DOI":"10.1109\/SFCS.2002.1181950"},{"doi-asserted-by":"crossref","unstructured":"Lin, X., Rasool, S.: A distributed joint channel-assignment, scheduling and routing algorithm for multi-channel ad hoc wireless networks. In: Proc. IEEE INFOCOM (2007)","key":"26_CR15","DOI":"10.1109\/INFCOM.2007.134"},{"key":"26_CR16","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1145\/1080829.1080837","volume-title":"MobiCom \u201905: Proceedings of the 11th annual international conference on Mobile computing and networking","author":"M. Kodialam","year":"2005","unstructured":"Kodialam, M., Nandagopal, T.: Characterizing the capacity region in multi-radio multi-channel wireless mesh networks. In: MobiCom \u201905: Proceedings of the 11th annual international conference on Mobile computing and networking, pp. 73\u201387. ACM Press, New York (2005)"},{"doi-asserted-by":"crossref","unstructured":"Bahl, P., Chandra, R., Dunagan, J.: SSCH: slotted seeded channel hopping for capacity improvement. In: IEEE 802.11 Ad-Hoc Wireless Networks, in ACM Mobicom, pp. 216\u2013230 (2004)","key":"26_CR17","DOI":"10.1145\/1023720.1023742"},{"unstructured":"Ha\u0144\u0107kowiak, M., Karo\u0144ski, M., Panconesi, A.: On the distributed complexity of computing maximal matchings. In: SODA \u201998: Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms, Philadelphia, PA, USA, pp. 219\u2013225. Society for Industrial and Applied Mathematics (1998)","key":"26_CR18"},{"issue":"5","key":"26_CR19","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1109\/18.21215","volume":"34","author":"B. Hajek","year":"1998","unstructured":"Hajek, B., Sasaki, G.: Link scheduling in polynomial time. IEEE Trans. Inf. Theory\u00a034(5), 910\u2013917 (1998)","journal-title":"IEEE Trans. Inf. Theory"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12963-6_26.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T02:59:11Z","timestamp":1606186751000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12963-6_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642129629","9783642129636"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12963-6_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}