Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution
Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, which consists of multiple independent three-terminal relay cha...
Saved in:
Published in | IEEE transactions on information theory Vol. 53; no. 10; pp. 3432 - 3453 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
New York
IEEE
01.10.2007
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Subjects | |
Online Access | Get full text |
ISSN | 0018-9448 1557-9654 |
DOI | 10.1109/TIT.2007.904996 |
Cover
Loading…
Abstract | Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, which consists of multiple independent three-terminal relay channels as subchannels. Lower and upper bounds on the capacity are derived, and are shown to match, and thus establish the capacity for the parallel relay channel with degraded subchannels. This capacity theorem is further demonstrated via the Gaussian parallel relay channel with degraded subchannels, for which the synchronized and asynchronized capacities are obtained. The capacity-achieving power allocation at the source and relay nodes among the subchannels is partially characterized for the synchronized case and fully characterized for the asynchronized case. The fading relay channel is then studied, which is based on the three-terminal relay channel with each communication link being corrupted by a multiplicative fading gain coefficient as well as an additive Gaussian noise term. For each link, the fading state information is assumed to be known at both the transmitter and the receiver. The source and relay nodes are allowed to allocate their power adaptively according to the instantaneous channel state information. The source and relay nodes are assumed to be subject to separate power constraints. For both the full-duplex and half-duplex cases, power allocations that maximize the achievable rates are obtained. In the half-duplex case, the power allocation needs to be jointly optimized with the channel resource (time and bandwidth) allocation between the two orthogonal channels over which the relay node transmits and receives. Capacities are established for fading relay channels that satisfy certain conditions. |
---|---|
AbstractList | Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, which consists of multiple independent three-terminal relay channels as subchannels. Lower and upper bounds on the capacity are derived, and are shown to match, and thus establish the capacity for the parallel relay channel with degraded subchannels. This capacity theorem is further demonstrated via the Gaussian parallel relay channel with degraded subchannels, for which the synchronized and asynchronized capacities are obtained. The capacity-achieving power allocation at the source and relay nodes among the subchannels is partially characterized for the synchronized case and fully characterized for the asynchronized case. The fading relay channel is then studied, which is based on the three-terminal relay channel with each communication link being corrupted by a multiplicative fading gain coefficient as well as an additive Gaussian noise term. For each link, the fading state information is assumed to be known at both the transmitter and the receiver. The source and relay nodes are allowed to allocate their power adaptively according to the instantaneous channel state information. The source and relay nodes are assumed to be subject to separate power constraints. For both the full-duplex and half-duplex cases, power allocations that maximize the achievable rates are obtained. In the half-duplex case, the power allocation needs to be jointly optimized with the channel resource (time and bandwidth) allocation between the two orthogonal channels over which the relay node transmits and receives. Capacities are established for fading relay channels that satisfy certain conditions. [PUBLICATION ABSTRACT] Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic model for fading relay channels, the parallel relay channel is first studied, which consists of multiple independent three-terminal relay channels as subchannels. Lower and upper bounds on the capacity are derived, and are shown to match, and thus establish the capacity for the parallel relay channel with degraded subchannels. This capacity theorem is further demonstrated via the Gaussian parallel relay channel with degraded subchannels, for which the synchronized and asynchronized capacities are obtained. The capacity-achieving power allocation at the source and relay nodes among the subchannels is partially characterized for the synchronized case and fully characterized for the asynchronized case. The fading relay channel is then studied, which is based on the three-terminal relay channel with each communication link being corrupted by a multiplicative fading gain coefficient as well as an additive Gaussian noise term. For each link, the fading state information is assumed to be known at both the transmitter and the receiver. The source and relay nodes are allowed to allocate their power adaptively according to the instantaneous channel state information. The source and relay nodes are assumed to be subject to separate power constraints. For both the full-duplex and half-duplex cases, power allocations that maximize the achievable rates are obtained. In the half-duplex case, the power allocation needs to be jointly optimized with the channel resource (time and bandwidth) allocation between the two orthogonal channels over which the relay node transmits and receives. Capacities are established for fading relay channels that satisfy certain conditions. |
Author | Poor, H.V. Yingbin Liang Veeravalli, V.V. |
Author_xml | – sequence: 1 surname: Yingbin Liang fullname: Yingbin Liang organization: Princeton Univ., Princeton – sequence: 2 givenname: V.V. surname: Veeravalli fullname: Veeravalli, V.V. – sequence: 3 givenname: H.V. surname: Poor fullname: Poor, H.V. organization: Princeton Univ., Princeton |
BookMark | eNp9kUFPGzEQRq0KJELKmUMvqx7a0wbP2l7bvaGoKZGCkCCIo-XdzLZGxqb2RoJ_X4egHnLgZFl-b2Y83yk5CjEgIedAZwBUX6yX61lDqZxpyrVuP5EJCCFr3Qp-RCaUgqo15-qEnOb8WK5cQDMhV7eY4zb1WF16H3s7uhiqIabqwSX0mHO1sBsXfle36O1rNf9jQ0Cff1TX9qW-dqG6i367kz6T48H6jGfv55TcL36u51f16ubXcn65qnsmYKyHrms0yq7vVNcMwJCKQSuQgAOI1vJOqlY15V1soKGMMsZoB1xuBEhUemBT8n1f9znFv1vMo3lyuUfvbcC4zUZJQVtQUhby24ck422hmCjg1wPwsawklF8Y0EJDq8sYU3Kxh_oUc044mOfknmx6NUDNLgBTAjC7AMw-gGKIA6N349uCx2Sd_8D7svccIv7vwhkVTGv2D0nrknw |
CODEN | IETTAW |
CitedBy_id | crossref_primary_10_1109_TIT_2011_2110690 crossref_primary_10_1109_JSTSP_2010_2052784 crossref_primary_10_1109_TWC_2016_2572690 crossref_primary_10_1155_2009_305146 crossref_primary_10_1109_TSP_2010_2049571 crossref_primary_10_1109_TWC_2017_2754261 crossref_primary_10_1109_TSP_2009_2020008 crossref_primary_10_1109_TCOMM_2014_031614_130226 crossref_primary_10_1109_TIT_2009_2030522 crossref_primary_10_1109_TIT_2009_2032821 crossref_primary_10_1109_TIT_2008_928978 crossref_primary_10_1109_TVT_2018_2789823 crossref_primary_10_1109_TSP_2011_2164910 crossref_primary_10_1155_2013_424162 crossref_primary_10_1016_j_comnet_2014_07_002 crossref_primary_10_1109_JSAC_2017_2686578 crossref_primary_10_1109_TIT_2011_2112030 crossref_primary_10_1186_1687_6180_2012_194 crossref_primary_10_1155_2010_172013 crossref_primary_10_1109_TW_2013_060413_121136 crossref_primary_10_1109_TCOMM_2011_063011_100030 crossref_primary_10_1109_TCOMM_2016_2552166 crossref_primary_10_1155_2009_458236 crossref_primary_10_1109_TVT_2014_2376779 crossref_primary_10_1109_TWC_2013_042213_121205 crossref_primary_10_1109_TWC_2013_010214_122030 crossref_primary_10_1109_TWC_2021_3103874 crossref_primary_10_3923_rjit_2009_41_50 crossref_primary_10_1109_TVT_2009_2020501 crossref_primary_10_1109_COMST_2015_2394324 crossref_primary_10_1109_TWC_2019_2950205 crossref_primary_10_1155_2011_184685 crossref_primary_10_1002_ett_3457 crossref_primary_10_1109_LSP_2019_2942994 crossref_primary_10_1109_LWC_2017_2748581 crossref_primary_10_1109_ACCESS_2020_3028173 crossref_primary_10_1109_TIT_2015_2485995 crossref_primary_10_1002_dac_1174 crossref_primary_10_1109_JSAC_2008_081007 crossref_primary_10_1109_TETCI_2019_2902869 crossref_primary_10_1109_TVT_2015_2455232 crossref_primary_10_1109_TBC_2023_3311330 crossref_primary_10_1109_TPS_2020_3025445 crossref_primary_10_1109_JSTSP_2016_2607684 crossref_primary_10_1109_TCOMM_2015_2391188 crossref_primary_10_1186_s13638_015_0512_1 crossref_primary_10_1109_TSP_2012_2232656 crossref_primary_10_1109_LCOMM_2012_050912_112192 crossref_primary_10_1155_2010_792410 crossref_primary_10_1109_TVT_2011_2165570 crossref_primary_10_1109_TVT_2013_2291435 crossref_primary_10_1109_TCOMM_2020_2965526 crossref_primary_10_1109_TWC_2010_07_081669 crossref_primary_10_3724_SP_J_1087_2009_02153 crossref_primary_10_1109_TWC_2013_093013_122002 crossref_primary_10_1109_TIT_2010_2048469 crossref_primary_10_1109_TWC_2011_011211_100752 crossref_primary_10_1109_TIFS_2012_2185493 crossref_primary_10_1007_s11771_013_1572_1 crossref_primary_10_1109_JIOT_2022_3143165 crossref_primary_10_1109_TIT_2012_2196677 crossref_primary_10_1109_TWC_2012_050112_111372 crossref_primary_10_1109_TSP_2011_2109958 crossref_primary_10_1109_TWC_2017_2718537 crossref_primary_10_1007_s11277_021_08968_1 crossref_primary_10_1049_iet_com_2013_0196 crossref_primary_10_1109_TWC_2013_031313_120709 crossref_primary_10_1155_2010_132910 crossref_primary_10_1109_TVT_2015_2499263 crossref_primary_10_1109_TVT_2018_2856507 crossref_primary_10_1002_wcm_793 crossref_primary_10_1109_TMC_2017_2725266 crossref_primary_10_1109_TCOMM_2010_05_090600 crossref_primary_10_1109_TVT_2012_2237423 crossref_primary_10_1109_TIT_2013_2238607 crossref_primary_10_1109_ACCESS_2017_2693441 crossref_primary_10_1109_TWC_2014_2338853 crossref_primary_10_1109_TIT_2008_921678 crossref_primary_10_1109_TWC_2011_040411_101240 crossref_primary_10_1109_TIT_2012_2197851 crossref_primary_10_1109_TSP_2011_2179651 crossref_primary_10_1109_TWC_2010_05_090307 |
Cites_doi | 10.1007/978-1-4757-2341-0 10.1109/TIT.1979.1056084 10.1109/ISIT.2006.261986 10.1109/TIT.2003.817829 10.1109/TIT.2006.871579 10.1109/TCOMM.2003.818096 10.1109/TIT.2004.826631 10.1109/TIT.2006.871576 10.1109/TIT.2007.904962 10.1109/ACSSC.2004.1399496 10.1109/TIT.2004.839487 10.1109/TIT.2005.858920 10.1109/TIT.2005.855582 10.1109/TCOMM.2003.819238 10.1109/TIT.2004.842566 10.1109/ISIT.2004.1365307 10.1109/TWC.2005.858294 10.1109/TIT.1982.1056502 10.1109/TIT.2005.853304 10.1109/ICC.1995.525188 10.1109/TIT.2004.838373 10.1109/TWC.2007.348341 10.1109/ISIT.2006.262148 10.1109/TIT.2005.847703 10.1109/TIT.2006.885478 10.1109/ISIT.2004.1365306 10.1109/TCOMM.2004.833070 10.1109/JSAC.2007.070204 10.1109/JSAC.2004.830922 10.1109/TIT.2007.892773 10.1109/TIT.2006.890726 10.2307/1426331 10.1109/TIT.2005.853305 10.1109/ISIT.2000.866312 |
ContentType | Journal Article |
Copyright | Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2007 |
Copyright_xml | – notice: Copyright Institute of Electrical and Electronics Engineers, Inc. (IEEE) Oct 2007 |
DBID | 97E RIA RIE AAYXX CITATION 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
DOI | 10.1109/TIT.2007.904996 |
DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
DatabaseTitle | CrossRef Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Professional Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
DatabaseTitleList | Technology Research Database Technology Research Database Technology Research Database |
Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/ sourceTypes: Publisher |
DeliveryMethod | fulltext_linktorsrc |
Discipline | Engineering Computer Science |
EISSN | 1557-9654 |
EndPage | 3453 |
ExternalDocumentID | 1345554801 10_1109_TIT_2007_904996 4305399 |
Genre | orig-research Feature |
GroupedDBID | -~X .DC 0R~ 29I 3EH 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABFSI ABQJQ ABVLG ACGFO ACGFS ACGOD ACIWK AENEX AETEA AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 E.L EBS EJD F5P HZ~ H~9 IAAWW IBMZZ ICLAB IDIHD IFIPE IFJZH IPLJI JAVBF LAI M43 MS~ O9- OCL P2P PQQKQ RIA RIE RNS RXW TAE TN5 VH1 VJK AAYOK AAYXX CITATION RIG 7SC 7SP 8FD JQ2 L7M L~C L~D F28 FR3 |
ID | FETCH-LOGICAL-c351t-fbb29e7bcb8b2f13e05f98171ef156a4b786827bc5d120303330b147d517e89f3 |
IEDL.DBID | RIE |
ISSN | 0018-9448 |
IngestDate | Thu Jul 10 17:39:42 EDT 2025 Fri Jul 11 08:52:45 EDT 2025 Mon Jun 30 05:25:11 EDT 2025 Thu Apr 24 23:01:41 EDT 2025 Tue Jul 01 02:34:19 EDT 2025 Tue Aug 26 16:39:37 EDT 2025 |
IsPeerReviewed | true |
IsScholarly | true |
Issue | 10 |
Language | English |
License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
LinkModel | DirectLink |
MergedId | FETCHMERGED-LOGICAL-c351t-fbb29e7bcb8b2f13e05f98171ef156a4b786827bc5d120303330b147d517e89f3 |
Notes | SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-2 content type line 23 |
PQID | 195916903 |
PQPubID | 23500 |
PageCount | 22 |
ParticipantIDs | proquest_miscellaneous_34677335 ieee_primary_4305399 proquest_miscellaneous_875061877 proquest_journals_195916903 crossref_primary_10_1109_TIT_2007_904996 crossref_citationtrail_10_1109_TIT_2007_904996 |
ProviderPackageCode | CITATION AAYXX |
PublicationCentury | 2000 |
PublicationDate | 2007-10-01 |
PublicationDateYYYYMMDD | 2007-10-01 |
PublicationDate_xml | – month: 10 year: 2007 text: 2007-10-01 day: 01 |
PublicationDecade | 2000 |
PublicationPlace | New York |
PublicationPlace_xml | – name: New York |
PublicationTitle | IEEE transactions on information theory |
PublicationTitleAbbrev | TIT |
PublicationYear | 2007 |
Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
References | ref35 ref13 ref34 ref12 sankaranarayanan (ref17) 2004 ref37 ref36 ref30 ref33 ref11 ref32 ref10 ref2 ref1 ref39 ref16 ref19 ref18 mitra (ref14) 2003 yao (ref31) 2005; 4 ref23 ref26 ref25 ref20 ref22 ref28 sendonaris (ref5) 2003; 51 ref27 el gamal (ref21) 2006; 52 ref29 luenberger (ref38) 2003 ref8 ref7 ref9 ref4 liang (ref40) 2005 ref3 ref6 khojastepour (ref15) 2004 pradad (ref24) 2004 |
References_xml | – ident: ref35 doi: 10.1007/978-1-4757-2341-0 – ident: ref2 doi: 10.1109/TIT.1979.1056084 – ident: ref25 doi: 10.1109/ISIT.2006.261986 – ident: ref22 doi: 10.1109/TIT.2003.817829 – start-page: 268 year: 2004 ident: ref24 article-title: diversity and multiplexing tradeoff bounds for cooperative diversity protocols publication-title: Proc IEEE Int Symp Information Theory – year: 2003 ident: ref38 publication-title: Linear and Nonlinear Programming – start-page: 573 year: 2005 ident: ref40 article-title: distributed optimal resource allocation for fading relay broadcast channels publication-title: IEEE Int Workshop on Signal Processing Advances in Wireless Communications (SPAWC) – volume: 52 start-page: 1545 year: 2006 ident: ref21 article-title: Bounds on capacity and minimum energy-per-bit for AWGN relay channels publication-title: IEEE Trans Inf Theory doi: 10.1109/TIT.2006.871579 – ident: ref4 doi: 10.1109/TCOMM.2003.818096 – ident: ref7 doi: 10.1109/TIT.2004.826631 – ident: ref10 doi: 10.1109/TIT.2006.871576 – start-page: 1782 year: 2004 ident: ref17 article-title: capacity theorems for the multiple-access relay channel publication-title: Proc 42nd Annu Allerton Conf Communication Control and Computing – ident: ref36 doi: 10.1109/TIT.2007.904962 – ident: ref34 doi: 10.1109/ACSSC.2004.1399496 – start-page: 1792 year: 2004 ident: ref15 article-title: cheap' relay channel: a unifying approach to time and frequency division relaying publication-title: Proc 42nd Annu Allerton Conf Communication Control and Computing – ident: ref11 doi: 10.1109/TIT.2004.839487 – ident: ref23 doi: 10.1109/TIT.2005.858920 – ident: ref12 doi: 10.1109/TIT.2005.855582 – start-page: 551 year: 2003 ident: ref14 article-title: on achievable rates of complexity constrained relay channels publication-title: Proc 41st Annu Allerton Conf Communication Control and Computing – volume: 51 start-page: 1939 year: 2003 ident: ref5 article-title: user cooperation diversity. part ii. implementation aspects and performance analysis publication-title: IEEE Transactions on Communications doi: 10.1109/TCOMM.2003.819238 – ident: ref13 doi: 10.1109/TIT.2004.842566 – ident: ref33 doi: 10.1109/ISIT.2004.1365307 – volume: 4 start-page: 2917 year: 2005 ident: ref31 article-title: On energy efficiency and optimum resource allocation of relay transmissions in the low-power regime publication-title: IEEE Trans Wireless Commun doi: 10.1109/TWC.2005.858294 – ident: ref3 doi: 10.1109/TIT.1982.1056502 – ident: ref8 doi: 10.1109/TIT.2005.853304 – ident: ref39 doi: 10.1109/ICC.1995.525188 – ident: ref32 doi: 10.1109/TIT.2004.838373 – ident: ref26 doi: 10.1109/TWC.2007.348341 – ident: ref30 doi: 10.1109/ISIT.2006.262148 – ident: ref9 doi: 10.1109/TIT.2005.847703 – ident: ref20 doi: 10.1109/TIT.2006.885478 – ident: ref18 doi: 10.1109/ISIT.2004.1365306 – ident: ref28 doi: 10.1109/TCOMM.2004.833070 – ident: ref29 doi: 10.1109/JSAC.2007.070204 – ident: ref16 doi: 10.1109/JSAC.2004.830922 – ident: ref27 doi: 10.1109/TIT.2007.892773 – ident: ref19 doi: 10.1109/TIT.2006.890726 – ident: ref1 doi: 10.2307/1426331 – ident: ref37 doi: 10.1109/TIT.2005.853305 – ident: ref6 doi: 10.1109/ISIT.2000.866312 |
SSID | ssj0014512 |
Score | 2.313598 |
Snippet | Resource allocation is investigated for fading relay channels under separate power constraints at the source and relay nodes. As a basic information-theoretic... |
SourceID | proquest crossref ieee |
SourceType | Aggregation Database Enrichment Source Index Database Publisher |
StartPage | 3432 |
SubjectTerms | Additive noise Allocations Bandwidth Bandwidths Capacity Channel state information Channels Communication channels Degradation Electronics Fading Gaussian Gaussian noise Links max-min parallel relay channels Relay Relays Resource allocation Resource management Time Division Multiple Access Transmitters Upper bound wireless relay channels |
Title | Resource Allocation for Wireless Fading Relay Channels: Max-Min Solution |
URI | https://ieeexplore.ieee.org/document/4305399 https://www.proquest.com/docview/195916903 https://www.proquest.com/docview/34677335 https://www.proquest.com/docview/875061877 |
Volume | 53 |
hasFullText | 1 |
inHoldings | 1 |
isFullTextHit | |
isPrint | |
link | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT9wwEB4BJziUZ0WgpT5w6IEs6zhe29xQ1dUWaTktErcodmwJscpW3V0J-PWdcR4qLUi9RbKjRB7Pe-YbgHOvjKqUk6mxHB2ULITUuODT0knpqnxU5jn1O09vR5O7_OZe3m_ARd8L472PxWd-QI8xl18t3JpCZZcET4UKdRM20XFrerX6jEEueYMMzpGB0edoYXz40FzOfswarEJD9v3olQaKI1X-kcNRuYx3Ydr9VlNT8jhYr-zAvfyF2Pi__70HH1ork10312IfNnx9ALvdBAfWMvQB7PwBR3gIky6Wz67npOOIZgyNWkYlsnMUiWwcK-4ZVdA9M2pMqFG1XrFp-ZROH2rWxdiO4G78ffZtkraTFlInJF-lwdrMeGWd1TYLXPihDEZzxX1A_67MrdIjneG6rHiGYkEIMbQ8V5XkymsTxEfYqhe1P6YecGm50khpbXIrMx0qCi2hHPF4DLpMYNCdfuFaGHKahjEvojsyNAWSi4ZjqqIhVwJf-xd-Nggc7289pMPvt7XnnsBpR96i5dBlQaA6lCIUCXzpV5G1KF9S1n6xXhYClYgSQibA3tmBzh7aQ1qpk7e_fArbMRYci_8-wdbq19p_RiNmZc_i7f0Nh5fs5g |
linkProvider | IEEE |
linkToHtml | http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LT9wwEB5Remg5QAutCBTwoYcemmUdx2ubG0KslpZwWiRuUezYEuoqW5Vdqe2v74zzUGmL1FskO0rk8bxnvgF475VRtXIyNZajg5KFkBoXfFo5KV2dT6o8p37n4mYyu80_3cm7Dfg49MJ472PxmR_RY8zl10u3plDZKcFToUJ9Bs9R70vedmsNOYNc8hYbnCMLo9fRAfnwsTmdX81btEJDFv7kkQ6KQ1X-ksRRvUx3oOh_rK0q-TJar-zI_fwDs_F___wVbHd2JjtvL8Zr2PDNLuz0MxxYx9K7sPUbIOEezPpoPjtfkJYjqjE0axkVyS5QKLJprLlnVEP3g1FrQoPK9YwV1fe0uG9YH2V7A7fTy_nFLO1mLaROSL5Kg7WZ8co6q20WuPBjGYzmivuAHl6VW6UnOsN1WfMMBYMQYmx5rmrJldcmiLew2Swbv09d4NJypZHW2uRWZjrUFFxCSeLxGHSVwKg__dJ1QOQ0D2NRRodkbEokF43HVGVLrgQ-DC98bTE4nt66R4c_bOvOPYHDnrxlx6MPJcHqUJJQJHAyrCJzUcakavxy_VAKVCNKCJkAe2IHuntoEWmlDv795RN4MZsX1-X11c3nQ3gZI8OxFPAdbK6-rf0RmjQrexxv8i8KZPAv |
openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Resource+Allocation+for+Wireless+Fading+Relay+Channels%3A+Max-Min+Solution&rft.jtitle=IEEE+transactions+on+information+theory&rft.au=Liang%2C+Y&rft.au=Veeravalli%2C+V+V&rft.au=Poor%2C+H+Vincent&rft.date=2007-10-01&rft.pub=The+Institute+of+Electrical+and+Electronics+Engineers%2C+Inc.+%28IEEE%29&rft.issn=0018-9448&rft.eissn=1557-9654&rft.volume=53&rft.issue=10&rft.spage=3432&rft_id=info:doi/10.1109%2FTIT.2007.904996&rft.externalDBID=NO_FULL_TEXT&rft.externalDocID=1345554801 |
thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0018-9448&client=summon |
thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0018-9448&client=summon |
thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0018-9448&client=summon |