{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:14:05Z","timestamp":1760955245715},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/tit.2011.2110690","type":"journal-article","created":{"date-parts":[[2011,3,15]],"date-time":"2011-03-15T17:08:26Z","timestamp":1300208906000},"page":"1911-1931","source":"Crossref","is-referenced-by-count":15,"title":["Fading Multiple Access Relay Channels: Achievable Rates and Opportunistic Scheduling"],"prefix":"10.1109","volume":"57","author":[{"given":"Lalitha","family":"Sankar","sequence":"first","affiliation":[]},{"family":"Yingbin Liang","sequence":"additional","affiliation":[]},{"given":"Narayan B","family":"Mandayam","sequence":"additional","affiliation":[]},{"given":"H Vincent","family":"Poor","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1987.1057341"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566172"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(79)90337-1"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref31","author":"gallager","year":"1968","journal-title":"Information Theory and Reliable Communication"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2169110"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref36","first-page":"1312","article-title":"Models and theory for relay channels with receive constraints","author":"kramer","year":"2004","journal-title":"Proc Ann Allerton Conf Commun Control and Computing"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2004.1399497"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904791"},{"key":"ref10","first-page":"191","article-title":"Hierarchical sensor networks: Capacity theorems and cooperative strategies using the multiple-access relay channel model","author":"sankaranarayanan","year":"2004","journal-title":"Proc 1st IEEE Conf Sensor and Ad Hoc Communications and Networks"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032821"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.846438"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904972"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2007.348341"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.892773"},{"key":"ref15","article-title":"User vs. relay cooperation in time-duplexed multi-access relay networks","author":"sankar","year":"2008"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2007.05725"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.833070"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2004.1365307"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2004.1399496"},{"key":"ref28","first-page":"215","article-title":"Optimal power allocation for parallel broadcast channels with independent and common information","author":"jindal","year":"2004","journal-title":"Proc IEEE Int Symp Inform Theory"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858920"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/18.641562"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.853304"},{"key":"ref6","article-title":"Resource allocation for wireless relay channels","author":"liang","year":"2004","journal-title":"31st Ann Asilomar Conf Signals Systems and Computers"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2119270"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847703"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2000.866330"},{"key":"ref7","first-page":"1598","article-title":"Cooperative diversity in wireless networks: A geometry-inclusive analysis","author":"sankaranarayanan","year":"2005","journal-title":"Proc Ann Allerton Conf Commun Control and Computing"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.838089"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1979.1056084"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.818096"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2009.5351176"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2005.858294"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2008.4797560"},{"key":"ref48","first-page":"1782","article-title":"Capacity theorems for the multiple-access relay channel","author":"sankaranarayanan","year":"2004","journal-title":"Proc Ann Allerton Conf Commun Control and Computing"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2007.4557240"},{"key":"ref47","article-title":"Ergodic fading one-sided interference channels without state information at the transmitters","author":"zhu","year":"2009"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2008.4595395"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2007.904996"},{"key":"ref24","author":"schrijver","year":"2003","journal-title":"Combinatorial Optimization Polyhedra and Efficiency"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2003.821988"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2008.060336"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110110"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/18.737513"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1287"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.1995.525188"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5730547\/05730582.pdf?arnumber=5730582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:22Z","timestamp":1633909942000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5730582\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":48,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2110690","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}