{"http:\/\/dx.doi.org\/10.14288\/1.0166356":{"http:\/\/vivoweb.org\/ontology\/core#departmentOrSchool":[{"value":"Applied Science, Faculty of","type":"literal","lang":"en"},{"value":"Electrical and Computer Engineering, Department of","type":"literal","lang":"en"}],"http:\/\/www.europeana.eu\/schemas\/edm\/dataProvider":[{"value":"DSpace","type":"literal","lang":"en"}],"https:\/\/open.library.ubc.ca\/terms#degreeCampus":[{"value":"UBCV","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/creator":[{"value":"Zlatanov, Nikola","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/issued":[{"value":"2015-07-07T17:15:00Z","type":"literal","lang":"en"},{"value":"2015","type":"literal","lang":"en"}],"http:\/\/vivoweb.org\/ontology\/core#relatedDegree":[{"value":"Doctor of Philosophy - PhD","type":"literal","lang":"en"}],"https:\/\/open.library.ubc.ca\/terms#degreeGrantor":[{"value":"University of British Columbia","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/description":[{"value":"Wireless communication has enabled people to be connected from anywhere and at any time. This has had a profound impact on human society. Currently, wireless communication is performed using the communication protocols developed for cellular and wireless local area networks. Although these protocols support a broad range of mobile services, they do not fully exploit the capacity of the underlying networks and cannot satisfy the exponential growth in demand for higher data rates and more reliable connections. Therefore, new communication protocols have to be developed for general wireless networks in order to meet this demand. Ultimately, these protocols will have to be able to reach the fundamental limits of information flow in wireless networks, i.e., the network capacity. However, due to the complexity of the problem, it is currently not known how to design such protocols for general wireless networks. Therefore, in order to get insight into this problem, as a first step, communication protocols for very simple wireless networks have to be devised. Later, the gained knowledge can be exploited to design protocols for more complex networks. \nIn this thesis, we propose new communication protocols for the simplest half-duplex relay network, which is also the most basic building block of any wireless network, the two-hop half-duplex relay network. This network is comprised of a source, a half-duplex relay, and a destination where a direct source-destination link is not available. For the considered relay network, we propose three novel communication protocols. The first proposed protocol achieves the capacity of the considered network when fading on the source-relay and relay-destination links is not present. The second and third protocols significantly improve the average data rate and the outage probability, respectively, of the considered network when both the source-relay and the relay-destination links are affected by fading.","type":"literal","lang":"en"}],"http:\/\/www.europeana.eu\/schemas\/edm\/aggregatedCHO":[{"value":"https:\/\/circle.library.ubc.ca\/rest\/handle\/2429\/54010?expand=metadata","type":"literal","lang":"en"}],"http:\/\/www.w3.org\/2009\/08\/skos-reference\/skos.html#note":[{"value":"NOVEL PROTOCOLS FOR THE TWO-HOP HALF-DUPLEX RELAYNETWORKbyNikola ZlatanovM. Si., Ss. Cyril and Methodius University, 2010Dipl. Eng., Ss. Cyril and Methodius University, 2007A THESIS SUBMITTED IN PARTIAL FULFILLMENT OFTHE REQUIREMENTS FOR THE DEGREE OFDOCTOR OF PHILOSOPHYinThe Faulty of Graduate and Postdotoral Studies(Eletrial and Computer Engineering)THE UNIVERSITY OF BRITISH COLUMBIA(Vanouver)July 2015\u00a9 Nikola Zlatanov, 2015AbstratWireless ommuniation has enabled people to be onneted from anywhere and atany time. This has had a profound impat on human soiety. Currently, wirelessommuniation is performed using the ommuniation protools developed for ellu-lar and wireless loal area networks. Although these protools support a broad rangeof mobile servies, they do not fully exploit the apaity of the underlying networksand annot satisfy the exponential growth in demand for higher data rates and morereliable onnetions. Therefore, new ommuniation protools have to be developedfor general wireless networks in order to meet this demand. Ultimately, these pro-tools will have to be able to reah the fundamental limits of information \u001dow inwireless networks, i.e., the network apaity. However, due to the omplexity of theproblem, it is urrently not known how to design suh protools for general wirelessnetworks. Therefore, in order to get insight into this problem, as a \u001crst step, ommu-niation protools for very simple wireless networks have to be devised. Later, thegained knowledge an be exploited to design protools for more omplex networks.In this thesis, we propose new ommuniation protools for the simplest half-duplex relay network, whih is also the most basi building blok of any wirelessnetwork, the two-hop half-duplex relay network. This network is omprised of asoure, a half-duplex relay, and a destination where a diret soure-destination linkis not available. For the onsidered relay network, we propose three novel ommuni-ation protools. The \u001crst proposed protool ahieves the apaity of the onsiderediiAbstratnetwork when fading on the soure-relay and relay-destination links is not present.The seond and third protools signi\u001cantly improve the average data rate and theoutage probability, respetively, of the onsidered network when both the soure-relayand the relay-destination links are a\u001beted by fading.iiiPrefaeChapters 2\u00154 of this thesis are based on works performed under the supervision ofProf. Robert Shober and the ollaboration with Prof. Petar Popovski, AalborgUniversity, Denmark, and Vahid Jamali, Friedrih-Alexander-Universit\u00e4t Erlangen-N\u00fcrnberg, Germany.Unless otherwise stated, for all hapters and orresponding papers, I ondutedthe literature survey on related topis, identi\u001ced the hallenges, and performed theanalyses and simulations. I wrote all paper drafts for whih I am the \u001crst author.My supervisor guided the researh, validated the analyses, and gave omments onimproving the manusripts. The ollaborators' ontributions are listed below:1. Vahid Jamali gave omments for improving the paper related to Chapter 2 andvalidated the analyses.2. Prof. Petar Popovski suggested the system model for the paper related toChapter 3.Two papers related to Chapter 2 have been submitted for publiation:\u2022 N. Zlatanov, V. Jamali, and R. Shober, \u0010Capaity of the Two-Hop Half-DuplexRelay Channel,\u0011 Submitted for publiation.\u2022 N. Zlatanov, V. Jamali, and R. Shober, \u0010On the Capaity of the Two-HopHalf-Duplex Relay Channel,\u0011 Pro. of IEEE Globeom, San Diego, CA, USA,De. 2015.ivPrefaeTwo papers related to Chapter 3 have been published:\u2022 N. Zlatanov, R. Shober, and P. Popovski, \u0010Bu\u001ber-Aided Relaying with Adap-tive Link Seletion,\u0011 IEEE Journal on Seleted Areas in Communiations, vol.31, no. 8, pp. 1530-1542, Aug. 2013.\u2022 N. Zlatanov, R. Shober, and P. Popovski, \u0010Throughput and Diversity Gainof Bu\u001ber-Aided Relaying,\u0011 Pro. of IEEE Globeom 2011, Houston, TX, De.2011.Two papers related to Chapter 4 have been published:\u2022 N. Zlatanov and R. Shober, \u0010Bu\u001ber-Aided Relaying with Adaptive Link Sele-tion - Fixed and Mixed Rate Transmission,\u0011 IEEE Transations on InformationTheory, vol. 59, no. 5, pp. 2816-2840, May 2013.\u2022 N. Zlatanov and R. Shober, \u0010Bu\u001ber-Aided Relaying with Mixed Rate Trans-mission,\u0011 Pro. of IEEE IWCMC 2012, Limassol, Cyprus, Aug. 2012 (InvitedPaper).I have also o-authored other researh works whih have been published or sub-mitted for publiation during my time as a Ph.D. student at UBC. These works arelisted in Appendix D.vTable of ContentsAbstrat . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . iiPrefae . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ivTable of Contents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . viList of Figures . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xiiList of Abbreviations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xvList of Notation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xviAknowledgments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xviiDediation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . xviii1 Introdution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11.1 Cooperative Networks . . . . . . . . . . . . . . . . . . . . . . . . . . 21.2 The Two-Hop HD Relay Channel . . . . . . . . . . . . . . . . . . . . 41.3 Motivation of the Thesis . . . . . . . . . . . . . . . . . . . . . . . . . 51.3.1 The Two-Hop HD Relay Channel Without Fading . . . . . . 51.3.2 The Two-Hop HD Relay Channel With Fading . . . . . . . . 71.4 Contributions of the Thesis . . . . . . . . . . . . . . . . . . . . . . . 121.5 Organization of the Thesis . . . . . . . . . . . . . . . . . . . . . . . 15viTable of Contents2 Capaity of the Two-Hop Half-Duplex Relay Channel Without Fad-ing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172.1 Introdution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172.2 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 202.2.1 Channel Model . . . . . . . . . . . . . . . . . . . . . . . . . . 212.2.2 Mathematial Modelling of the HD Constraint . . . . . . . . 222.2.3 Mutual Information and Entropy . . . . . . . . . . . . . . . . 242.3 Capaity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 262.3.1 The Capaity . . . . . . . . . . . . . . . . . . . . . . . . . . . 272.3.2 Ahievability of the Capaity . . . . . . . . . . . . . . . . . . 292.3.3 Simpli\u001cation of Previous Converse Expressions . . . . . . . . 362.4 Capaity Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . 382.4.1 Binary Symmetri Channels . . . . . . . . . . . . . . . . . . . 382.4.2 AWGN Channels . . . . . . . . . . . . . . . . . . . . . . . . . 422.5 Numerial Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . 462.5.1 BSC Links . . . . . . . . . . . . . . . . . . . . . . . . . . . . 472.5.2 AWGN Links . . . . . . . . . . . . . . . . . . . . . . . . . . . 482.6 Conlusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 523 Bu\u001ber-Aided RelayingWith Adaptive Reeption-Transmission: Adap-tive Rate Transmission . . . . . . . . . . . . . . . . . . . . . . . . . . . 543.1 Introdution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 543.2 System Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 563.3 Preliminaries and Benhmark Shemes . . . . . . . . . . . . . . . . . 573.3.1 Adaptive Reeption-Transmission Protool and CSI Require-ments . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 57viiTable of Contents3.3.2 Transmission Rates and Queue Dynamis . . . . . . . . . . . 583.3.3 Ahievable Average Rate . . . . . . . . . . . . . . . . . . . . 603.3.4 Conventional Relaying . . . . . . . . . . . . . . . . . . . . . . 603.4 Optimal Adaptive Reeption-Transmission Protool for Fixed Powers 633.4.1 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . 633.4.2 Optimal Adaptive Reeption-Transmission Protool . . . . . 643.4.3 Deision Threshold . . . . . . . . . . . . . . . . . . . . . . . 693.4.4 Rayleigh Fading . . . . . . . . . . . . . . . . . . . . . . . . . 693.4.5 Real-Time Implementation . . . . . . . . . . . . . . . . . . . 713.5 Optimal Adaptive Reeption-Transmission and Optimal Power Allo-ation . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 723.5.1 Problem Formulation and Optimal Power Alloation . . . . . 723.5.2 Finding \u03bb and \u03c1 . . . . . . . . . . . . . . . . . . . . . . . . . 743.5.3 Rayleigh Fading . . . . . . . . . . . . . . . . . . . . . . . . . 763.5.4 Real-Time Implementation . . . . . . . . . . . . . . . . . . . 763.6 Delay-Limited Transmission . . . . . . . . . . . . . . . . . . . . . . . 773.6.1 Average Delay . . . . . . . . . . . . . . . . . . . . . . . . . . 773.6.2 Bu\u001ber-Aided Protool for Delay Limited Transmission . . . . 793.7 Numerial and Simulation Results . . . . . . . . . . . . . . . . . . . 813.7.1 Delay-Unonstrained Transmission . . . . . . . . . . . . . . . 813.7.2 Delay-Constrained Transmission . . . . . . . . . . . . . . . . 843.8 Conlusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 864 Bu\u001ber-Aided RelayingWith Adaptive Reeption-Transmission: Fixedand Mixed Rate Transmission . . . . . . . . . . . . . . . . . . . . . . 874.1 Introdution . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87viiiTable of Contents4.2 System Model and Channel Model . . . . . . . . . . . . . . . . . . . 894.3 Preliminaries and Benhmark Shemes . . . . . . . . . . . . . . . . . 904.3.1 Adaptive Reeption-Transmission and CSI Requirements . . 914.3.2 Transmission Rates and Queue Dynamis . . . . . . . . . . . 934.3.3 Link Outages and Indiator Variables . . . . . . . . . . . . . 954.3.4 Performane Metris . . . . . . . . . . . . . . . . . . . . . . . 964.3.5 Performane Benhmarks for Fixed Rate Transmission . . . . 974.3.6 Performane Benhmarks for Mixed Rate Transmission . . . . 994.4 Optimal Bu\u001ber-Aided Relaying for Fixed Rate Transmission WithoutDelay Constraints . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1024.4.1 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . 1024.4.2 Throughput Maximization . . . . . . . . . . . . . . . . . . . 1034.4.3 Performane in Rayleigh Fading . . . . . . . . . . . . . . . . 1124.5 Bu\u001ber-Aided Relaying for Fixed Rate Transmission With Delay Con-straints . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1134.5.1 Average Delay . . . . . . . . . . . . . . . . . . . . . . . . . . 1144.5.2 Adaptive Reeption-Transmission Protool for Delay LimitedTransmission . . . . . . . . . . . . . . . . . . . . . . . . . . . 1154.5.3 Throughput and Delay . . . . . . . . . . . . . . . . . . . . . 1174.5.4 Outage Probability . . . . . . . . . . . . . . . . . . . . . . . . 1224.6 Mixed Rate Transmission . . . . . . . . . . . . . . . . . . . . . . . . 1254.6.1 Optimal Adaptive Reeption-Transmission Protool WithoutPower Alloation . . . . . . . . . . . . . . . . . . . . . . . . . 1264.6.2 Optimal Adaptive Reeption-Transmission Poliy With PowerAlloation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129ixTable of Contents4.6.3 Mixed Rate Transmission With Delay Constraints . . . . . . 1354.6.4 Conventional Relaying With Delay Constraints . . . . . . . . 1364.7 Numerial and Simulation Results . . . . . . . . . . . . . . . . . . . 1374.7.1 Fixed Rate Transmission . . . . . . . . . . . . . . . . . . . . 1384.7.2 Mixed Rate Transmission . . . . . . . . . . . . . . . . . . . . 1424.8 Conlusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1455 Summary of Thesis and Future Researh Topis . . . . . . . . . . . 1475.1 Summary of the Results . . . . . . . . . . . . . . . . . . . . . . . . . 1475.2 Future Work . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 149Bibliography . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 151AppendiesA Proofs for Chapter 2 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159A.1 Proof That the Probability of Error at the Relay Goes to Zero When(2.25) Holds . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159A.2 Proof That the Probability of Error at the Destination Goes to ZeroWhen (2.26) Holds . . . . . . . . . . . . . . . . . . . . . . . . . . . . 165A.3 Proof of Lemma 2.1 . . . . . . . . . . . . . . . . . . . . . . . . . . . 167B Proofs for Chapter 3 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 169B.1 Proof of Theorem 3.1 . . . . . . . . . . . . . . . . . . . . . . . . . . 169B.2 Proof of Theorem 3.2 . . . . . . . . . . . . . . . . . . . . . . . . . . 170B.3 Proof of Theorem 3.3 . . . . . . . . . . . . . . . . . . . . . . . . . . 172B.4 Proof of Theorem 3.4 . . . . . . . . . . . . . . . . . . . . . . . . . . 174xTable of ContentsB.5 Proof of Lemma 3.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . 176C Proofs for Chapter 4 . . . . . . . . . . . . . . . . . . . . . . . . . . . . 178C.1 Proof of Theorem 4.1 . . . . . . . . . . . . . . . . . . . . . . . . . . 178C.2 Proof of Theorem 4.2 . . . . . . . . . . . . . . . . . . . . . . . . . . 181C.3 Proof of Lemma 4.2 . . . . . . . . . . . . . . . . . . . . . . . . . . . 186C.4 Proof of Lemma 4.4 . . . . . . . . . . . . . . . . . . . . . . . . . . . 187C.5 Proof of Theorem 4.3 . . . . . . . . . . . . . . . . . . . . . . . . . . 187C.6 Proof of Lemma 4.6 . . . . . . . . . . . . . . . . . . . . . . . . . . . 190C.7 Proof of Lemma 4.7 . . . . . . . . . . . . . . . . . . . . . . . . . . . 191C.8 Proof of Theorem 4.4 . . . . . . . . . . . . . . . . . . . . . . . . . . 191C.9 Proof of Theorem 4.5 . . . . . . . . . . . . . . . . . . . . . . . . . . 192C.10 Proof of Theorem 4.7 . . . . . . . . . . . . . . . . . . . . . . . . . . 194C.11 Proof of Theorem 4.8 . . . . . . . . . . . . . . . . . . . . . . . . . . 197C.12 Proof of Theorem 4.9 . . . . . . . . . . . . . . . . . . . . . . . . . . 199D Other Contributions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 201xiList of Figures1.1 The two-hop relay network omprised of a soure (S), a relay (R), anda destination (D). Sine there is no diret soure-destination link, thesoure transmits a message to the destination only via the relay. . . . 42.1 Two-hop relay hannel. . . . . . . . . . . . . . . . . . . . . . . . . . . 212.2 To ahieve the apaity in (2.18), transmission is organized in N + 1bloks and eah blok omprises k hannel uses. . . . . . . . . . . . . 292.3 Example of generated swithing vetor along with input\/output ode-words at soure, relay, and destination. . . . . . . . . . . . . . . . . 352.4 Blok diagram of the proposed hannel oding protool for time sloti. The following notations are used in the blok diagram: C1|r and C2are enoders, D1 and D2 are deoders, I is an inserter, S is a seletor,B is a bu\u001ber, and w(i) denotes the message transmitted by the sourein blok i. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 352.5 Comparison of rates for the BSC as a funtion of the error probabilityP\u03b51 = P\u03b52 = P\u03b5. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 482.6 Example of proposed input distributions at the relay pV (x2). . . . . . 492.7 Soure-relay and relay destination links are AWGN hannels with P1\/\u03c321 =P2\/\u03c322. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50xiiList of Figures2.8 Soure-relay and relay destination links are AWGN hannels with P1\/\u03c321\/10 =P2\/\u03c322. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 503.1 The two-hop HD relay network with fading on the S-R and R-D links.s(i) and r(i) are the instantaneous SNRs of the S-R and R-D links inthe ith time slot, respetively. . . . . . . . . . . . . . . . . . . . . . . 563.2 Average rates ahieved with bu\u001ber-aided relaying (BAR) with adap-tive reeption-transmission and with onventional relaying with andwithout bu\u001ber for \u2126SR = 0.9 and \u2126RD = 1.1. . . . . . . . . . . . . . . 823.3 Estimated \u03c1e(i) as a funtion of the time slot i. . . . . . . . . . . . . 833.4 Average rate with bu\u001ber-aided relaying with adaptive reeption-transmissionwith and without power alloation for \u2126\u00afS = 0.1 and \u2126\u00afR = 1.9 . . . . 833.5 Average rate of BAR with adaptive reeption-transmission for di\u001berentaverage delay onstraints. . . . . . . . . . . . . . . . . . . . . . . . . 843.6 Average delay until time slot i for T0 = 5 and \u03b3 = 20 dB . . . . . . . . 854.1 Ratio of the throughputs of bu\u001ber-aided relaying and ConventionalRelaying 1, \u03c4\/\u03c4fixedconv,1, vs. \u03b3. Fixed rate transmission without delayonstraints. \u03b3S = \u03b3R = \u03b3, S0 = R0 = 2 bits\/symb, and \u2126\u00afR = 1. . . . . 1384.2 Outage probability of bu\u001ber-aided (BA) relaying and ConventionalRelaying 1 vs. \u03b3. Fixed rate transmission without delay onstraints.\u03b3S = \u03b3R = \u03b3, S0 = R0 = 2 bits\/symb, and \u2126\u00afR = 1. . . . . . . . . . . . 1394.3 Throughputs of bu\u001ber-aided (BA) relaying and Conventional Relaying2 vs. \u03b3. Fixed rate transmission with delay onstraints. \u03b3S = \u03b3R = \u03b3,S0 = R0 = 2 bits\/symb, \u2126\u00afR = 1, and \u2126\u00afS = 1. . . . . . . . . . . . . . . 140xiiiList of Figures4.4 Outage probability of bu\u001ber-aided (BA) relaying and ConventionalRelaying 2 vs. \u03b3. Fixed rate transmission with delay onstraints. \u03b3S =\u03b3R = \u03b3, S0 = R0 = 2 bits\/symb, \u2126\u00afR = 1, and \u2126\u00afS = 1. . . . . . . . . . 1414.5 Throughput of bu\u001ber-aided relaying with adaptive reeption-transmissionand Conventional Relaying 1 vs. \u0393. Mixed rate transmission withoutdelay onstraints. \u2126\u00afS = 10, \u2126\u00afR = 1, and S0 = 2 bits\/symb. . . . . . . 1434.6 Throughput of bu\u001ber-aided relaying with adaptive reeption-transmissionand onventional relaying vs. \u0393. Mixed rate and \u001cxed rate transmis-sion with delay onstraint. E{T} = 5 time slots, \u03b3S = \u03b3R = \u0393, S0 = 2bits\/symb, and \u2126\u00afS = \u2126\u00afR = 1. . . . . . . . . . . . . . . . . . . . . . . 144C.1 Markov hain for the number of pakets in the queue of the bu\u001ber ifthe link seletion variable di is given by (4.59). . . . . . . . . . . . . . 188C.2 Markov hain for the number of pakets in the queue of the bu\u001ber ifthe link seletion variable di is given by (4.61) or (4.63). . . . . . . . 190xivList of AbbreviationsAWGN Additive White Gaussian NoiseBA Bu\u001ber-AidedBAR Bu\u001ber-Aided RelayingBSC Binary Symmetri ChannelCDF Cumulative Distribution FuntionCSI Channel State InformationCSIT Channel State Information at TransmitterDF Deode\u0015and\u0015Forwardi.i.d. Independent and Identially DistributedFD Full-DuplexHD Half-DuplexLTE Long Term EvolutionPMF Probability Mass FuntionPDF Probability Density FuntionRV Random VariableSNR Signal\u0015to\u0015Noise RatioWiMAX Worldwide Interoperability for Mirowave AessxvList of NotationE{\u00b7} Statistial expetationPr{\u00b7} Probability of an eventI(\u00b7; \u00b7) Mutual informationH(\u00b7) EntropyxviAknowledgmentsFirst, I would like to express my deep and sinere gratitude to my advisor, Prof.Robert Shober, for his endless support and invaluable advie during my Ph.D. study.I am extraordinarily luky to have had Prof. Shober as my advisor. This thesis wouldnot have been possible without him. I am forever indebted to Prof. Shober.I am grateful to my o-supervisor, Prof. Lutz Lampe, for his help and onstantsupport. I would also like to speially thank Prof. Zoran Hadzi-Velkov for his overallguidane, onstant support, and invaluable advie. I have also greatly bene\u001cted fromthe ollaboration and support of Prof. George Karagiannidis, Prof. Petar Popovski,Prof. Ljupo Koarev, Vahid Jamali, and Dr. Derrik Wing Kwan Ng.Endless gratitude and admiration goes to my mother, Gua Zlatanova, my father,Todor Zlatanov, and my sister, Zoria Zlatanova, for their relentless support andinredible sari\u001ce. Without their love and wisdom, I would not be where I amtoday.Finally, I would like to thank my wife, Ljupka Zlatanova, who has always beenthere for me. I am grateful for her unonditional support, her endless love, andexeptional sari\u001ce. Without her, none of this would be possible.This work was supported \u001cnanially by The University of British Columbia, TheKillam Trusts, the Natural Sienes and Engineering Researh Counil of Canada(NSERC), and the German Aademi Exhange Servie (DAAD).xviiDediationTo My Family.xviiiChapter 1IntrodutionWireless ommuniation has enabled people to be onneted from anywhere andat any time. This has had a profound impat on human soiety. Currently, wirelessommuniation is performed using the ommuniation protools developed for ellularand wireless loal area networks. Although these protools support a broad rangeof mobile servies, they do not fully exploit the apaity of the underlying networksand annot satisfy the exponential growth in demand for higher data rates and morereliable onnetions. Therefore, new ommuniation protools have to be developedfor general wireless networks in order to meet this demand. Ultimately, these protoolwill have to be able to reah the fundamental limits of information \u001dow in wirelessnetworks, i.e., the network apaity. Unfortunately, our urrent understanding ofthe network apaity is very poor even for very simple networks [1\u2104. Therefore, weare urrently unable to design protools whih reah the apaity of general wirelessnetworks. Hene, in order to get insight into this problem, we \u001crst have to deviseommuniation protools for very simple wireless networks, e.g., networks omprisedof one soure, one relay, and one destination, and then use the gained knowledgeto design protools for more omplex networks, e.g., networks omprised of multiplesoures, relays, and destinations. These protools should take into aount pratiallimitations suh as half-duplex (HD) reeption and transmission in HD relaying andself-interferene in full-duplex (FD) relaying, and ultimately, should be able the reahthe apaity of the underlaying networks. In the following, we brie\u001dy review the state1Chapter 1. Introdutionof the art in relay networks and motivate the work in this thesis.This hapter is organized as follows. In Setion 1.1, we brie\u001dy introdue the on-ept of ooperative networks. In Setion 1.2, we desribe the simplest HD ooperativenetwork, the two-hop HD relay network. In Setion 1.3, we motivate this thesis byreviewing some of the best known protools for the two-hop HD relay network andpresent their orresponding ahievable data rates and outage probabilities. In Se-tion 1.4, we summarize the ontributions made in this thesis. The thesis organizationis provided in Setion 1.5.1.1 Cooperative NetworksFor improving our understanding of the network apaity, it has long been realizedthat we have to move away from analyzing networks as a olletion of disonnetedpoint-to-point ommuniations, and fous our attention on analyzing networks asone system in whih all nodes mutually ooperate in order for the information \u001dowin the network to reah its fundamental limit, i.e., to reah the network apaity[1\u2104. Thereby, the network nodes must assist eah other by willingly ating as relaysand use their own resoures to forward the information of other nodes [2\u2104, [3\u2104. Inpartiular, when a soure (e.g., mobile phone) transmits a paket to a destination(e.g., base station) wirelessly, all surrounding nodes (e.g., other mobile phones) whihoverhear this paket, should proess it, and retransmit the proessed paket to theintended destination, thus helping in the transmission proess. It has been shownthat ooperation among the nodes of a network signi\u001cantly improves the data rateand\/or reliability of the network, and as a result, a host of ooperative tehniqueshave been proposed [2\u2104-[51\u2104. Due to the bene\u001cts of ooperation, it is expeted thatfuture wireless ommuniation systems will inlude some form of ooperation between2Chapter 1. Introdutionnetwork nodes. In fat, simple relaying shemes have been\/are being inluded in re-ent\/future wireless standards suh as the Worldwide Interoperability for MirowaveAess (WiMAX) and Long Term Evolution (LTE) Advaned standards [6\u2104, [49\u2104, [50\u2104.In ooperative wireless networks, eah relay node an perform reeption and trans-mission either in FD or HD mode [7\u2104. In the FD mode, the relay transmits and reeivesat the same time and in the same frequeny band, whereas in the HD mode, trans-mission and reeption our in the same frequeny band but not at the same timeor at the same time but in di\u001berent frequeny bands. Although ideal FD relayingahieves a higher data rate than HD relaying, given the limitations of urrent radioimplementations, ideal FD relaying is not possible due to strong self-interferene [7\u2104.More preisely, the transmit signal of an FD node onstitutes strong interferene forthe reeived signal at the same node, thus potentially preventing the FD node fromsuessfully deoding the reeived messages and thereby severely degrading its per-formane. Although reently there has been a lot of e\u001bort in developing FD nodeswhih an redue self-interferene [52\u2104, [53\u2104, it is still not possible to attenuate theself-interferene to a level whih makes it negligible [54\u2104. Therefore, HD relaying isstill a preferred hoie in pratie due to the muh simpler hardware implementationand the absene of self-interferene.In urrent HD relaying protools, reeption and transmission at the HD relaysis organized in two suessive time slots. In the \u001crst time slot, the relay reeivesdata transmitted by a soure, and in the seond time slot the relay forwards thereeived data to a destination. Suh \u001cxed sheduling of reeption and transmissionin HD relaying has beome a ommonly aepted priniple, i.e., it has almost beomean axiom. Researhers have long thought that the apaity limits of ooperative HDrelay networks an be obtained with \u001cxed sheduling of reeption and transmission at3Chapter 1. IntrodutionS R DFigure 1.1: The two-hop relay network omprised of a soure (S), a relay (R), and adestination (D). Sine there is no diret soure-destination link, the soure transmitsa message to the destination only via the relay.the relays [18\u2104. However, as we will show in this thesis, \u001cxed sheduling of reeptionand transmission at HD relays is not optimal and results in signi\u001cant performanelosses.1.2 The Two-Hop HD Relay ChannelGiven our urrent knowledge, we are still not able to design ommuniation pro-tools whih reah the apaity of general HD relay networks [1\u2104. Hene, in orderto inrease our knowledge, we have to \u001crst investigate ommuniation protools forvery simple HD relay networks. As a onsequene, in this thesis, we will investigateommuniation protools for the simplest HD relay network, shown in Fig. 1.1, whihwe refer to as the \u0010two-hop HD relay hannel\u0011 or as the \u0010two-hop HD relay network\u0011,interhangeably. The two-hop HD relay hannel onsists of a soure, a HD relay, anda destination, and there is no diret link between the soure and the destination.Due to the HD onstraint, the relay annot transmit and reeive at the same time.Moreover, sine there is no diret soure-destination link, the soure has to transmitits information to the destination via the relay. The network shown in Fig. 1.1 isnot only the simplest relay network, but is also the most basi building blok of anyooperative network. Therefore, by understanding how to improve the performaneof this network, we will get insight into how to improve the performane of generalHD relay networks. In the following, we motivate this thesis by providing a brief4Chapter 1. Introdutionoverview of previous results for the two-hop HD relay hannel.1.3 Motivation of the ThesisAlthough extensively investigated, the apaity of the two-hop HD relay hannel isnot fully known nor understood. In partiular, a apaity expression whih an beevaluated is not available and an expliit oding sheme whih ahieves the apaityis not known either. Hene, only oding shemes whih ahieve rates stritly lowerthan the apaity are known. To motivate this thesis, in the following, we brie\u001dyreview previous results for the data rate and the outage probability of the two-hopHD relay hannel in the absene and presene of fading.1.3.1 The Two-Hop HD Relay Channel Without FadingConsider the system model in Fig. 1.1. Assume that both the soure-relay and relay-destination links are general memoryless hannels whih are not a\u001beted by fading,i.e., the hannels' statistis do not hange with time. For this relay hannel, the sourewants to transmit a message via the HD relay to the destination in n hannel uses1with the largest possible data rate for whih the destination an reliably deode thetransmitted message. Currently, a oding sheme whih ahieves the largest knowndata rate is desribed in [18\u2104 and [48\u2104. In partiular, the ommuniation is performedin n \u2192 \u221e hannel uses and is organized in two suessive time slots. In the \u001crstand seond time slot the hannel is used n\u03be and n(1 \u2212 \u03be) times, respetively, where0 < \u03be < 1. In the \u001crst time slot, the soure transmits to the relay a odewordomprised of n\u03be symbols and with a rate equal to the apaity of the soure-relayhannel denoted by CSR. The relay deodes the reeived data, re-enodes it into a1A hannel use is equivalent to the duration of one symbol.5Chapter 1. Introdutionodeword omprised of n(1 \u2212 \u03be) symbols and with a rate equal to the apaity ofthe relay-destination hannel, denoted by CRD, and transmits it to the destination.Thereby, by optimizing \u03be for rate maximization, the following data rate is ahievedRconv =CSRCRDCSR + CRD. (1.1)As an be seen from the disussion above, this ommuniation protool has a\u001cxed sheduling of reeption and transmission at the relay. However, suh \u001cxedsheduling of reeption and transmission at the relay was shown to be suboptimalin [8\u2104. In partiular, in [8\u2104, it was shown that if the \u001cxed sheduling of reeptionand transmission at the HD relay is abandoned, then additional information anbe enoded in the relay's reeption and transmission swithing pattern whih wouldyield a data rate larger than (1.1). Moreover, it was argued in [8\u2104 that the data rateahieved with the enoding of information in the relay's reeption and transmissionswithing pattern would be the apaity of the two-hop HD relay hannel in theabsene of fading. However, the results for the apaity of the two-hop HD relayhannel in [8\u2104, as well in the literature, are inomplete. In partiular, a apaityexpression whih an be evaluated still has not been provided and an expliit odingsheme whih ahieves the apaity rate, or any rate larger than (1.1), is still notknown. Therefore, although expliit upper bounds on the apaity exists [8\u2104, it isstill unknown exatly how muh larger the apaity is ompared to the rate in (1.1).Motivated by the above disussion, in Chapter 2, we derive a new easy-to-evaluateexpression for the apaity of the two-hop HD relay hannel based on simplifyingpreviously derived onverse expressions. In ontrast to previous results, this apaityexpression an be easily evaluated. Moreover, we propose a oding sheme whih anahieve the apaity. In partiular, we show that ahieving the apaity requires the6Chapter 1. Introdutionrelay to swith between reeption and transmission in a symbol-by-symbol manner.Thereby, the relay does not only send information to the destination by transmittinginformation-arrying symbols but also with the zero symbol resulting from the relay'ssilene during reeption. Furthermore, we show that the apaity is signi\u001cantlyhigher than the rate in (1.1).1.3.2 The Two-Hop HD Relay Channel With FadingFor the onsidered HD relay network in Fig. 1.1, assume that both soure-relay andrelay-destination links are additive white Gaussian noise (AWGN) hannels a\u001betedby slow fading. Assume that the fading is a stationary and ergodi random proess.Moreover, assume that time is divided into N \u2192 \u221e time slots suh that duringone time slot the fading on both soure-relay and relay-destination links remainsonstant and hanges from one time slot to the next. Let CSR(i) and CRD(i) denotethe apaities of the soure-relay and relay-destination hannels in the i-th time slot,respetively. Furthermore, let C\u00afSR and C\u00afRD denote the average apaities of thesoure-relay and relay-destination hannels, respetively, given byC\u00afSR = E{CSR(i)}(a)= limN\u2192\u221e1NN\u2211i=1CSR(i) (1.2)C\u00afRD = E{CRD(i)}(a)= limN\u2192\u221e1NN\u2211i=1CRD(i), (1.3)where E{\u00b7} denotes expetation and (a) follows from the assumed ergodiity.For this network, in the following, we brie\u001dy review ommuniation protoolswhih ahieve the best known average data rate and the best known outage proba-bility, respetively.7Chapter 1. IntrodutionBest Known Data RateA ommuniation protool whih ahieves the highest known data rate for this net-work was proposed in [18\u2104. In partiular, the ommuniation is performed in N \u2192\u221etime slots. During one time slot, the hannel is used n \u2192 \u221e times. The proposedprotool in [18\u2104 is as follows. In the \u001crst N\u03be time slots, the soure transmits to theHD relay a odeword omprised of Nn\u03be symbols, where 0 < \u03be < 1, and with rateequal to the average apaity of the soure-relay hannel C\u00afSR. The relay deodesthe reeived data, re-enodes it into a odeword omprised on Nn(1 \u2212 \u03be) symbolsand with rate equal to the average apaity of the relay-destination hannel C\u00afRD andtransmits it to the destination. Thereby, by optimizing \u03be for rate maximization, thefollowing data rate is ahievedR\u00afconv,1 =C\u00afSRC\u00afRDC\u00afSR + C\u00afRD. (1.4)In order to ahieve the rate in (1.4), the destination has to wait for N \u2192\u221e timeslots before it an deode the reeived odeword. This may not be pratial for ahost of appliations. To redue the delay, and yet ahieve the same rate as (1.4), thefollowing protool an be used [51\u2104. Both soure and relay transmit odewords whihspan one time slot and are omprised of n \u2192 \u221e symbols. The relay is equippedwith an in\u001cnite size bu\u001ber. The ommuniation is performed in N \u2192 \u221e time slots,and is as follows. In eah time slot i, where 1 \u2264 i \u2264 \u03beN , the soure transmits tothe relay a odeword with rate CSR(i). The relay deodes the reeived odewords,stores the information in its bu\u001ber, and then sends the aumulated information tothe destination in the following (1 \u2212 \u03be)N slots. In partiular, in eah time slot i,where \u03beN + 1 \u2264 i \u2264 N , the relay transmits to the destination a odeword with rateCRD(i). By optimizing \u03be for rate maximization, the ahieved data rate is idential8Chapter 1. Introdutionto the one in (1.4). In this protool, the destination has to wait for \u03beN time slotsbefore it an start deoding the \u001crst reeived odeword. However, sine N \u2192\u221e, thisprotool may also be unpratial.To redue the delay even further, the following protool an be used [18\u2104. Theommuniation is performed in N \u2192\u221e time slots. In time slot i, the soure and relaytransmit odewords whih span \u03be(i) and 1\u2212 \u03be(i) frations of time slot i, respetively,and are omprised of \u03be(i)n and (1 \u2212 \u03be(i))n symbols, respetively, where n \u2192 \u221e. Inthe \u03be(i) fration of time slot i, the soure sends a odeword with rate CSR(i) to theHD relay. Then, in the remaining 1\u2212 \u03be(i) fration of time slot i, the relay re-enodesthe reeived information and sends it to the destination with rate CRD(i). As aresult, the overall rate transmitted from soure to destination during time slot i isR(i) = min{\u03be(i)CSR(i), (1\u2212 \u03be(i))CRD(i)}. By optimizing \u03be(i) for rate maximization,the following maximum rate is ahieved in time slot iR(i) = CSR(i)CRD(i)CSR(i) + CRD(i). (1.5)Thereby, during N \u2192\u221e time slots, the average rate ahieved with this ommunia-tion protool is given byR\u00afconv,2 = E{ CSR(i)CRD(i)CSR(i) + CRD(i)}. (1.6)Ahieving (1.6) requires the odeword lengths to be variable and adopted for eahfading state, whih may not be desirable in pratie. In that ase, the above protoolan be modi\u001ced by setting \u03be(i) = 1\/2, \u2200i, and thereby the following average rate anbe ahievedR\u00afconv,3 =12E {min{CSR(i), CRD(i)}} . (1.7)9Chapter 1. IntrodutionComparing (1.4), (1.6), and (1.7) we observe that R\u00afconv,1 \u2265 R\u00afconv,2 \u2265 R\u00afconv,3holds. However, to realize R\u00afconv,1 and R\u00afconv,2, an in\u001cnite delay and adaptive odewordlengths must be introdued, respetively.As seen from the disussion above, all four protools have a \u001cxed shedule of thereeption and transmissions at the relay. We refer to these protools as \u0010onventionalrelaying protools\u0011 throughout this thesis. To inrease the average data rate, inChapter 3, we develop a HD relaying protool in whih the HD relay adaptivelyhooses whether to reeive or transmit a odeword in a given time slot based onthe instantaneous qualities of the soure-relay and relay-destination links. This newapproah requires the relay to have a bu\u001ber, and therefore, the new protool is referredto as \u0010bu\u001ber-aided relaying with adaptive reeption-transmission\u0011. We will show thatbu\u001ber-aided relaying with adaptive reeption-transmission ahieves rates whih aresigni\u001cantly higher than the rates in (1.4), (1.6), and (1.7). In the following, webrie\u001dy desribe bu\u001ber-aided relaying with adaptive reeption-transmission and reviewprevious works on this subjet.Bu\u001ber-Aided Relaying With Adaptive Reeption-TransmissionBu\u001ber-aided relaying with adaptive reeption-transmission belongs to a lass of om-muniation protools for wireless HD relay networks where the HD relays use theirbu\u001bers to adaptively hoose whether to reeive or transmit a paket in a given timeslot based on the instantaneous qualities of their respetive reeiving and transmittinghannels.In onventional relaying protools, the relays employ a pre\u001cxed shedule of trans-mission and reeption, independent of the quality of the transmitting and reeivinghannels. This pre\u001cxed sheduling may lead to a signi\u001cant performane degrada-tion in wireless systems, where the quality of the transmitting and reeiving hannels10Chapter 1. Introdutionvaries with time, sine it may prevent the relays from exploiting the best transmittingand the best reeiving hannels. Clearly, performane ould be improved if the linkwith the higher quality ould be used in eah time slot. This an be ahieved viaa bu\u001ber-aided relaying protool whih does not have a pre\u001cxed shedule of reep-tion and transmission. In partiular, bu\u001ber-aided relaying with adaptive reeption-transmission an exploit the stronger of the reeiving and transmitting hannels ineah time slot, and thereby improve the performane.We devised the onept of bu\u001ber-aided relaying with adaptive reeption-transmis-sion in [55\u2104 and showed that signi\u001cant improvement of the average data rate andthe outage probability are possible ompared to onventional relaying. Later, in [56\u2104and [57\u2104 we investigated bu\u001ber-aided relaying with adaptive reeption-transmissionfor the two-hop HD relay network, and these two papers onstitute the basis of Chap-ters 3 and 4, respetively. The works in [55\u2104-[57\u2104 led to other extension. For example,bu\u001ber-aided relaying with adaptive reeption-transmission were also proposed for thetwo-hop HD relay network with bit interleaved oded modulation and orthogonalfrequeny division multiplexing in [58\u2104 and with statistial quality of servie on-straints in [59\u2104, for two-way relaying in [60\u2104-[63\u2104, for the HD relay hannel with adiret soure-destination link in [64\u2104, [65\u2104, for the multihop relay network in [66\u2104,[67\u2104, for two soure and two destination pairs sharing a single HD relay in [68\u2104, forseure ommuniation for two-hop HD relaying and HD relay seletion in [69\u2104 and[70\u2104, respetively, for amplify-and-forward relaying in [71\u2104, for energy harvesting in[72\u2104, for HD relay-seletion in [73\u2104-[75\u2104, and for hybrid FD\/HD in [76\u2104.In the following, we review HD relay protools for \u001cxed rate transmission.11Chapter 1. IntrodutionBest Known Outage ProbabilityFor the onsidered relay network in Fig. 1.1, assume that both soure and relay donot have hannel state information at the transmitter (CSIT) and therefore have totransmit odewords with a \u001cxed data rate R0. Moreover, assume that both soureand relay transmit odewords whih span one time slot and are omprised of n\u2192\u221esymbols. In this ase, a hannel apaity in the strit Shannon sense does not exist[77\u2104. In other words, not all transmitted odewords an be deoded at the respetivereeivers, and for the undeodable reeived odewords the system is said to be inoutage. An appropriate measure for suh systems is the outage probability whih isthe fration of undeodable odewords at the reeiver [77\u2104.For this senario, a ommuniation protool was proposed in [12\u2104 for the two-hopHD relay hannel. Thereby, the soure transmits odewords to the HD relay in oddtime slots, and the HD relay retransmits the reeived data to the destination in eventime slots. This protool, ahieves the following outage probabilityPout = Pr{CSR(i) < R0 OR CRD(i) < R0}, (1.8)where Pr{\u00b7} denotes probability. In this thesis, in Chapter 4, we will show that wean improve the outage probability in (1.8) signi\u001cantly, using a novel bu\u001ber-aidedrelaying protool with adaptive reeption-transmission spei\u001cally designed for \u001cxedrate transmission and improvement of the outage probability.1.4 Contributions of the ThesisThis thesis presents novel HD relaying protools for the two-hop HD relay hannel.In the following, we list the main ontributions of this thesis.12Chapter 1. Introdution1. We derive a new easy-to-evaluate expression for the apaity of the two-hopHD relay hannel in the absene of fading based on simplifying previously de-rived onverse expressions. Compared to previous results, this apaity expres-sion an be easily evaluated. Moreover, we propose a oding sheme whihan ahieve the apaity. In partiular, we show that ahieving the apaityrequires the relay to swith between reeption and transmission in a symbol-by-symbol manner. Thereby, the relay does not only send information to thedestination by transmitting information-arrying symbols but also with thezero symbol resulting from the relay's silene during reeption. As examples,we derive simpli\u001ced apaity expressions for the following two speial ases: 1)The soure-relay and relay-destination links are both binary-symmetri han-nels (BSCs); 2) The soure-relay and relay-destination links are both AWGNhannels. For these two ases, we numerially ompare the apaity with therate ahieved by onventional relaying where the relay reeives and transmitsin a odeword-by-odeword fashion and swithes between reeption and trans-mission in a stritly alternating manner. Our numerial results show that theapaity is signi\u001cantly larger than the rate ahieved with onventional relayingfor both the BSC and the AWGN hannel.2. For the two-hop HD relay hannel when both soure-relay and relay-destinationlinks are a\u001beted by fading, we propose a new relaying protool employing adap-tive reeption-transmission, i.e., in any given time slot, based on the hannelstate information of the soure-relay and the relay-destination links a deisionis made whether the relay should reeive or transmit. In order to avoid data lossat the relay, adaptive reeption-transmission requires the relay to be equippedwith a bu\u001ber suh that data an be queued until the relay-destination link13Chapter 1. Introdutionis seleted for transmission. We study both delay-unonstrained and delay-onstrained transmission. For the delay-unonstrained ase, we haraterizethe optimal adaptive reeption-transmission shedule, derive the orrespondingahievable rate, and develop an optimal power alloation sheme. For the delay-onstrained ase, we propose a modi\u001ced bu\u001ber-aided protool whih satis\u001ces aprede\u001cned average delay onstraint at the expense of a lower data rate. Ouranalytial and numerial results show that bu\u001ber-aided relaying with adaptivereeption-transmission with and without a delay onstraint ahieve signi\u001cantrate gains ompared to onventional relaying protools with and without bu\u001berswhere the relay employs a \u001cxed shedule for reeption and transmission.3. For the two-hop HD relay hannel when both the soure-relay and relay-destinat-ion links are a\u001beted by fading, we propose two new bu\u001ber-aided relayingshemes with di\u001berent requirements regarding the availability of CSIT. In the\u001crst sheme, neither the soure nor the relay have full CSIT, and onsequently,both nodes are fored to transmit with \u001cxed rates. In ontrast, in the se-ond sheme, the soure does not have full CSIT and transmits with \u001cxed ratebut the relay has full CSIT and adapts its transmission rate aordingly. Inthe absene of delay onstraints, for both \u001cxed rate and mixed rate transmis-sion, we derive the throughput-optimal bu\u001ber-aided relaying protools whihselet the relay to either reeive or transmit based on the instantaneous qual-ities of the soure-relay and relay-destination links. In addition, for the de-lay onstrained ase, we develop bu\u001ber-aided relaying protools with adaptivereeption-transmission that ahieve a prede\u001cned average delay. Compared toonventional relaying protools, the proposed bu\u001ber-aided protools with adap-tive reeption-transmission ahieve large performane gains. In partiular, for14Chapter 1. Introdution\u001cxed rate transmission, we show that the proposed protool ahieves a diver-sity gain of two as long as an average delay of more than three time slots anbe a\u001borded. In ontrast, onventional relaying protools ahieve a diversitygain of one. Furthermore, for mixed rate transmission with an average delayof E{T} time slots, a multiplexing gain of r = 1 \u2212 1\/(2E{T}) is ahieved.As a by-produt of the onsidered adaptive reeption-transmission protools,we also develop a novel onventional relaying protool for mixed rate trans-mission whih yields the same multiplexing gain as the protool with adaptivereeption-transmission. Hene, for mixed rate transmission, for su\u001eiently largeaverage delays, bu\u001ber-aided HD relaying with and without adaptive reeption-transmission does not su\u001ber from a multiplexing gain loss ompared to FDrelaying.1.5 Organization of the ThesisIn the following, we provide a brief overview of the remainder of this thesis.In Chapter 2, we derive the apaity of the two-hop HD relay hannel whenthe soure-relay and relay-destination links are not a\u001beted by fading. Thereby, we\u001crst formally de\u001cne the hannel model. Then, we introdue a new expression forthe apaity of the onsidered relay hannel, prove that it satis\u001ces the onverse,and introdue an expliit hannel oding sheme whih ahieves this apaity. Wealso investigate the apaity for the speial ases when the soure-relay and relay-destination links are both BSCs and AWGN hannels, respetively, and numeriallyompare the derived apaity expressions with the rate ahieved by onventionalrelaying.In Chapter 3, we introdue a novel relaying protool, whih we refer to as bu\u001ber-15Chapter 1. Introdutionaided relaying with adaptive reeption-transmission, for improving the average datarate of the two-hop HD relay hannel when the soure-relay and relay-destinationlinks are AWGN hannels a\u001beted by fading. Thereby, we \u001crst formally de\u001cne theonsidered system and hannel models. Then, we formulate optimization problemsfor maximization of the ahievable average rate of bu\u001ber-aided relaying with andwithout power alloation. From these optimization problems we derive the optimalbu\u001ber-aided relaying protools whih maximize the data rate. Sine these protoolsrequire unlimited delay, we also propose a heuristi bu\u001ber-aided relaying protoolwhih limits the average delay.In Chapter 4, we introdue novel bu\u001ber-aided relaying protools for improving theoutage probability of the two-hop HD relay hannel when the soure-relay and relay-destination links are AWGN hannels a\u001beted by fading. Thereby, we investigate twosystem models. In the \u001crst system, neither the soure nor the relay have full CSIT,and onsequently, both nodes are fored to transmit with \u001cxed rates. In ontrast,in the seond system model, the soure does not have full CSIT and transmits with\u001cxed rate but the relay has full CSIT and adapts its transmission rate aordingly.For both system models, we introdue bu\u001ber-aided relaying protools with adaptivereeption-transmission for delay unonstrained and delay onstrained transmission,respetively. The protools for delay unonstrained and delay onstrained transmis-sions are analyzed and onlusions are drawn.Chapter 5 summarizes the ontributions of this thesis and outlines areas of futureresearh.Appendies A - C ontain proofs of theorems and lemmas used in this thesis.16Chapter 2Capaity of the Two-HopHalf-Duplex Relay Channel in theAbsene of Fading2.1 IntrodutionThroughout this hapter, we assume that the two-hop HD relay hannel is not a\u001betedby fading, i.e., the statistis of the soure-relay and relay-destination hannels do nothange with time.The apaity of the two-hop FD relay hannel without self-interferene has beenderived in [5\u2104 (see the apaity of the degraded relay hannel). On the other hand,although extensively investigated, the apaity of the two-hop HD relay hannel isnot fully known nor understood. The reason for this is that a apaity expressionwhih an be evaluated is not available and an expliit oding sheme whih ahievesthe apaity is not known either. Currently, for HD relaying, detailed oding shemesexist only for rates whih are stritly smaller than the apaity, see [18\u2104 and [48\u2104. Toahieve the rates given in [18\u2104 and [48\u2104, the HD relay reeives a odeword in one timeslot, deodes the reeived odeword, and re-enodes and re-transmits the deodedinformation in the following time slot, see Setion 1.3.1 for more details. However,17Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingsuh \u001cxed swithing between reeption and transmission at the HD relay was shown tobe suboptimal in [8\u2104. In partiular, in [8\u2104, it was shown that if the \u001cxed sheduling ofreeption and transmission at the HD relay is abandoned, then additional informationan be enoded in the relay's reeption and transmission swithing pattern yieldingan inrease in data rate. In addition, it was shown in [8\u2104 that the HD relay hannelan be analyzed using the framework developed for the FD relay hannel in [5\u2104. Inpartiular, results derived for the FD relay hannel in [5\u2104 an be diretly applied tothe HD relay hannel. Thereby, using the onverse for the degraded relay hannel in[5\u2104, the apaity of the disrete memoryless two-hop HD relay hannel is obtained as[8\u2104, [9\u2104, [78\u2104C = maxp(x1,x2)min{I(X1; Y1|X2) , I(X2; Y2)}, (2.1)where I(\u00b7; \u00b7) denotes the mutual information, X1 and X2 are the inputs at soure andrelay, respetively, Y1 and Y2 are the outputs at relay and destination, respetively,and p(x1, x2) is the joint probability mass funtion (PMF) of X1 and X2. Moreover, itwas shown in [8\u2104, [9\u2104, [78\u2104 that X2 an be represented as X2 = [X \u20322, U ], where U is anauxiliary random variable with two outomes t and r orresponding to the HD relaytransmitting and reeiving, respetively. Thereby, (2.1) an be written equivalentlyasC = maxp(x1,x\u20322,u)min{I(X1; Y1|X \u20322, U) , I(X \u20322, U ; Y2)}, (2.2)where p(x1, x\u20322, u) is the joint PMF of X1, X \u20322, and U . However, the apaity expres-sions in (2.1) and (2.2), respetively, annot be evaluated sine it is not known howX1 and X2 nor X1, X \u20322, and U are mutually dependent, i.e., p(x1, x2) and p(x1, x\u20322, u)are not known. In fat, the authors of [78, page 2552\u2104 state that: \u0010Despite knowing18Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingthe apaity expression (i.e., expression (2.2)), its atual evaluation is elusive as itis not lear what the optimal input distribution p(x1, x\u20322, u) is.\u0011 On the other hand,for the oding sheme that would ahieve (2.1) and (2.2) if p(x1, x2) and p(x1, x\u20322, u)were known, it an be argued that it has to be a deode-and-forward strategy sinethe two-hop HD relay hannel belongs to the lass of the degraded relay hannelsde\u001cned in [5\u2104. Thereby, the HD relay should deode any reeived odewords, mapthe deoded information to new odewords, and transmit them to the destination.Moreover, it is known from [8\u2104 that suh a oding sheme requires the HD relay toswith between reeption and transmission in a symbol-by-symbol manner, and notin a odeword-by-odeword manner as in [18\u2104 and [48\u2104. However, sine p(x1, x2) andp(x1, x\u20322, u) are not known and sine an expliit oding sheme does not exist, it isurrently not known how to evaluate (2.1) and (2.2) nor how to enode additionalinformation in the relay's reeption and transmission swithing pattern and therebyahieve (2.1) and (2.2).Motivated by the above disussion, in this hapter, we derive a new expression forthe apaity of the two-hop HD relay hannel based on simplifying previously derivedonverse expressions. In ontrast to previous results, this apaity expression an beeasily evaluated. Moreover, we propose an expliit oding sheme whih ahieves theapaity. In partiular, we show that ahieving the apaity requires the relay indeedto swith between reeption and transmission in a symbol-by-symbol manner as pre-dited in [8\u2104. Thereby, the relay does not only send information to the destination bytransmitting information-arrying symbols but also with the zero symbols resultingfrom the relay's silene during reeption. In addition, we propose a modi\u001ced od-ing sheme for pratial implementation where the HD relay reeives and transmitsat the same time (i.e., as in FD relaying), however, the simultaneous reeption and19Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingtransmission is performed suh that the self-interferene is ompletely avoided. Asexamples, we ompute the apaities of the two-hop HD relay hannel for the aseswhen the soure-relay and relay-destination links are both binary-symmetri han-nels (BSCs) and additive white Gaussian noise (AWGN) hannels, respetively, andwe numerially ompare the apaities with the rates ahieved by onventional relay-ing where the relay reeives and transmits in a odeword-by-odeword fashion andswithes between reeption and transmission in a stritly alternating manner. Ournumerial results show that the apaities of the two-hop HD relay hannel for BSCand AWGN links are signi\u001cantly larger than the rates ahieved with onventionalrelaying.We note that the apaity of the two-hop HD relay hannel was also investigatedin [79\u2104 as a speial ase of the multi-hop HD relay hannel, but only for the ase whenall involved links are error-free BSCs.The rest of this hapter is organized as follows. In Setion 2.2, we present thehannel model. In Setion 2.3, we introdue a new expression for the apaity of theonsidered hannel, expliitly show the ahievability of the derived apaity, and provethat the new apaity expression satis\u001ces the onverse. In Setion 2.4, we investigatethe apaity for the ases when the soure-relay and relay-destination links are bothBSCs and AWGN hannels, respetively. In Setion 2.5, we numerially evaluate thederived apaity expressions and ompare them to the rates ahieved by onventionalrelaying. Finally, Setion 2.6 onludes the hapter.2.2 System ModelThe two-hop HD relay hannel onsists of a soure, a HD relay, and a destination,and the diret link between soure and destination is not available, see Fig. 2.1. Due20Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without FadingSource Relay Destinat.X1 X2Y1 Y2Figure 2.1: Two-hop relay hannel.to the HD onstraint, the relay annot transmit and reeive at the same time. In thefollowing, we formally de\u001cne the hannel model.2.2.1 Channel ModelThe disrete memoryless two-hop HD relay hannel is de\u001cned by X1, X2, Y1, Y2,and p(y1, y2|x1, x2), where X1 and X2 are the \u001cnite input alphabets at the enodersof the soure and the relay, respetively, Y1 and Y2 are the \u001cnite output alphabetsat the deoders of the relay and the destination, respetively, and p(y1, y2|x1, x2) isthe PMF on Y1 \u00d7 Y2 for given x1 \u2208 X1 and x2 \u2208 X2. The hannel is memorylessin the sense that given the input symbols for the i-th hannel use, the i-th outputsymbols are independent from all previous input symbols. As a result, the onditionalPMF p(yn1 , yn2 |xn1 , xn2 ), where the notation an is used to denote the ordered sequenean = (a1, a2, ..., an), an be fatorized as p(yn1 , yn2 |xn1 , xn2 ) =\u220fni=1 p(y1i, y2i|x1i, x2i).For the onsidered hannel and the i-th hannel use, let X1i and X2i denote therandom variables (RVs) whih model the input at soure and relay, respetively, andlet Y1i and Y2i denote the RVs whih model the output at relay and destination,respetively.In the following, we model the HD onstraint of the relay and disuss its e\u001bet onsome important PMFs that will be used throughout this hapter.21Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fading2.2.2 Mathematial Modelling of the HD ConstraintDue to the HD onstraint of the relay, the input and output symbols of the relayannot assume non-zero values at the same time. More preisely, for eah hanneluse, if the input symbol of the relay is non-zero then the output symbol has to bezero, and vie versa, if the output symbol of the relay is non-zero then the inputsymbol has to be zero. Hene, the following holdsY1i =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f3Y \u20321i if X2i = 00 if X2i 6= 0,(2.3)where Y \u20321i is an RV that take values from the set Y1.In order to model the HD onstraint of the relay more onveniently, we representthe input set of the relay X2 as the union of two sets X2 = X2R \u222a X2T , where X2Rontains only one element, the zero symbol, and X2T ontains all symbols in X2exept the zero symbol. Note that, beause of the HD onstraint, X2 has to ontainthe zero symbol. Furthermore, we introdue an auxiliary random variable, denotedby Ui, whih takes values from the set {t, r}, where t and r orrespond to the relaytransmitting a non-zero symbol and a zero symbol, respetively. Hene, Ui is de\u001cnedasUi =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f3r if X2i = 0t if X2i 6= 0.(2.4)Let us denote the probabilities of the relay transmitting a non-zero and a zero symbolfor the i-th hannel use as Pr{Ui = t} = Pr{X2i 6= 0} = PUi and Pr{Ui = r} =Pr{X2i = 0} = 1 \u2212 PUi, respetively. We now use (2.4) and represent X2i as a22Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingfuntion of the outome of Ui. Hene, we haveX2i =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f30 if Ui = rVi if Ui = t,(2.5)where Vi is an RV with distribution pVi(x2i) that takes values from the set X2T , orequivalently, an RV whih takes values from the set X2, but with pVi(x2i = 0) = 0.From (2.5), we obtainp(x2i|Ui = r) = \u03b4(x2i), (2.6)p(x2i|Ui = t) = pVi(x2i), (2.7)where \u03b4(x) = 1 if x = 0 and \u03b4(x) = 0 if x 6= 0. Furthermore, for the derivation ofthe apaity, we will also need the onditional PMF p(x1i|x2i = 0) whih is the inputdistribution at the soure when the relay transmits a zero (i.e., when Ui = r). Aswe will see in Theorem 2.1, the distributions p(x1i|x2i = 0) and pVi(x2i) have to beoptimized in order to ahieve the apaity. Using p(x2i|Ui = r) and p(x2i|Ui = t),and the law of total probability, the PMF of X2i, p(x2i), is obtained asp(x2i) = p(x2i|Ui = t)PUi + p(x2i|Ui = r)(1\u2212 PUi)(a)= pVi(x2i)PUi + \u03b4(x2i)(1\u2212 PUi), (2.8)where (a) follows from (2.6) and (2.7). In addition, we will also need the distributionof Y2i, p(y2i), whih, using the law of total probability, an be written asp(y2i) = p(y2i|Ui = t)PUi + p(y2i|Ui = r)(1\u2212 PUi). (2.9)23Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without FadingOn the other hand, using X2i and the law of total probability, p(y2i|Ui = r) an bewritten asp(y2i|Ui = r) =\u2211x2i\u2208X2p(y2i, x2i|Ui = r)=\u2211x2i\u2208X2p(y2i|x2i, Ui = r)p(x2i|Ui = r)(a)=\u2211x2i\u2208X2p(y2i|x2i, Ui = r)\u03b4(x2i) = p(y2i|x2i = 0, Ui = r)(b)= p(y2i|x2i = 0), (2.10)where (a) is due to (2.6) and (b) is the result of onditioning on the same variabletwie sine if X2i = 0 then Ui = r, and vie versa. On the other hand, using X2i andthe law of total probability, p(y2i|Ui = t) an be written asp(y2i|Ui = t) =\u2211x2i\u2208X2p(y2i, x2i|Ui = t) =\u2211x2i\u2208X2p(y2i|x2i, Ui = t)p(x2i|Ui = t)(a)=\u2211x2i\u2208X2Tp(y2i|x2i, Ui = t)pVi(x2i)(b)=\u2211x2i\u2208X2Tp(y2i|x2i)pVi(x2i), (2.11)where (a) follows from (2.7) and sine Vi takes values from set X2T , and (b) followssine onditioned on X2i, Y2i is independent of Ui. In (2.11), p(y2i|x2i) is the distri-bution at the output of the relay-destination hannel onditioned on the relay's inputX2i.2.2.3 Mutual Information and EntropyFor the apaity expression given later in Theorem 2.1, we need I(X1; Y1|X2 = 0),whih is the mutual information between the soure's input X1 and the relay's outputY1 onditioned on the relay having its input set to X2 = 0, and I(X2; Y2), whih is24Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingthe mutual information between the relay's input X2 and the destination's outputY2.The mutual information I(X1; Y1|X2 = 0) is obtained by de\u001cnition asI(X1; Y1|X2 = 0)=\u2211x1\u2208X1\u2211y1\u2208Y1p(y1|x1, x2 = 0)p(x1|x2 = 0) log2(p(y1|x1, x2 = 0)p(y1|x2 = 0)),(2.12)wherep(y1|x2 = 0) =\u2211x1\u2208X1p(y1|x1, x2 = 0)p(x1|x2 = 0). (2.13)In (2.12) and (2.13), p(y1|x1, x2 = 0) is the distribution at the output of the soure-relay hannel onditioned on the relay having its input set to X2 = 0, and onditionedon the input symbols at the soure X1.On the other hand, I(X2; Y2) is given byI(X2; Y2) = H(Y2)\u2212H(Y2|X2), (2.14)where H(Y2) is the entropy of RV Y2, and H(Y2|X2) is the entropy of Y2 onditionedon X2. The entropy H(Y2) an be found by de\u001cnition asH(Y2) = \u2212\u2211y2\u2208Y2p(y2) log2(p(y2))(a)= \u2212\u2211y2\u2208Y2[p(y2|U = t)PU + p(y2|U = r)(1\u2212 PU)]\u00d7 log2[p(y2|U = t)PU + p(y2|U = r)(1\u2212 PU)], (2.15)where (a) follows from (2.9). Now, inserting p(y2|U = r) and p(y2|U = t) given in25Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fading(2.10) and (2.11), respetively, into (2.15), we obtain the \u001cnal expression for H(Y2),asH(Y2) = \u2212\u2211y2\u2208Y2[PU\u2211x2\u2208X2Tp(y2|x2)pV (x2) + p(y2|x2 = 0)(1\u2212 PU)]\u00d7 log2[PU\u2211x2\u2208X2Tp(y2|x2)pV (x2) + p(y2|x2 = 0)(1\u2212 PU)]. (2.16)On the other hand, the onditional entropy H(Y2|X2) an be found based on itsde\u001cnition asH(Y2|X2) = \u2212\u2211x2\u2208X2p(x2)\u2211y2\u2208Y2p(y2|x2) log2(p(y2|x2))(a)= \u2212PU\u2211x2\u2208X2TpV (x2)\u2211y2\u2208Y2p(y2|x2) log2(p(y2|x2))\u2212 (1\u2212 PU)\u2211y2\u2208Y2p(y2|x2 = 0) log2(p(y2|x2 = 0)), (2.17)where (a) follows by inserting p(x2) given in (2.8). Inserting H(Y2) and H(Y2|X2)given in (2.16) and (2.17), respetively, into (2.14), we obtain the \u001cnal expressionfor I(X2; Y2), whih is dependent on p(x2), i.e., on pV (x2) and PU . To highlight thedependene of I(X2; Y2) with respet to PU , in the following, we write I(X2; Y2) asI(X2; Y2)\u2223\u2223PU.We are now ready to present the apaity of the onsidered hannel.2.3 CapaityIn this setion, we provide an easy-to-evaluate expression for the apaity of thetwo-hop HD relay hannel, an expliit oding sheme that ahieves the apaity, andprove that the new apaity expression satis\u001ces the onverse.26Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fading2.3.1 The CapaityA new expression for the apaity of the two-hop HD relay hannel is given in thefollowing theorem.Theorem 2.1. The apaity of the two-hop HD relay hannel is given byC = maxPUmin{maxp(x1|x2=0)I(X1; Y1|X2 = 0)(1\u2212 PU), maxpV (x2)I(X2; Y2)\u2223\u2223PU}, (2.18)where I(X1; Y1|X2 = 0)is given in (2.12) and I(X2; Y2) is given in (2.14)-(2.17).The optimal PU that maximizes the apaity in (2.18) is given by P \u2217U = min{P \u2032U , P \u2032\u2032U},where P \u2032U is the solution ofmaxp(x1|x2=0)I(X1; Y1|X2 = 0)(1\u2212 PU) = maxpV (x2)I(X2; Y2)\u2223\u2223PU, (2.19)where, if (2.19) has two solutions, then P \u2032U is the smaller of the two, and P \u2032\u2032U is thesolution of\u2202(maxpV (x2)I(X2; Y2)\u2223\u2223PU)\u2202PU= 0. (2.20)If P \u2217U = P \u2032U , the apaity in (2.18) simpli\u001ces toC = maxp(x1|x2=0)I(X1; Y1|X2 = 0)(1\u2212 P \u2032U) = maxpV (x2)I(X2; Y2)\u2223\u2223PU=P \u2032U, (2.21)whereas, if P \u2217U = P \u2032\u2032U , the apaity in (2.18) simpli\u001ces toC = maxpV (x2)I(X2; Y2)\u2223\u2223PU=P \u2032\u2032U= maxp(x2)I(X2; Y2), (2.22)whih is the apaity of the relay-destination hannel.27Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without FadingProof. The proof of the apaity given in (2.18) is provided in two parts. In the \u001crstpart, given in Setion 2.3.2, we show that there exists a oding sheme that ahievesa rate R whih is smaller, but arbitrarily lose to apaity C. In the seond part,given in Setion 2.3.3, we prove that any rate R for whih the probability of erroran be made arbitrarily small, must be smaller than apaity C given in (2.18). Therest of the theorem follows from solving (2.18) with respet to PU , and simplifyingthe result. In partiular, note that the \u001crst term inside the min{\u00b7} funtion in (2.18)is a dereasing funtion with respet to PU . This funtion ahieves its maximumfor PU = 0 and its minimum, whih is zero, for PU = 1. On the other hand, theseond term inside the min{\u00b7} funtion in (2.18) is a onave funtion with respet toPU . To see this, note that I(X2; Y2) is a onave funtion with respet to p(x2), i.e.,with respet to the vetor omprised of the probabilities p(x2), for x2 \u2208 X2, see [80\u2104.Now, sine 1 \u2212 PU is just the probability p(x2 = 0) and sine pV (x2) ontains therest of the probability onstrained parameters in p(x2), I(X2; Y2) is a jointly onavefuntion with respet to pV (x2) and PU . In [81, pp. 87-88\u2104, it is proven that if f(x, y)is a jointly onave funtion in both (x, y) and C is a onvex nonempty set, thenthe funtion g(x) = maxy\u2208Cf(x, y) is onave in x. Using this result, and noting thatthe domain of pV (x2) is spei\u001ced by the probability onstraints, i.e., by a onvexnonempty set, we an onlude that maxpV (x2)I(X2, Y2)\u2223\u2223PUis onave with respet to PU .Now, the maximization of the minimum of the dereasing and onave funtionswith respet to PU , given in (2.18), has a solution PU = P \u2032\u2032U , when the onavefuntion reahes its maximum, found from (2.20), and when for this point, i.e., forPU = P \u2032\u2032U , the dereasing funtion is larger than the onave funtion. Otherwise,the solution is PU = P \u2032U whih is found from (2.19) and in whih ase P \u2032U < P \u2032\u2032Uholds. If (2.19) has two solutions, then P \u2032U has to be the smaller of the two sine28Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fading...PSfrag replaements1 2 3 4 N N + 1k n = NkFigure 2.2: To ahieve the apaity in (2.18), transmission is organized in N + 1bloks and eah blok omprises k hannel uses.maxp(x1|x2=0)I(X1; Y1|X2 = 0)(1\u2212 PU) is a dereasing funtion with respet to PU . Now,when P \u2217U = P \u2032U , (2.19) holds and (2.18) simpli\u001ces to (2.21). Whereas, when P \u2217U = P \u2032\u2032U ,then maxpV (x2)I(X2; Y2)\u2223\u2223PU=P \u2032\u2032U= maxpV (x2)maxPUI(X2; Y2) = maxp(x2)I(X2; Y2), thereby leadingto (2.22).2.3.2 Ahievability of the CapaityIn the following, we desribe a method for transferring nR bits of information inn + k hannel uses, where n, k \u2192 \u221e and n\/(n + k) \u2192 1 as n, k \u2192 \u221e. As a result,the information is transferred at rate R. To this end, the transmission is arried outin N + 1 bloks, where N \u2192 \u221e. In eah blok, we use the hannel k times. Thenumbers N and k are hosen suh that n = Nk holds. The transmission in N + 1bloks is illustrated in Fig. 2.2.The soure transmits messageW , drawn uniformly frommessage set {1, 2, ..., 2nR},from the soure via the HD relay to the destination. To this end, before the start oftransmission, message W is spilt into N messages, denoted by w(1), ..., w(N), whereeah w(i), \u2200i, ontains kR bits of information. The transmission is arried out in thefollowing manner. In blok one, the soure sends message w(1) in k hannel uses tothe relay and the relay is silent. In blok i, for i = 2, ..., N , soure and relay sendmessages w(i) and w(i\u2212 1) to relay and destination, respetively, in k hannel uses.In blok N + 1, the relay sends message w(N) in k hannel uses to the destination29Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingand the soure is silent. Hene, in the \u001crst blok and in the (N + 1)-th blok therelay and the soure are silent, respetively, sine in the \u001crst blok the relay does nothave information to transmit, and in blok N+1, the soure has no more informationto transmit. In bloks 2 to N , both soure and relay transmit, while meeting theHD onstraint in every hannel use. Hene, during the N + 1 bloks, the hannel isused k(N + 1) times to send nR = NkR bits of information, leading to an overallinformation rate given bylimN\u2192\u221elimk\u2192\u221eNkRk(N + 1) = R bits\/use. (2.23)A detailed desription of the proposed oding sheme is given in the following,where we explain the rates, odebooks, enoding, and deoding used for transmission.Rates: The transmission rate of both soure and relay is denoted by R and givenbyR = C \u2212 \u01eb, (2.24)where C is given in Theorem 2.1 and \u01eb > 0 is an arbitrarily small number. Note thatR is a funtion of P \u2217U , see Theorem 2.1.Codebooks: We have two odebooks: The soure's transmission odebook andthe relay's transmission odebook.The soure's transmission odebook is generated by mapping eah possible binarysequene omprised of kR bits, where R is given by (2.24), to a odeword2 x1|romprised of k(1 \u2212 P \u2217U) symbols. The symbols in eah odeword x1|r are generatedindependently aording to distribution p(x1|x2 = 0). Sine in total there are 2kRpossible binary sequenes omprised of kR bits, with this mapping we generate 2kR2The subsript 1|r in x1|r is used to indiate that odeword x1|r is omprised of symbols whihare transmitted by the soure only when Ui = r, i.e., when X2i = 0.30Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingodewords x1|r eah ontaining k(1 \u2212 P \u2217U) symbols. These 2kR odewords form thesoure's transmission odebook, whih we denote by C1|r.The relay's transmission odebook is generated by mapping eah possible binarysequene omprised of kR bits, where R is given by (2.24), to a transmission odewordx2 omprised of k symbols. The i-th symbol, i = 1, ..., k, in odeword x2 is generatedin the following manner. For eah symbol a oin is tossed. The oin is suh that itprodues symbol r with probability 1\u2212 P \u2217U and symbol t with probability P \u2217U . If theoutome of the oin \u001dip is r, then the i-th symbol of the relay's transmission odewordx2 is set to zero. Otherwise, if the outome of the oin \u001dip is t, then the i-th symbolof odeword x2 is generated independently aording to distribution pV (x2). The 2kRodewords x2 form the relay's transmission odebook denoted by C2.The two odebooks are known at all three nodes.Enoding, Transmission, and Deoding: In the \u001crst blok, the soure mapsw(1) to the appropriate odeword x1|r(1) from its odebook C1|r. Then, odewordx1|r(1) is transmitted to the relay, whih is sheduled to always reeive and be silent(i.e., to set its input to zero) during the \u001crst blok. However, knowing that thetransmitted odeword from the soure x1|r(1) is omprised of k(1 \u2212 P \u2217U) symbols,the relay onstruts the reeived odeword, denoted by y1|r(1), only from the \u001crstk(1\u2212 P \u2217U) reeived symbols. In Appendix A.1 , we prove that odeword x1|r(1) sentin the \u001crst blok an be deoded suessfully from the reeived odeword at the relayy1|r(1) using a typial deoder [80\u2104 sine R satis\u001cesR < maxp(x1|x2=0)I(X1; Y1|X2 = 0)(1\u2212 P \u2217U). (2.25)In bloks i = 2, ..., N , the enoding, transmission, and deoding are performed asfollows. In bloks i = 2, ..., N , the soure and the relay map w(i) and w(i \u2212 1) to31Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingthe appropriate odewords x1|r(i) and x2(i) from odebooks C1|r and C2, respetively.Note that the soure also knows x2(i) sine x2(i) was generated from w(i\u2212 1) whihthe soure transmitted in the previous (i.e., (i \u2212 1)-th) blok. The transmission ofx1|r(i) and x2(i) an be performed in two ways: 1) by the relay swithing betweenreeption and transmission, and 2) by the relay always reeiving and transmitting asin FD relaying. We \u001crst explain the \u001crst option.Note that both soure and relay know the position of the zero symbols in x2(i).Hene, if the \u001crst symbol in odeword x2(i) is zero, then in the \u001crst symbol intervalof blok i, the soure transmits its \u001crst symbol from odeword x1|r(i) and the relayreeives. By reeiving, the relay atually also sends the \u001crst symbol of odewordx2(i), whih is the symbol zero, i.e., x21 = 0. On the other hand, if the \u001crst sym-bol in odeword x2(i) is non-zero, then in the \u001crst symbol interval of blok i, therelay transmits its \u001crst symbol from odeword x2(i) and the soure is silent. Thesame proedure is performed for the j-th hannel use in blok i, for j = 1, ..., k. Inpartiular, if the j-th symbol in odeword x2(i) is zero, then in the j-th hannel useof blok i the soure transmits its next untransmitted symbol from odeword x1|r(i)and the relay reeives. With this reeption, the relay atually also sends the j-thsymbol of odeword x2(i), whih is the symbol zero, i.e., x2j = 0. On the otherhand, if the j-th symbol in odeword x2(i) is non-zero, then for the j-th hanneluse of blok i, the relay transmits the j-th symbol of odeword x2(i) and the soureis silent. Note that odeword x2(i) ontains k(1 \u2212 P \u2217U) \u00b1 \u03b5(i) symbols zeros, where\u03b5(i) > 0. Due to the strong law of large numbers [80\u2104, limk\u2192\u221e\u03b5(i)\/k = 0 holds, whihmeans that for large enough k, the fration of symbols zeros in odeword x2(i) is1 \u2212 P \u2217U . Hene, for k \u2192 \u221e, the soure an transmit pratially all3 of its k(1 \u2212 P \u2217U)3When we say pratially all, we mean either all or all exept for a negligible frationlimk\u2192\u221e \u03b5(i)\/k = 0 of them.32Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingsymbols from odeword x1|r(i) during a single blok to the relay. Let y1|r(i) denotethe orresponding reeived odeword at the relay. In Appendix A.1, we prove thatthe odewords x1|r(i) sent in bloks i = 2, . . . , N an be deoded suessfully at therelay from the orresponding reeived odewords y1|r(i) using a typial deoder [80\u2104sine R satis\u001ces (2.25). Moreover, in Appendix A.1, we also prove that, for k \u2192\u221e,the odewords x1|r(i) an be suessfully deoded at the relay even though, for somebloks i = 2, ..., N , only k(1\u2212 P \u2217U)\u2212 \u03b5(i) symbols out of k(1\u2212 P \u2217U) symbols in ode-words x1|r(i) are transmitted to the relay. On the other hand, the relay sends theentire odeword x2(i), omprised of k symbols of whih a fration 1 \u2212 P \u2217U are zeros,to the destination. In partiular, the relay sends the zero symbols of odeword x2(i)to the destination by being silent during reeption, and sends the non-zero symbolsof odeword x2(i) to the destination by atually transmitting them. On the otherhand, the destination listens during the entire blok and reeives a odeword y2(i).In Appendix A.2 , we prove that the destination an suessfully deode x2(i) fromthe reeived odeword y2(i), and thereby obtain w(i\u2212 1), sine rate R satis\u001cesR < maxpV (x2)I(X2; Y2)\u2223\u2223\u2223PU=P \u2217U. (2.26)In a pratial implementation, the relay may not be able to swith between reep-tion and transmission in a symbol-by-symbol manner, due to pratial onstraintsregarding the speed of swithing. Instead, we may allow the relay to reeive andtransmit at the same time and in the same frequeny band similar to FD relaying.However, this simultaneous reeption and transmission is performed while avoid-ing self-interferene sine, in eah symbol interval, either the input or the outputinformation-arrying symbol of the relay is zero. This is aomplished in the follow-ing manner. The soure performs the same operations as for the ase when the relay33Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingswithes between reeption and transmission. On the other hand, the relay transmitsall symbols from x2(i) while ontinuously listening. Then, the relay disards fromthe reeived odeword, denoted by y1(i), those symbols for whih the orrespondingsymbols in x2(i) are non-zero, and only ollets the symbols in y1(i) for whih theorresponding symbols in x2(i) are equal to zero. The olleted symbols from y1(i)onstitute the relay's information-arrying reeived odeword y1|r(i) whih is used fordeoding. Codeword y1|r(i) is ompletely free of self-interferene sine the symbols iny1|r(i) were reeived in symbol intervals for whih the orresponding transmit symbolat the relay was zero.In the last (i.e., the (N +1)-th) blok, the soure is silent and the relay transmitsw(N) by mapping it to the orresponding odeword x2(i) from set C2. The relaytransmits all symbols in odeword x2(i) to the destination. The destination andeode the reeived odeword in blok N + 1 suessfully, sine (2.26) holds.Finally, sine both relay and destination an deode their respetive odewordsin eah blok, the entire message W an be deoded suessfully at the destinationat the end of the (N + 1)-th blok.Coding ExampleIn Fig. 2.3, we show an example for vetors x1|r, x1, y1, y1|r, x2, and y2, for k = 8and P \u2217U = 1\/2, where x1 ontains all k input symbols at the soure inluding thesilenes. From this example, it an be seen that x1 ontains zeros due to silenes forhannel uses for whih the orresponding symbol in x2 is non-zero. By omparing x1and x2 it an be seen that the HD onstraint is satis\u001ced for eah symbol duration.The blok diagram of the proposed oding sheme is shown in Fig. 2.4. In par-tiular, in Fig 2.4, we show shematially the enoding, transmission, and deodingat soure, relay, and destination. The \u001dow of enoding\/deoding in Fig. 2.4 is as34Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without FadingPSfrag replaementsx22 x23 x25 0 x28x11|rx11|rx12|rx12|rx13|rx13|rx14|ry11y11y14y14y16y16y17y12 y13 y15 y17 y180000000x14|rx2::x1:y1:x1|r:y1|r:y2: y21 y22 y23 y24 y25 y26 y27 y28Figure 2.3: Example of generated swithing vetor along with input\/output ode-words at soure, relay, and destination.PSfrag replaementsw(i\u2212 1)w(i\u2212 1)w(i\u2212 1) w(i)w(i) x1|r(i)x1(i) y1(i)y1|r(i)x2(i)x2(i)x2(i) y2(i)C1|rC2C2IS D1D2BChannel 1 Channel 2Source Relay DestinationFigure 2.4: Blok diagram of the proposed hannel oding protool for time slot i.The following notations are used in the blok diagram: C1|r and C2 are enoders, D1and D2 are deoders, I is an inserter, S is a seletor, B is a bu\u001ber, and w(i) denotesthe message transmitted by the soure in blok i.35Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingfollows. Messages w(i\u2212 1) and w(i) are enoded into x2(i) and x1|r(i), respetively,at the soure using the enoders C2 and C1|r, respetively. Then, an inserter I isused to reate the vetor x1(i) by inserting the symbols of x1|r(i) into the positionsof x1(i) for whih the orresponding elements of x2(i) are zeros and setting all othersymbols in x1(i) to zero. The soure then transmits x1(i). On the other hand, therelay, enodes w(i\u2212 1) into x2(i) using enoder C2. Then, the relay transmits x2(i)while reeiving y1(i). Next, using x2(i), the relay onstruts y1|r(i) from y1(i) byseleting only those symbols for whih the orresponding symbol in x2(i) is zero. Therelay then deodes y1|r(i), using deoder D1, into w(i) and stores the deoded bitsin its bu\u001ber B. The destination reeives y2(i), and deodes it using deoder D2, intow(i\u2212 1).2.3.3 Simpli\u001cation of Previous Converse ExpressionsAs shown in [8\u2104, the HD relay hannel an be analyzed with the framework developedfor the FD relay hannel in [5\u2104. Sine the onsidered two-hop HD relay hannelbelongs to the lass of degraded relay hannels de\u001cned in [5\u2104, the rate of this hannel,for some p(x1, x2), is upper bounded by [5\u2104, [8\u2104R \u2264 min{I(X1; Y1|X2), I(X2; Y2)}. (2.27)On the other hand, I(X1; Y1|X2)an be simpli\u001ced asI(X1; Y1|X2)= I(X1; Y1|X2 = 0)(1\u2212 PU) + I(X1; Y1|X2 6= 0)PU(a)= I(X1; Y1|X2 = 0)(1\u2212 PU), (2.28)36Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingwhere (a) follows from (2.3) sine when X2 6= 0, Y1 is deterministially zero therebyleading to I(X1; Y1|X2 6= 0)= 0. Inserting (2.28) into (2.27), we obtain that forsome p(x1, x2), the following holdsR \u2264 min{I(X1; Y1|X2 = 0)(1\u2212 PU) , I(X2; Y2)}. (2.29)Now, sine I(X1; Y1|X2 = 0)(1\u2212PU) is a funtion of p(x1|x2 = 0), and no other fun-tion inside the min{\u00b7} funtion in (2.29) is dependent on the distribution p(x1|x2 = 0),the right hand side of (2.29) and thereby the rate R an be upper bounded asR \u2264 min{maxp(x1|x2=0)I(X1; Y1|X2 = 0)(1\u2212 PU) , I(X2; Y2)}, (2.30)where maxp(x1|x2=0)I(X1; Y1|X2 = 0)exists sine the mutual information I(X1; Y1|X2 =0)is a onave funtion with respet to p(x1|x2 = 0). On the other hand, I(X2; Y2)is a funtion of p(x2) whih is given in (2.8) as a funtion of pV (x2) and PU . Hene,I(X2; Y2)is also a funtion of pV (x2) and PU . Now, sine in the right hand side of(2.30) only I(X2; Y2)is a funtion of pV (x2), and sine I(X2; Y2)is a onave funtionof pV (x2) (see proof of Theorem 2.1 for the proof of onavity), we an upper boundthe right hand side of (2.30) and obtain a new upper bound for the rate R asR \u2264 min{maxp(x1|x2=0)I(X1; Y1|X2 = 0)(1\u2212 PU) , maxpV (x2)I(X2; Y2)\u2223\u2223\u2223PU}. (2.31)Now, both the \u001crst and the seond term inside the min{\u00b7} funtion in (2.31) aredependent on PU . If we maximize (2.31) with respet to PU , we obtain a new upper37Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingbound for rate R asR \u2264 maxPUmin{maxp(x1|x2=0)I(X1; Y1|X2 = 0)(1\u2212 PU) , maxpV (x2)I(X2; Y2)\u2223\u2223\u2223PU}, (2.32)where the maximum with respet to PU exists sine the \u001crst and the seond terms in-side the min{\u00b7} funtion in (2.32) are monotonially dereasing and onave funtionswith respet to PU , respetively (see proof of Theorem 2.1 for proof of onavity).This onludes the proof that the new apaity expression in Theorem 2.1 satis\u001cesthe onverse.2.4 Capaity ExamplesIn the following, we evaluate the apaity of the onsidered relay hannel when thesoure-relay and relay-destination links are both BSCs and AWGN hannels, respe-tively.2.4.1 Binary Symmetri ChannelsAssume that the soure-relay and relay-destination links are both BSCs, where X1 =X2 = Y1 = Y2 = {0, 1}, with probability of error P\u03b51 and P\u03b52, respetively. Now,in order to obtain the apaity for this relay hannel, aording to Theorem 2.1, we\u001crst have to \u001cnd maxp(x1|x2=0)I(X1; Y1|X2 = 0)and maxpV (x2)I(X2; Y2). For the BSC, theexpression for maxp(x1|x2=0)I(X1; Y1|X2 = 0)is well known and given by [5\u2104maxp(x1|x2=0)I(X1; Y1|X2 = 0)= 1\u2212H(P\u03b51), (2.33)38Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingwhere H(P\u03b51) is the binary entropy funtion, whih for probability P is de\u001cned asH(P ) = \u2212P log2(P )\u2212 (1\u2212 P ) log2(1\u2212 P ). (2.34)The distribution that maximizes I(X1; Y1|X2 = 0)is also well known and given by[5\u2104p(x1 = 0|x2 = 0) = p(x1 = 1|x2 = 0) =12 . (2.35)On the other hand, for the BSC, the only symbol in the set X2T is symbol 1, whihRV V takes with probability one. In other words, pV (x2) is a degenerate distribution,given by pV (x2) = \u03b4(x2 \u2212 1). Hene,maxpV (x2)I(X2; Y2) = I(X2; Y2)\u2223\u2223\u2223pV (x2)=\u03b4(x2\u22121)(2.36)= H(Y2)\u2223\u2223\u2223pV (x2)=\u03b4(x2\u22121)\u2212H(Y2|X2)\u2223\u2223\u2223pV (x2)=\u03b4(x2\u22121). (2.37)For the BSC, the expression for H(Y2|X2) is independent of X2, and is given by [5\u2104H(Y2|X2) = H(P\u03b52). (2.38)On the other hand, in order to \u001cnd H(Y2)\u2223\u2223\u2223pV (x2)=\u03b4(x2\u22121)from (2.16), we need thedistributions of p(y2|x2 = 0) and p(y2|x2 = 1). For the BSC with probability of errorP\u03b52, these distributions are obtained asp(y2|x2 = 0) =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f31\u2212 P\u03b52 if y2 = 0P\u03b52 if y2 = 1,(2.39)39Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingandp(y2|x2 = 1) =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f3P\u03b52 if y2 = 01\u2212 P\u03b52 if y2 = 1.(2.40)Inserting (2.39), (2.40), and pV (x2) = \u03b4(x2\u22121) into (2.16), we obtainH(Y2)\u2223\u2223pV (x2)=\u03b4(x2\u22121)asH(Y2)\u2223\u2223pV (x2)=\u03b4(x2\u22121)= \u2212A log2(A)\u2212 (1\u2212 A) log2(1\u2212A), (2.41)whereA = P\u03b52(1\u2212 2PU) + PU . (2.42)Inserting (2.38) and (2.41) into (2.36), we obtain maxpV (x2)I(X2; Y2) asmaxpV (x2)I(X2; Y2) = \u2212A log2(A)\u2212 (1\u2212A) log2(1\u2212 A)\u2212H(P\u03b52). (2.43)We now have the two neessary omponents required for obtaining P \u2217U from (2.18),and thereby obtaining the apaity. This is summarized in the following orollary.Corollary 2.1. The apaity of the onsidered relay hannel with BSCs links is givenbyC = maxPUmin{(1\u2212H(P\u03b51))(1\u2212 PU),\u2212A log2(A)\u2212 (1\u2212 A) log2(1\u2212A)\u2212H(P\u03b52)}(2.44)40Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingand is ahieved withpV (x2) = \u03b4(x2 \u2212 1) (2.45)p(x1 = 0|x2 = 0) = p(x1 = 1|x2 = 0) = 1\/2. (2.46)There are two ases for the optimal P \u2217U whih maximizes (2.44). If PU found from4(1\u2212H(P\u03b51))(1\u2212 PU) = \u2212A log2(A)\u2212 (1\u2212 A) log2(1\u2212 A)\u2212H(P\u03b52) (2.47)is smaller than 1\/2, then the optimal P \u2217U whih maximizes (2.44) is found as thesolution to (2.47), and the apaity simpli\u001ces toC = (1\u2212H(P\u03b51))(1\u2212 P \u2217U) = \u2212A\u2217 log2(A\u2217)\u2212 (1\u2212A\u2217) log2(1\u2212A\u2217)\u2212H(P\u03b52),(2.48)where A\u2217 = A|PU=P \u2217U . Otherwise, if PU found from (2.47) is PU \u2265 1\/2, then theoptimal P \u2217U whih maximizes (2.44) is P \u2217U = 1\/2, and the apaity simpli\u001ces toC = 1\u2212H(P\u03b52). (2.49)Proof. The apaity in (2.44) is obtained by inserting (2.33) and (2.43) into (2.18).On the other hand, for the BSC, the solution of (2.20) is P \u2032\u2032U = 1\/2, whereas (2.19)simpli\u001ces to (2.47). Hene, using Theorem 2.1, we obtain that if P \u2032U \u2264 P \u2032\u2032U = 1\/2,then P \u2217U = P \u2032U , where P \u2032U is found from (2.47), in whih ase the apaity is given by(2.21), whih simpli\u001ces to (2.48) for the BSC. On the other hand, if P \u2032U > P \u2032\u2032U = 1\/2,then P \u2217U = P \u2032\u2032U = 1\/2, in whih ase the apaity is given by (2.22), whih simpli\u001ces4Solving (2.47) with respet to PU leads to a nonlinear equation, whih an be easily solvedusing e.g. Newton's method [82\u2104.41Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingto (2.49) for the BSC.2.4.2 AWGN ChannelsIn this subsetion, we assume that the soure-relay and relay-destination links areAWGN hannels, i.e., hannels whih are impaired by independent, real-valued, zero-mean AWGN with varianes \u03c321 and \u03c322, respetively. More preisely, the outputs atthe relay and the destination are given byYk = Xk +Nk, k \u2208 {1, 2}, (2.50)where Nk is a zero-mean Gaussian RV with variane \u03c32k, k \u2208 {1, 2}, with distributionpNk(z), k \u2208 {1, 2}, \u2212\u221e \u2264 z \u2264 \u221e. Moreover, assume that the symbols transmittedby the soure and the relay must satisfy the following average power onstraints5\u2211x1\u2208X1x21 p(x1|x2 = 0) \u2264 P1 and\u2211x2\u2208X2Tx22 pV (x2) \u2264 P2. (2.51)Obtaining the apaity for this relay hannel using Theorem 2.1, requires expressionsfor the funtions maxp(x1|x2=0)I(X1; Y1|X2 = 0)and maxpV (x2)I(X2; Y2) = maxpV (x2)[H(Y2) \u2212H(Y2|X2)]. For the AWGN hannel, the expressions for the mutual informationmaxp(x1|x2=0)I(X1; Y1|X2 = 0)and the entropy H(Y2|X2) are well known and given bymaxp(x1|x2=0)I(X1; Y1|X2 = 0)= 12 log2(1 + P1\u03c321)(2.52)H(Y2|X2) =12 log2(2\u03c0e\u03c322), (2.53)5If the optimal distributions p(x1|x2 = 0) and pV (x2) turn out to be ontinuous, the sums in(2.51) should be replaed by integrals.42Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingwhere, as is well known, for AWGN I(X1; Y1|X2 = 0) is maximized when p(x1|x2 =0) is the zero mean Gaussian distribution with variane P1. On the other hand,H(Y2|X2) is just the di\u001berential entropy of Gaussian RV N2, whih is independent ofp(x2), i.e., of pV (x2). Hene,maxpV (x2)I(X2; Y2) = maxpV (x2)H(Y2)\u221212 log2(2\u03c0e\u03c322)(2.54)holds and in order to \u001cnd maxpV (x2)I(X2; Y2) we only need to derive maxpV (x2)H(Y2). Now,in order to \u001cnd maxpV (x2)H(Y2), we \u001crst obtain H(Y2) using (2.16) and then obtain thedistribution pV (x2) whih maximizesH(Y2). Finding an expression forH(Y2) requiresthe distribution of p(y2|x2). This distribution is found using (2.50) asp(y2|x2) = pN2(y2 \u2212 x2). (2.55)Inserting (2.55) into (2.16), we obtain H(Y2) asH(Y2) = \u2212\u222b \u221e\u2212\u221e[PU\u2211x2\u2208X2TpN2(y2 \u2212 x2)pV (x2) + pN2(y2)(1\u2212 PU)]\u00d7 log2[PU\u2211x2\u2208X2TpN2(y2 \u2212 x2)pV (x2) + pN2(y2)(1\u2212 PU)]dy2, (2.56)where, sine p(y2|x2) is now a ontinuos probability density funtion, the summationin (2.16) with respet to y2 onverges to an integral as\u2211y2\u2192\u221e\u222b\u2212\u221edy2. (2.57)We are now ready to maximizeH(Y2) in (2.56) with respet to pV (x2). Unfortunately,obtaining the optimal pV (x2) whih maximizes H(Y2) in losed form is di\u001eult, if43Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingnot impossible. However, as will be shown in the following lemma, we still anharaterize the optimal pV (x2), whih is helpful for numerial alulation of pV (x2).Lemma 2.1. For the onsidered relay hannel where the relay-destination link is anAWGN hannel and where the input symbols of the relay must satisfy the averagepower onstraint given in (2.51), the distribution pV (x2) whih maximizes H(Y2) in(2.56) for a \u001cxed PU < 1 is disrete, i.e., it has the following formpV (x2) =K\u2211k=1pk\u03b4(x2 \u2212 x2k), (2.58)where pk is the probability that symbol x2 will take the value x2k, for k = 1, ..., K,where K \u2264 \u221e. Furthermore, pk and x2k given in (2.58), must satisfyK\u2211k=1pk = 1 andK\u2211k=1pkx22k = P2. (2.59)In the limiting ase when PU \u2192 1, distribution pV (x2) onverges to the zero-meanGaussian distribution with variane P2.Proof. Please see Appendix A.3.Remark 2.1. Unfortunately, there is no losed-form expression for distribution pV (x2)given in the form of (2.58), and therefore, a brute-fore searh has to be used in orderto \u001cnd x2k and pk, \u2200k.44Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without FadingNow, inserting (2.58) into (2.56) we obtain maxpV (x2)H(Y2) asmaxpV (x2)H(Y2) = \u2212\u221e\u222b\u2212\u221e(PUK\u2211k=1p\u2217kpN2(y2 \u2212 x\u22172k) + (1\u2212 PU)pN2(y2))\u00d7 log2(PUK\u2211k=1p\u2217kpN2(y2 \u2212 x\u22172k) + (1\u2212 PU)pN2(y2))dy2,(2.60)where p\u2217V (x2) =\u2211Kk=1 p\u2217k\u03b4(x2 \u2212 x\u22172k) is the distribution that maximizes H(Y2) in(2.56). Inserting (2.60) into (2.54), we obtain maxpV (x2)I(X2; Y2). Using (2.52) andmaxpV (x2)I(X2; Y2) in Theorem 2.1, we obtain the apaity of the onsidered relay hannelwith AWGN links. This is onveyed in the following orollary.Corollary 2.2. The apaity of the onsidered relay hannel where the soure-relayand relay-destination links are both AWGN hannels with noise varianes \u03c321 and \u03c322,respetively, and where the average power onstraints of the inputs of soure and relayare given by (2.51), is given byC = 12 log2(1 + P1\u03c321)(1\u2212 P \u2217U)(a)= \u2212\u221e\u222b\u2212\u221e(P \u2217UK\u2211k=1p\u2217kpN2(y2 \u2212 x\u22172k) + (1\u2212 P \u2217U)pN2(y2))\u00d7 log2(P \u2217UK\u2211k=1p\u2217kpN2(y2 \u2212 x\u22172k) + (1\u2212 P \u2217U)pN2(y2))dy2 \u221212 log2(2\u03c0e\u03c322),(2.61)where the optimal P \u2217U is found suh that equality (a) in (2.61) holds. The apaityin (2.61) is ahieved when p(x1|x2 = 0) is the zero-mean Gaussian distribution withvariane P1 and p\u2217V (x2) =\u2211Kk=1 p\u2217k\u03b4(x2\u2212x\u22172k) is a disrete distribution whih satis\u001ces45Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fading(2.59) and maximizes H(Y2) given in (2.60).Proof. The apaity in (2.61) is obtained by inserting (2.60) into (2.54), then inserting(2.54) and (2.52) into (2.18), and \u001cnally maximizing with respet to PU . For themaximization of the orresponding apaity with respet to PU , we note that P \u2032U <P \u2032\u2032U = 1 always holds. Hene, the apaity is given by (2.21), whih for the Gaussianase simpli\u001ces to (2.61). To see that P \u2032\u2032U = 1, note the relay-destination hannel isan AWGN hannel for whih the mutual information is maximized when p(x2) is aGaussian distribution. From (2.8), we see that p(x2) beomes a Gaussian distributionif and only if PU = 1 and pV (x2) also assumes a Gaussian distribution.2.5 Numerial ExamplesIn this setion, we numerially evaluate the apaities of the onsidered HD relayhannel when the soure-relay and relay-destination links are both BSCs and AWGNhannels, respetively. As a performane benhmark, we use the maximal ahievablerate of onventional relaying [48\u2104. Thereby, the soure transmits to the relay oneodeword with rate maxp(x1|x2=0)I(X1; Y1|X2 = 0)in 1 \u2212 PU fration of the time, where0 < PU < 1, and in the remaining fration of time, PU , the relay retransmits thereeived information to the destination with rate maxp(x2)I(X2; Y2), see [18\u2104 and [48\u2104.The optimal PU , is found suh that the following holdsRconv = maxp(x1|x2=0)I(X1; Y1|X2 = 0)(1\u2212 PU) = maxp(x2)I(X2; Y2)PU . (2.62)46Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without FadingEmploying the optimal PU obtained from (2.62), the maximal ahievable rate ofonventional relaying an be written asRconv =maxp(x1|x2=0)I(X1; Y1|X2 = 0)\u00d7maxp(x2)I(X2; Y2)maxp(x1|x2=0)I(X1; Y1|X2 = 0)+ maxp(x2)I(X2; Y2). (2.63)2.5.1 BSC LinksFor simpliity, we assume symmetri links with P\u03b51 = P\u03b52 = P\u03b5. As a result, P \u2217U < 1\/2in Corollary 2.1 and the apaity is given by (2.48). This apaity is plotted inFig. 2.5, where P \u2217U is found from (2.47) using a mathematial software pakage, e.g.Mathematia. As a benhmark, in Fig. 2.5, we also show the maximal ahievablerate using onventional relaying, obtained by insertingmaxp(x1|x2=0)I(X1; Y1|X2 = 0)= maxp(x2)I(X2; Y2) = 1\u2212H(P\u03b5) (2.64)into (2.63), where H(P\u03b5) is given in (2.34) with P = P\u03b5. Thereby, the following rateis obtainedRconv =12(1\u2212H(P\u03b5)). (2.65)As an be seen from Fig. 2.5, when both links are error-free, i.e., P\u03b5 = 0, onventionalrelaying ahieves 0.5 bits\/hannel use, whereas the apaity is 0.77291, whih is 54%larger than the rate ahieved with onventional relaying. This value for the apaityan be obtained by inserting P\u03b51 = P\u03b52 = 0 in (2.47), and thereby obtainC = 1\u2212 P \u2217U(a)= H(P \u2217U). (2.66)47Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fading0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 100.10.20.30.40.50.60.70.8P\u03b5Rate(bits\/use)  CapacityConventional relayingFigure 2.5: Comparison of rates for the BSC as a funtion of the error probabilityP\u03b51 = P\u03b52 = P\u03b5.Solving (a) in (2.66) with respet to P \u2217U and inserting the solution for P \u2217U bak into(2.66), yields C = 0.77291. We note that this value was \u001crst reported in [9, page327\u2104.2.5.2 AWGN LinksFor the AWGN ase, the apaity is evaluated based on Corollary 2.2. However, sinefor this ase the optimal input distribution at the relay p\u2217V (x2) is unknown, i.e., thevalues of p\u2217k and x\u22172k in (2.61) are unknown, we have performed a brute fore searh forthe values of p\u2217k and x\u22172k whih maximize (2.61). Two examples of suh distributions6are shown in Fig. 2.6 for two di\u001berent values of the SNR P1\/\u03c321 = P2\/\u03c322. Sinewe do not have a proof that the distributions obtained via brute-fore searh areatually the exat optimal input distributions at the relay that ahieve the apaity,the rates that we obtain, denoted by CL, are lower than or equal to the atual6Note that these distributions resemble a disrete, Gaussian shaped distribution with a gaparound zero.48Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fading\u221220 \u221210 0 10 2000.10.20.30.4x2kp k  p(x2|t) for 10 dBp(x2|t) for 15 dBFigure 2.6: Example of proposed input distributions at the relay pV (x2).apaity. These rates are shown in Figs. 2.7 and 2.8, for symmetri links and non-symmetri links, respetively, where we set P1\/\u03c321 = P2\/\u03c322 and P1\/\u03c321\/10 = P2\/\u03c322,respetively. We note that for the results in Fig. 2.7, for P1\/\u03c321 = P2\/\u03c322 = 10 dB andP1\/\u03c321 = P2\/\u03c322 = 15 dB, we have used the input distributions at the relay shown inFig. 2.6. In partiular, for P1\/\u03c321 = P2\/\u03c322 = 10 dB we have used the following valuesfor p\u2217k and x\u22172kp\u2217k = [0.35996, 0.11408, 2.2832\u00d7 10\u22122, 2.88578\u00d7 10\u22123, 2.30336\u00d7 10\u22124,1.16103\u00d7 10\u22125, 3.69578\u00d7 10\u22127],x\u22172k = [2.62031, 3.93046, 5.24061, 6.55077, 7.86092, 9.17107, 10.4812],and for P1\/\u03c321 = P2\/\u03c322 = 15 dB we have usedp\u2217k = [0.212303, 0.142311, 8.12894\u00d710\u22122, 3.95678\u00d710\u22122, 1.64121\u00d710\u22122, 5.80092\u00d710\u221231.7472\u00d710\u22123, 4.48438\u00d710\u22124, 9.80788\u00d710\u22125, 1.82793\u00d710\u22125, 2.90308\u00d710\u22126, 3.92889\u00d710\u22127],x\u22172k = [3.40482, 5.10724, 6.80965, 8.51206, 10.2145, 11.9169, 13.6193, 15.3217,17.0241, 18.7265, 20.4289, 22.1314].The above values of p\u2217k and x\u22172k are only given for x\u22172k > 0, sine the values of p\u2217k andx\u22172k when x\u22172k < 0 an be found from symmetry, see Fig. 2.6.49Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fading\u221210 \u22125 0 5 10 15 20 25 3000.511.522.53P1\/\u03c321 = P2\/\u03c322 (in dB)Rate(bits\/use)  CLRGaussRconvUnachievable bound from [8] and [78]Figure 2.7: Soure-relay and relay destination links are AWGN hannels with P1\/\u03c321 =P2\/\u03c322.\u221210 \u22125 0 5 10 15 20 25 3000.511.522.533.5P1\/\u03c321\/10 = P2\/\u03c322 (in dB)  Rate(bits\/use)CLRGaussRconvUnachievable bound from [8] and [78]Figure 2.8: Soure-relay and relay destination links are AWGN hannels withP1\/\u03c321\/10 = P2\/\u03c322 .50Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without FadingIn Figs. 2.7 and 2.8, we also show the rate ahieved when instead of an optimaldisrete input distribution at the relay p\u2217V (x2), f. Lemma 2.1, we use a ontinuous,zero-mean Gaussian distribution with variane P2. Thereby, we obtain the followingrateRGauss =12 log2(1 + P1\u03c321)(1\u2212 PU)(a)= \u2212\u221e\u222b\u2212\u221e(PU pG(y2) + (1\u2212 PU)pN2(y2))\u00d7 log2(PU pG(y2) + (1\u2212 PU)pN2(y2))dy2 \u221212 log2(2\u03c0e\u03c322),(2.67)where PU is found suh that equality (a) holds and pG(y2) is a ontinuous, zero-meanGaussian distribution with variane P2 +\u03c322 . From Figs. 2.7 and 2.8, we an see thatRGauss \u2264 CL, whih was expeted from Lemma 2.1. However, the loss in performaneaused by the Gaussian inputs is moderate, whih suggests that the performanegains obtained by the proposed protool are mainly due to the exploitation of thesilent (zero) symbols for onveying information from the HD relay to the destinationrather than the optimization of pV (x2).As benhmark, in Figs. 2.7 and 2.8, we have also shown the maximal ahievablerate using onventional relaying, obtained by insertingmaxp(x1|x2=0)I(X1; Y1|X2 = 0, U = r)= 12 log2(1 + P1\u03c321)(2.68)andmaxpV (x2)I(X2; Y2|U = t) =12 log2(1 + P2\u03c322)(2.69)51Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadinginto (2.63), whih yieldsRconv =12log2(1 + P1\u03c321)log2(1 + P2\u03c322)log2(1 + P1\u03c321)+ log2(1 + P2\u03c322) . (2.70)Comparing the rates CL and Rconv in Figs. 2.7 and 2.8, we see that for 10 dB \u2264P2\/\u03c322 \u2264 30 dB, CL ahieves 3 to 6 dB gain ompared to Rconv. Hene, large per-formane gains are ahieved using the proposed apaity protool even if suboptimalinput distributions at the relay are employed.Finally, as additional benhmark in Figs. 2.7 and 2.8, we show the unahievableupper bounds reported in [8\u2104 and [78\u2104, given byCUpper = maxPU min{12 log2(1 + P1\u03c321)(1\u2212 PU) ,12 log2(1 + P2\u03c322)PU +H(PU)}.(2.71)As an be seen from Figs. 2.7 and 2.8, this bound is loose for low SNRs but beomestight for high SNRs.2.6 ConlusionWe have derived an easy-to-evaluate expression for the apaity of the two-hop HDrelay hannel without fading based on simplifying previously derived onverse ex-pressions. Moreover, we have proposed an expliit oding sheme whih ahievesthe apaity. In partiular, we showed that the apaity is ahieved when the re-lay swithes between reeption and transmission in a symbol-by-symbol manner andwhen additional information is sent by the relay to the destination using the zerosymbol impliitly sent by the relay's silene during reeption. Furthermore, we haveevaluated the apaity for the ases when both links are BSCs and AWGN hannels,52Chapter 2. Capaity of the Two-Hop Half-Duplex Relay Channel Without Fadingrespetively. From the numerial examples, we have observed that the apaity ofthe two-hop HD relay hannel is signi\u001cantly higher than the rates ahieved withonventional relaying protools.53Chapter 3Bu\u001ber-Aided Relaying With AdaptiveReeption-Transmission: AdaptiveRate Transmission3.1 IntrodutionThe apaity of the two-hop HD relay network when the soure-relay and relay-destination links are AWGN hannels a\u001beted by fading is not known, and onlyahievable rates have been reported in the literature so far, see Setion 1.3.2. In thishapter, we present new ahievable average rates for this network whih are largerthan the best known average rates. These new average rates are ahieved with abu\u001ber-aided relaying protool with adaptive reeption-transmission.In this hapter, we onsider bu\u001ber-aided relaying with adaptive reeption-transmis-sion for the two-hop HD relay network when the soure-relay and relay-destinationlinks are AWGN hannels a\u001beted by fading. In partiular, in any given time slot,based on the hannel state information (CSI) of the soure-relay and the relay-destination link a deision is made on whether the relay transmits or reeives. Forthe two-hop HD relay network, this is equivalent to seleting either the soure-relayor relay-destination link for transmission in a given time slot, i.e., equivalent to54Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionlink seletion. We onsider the ases of delay-unonstrained and delay-onstrainedtransmission. For the delay-unonstrained ase, we optimize the adaptive reeption-transmission protool and the power alloated to the soure and the relay for datarate maximization. Interestingly, the optimal adaptive reeption-transmission poliyrequires only knowledge of the instantaneous CSI of the onsidered time slot andthe statistial CSI of the involved links. However, the instantaneous CSI of pastand future time slots and the state of the relay's bu\u001ber are not required for opti-mal reeption-transmission. For the delay-onstrained ase, we propose a heuristibu\u001ber-aided protool with adaptive reeption-transmission whih limits the averagedelay and ahieves a rate lose to the rate ahieved without a delay onstraint. Thisprotool only requires the instantaneous CSI of both links, and an be easily imple-mented in real-time. Our analytial and simulation results show, in good agreement,that bu\u001ber-aided relaying with adaptive reeption-transmission an ahieve signif-iant performane gains ompared to onventional relaying with or without bu\u001ber[51\u2104, [18\u2104, as long as a ertain delay an be tolerated.The remainder of the hapter is organized as follows. In Setion 3.2, the onsid-ered system and hannel models are presented. The proposed adaptive reeption-transmission protool for bu\u001ber-aided relaying is introdued in Setion 3.3, and opti-mized for rate maximization and power alloation in Setions 3.4 and 3.5, respetively.In Setion 3.6, we propose an adaptive reeption-transmission protool that limits thedelay. Numerial results are presented in Setion 3.7, and some onlusions are drawnin Setion 3.8.55Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissions(i) r(i)S R DFigure 3.1: The two-hop HD relay network with fading on the S-R and R-D links.s(i) and r(i) are the instantaneous SNRs of the S-R and R-D links in the ith timeslot, respetively.3.2 System ModelWe onsider the two-hop HD relay network shown in Fig. 3.1. For simpliity of presen-tation, in this and the following hapter, we denote the soure, relay, and destinationby S, R, and D, respetively, and the soure-relay and relay-destination links by S-Rand R-D links, respetively. We assume that the HD relay is equipped with an unlim-ited bu\u001ber. The soure sends odewords to the relay, whih deodes these odewords,possibly stores the information in its bu\u001ber, and eventually sends the information tothe destination. Throughout this hapter, we assume that the S-R and R-D linksare AWGN hannels a\u001beted by fading and that the soure has always data to trans-mit. We assume that time is divided into N \u2192 \u221e slots of equal lengths. In the ithtime slot, the transmit powers of soure and relay are denoted by PS(i) and PR(i),respetively, and the instantaneous (squared) hannel gains of the S-R and R-D linksare denoted by hS(i) and hR(i), respetively. The hannel gains hS(i) and hR(i) aremodeled as mutually independent, non-negative, stationary, ergodi, and ontinuousrandom proesses with expeted values E{hS(i)} , \u2126\u00afSR and E{hR(i)} , \u2126\u00afRD. Weassume slow fading suh that the hannel gains are onstant during one time slotbut hange from one time slot to the next due to e.g. the mobility of the involvednodes and\/or frequeny hopping. The instantaneous link SNRs of the S-R and R-Dhannels in the ith time slot are given by s(i) , \u03b3S(i)hS(i) and r(i) , \u03b3R(i)hR(i),respetively. Here, \u03b3S(i) = PS(i)\/\u03c32nR and \u03b3R(i) = PR(i)\/\u03c32nD denote the transmit56Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate TransmissionSNRs without fading of the soure and the relay, respetively, and \u03c32nR and \u03c32nD arethe varianes of the omplex AWGN at the relay and the destination, respetively.The average SNRs reeived at relay and destination are denoted by \u2126SR , E{s(i)}and \u2126RD , E{r(i)}, respetively. Throughout this hapter, we assume transmissionwith apaity ahieving odes. Hene, the transmitted odewords by soure and relayspan one time slot, are omprised of n \u2192 \u221e omplex symbols whih are generatedindependently aording to the zero-mean omplex irular-invariant Gaussian dis-tribution. In time slot i, the variane of soure's and relay's odewords are PS(i) andPR(i), and their data rate will be determined in the following setion.In the following, we outline the general bu\u001ber-aided adaptive reeption-transmis-sion protool.3.3 Preliminaries and Benhmark ShemesIn this setion, we desribe the general bu\u001ber-aided adaptive reeption-transmissionprotool for the two-hop HD rely network. Later, we optimize the general bu\u001ber-aidedadaptive reeption-transmission protool for average rate maximization and therebyobtain the proposed bu\u001ber-aided protool.3.3.1 Adaptive Reeption-Transmission Protool and CSIRequirementsThe general bu\u001ber-aided adaptive reeption-transmission protool is as follows. Atthe beginning of eah time slot, the relay deides to either reeive a odeword fromthe soure or to transmit a odeword to the destination, i.e., whether to selet theS-R or R-D link for transmission in a given time slot i. One the relay makes the57Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissiondeision, it broadasts its deision7to the other nodes before transmission in timeslot i begins. If they are seleted for transmission, the soure and the relay transmitodewords spanning one time slot with rates whih are adapted to the apaity oftheir respetive links. For seletion of the reeption-transmission and of the rateadaptation, the nodes require CSI knowledge as will be detailed in the following.CSI requirements: The relay node requires knowledge of the instantaneous hannelgains hS(i) and hR(i) in order to make the deision of whether it should reeive ortransmit. In addition, if the S-R link is seleted for transmission, the soure requiresknowledge of hS(i) in order to adapt the rate of its odeword. On the other hand, ifthe R-D link is seleted for transmission, the relay the destination requires knowledgeof hR(i) for deoding. In a given time slot i, this CSI an be obtained by three pilotsymbol transmissions, one from soure and destination, respetively, and one fromthe relay. Furthermore, we assume that the noise variane \u03c32nR is known at soureand relay, and that the noise variane \u03c32nD is known at relay and destination.3.3.2 Transmission Rates and Queue DynamisIn the following, we de\u001cne the rates of the odewords transmitted by the soure andrelay in a given time slot i, and determine the state of the queue at the bu\u001ber of therelay.Soure transmits relay reeives: If the soure is seleted for transmission intime slot i, it transmits one odeword with rateSSR(i) = log2(1 + s(i)). (3.1)7The deision ontains an information of one bit whih is: should relay reeive or transmit intime slot i.58Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate TransmissionHene, the relay reeives SSR(i) bits\/symb from the soure and appends them to thequeue in its bu\u001ber. The number of bits\/symb in the bu\u001ber of the relay at the end oftime slot i is denoted by Q(i) and given byQ(i) = Q(i\u2212 1) + SSR(i). (3.2)Relay transmits destination reeives: If the relay transmits in time slot i,the number of bits\/symb transmitted by the relay is given byRRD(i) = min{log2(1 + r(i)), Q(i\u2212 1)}, (3.3)where we take into aount that the maximal number of bits\/symb that an be sendby the relay is limited by the number of bits\/symb in its bu\u001ber and the instantaneousapaity of the R-D link. The number of bits\/symb remaining in the bu\u001ber at theend of time slot i is given byQ(i) = Q(i\u2212 1)\u2212 RRD(i), (3.4)whih is always non-negative beause of (3.3).Beause of the HD onstraint, we have RRD(i) = 0 when the soure transmitsand the relay reeives, and we have SSR(i) = 0 when the relay transmits.In the following, we determine the average data rate reeived at the destinationduring N \u2192\u221e time slots.59Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmission3.3.3 Ahievable Average RateSine we assume the soure has always data to transmit, the average number ofbits\/symb that arrive at the destination per time slot is given byR\u00afSD = limN\u2192\u221e1NN\u2211i=1RRD(i), (3.5)i.e., R\u00afSD is the ahievable average rate of the onsidered ommuniation system.The main goal in this hapter is the maximization of R\u00afSD by optimizing the relay'sreeption and transmission in eah time slot and the transmit power alloated tosoure and relay.3.3.4 Conventional RelayingFor omparison purpose, we provide the ahievable average rate of two baselineshemes and provide the CSI requirements. Thereby, we assume that the transmitpowers at the soure and the relay are \u001cxed, i.e., PS(i) = PS, PR(i) = PR, \u2200i.Conventional Relaying With Bu\u001ber [18\u2104, [51\u2104In onventional relaying with bu\u001ber as proposed in [18\u2104, [51\u2104, the relay reeives datafrom the soure in the \u001crst \u03beN time slots, where 0 < \u03be < 1, and sends this umulativeinformation to the destination in the next (1 \u2212 \u03be)N slots, where N \u2192 \u221e. Theorresponding ahievable average rate is given in (1.4), where after setting E{log2(1+s(i))} = C\u00afSR and E{log2(1 + r(i))} = C\u00afRD, we obtain the following rateR\u00afconv,1 =E{log2(1 + s(i))}E{log2(1 + r(i))}E{log2(1 + s(i))}+ E{log2(1 + r(i))}. (3.6)CSI Requirements: In order to ahieve (3.6) using onventional relaying with60Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionbu\u001ber as proposed [51\u2104, the soure and relay have to aquire the CSI of the soure-relay link in the \u001crst \u03beN time slots, and the relay and destination have to aquirethe CSI of the relay-destination link in the following (1 \u2212 \u03be)N time slot. Thereby,two pilot symbol transmissions are required per time slot. Compared to bu\u001ber-aidedrelaying with adaptive reeption-transmission, this protool requires one pilot symboltransmission less.Conventional Relaying Without Bu\u001berThe ahievable average rate of onventional relaying without bu\u001ber, where the relayreeives a odeword in \u03be(i) fration of time slot i and transmits the reeived infor-mation in the remaining 1 \u2212 \u03be(i) fration of time slot i, where 0 < \u03be(i) < 1, is givenin (1.6). After setting log2(1+ s(i)) = CSR(i) and log2(1+ r(i)) = CRD(i), we obtainfrom (1.6) the following average data rateR\u00afconv,2 = E{ log2(1 + s(i))\u00d7 log2(1 + r(i))log2(1 + s(i)) + log2(1 + r(i))}. (3.7)However, to ahieve (3.7), the lengths of odewords have to vary and to be adaptedto the fading state of the hannels in eah time slot, whih may not be desirable inpratie. In that ase, by setting \u03be(i) = 1\/2, \u2200i, the odeword lengths ould be \u001cxed,and thereby, the following average rate is ahievedR\u00afconv,3 =12E {min{log2(1 + s(i), log2(1 + r(i))}} . (3.8)CSI Requirements: In order to ahieve (3.7) and (3.8) using onventional relayingwithout bu\u001ber, the soure, relay, and destination have to aquire the CSI of both theS-R and R-D links in eah time slot. Thereby, three pilot transmissions are required61Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionper time slot. In addition, the CSI of S-R and R-D links have to be feedbakto destination and soure, respetively, in eah time slot. In omparison, bu\u001ber-aided relaying with adaptive reeption-transmission also requires three pilot symboltransmissions per time slot, however, it requires only one bit of feedbak informationper time slot. On the other hand, sine the CSI of the S-R and R-D links are realnumbers, the two feedbaks required for onventional relaying without bu\u001ber mustontain large (ideally in\u001cnite) number of information bits.Comparing (3.7) and (3.6), we observe that R\u00afconv,2 \u2264 R\u00afconv,1 holds. However, torealize this performane gain, the relay has to be equipped with a bu\u001ber of in\u001cnitesize and and in\u001cnite delay is introdued.Rayleigh FadingFor the numerial results shown in Setion 3.7, we onsider the ase where the S-R and R-D links are both Rayleigh faded, i.e., the probability density funtions(PDFs) of s(i) and r(i) are given by fs(s) = e\u2212s\/\u2126SR\/\u2126SR and fr(r) = e\u2212r\/\u2126RD\/\u2126RD,respetively. In this ase, R\u00afconv,1, R\u00afconv,2, and R\u00afconv,3 given in (3.6), (3.7), and (3.8),respetively, an be obtained asR\u00afconv,1 =1ln(2)exp(1\u2126SR)E1(1\u2126SR)exp(1\u2126RD)E1(1\u2126RD)exp(1\u2126SR)E1(1\u2126SR)+ exp(1\u2126RD)E1(1\u2126RD) , (3.9)R\u00afconv,2 =\u222b \u221e0\u222b \u221e0log2(1 + s)\u00d7 log2(1 + r)log2(1 + s) + log2(1 + r)e\u2212s\/\u2126SR\u2212r\/\u2126RD\u2126SR\u2126RDdsdr, (3.10)62Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate TransmissionandR\u00afconv,3 =12 ln(2) exp(\u2126R + \u2126S\u2126S\u2126R)E1(\u2126R + \u2126S\u2126S\u2126R), (3.11)respetively, where E1(x) =\u222b\u221ex e\u2212t\/t dt, x > 0, denotes the exponential integralfuntion.In the following, we optimize the general bu\u001ber-aided protool with adaptivereeption-transmission for rate maximization.3.4 Optimal Adaptive Reeption-TransmissionProtool for Fixed PowersTo gain insight, we \u001crst derive the optimal adaptive reeption-transmission poliyand the orresponding ahievable average rate for the ase when the soure andrelay transmit with \u001cxed powers, i.e., PS(i) = PS, PR(i) = PR, \u2200i. Optimal poweralloation will be disussed in Setions 3.5.3.4.1 Problem FormulationIn order to formulate the reeption and transmission at the relay in time slot i, weintrodue a binary deision variable di \u2208 {0, 1}. We set di = 1 if the R-D link isseleted for transmission in time slot i, i.e., the relay transmits and the destinationreeives. Similarly, we set di = 0 if the S-R link is seleted for transmission in timeslot i, i.e., the soure transmits and the relay reeives. Exploiting di, the number ofbits\/symb send from the soure to the relay and from the relay to the destination in63Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissiontime slot i an be written in ompat form asSSR(i) = (1\u2212 di) log2(1 + s(i)) (3.12)andRRD(i) = di min{log2(1 + r(i)), Q(i\u2212 1)}, (3.13)respetively. Consequently, the average rate in (3.5) an be rewritten asR\u00afSD = limN\u2192\u221e1NN\u2211i=1di min{log2(1 + r(i)), Q(i\u2212 1)}. (3.14)The onsidered rate maximization problem an now be stated as follows: Find the op-timal adaptive reeption-transmission poliy, i.e., the optimal sequene di, \u2200i, whihmaximizes the ahievable average rate R\u00afSD given in (3.14).3.4.2 Optimal Adaptive Reeption-Transmission ProtoolUsing notation from queueing theory [83\u2104, we de\u001cne the average arrival rate ofbits\/symb per time slot arriving into the queue of the bu\u001ber, denoted by A, andthe average departure rate of bits\/symb time per slot departing out of the queue ofthe bu\u001ber, denoted by D, asA , limN\u2192\u221e1NN\u2211i=1(1\u2212 di) log2(1 + s(i)) (3.15)andD , limN\u2192\u221e1NN\u2211i=1di min{log2(1 + r(i)), Q(i\u2212 1)}, (3.16)64Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionrespetively. We note that the average departure rate D is equal to the ahievableaverage rate given in (3.14). In order to derive the optimal protool, we give thefollowing de\u001cnition for an absorbing and non-absorbing queue.De\u001cnition 3.1. An absorbing queue is a queue for whih A > D holds. A non-absorbing queue is a queue for whih A = D holds.In an absorbing queue a part of the arrival rate is absorbed (trapped) inside thebu\u001ber of unlimited size and therefore the departure rate D is smaller than the arrivalrate.The following theorem haraterizes the optimal adaptive reeption-transmissionpoliy in terms of the state of the queue in the bu\u001ber of the relay.Theorem 3.1. A neessary ondition for the optimal adaptive reeption-transmissionpoliy whih maximizes the ahievable average rate is that the queue in the bu\u001ber ofthe relay is at the edge of non-absorbtion, i.e., the queue is non-absorbing but is atthe boundary of a non-absorbing and an absorbing queue.Proof. Please refer to Appendix B.1.Exploiting Theorem 3.1, we an establish a useful ondition that the optimaladaptive reeption-transmission poliy has to ful\u001cll and a simpli\u001ced expression forthe ahievable average rate. This is the subjet of the following theorem.Theorem 3.2. The ahievable average rate in (3.14) is maximized when the followingidentity holdslimN\u2192\u221e1NN\u2211i=1(1\u2212 di) log2(1 + s(i)) = limN\u2192\u221e1NN\u2211i=1di log2(1 + r(i)). (3.17)65Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate TransmissionMoreover, when (3.17) holds, the ahievable average rate in (3.14) is then given byR\u00afSD = limN\u2192\u221e1NN\u2211i=1di log2(1 + r(i)) = E{di log2(1 + r(i))}. (3.18)Proof. Please refer to Appendix B.2.Remark 3.1. A queue that meets ondition (3.17) is rate-stable sine there is noloss of information, i.e., the information that goes in the bu\u001ber eventually leaves thebu\u001ber without any loss. Hene, all of the information sent by the soure is eventuallyreeived at the destination without any loss.Remark 3.2. By omparing (3.14) and (3.18) it an be seen that when (3.17) holds,the average data rate beomes independent of the queue states Q(i), \u2200i. The rea-son for this is the following. When (3.17) holds and N \u2192 \u221e, the number of timeslots in whih the bu\u001ber does not have enough data for transmission, and therebymin{Q(i \u2212 1), log2(1 + r(i)} = Q(i \u2212 1) ours, are negligeable ompared to thenumber of time slots in whih the bu\u001ber does have enough data for transmission,and thereby min{Q(i \u2212 1), log2(1 + r(i)} = log2(1 + r(i)) ours. In partiular, asshown in Appendix B.2, ondition (3.17) automatially ensures that for N \u2192 \u221e,1N\u2211Ni=1 di log2(1 + r(i)) = 1N\u2211Ni=1 di min{log2(1 + r(i)), Q(i \u2212 1)} is valid, i.e., theimpat of event log2(1 + r(i)) > Q(i \u2212 1), i = 1, . . . , N , is negligible. Hene, when(3.17) holds and N \u2192\u221e, we an pratially onsider the relay is fully baklogged.We are now ready to derive the optimal adaptive reeption-transmission poliyfor bu\u001ber-aided relaying without power alloation. Aording to Theorem 3.2, thepoliy that maximizes the ahievable average rate R\u00afSD in (3.18) an be found insidethe set of poliies that produe a queue whih satis\u001ces (3.17). Thus, for N \u2192\u221e, we66Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionformulate the following optimization problem:Maximize :di1N\u2211Ni=1 di log2(1 + r(i))Subject to : C1 : 1N\u2211Ni=1(1\u2212 di) log2(1 + s(i)) = 1N\u2211Ni=1 di log2(1 + r(i))C2 : di \u2208 {0, 1}, \u2200i,(3.19)where onstraint C1 ensures that the searh for the optimal poliy is onduted onlyamong those poliies that satisfy (3.17) and C2 ensures that di \u2208 {0, 1}. We notethat C1 and C2 do not exlude the ase that the relay is hosen for transmission iflog2(1 + r(i)) > Q(i \u2212 1). However, aording to Remark 3.2, C1 ensures that thein\u001duene of event log2(1 + r(i)) > Q(i \u2212 1) is negligible. Therefore, an additionalonstraint dealing with this event is not required. The solution of problem (3.19)leads to the following theorem.Theorem 3.3. The optimal poliy maximizing the ahievable average rate of bu\u001ber-aided relaying with adaptive reeption-transmission is given bydi =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f31 if log2(1 + r(i)) \u2265 \u03c1 log2(1 + s(i))0 otherwise(3.20)where \u03c1 is a onstant, referred to as the deision threshold, found suh that onstraintC1 in (3.19) holds. The orresponding maximum rate, denoted by R\u00afSD,max, is foundby inserting (3.20) into (3.18).Proof. Please refer to Appendix B.3.Remark 3.3. Interestingly, we observe from Theorem 3.3 that the optimal deision,di, at time slot i, depends only on the instantaneous SNRs, s(i) and r(i), of thattime slot. Hene, di does not depend on the state of the queue, Q(i), in any time67Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionslot nor on the instantaneous SNRs in previous or future time slots. This makesthe proposed optimal seletion poliy easy to implement. We note that the deisionthreshold, \u03c1, depends on the statistial CSI of both involved links as will be establishedin the next setion. The independene of the optimal adaptive reeption-transmissionpoliy from non-ausal instantaneous CSI is aused by the relay being operated at theedge of non-absorption, i.e., the relay node is pratially fully baklogged. Non-ausalknowledge would only help bu\u001ber management (i.e., ensuring that there is a su\u001eientnumber of bits\/symb in the bu\u001ber for upoming time slots), whih is not required inthe onsidered regime.Remark 3.4. In this hapter, we assume that the transmitting nodes have perfetCSI and apply adaptive rate transmission. However, we note that this is not ne-essary for ahieving the maximum ahievable average rate in (3.18). In fat, theproposed adaptive reeption-transmission protool (3.20) also ahieves the maximumahievable average rate in (3.18) if soure and relay transmit long odewords thatspan (ideally in\u001cnitely) many time slots (and onsequently in\u001cnitely many fadingstates). In this ase, both the soure and the relay an transmit with onstant rateR\u00afSD,max = E{(1 \u2212 di) log2(1 + s(i))} = E{di log2(1 + r(i))}, where di is given in(3.20), and rate adaptation is not neessary. The \u001crst odeword is transmitted bythe soure without adaptive reeption-transmission and deoded by the relay. For allsubsequent odewords, adaptive reeption-transmission is performed based on (3.20)and soure and relay transmit parts of a long odeword whenever they are seletedfor transmission. The disadvantage of this approah is that the long odewords inher-ently introdue (ideally in\u001cnitely) long delays and the generalization of this approahto the delay-onstrained ase is di\u001eult. Therefore, in this hapter, we onsider adap-tive rate transmission and assume that one odeword spans only one time slot (and68Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissiononsequently one fading state).3.4.3 Deision ThresholdThe deision threshold \u03c1 an be omputed based on the following lemma.Lemma 3.1. The deision threshold \u03c1 is found as the solution of\u222b \u221e0[\u222b \u221eG(r)log2(1 + s)fs(s)ds]fr(r)dr =\u222b \u221e0[\u222b \u221eH(s)log2(1 + r)fr(r)dr]fs(s)ds,(3.21)where fs(s) and fr(r) are the PDFs of s(i) and r(i), respetively, and G(r) = (1 +r) 1\u03c1 \u2212 1 and H(s) = (1 + s)\u03c1 \u2212 1.Proof. Due to the ergodiity, the left hand side of (3.17) is the expetation of variable(1 \u2212 di) log2(1 + s(i)). This variable is nonzero only when di = 0. From (3.20)we observe that di = 0 if \u03c1 log2(1 + s(i)) > log2(1 + r(i)), whih is equivalent tos(i) > G(r). Therefore, the domain of integration for alulating the expetation of(1\u2212 di) log2(1+ s(i)) is s(i) > G(r) and r(i) > 0, whih leads to the left hand side of(3.21). Using a similar approah, the right hand side of (3.21) is obtained from theright hand side of (3.17). This onludes the proof.Remark 3.5. Eq. (3.21) reveals that the deision threshold \u03c1 depends indeed on thestatistial properties of both involved links as was already alluded to in Remark 3.3.3.4.4 Rayleigh FadingFor onreteness, we provide in this subsetion expressions for \u03c1 and the orrespond-ing maximum ahievable average rate R\u00afSD,max for Rayleigh fading links. Thus, by69Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissioninserting fs(s) = e\u2212s\/\u2126SR\/\u2126SR and fr(r) = e\u2212r\/\u2126RD\/\u2126RD into (3.21), we obtain1ln(2)\u222b \u221e0[exp(\u2212(r + 1)1\u03c1 \u2212 1\u2126SR)ln((r + 1) 1\u03c1)+ e1\u2126SRE1((r + 1) 1\u03c1\u2126SR)]e\u2212r\/\u2126RD\u2126RDdr= 1ln(2)\u222b \u221e0[exp(\u2212(s + 1)\u03c1 \u2212 1\u2126RD)ln ((s+ 1)\u03c1) + e1\u2126RDE1((s+ 1)\u03c1\u2126RD)]\u00d7 1\u2126SRexp(\u2212 s\u2126SR)ds. (3.22)The optimal deision threshold \u03c1 an be found numerially from (3.22). The orre-sponding maximum ahievable average rate is obtained asR\u00afSD,max =1ln(2)\u222b \u221e0[exp(\u2212(s+ 1)\u03c1 \u2212 1\u2126RD)\u00d7 ln ((s+ 1)\u03c1)+e1\u2126RDE1((s+ 1)\u03c1\u2126RD)] 1\u2126SRexp(\u2212 s\u2126SR)ds, (3.23)where \u03c1 is found from (3.22).Speial ase (\u2126SR = \u2126RD)For the speial ase \u2126SR = \u2126RD = \u2126, we obtain from (3.22) \u03c1 = 1, and the orre-sponding maximal ahievable average rate isR\u00afSD,max =1ln(2) exp( 1\u2126)E1( 1\u2126)\u2212 12 ln(2) exp( 2\u2126)E1( 2\u2126). (3.24)Comparing this average rate with the average rate ahieved with onventional re-laying with a bu\u001ber, f. (3.9), the gain of adaptive reeption-transmission an beharaterized byR\u00afSD,maxR\u00afconv,1= 2\u2212 exp( 2\u2126)E1( 2\u2126)exp( 1\u2126)E1( 1\u2126) \u2265 1, (3.25)70Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionwhere the ratio R\u00afSD,max\/R\u00afconv,1 monotonially inreases from 1 to 1.5 as \u2126 dereasesfrom \u221e to zero.3.4.5 Real-Time ImplementationIn order to selet whether the relay should reeive or transmit aording to theprotool in Theorem 3.3, the relay has to ompute the onstant \u03c1. This onstant anbe omputed using Lemma 3.1, but this requires knowledge of the PDFs of the fadinggains of the two links before the start of transmission. Suh a priori knowledge maynot be available in pratie. In this ase, the relay has to estimate \u03c1 in real-timeusing only the CSI knowledge until time slot i. Sine \u03c1 is atually the Lagrangemultiplier obtained by solving the optimization problem in (3.19), see Appendix B.3,an aurate estimate of \u03c1 an be obtained using the gradient desent method [81\u2104. Inpartiular, using log2(1+s(i)) and log2(1+r(i)), the destination reursively omputesan estimate of \u03c1, denoted by \u03c1e(i), as\u03c1e(i) =[\u03c1e(i\u2212 1) + \u03c8(i)(De(i\u2212 1)\u2212Ae(i\u2212 1))]\u221e0, (3.26)where [x]ba = min{max{x, a}, b}, Ae(i \u2212 1) and De(i \u2212 1) are real-time estimates ofthe average arrival rate A and the average departure rate D, respetively, omputedasAe(i\u2212 1) =i\u2212 2i\u2212 1Ae(i\u2212 2) +1\u2212 di\u22121i\u2212 1 log2(1 + s(i\u2212 1)), i \u2265 2, (3.27)De(i\u2212 1) =i\u2212 2i\u2212 1De(i\u2212 2) +di\u22121i\u2212 1 log2(1 + r(i\u2212 1)), i \u2265 2, (3.28)where Ae(0) and De(0) are set to zero. In (3.26), \u03c8(i) is an adaptive step size whihontrols the speed of onvergene of \u03c1e(i) to \u03c1. In partiular, the step size \u03c8(i) is71Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionsome properly hosen monotonially deaying funtion of i with \u03c8(1) < 1, see [81\u2104for more details.One the relay has estimated s(i) and r(i), and omputed \u03c1e(i), it selets theative link, i.e., the value of di, aording to Theorem 3.3.3.5 Optimal Adaptive Reeption-Transmission andOptimal Power AlloationSo far, we have assumed that the soure and relay transmit powers are \u001cxed. In thissetion, we jointly optimize the power alloation and adaptive reeption-transmissionpoliies for bu\u001ber-aided relaying.3.5.1 Problem Formulation and Optimal Power AlloationOur goal is to jointly optimize the link seletion variable di and the powers PS(i)and PR(i) in eah time slot i suh that the ahievable average rate is maximized.For onveniene, we optimize in the following the transmit SNRs without fading\u03b3S(i) and \u03b3R(i), whih may be viewed as normalized powers, instead of the powersPS(i) = \u03b3S(i)\u03c32nR and PR(i) = \u03b3R(i)\u03c32nD themselves. For a fair omparison, we limitthe average power onsumed by the soure and the relay to \u0393. This leads for N \u2192\u221e72Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionto the following optimization problem:Maximize :\u03b3S(i)\u22650,\u03b3R(i)\u22650,di1N\u2211Ni=1 di log2(1 + \u03b3R(i)hR(i))Subject to : C1 : 1N\u2211Ni=1(1\u2212 di) log2(1 + \u03b3S(i)hS(i))= 1N\u2211Ni=1 di log2(1 + \u03b3R(i)hR(i))C2 : di \u2208 {0, 1}C3 : 1N\u2211Ni=1(1\u2212 di)\u03b3S(i) + 1N\u2211Ni=1 di\u03b3R(i) \u2264 \u0393(3.29)where onstraints C1 and C2 are idential to the onstraints in (3.19) and C3 is thejoint soure-relay power onstraint. The solution of Problem (3.29) is summarized inthe following theorem.Theorem 3.4. The optimal (normalized) powers \u03b3S(i) and \u03b3R(i) and deision vari-able di maximizing the ahievable average rate of bu\u001ber-aided relaying with adaptivereeption-transmission while satisfying an average soure-relay power onstraint aregiven by\u03b3S(i) =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f3\u03c1\/\u03bb\u2212 1\/hS(i) if hS(i) > \u03bb\/\u03c10 otherwise(3.30)\u03b3R(i) =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f31\/\u03bb\u2212 1\/hR(i) if hR(i) > \u03bb0 otherwise(3.31)di =\uf8f1\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f2\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f31 if[ln(hR(i)\u03bb)+ \u03bbhR(i) \u2212 1 > \u03c1 ln( \u03c1\u03bbhS(i))+ \u03bbhS(i) \u2212 \u03c1AND hR(i) > \u03bb AND hS(i) > \u03bb\u03c1]OR[hR(i) > \u03bb AND hS(i) \u2264 \u03bb\u03c1]0 otherwise(3.32)73Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionwhere \u03c1 and \u03bb are found suh that C1 and C3 in (3.29) hold with equality for N \u2192\u221e.The orresponding maximum average rate is found by inserting (3.31) and (3.32) intoR\u00afSD,max = limN\u2192\u221e1NN\u2211i=1di log2(1 + \u03b3R(i)hR(i)). (3.33)Proof. Please refer to Appendix B.4.3.5.2 Finding \u03bb and \u03c1The following lemma establishes two equations from whih the optimal \u03bb and \u03c1 anbe found.Lemma 3.2. Denote the PDFs of hS(i) and hR(i) by fhS(hS) and fhR(hR), respe-tively. Let the transmit powers of the soure and the relay in time slot i be given by(3.30) and (3.31), respetively, and the link seletion variable di by (3.32). Then,\u03c1 and \u03bb maximizing the ahievable average rate of bu\u001ber-aided relaying with adap-tive reeption-transmission and power alloation are found from the following twoequations\u222b \u03bb0[\u222b \u221e\u03bb\/\u03c1log2(\u03c1hS\u03bb)fhS(hS)dhS]fhR(hR)dhR+\u222b \u221e\u03bb[\u222b \u221eL1(\u03c1hS\u03bb)fhS(hS)dhS]fhR(hR)dhR=\u222b \u03bb\/\u03c10[\u222b \u221e\u03bblog2(hR\u03bb)fhR(hR)dhR]fhS(hS)dhS+\u222b \u221e\u03bb\/\u03c1[\u222b \u221eL2log2(hR\u03bb)fhR(hR)dhR]fhS(hS)dhS , (3.34)74Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmission\u222b \u03bb0[\u222b \u221e\u03bb\/\u03c1(\u03c1\u03bb \u22121hS)fhS(hS)dhS]fhR(hR)dhR+\u222b \u221e\u03bb[\u222b \u221eL1(\u03c1\u03bb \u22121hS)fhS(hS)dhS]fhR(hR)dhR+\u222b \u03bb\/\u03c10[\u222b \u221e\u03bb(1\u03bb \u22121hR)fhR(hR)dhR]fhS(hS)dhS+\u222b \u221e\u03bb\/\u03c1[\u222b \u221eL2( 1\u03bb \u22121hR)fhR(hR)dhR]fhS(hS)dhS = \u0393 (3.35)whereL1 = \u2212\u03bb\u03c1W (\u2212e(hR\u2212\u03bb)\/(\u03c1hR)\u22121(\u03bb\/hR)1\/\u03c1),L2 = \u2212\u03bbW (\u2212e\u03c1\u22121\u2212\u03bb\/hS (\u03bb\/(\u03c1hS))\u03c1). (3.36)Here, W (\u00b7) is the Lambert W -funtion [84\u2104, whih is available as built-in funtionin software pakages suh as Mathematia. The maximum ahievable average rate isgiven by the left (and right) hand side of (3.34).Proof. Please refer to Appendix B.5.The onstants \u03bb and \u03c1 an be found o\u001fine sine (3.34) and (3.35) only dependon the statistial properties of the S-R and the R-D links. Sine these statistialproperties hange on a muh slower time sale than the instantaneous hannel gains,\u03bb and \u03c1 an be updated with a low rate.75Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmission3.5.3 Rayleigh FadingFor the speial ase of Rayleigh fading with fhS(hS) = e\u2212hS\/\u2126\u00afSR\/\u2126\u00afSR and fhR(hR) =e\u2212hR\/\u2126\u00afRD\/\u2126\u00afRD, (3.34) and (3.35) an be simpli\u001ced to an be simpli\u001ced to1ln(2)[(1\u2212 e\u2212\u03bb\/\u2126\u00afRD)E1( \u03bb\u03c1\u2126\u00afSR)+\u222b \u221e\u03bb{e\u2212L1\/\u2126\u00afSR ln(\u03c1L1\u03bb)+ E1( L1\u2126\u00afSR)}e\u2212hR\/\u2126\u00afRD\u2126\u00afRDdhR]= 1ln(2)[(1\u2212 e\u2212\u03bb\/(\u03c1\u2126\u00afSR))E1( \u03bb\u2126\u00afRD)+\u222b \u221e\u03bb\/\u03c1{e\u2212L2\/\u2126\u00afRD ln(L2\u03bb)+ E1( L2\u2126\u00afRD)}e\u2212hS\/\u2126\u00afSR\u2126\u00afSRdhS](3.37)and(1\u2212 e\u2212\u03bb\/\u2126\u00afRD)\uf8eb\uf8ed\u03c1\u03bbe\u2212\u03bb\/(\u03c1\u2126\u00afSR) \u2212E1(\u03bb\u03c1\u2126\u00afSR)\u2126\u00afSR\uf8f6\uf8f8+\u222b \u221e\u03bb\uf8f1\uf8f2\uf8f3\u03c1\u03bbe\u2212L1\/\u2126\u00afSR \u2212E1(L1\u2126\u00afSR)\u2126\u00afSR\uf8fc\uf8fd\uf8fee\u2212hR\/\u2126\u00afRD\u2126\u00afRDdhR+(1\u2212 e\u2212\u03bb\/(\u03c1\u2126\u00afSR))\uf8eb\uf8ed1\u03bbe\u2212\u03bb\/\u2126\u00afRD \u2212E1(\u03bb\u2126\u00afRD)\u2126\u00afRD\uf8f6\uf8f8+\u222b \u221e\u03bb\/\u03c1\uf8f1\uf8f2\uf8f31\u03bbe\u2212L2\/\u2126\u00afRD \u2212E1(L2\u2126\u00afRD)\u2126\u00afRD\uf8fc\uf8fd\uf8fee\u2212hS\/\u2126\u00afSR\u2126\u00afSRdhS = \u0393, (3.38)respetively, where L1 and L2 are given in (3.36) and the maximum ahievable averagerate is given by the left (and right) hand side of equation (3.37).3.5.4 Real-Time ImplementationSimilar to the real-time implementation for \u001cnding \u03c1 for the ase without poweralloation desribed in Se. 3.5.1, we an also onstrut a real-time implementation76Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionfor \u001cnding \u03c1 and \u03bb for the ase with power alloation. In this ase, an estimate for\u03c1 is found in the same way as in Se. 3.5.1. On the other hand, an estimate for \u03bb,denoted by \u03bbe(i) is found as\u03bbe(i) =[\u03bbe(i\u2212 1) + \u03c6(i)(\u0393eS(i\u2212 1) + \u0393eR(i\u2212 1)\u2212 \u0393]\u221e0, (3.39)where\u0393eS(i\u2212 1) =i\u2212 2i\u2212 1\u0393eS(i\u2212 2) +1\u2212 di\u22121i\u2212 1 \u03b3S(i), i \u2265 2, (3.40)\u0393eR(i\u2212 1) =i\u2212 2i\u2212 1\u0393eR(i\u2212 2) +di\u22121i\u2212 1\u03b3R(i), i \u2265 2, (3.41)where \u0393eS(0) and \u0393eR(0) are set to zero. In (3.39), \u03c6(i) is an adaptive step size whihontrols the speed of onvergene of \u03bbe(i) to \u03bb. In partiular, the step size \u03c6(i) issome properly hosen monotonially deaying funtion of i with \u03c6(1) < 1, see [81\u2104 formore details.3.6 Delay-Limited TransmissionSo far, we have assumed that there is no delay onstraint. In pratie, there is usuallysome onstraint on the delay. In this setion, we propose a bu\u001ber-aided adaptivereeption-transmission protool for delay onstrained transmission. For simpliity,we assume \u001cxed transmit powers, i.e., PS(i) = PS, PR(i) = PR, \u2200i.3.6.1 Average DelaySine we assume that the soure is baklogged and has always information to transmit,for the onsidered network, the transmission delay is aused only by the bu\u001ber at the77Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionrelay. Let T (i) denote the delay of a bit of information that is transmitted by thesoure in time slot i and reeived at the destination in time slot i + T (i), i.e., theonsidered bit is stored for T (i) time slots in the bu\u001ber. Then, aording to Little'slaw [85\u2104 the average delay E{T (i)} in number of time slots is given byE{T (i)} = E{Q(i)}A , (3.42)where E{Q(i)} is the average queue length at the bu\u001ber and A is the average arrivalrate into the queue.The queue size at time slot i an be obtained asQ(i) = Q(i\u2212 1) + (1\u2212 di) log2(1 + s(i))\u2212 di min{Q(i\u2212 1), log2(1 + s(i))}. (3.43)Due to the reursiveness of the expression in (3.43), it is di\u001eult, if not impossible,to obtain an analytial expression for the average queue size E{Q(i)} for a generalbu\u001ber-aided relaying poliy. Hene, in ontrast to the ase without delay onstraint,for the delay limited ase, it is very di\u001eult to formulate an optimization problemfor maximization of the average rate subjet to some average delay onstraint. Asa result, in the following, we develop a simple heuristi protool for delay limitedtransmission. In the proposed protool, the relay itself deides whether it shouldreeive or transmit in eah time slot suh that the average delay onstraint is satis\u001ced,and informs the soure and destination about the deision. We note that the proposedprotool does not need any knowledge of the statistis of the hannels. The protoolneeds only the instantaneous CSI of the S-R and R-D links at the relay, and thedesired average delay T0. This allows for relatively easy real-time implementation ofthe proposed protool for delay-limited transmission.78Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmission3.6.2 Bu\u001ber-Aided Protool for Delay Limited TransmissionBefore presenting the proposed heuristi protool for delay limited transmission, we\u001crst explain the intuition behind the protool.Intuition Behind the ProtoolAssume that we have a bu\u001ber-aided protool whih, when implemented in the on-sidered network, enfores the following relationE{Q(i)}A = T0, (3.44)where T0 is the desired average delay. There are many ways to enfore (3.44) atthe relay. Our preferred method for enforing (3.44) is to have the relay reeive andtransmit when Q(i)\/A < T0 and Q(i)\/A > T0, respetively. In this way, Q(i)\/Abeomes a random proess whih exhibits \u001dutuation around its mean value T0, andthereby ahieves (3.44) in the long run. We are now ready to present the proposedprotool.The Proposed ProtoolLet T0 be the desired average delay onstraint of the system. At the beginningof time slot i, soure and destination transmit pilots in suessive pilot time slots.This enables the relay to aquire the CSI of their respetive S-R and R-D links,respetively. Using the aquired CSI, the relay omputes log2(1 + s(i)) and log2(1 +r(i)). Next, using log2(1 + s(i)) and the amount of normalized information in itsbu\u001ber, Q(i\u2212 1), the relay omputes a variable \u03c9(i) as follows\u03c9(i) = \u03c9(i\u2212 1) + \u03b6(i)(T0 \u2212Q(i\u2212 1)Ae(i\u2212 1)), (3.45)79Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionwhere Ae(i\u22121) is a real-time estimate of A, omputed using (3.27). In (3.45), \u03b6(i) isthe step size funtion, whih is some properly hosen monotonially deaying funtionof i with \u03b6(1) < 1. Now, using log2(1 + s(i)), log2(1 + r(i)), Q(i\u2212 1), and \u03c9(i), therelay omputes di asdi =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f31 if 1\u03c9(i) min{Q(i\u2212 1), log2(1 + r(i))} \u2265 \u03c9(i) log2(1 + s(i))0 otherwise(3.46)The relay then broadasts a ontrol paket ontaining pilot symbols and informationabout whether the relay reeives or transmits to the soure and destination. From thepaket broadasted by the relay, both soure and destination learn the S-R and R-Dlinks, respetively, and learn whether the relay is sheduled to reeive or transmit.If the relay is sheduled to transmit, then it extrats information from its bu\u001ber andtransmits a odeword to the destination with rateRRD(i) = min{Q(i\u2212 1), log2(1 + r(i))}.However, if the relay is sheduled to reeive, then the soure transmits a odewordto the relay with rate SSR(i) = log2(1 + s(i)).Remark 3.6. The required overhead of the proposed delay-limited protool is identialto the overhead of the proposed protool without delay onstraint.Remark 3.7. Although oneptually simple, a theoretial analysis of the ahievableaverage rate of the proposed delay-limited protool is di\u001eult. Thus, we will resort tosimulations to evaluate the performane of the delay limiting protool in Setion 3.7.Remark 3.8. We note that the proposed protool for the delay-onstrained ase isheuristi in nature. The searh for other protools with possibly superior perfor-80Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmissionmane is an interesting topi for future work. The proposed protools for the delay-onstrained and the delay-unonstrained ase an serve as benhmark and perfor-mane upper bound for these new protools, respetively.3.7 Numerial and Simulation ResultsIn this setion, we evaluate the performane of bu\u001ber-aided relaying (BAR) withadaptive reeption-transmission and ompare it with that of onventional relaying.Throughout this setion, we assume Rayleigh fading. All results shown in this setionhave been on\u001crmed by omputer simulations. However, the simulations are notshown in all instanes for larity of presentation. We note that the simulation resultsare independent of whether the fading is slot-by-slot orrelated or unorrelated.3.7.1 Delay-Unonstrained TransmissionFirst, we assume that there are no delay onstraints and investigate the ahievableaverage rates with and without power alloation.In Fig. 3.2, we show the ahievable average rates of bu\u001ber-aided relaying withadaptive reeption-transmission, R\u00afSD,max, without power alloation, given in (3.23),and the ahievable average rate of onventional relaying with a bu\u001ber, R\u00afconv,1, givenin (3.9), and without a bu\u001ber with adaptive and \u001cxed odeword lengths R\u00afconv,2 andR\u00afconv,3, respetively, given in (3.10) and (3.11), respetively, for \u2126\u00afSR = 0.9, \u2126\u00afRD =1.1, and \u03b3s = \u03b3r = \u03b3. Moreover, we have also shown the rate of bu\u001ber-aided relayingobtained via simulations. As an be seen from Fig. 3.2, the simulated and theoretialresults math perfetly. The \u001cgure shows that bu\u001ber-aided relaying with adaptivereeption-transmission leads to substantial gains ompared to onventional relaying.In partiular, for \u03b3 = 10 dB, the gain of bu\u001ber-aided relaying with adaptive reeption-81Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmission\u221210 \u22125 0 5 10 15 20 25 3000.511.522.533.544.55\u03b3 (in dB)Averagerate(inbits\/symb)  BAR with adaptive reception-transmission - TheoryBAR with adaptive reception-transmission - SimulationConventional relaying with bufferConventional relaying without buffer, adaptive codeword lengthsConventional relaying without buffer, fixed codeword lengthsFigure 3.2: Average rates ahieved with bu\u001ber-aided relaying (BAR) with adaptivereeption-transmission and with onventional relaying with and without bu\u001ber for\u2126SR = 0.9 and \u2126RD = 1.1.transmission over onventional relaying with a bu\u001ber is 3 dB, and without a bu\u001berwith adaptive and \u001cxed odeword lengths is 4 dB and 6 dB, respetively.For the parameters adopted in Fig. 3.2, we show in Fig. 3.3 the orrespondingonstant \u03c1 obtained using Lemma 3.1, and the orresponding estimated parameter\u03c1e(i) obtained using the reursive method in (3.26) as funtions of time for \u03b3 = 0dB. As an be seen from Fig. 3.3, the estimated parameter \u03c1e(i) onverges relativelyquikly to \u03c1.In Fig. 3.4, we investigate the gains ahieved with power alloation for a systemwith \u2126\u00afS = 0.1 and \u2126\u00afR = 1.9. Thereby, we ompare the performanes of bu\u001ber-aidedrelaying with adaptive reeption-transmission with and without power alloation.For bu\u001ber-aided relaying with adaptive reeption-transmission and power alloationthe average rate, power alloation, and adaptive reeption-transmission poliy wereobtained as desribed in Theorem 3.4 and Lemma 3.2 in Setion 3.5. As an be seenfrom Fig. 3.4, and as expeted, power alloation inreases the average rate.82Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmission50 100 150 200 250 300 350 400 450 50000.511.52  Time slot i\u03c1\u03c1e(i)\u03c1Figure 3.3: Estimated \u03c1e(i) as a funtion of the time slot i.\u22125 0 5 10 15 2000.511.522.5\u0393 (in dB)Averagerate(inbits\/symb)  With power allocationWithout power allocationFigure 3.4: Average rate with bu\u001ber-aided relaying with adaptive reeption-transmission with and without power alloation for \u2126\u00afS = 0.1 and \u2126\u00afR = 1.983Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmission\u22125 0 5 10 15 20 25 3000.511.522.533.544.55\u03b3 (in dB)Averagerate(inbits\/symb)  BAR with adaptive reception-transmission, T0 \u2192 \u221eBAR with adaptive reception-transmission, T0 = 5BAR with adaptive reception-transmission, T0 = 3BAR with adaptive reception-transmission, T0 = 2Conventional relaying, adaptive codeword lengths T0 = 1Conventional relaying, fixed codeword lengths T0 = 1Figure 3.5: Average rate of BAR with adaptive reeption-transmission for di\u001berentaverage delay onstraints.3.7.2 Delay-Constrained TransmissionWe now turn our attention to delay-limited transmission and investigate the perfor-mane of the proposed bu\u001ber-aided protool for this ase. Furthermore, we assume\u001cxed transmit powers for the soure and the relay.In Fig. 3.5, we plot the ahievable average rate for bu\u001ber-aided relaying withadaptive reeption-transmission without and with a delay onstraint, as a funtion of\u03b3, for \u2126\u00afSR = \u2126\u00afRD = 1. This numerial example shows that for an average delay of 5,3, and 2 time slots, the rate of the delay onstrained protool is within 0.75, 1.5, and2.5 dB from the rate of the protool without a delay onstraint (i.e., T0 \u2192 \u221e). Foromparison, we have also plotted the average rate of onventional relaying withoutbu\u001ber with adaptive and \u001cxed odeword lengths, respetively, whih require a delayof one time slot. Fig. 3.5 shows that for an average delay of 5, 3, and 2 time slots,the rate of the delay onstrained protool is within 3, 2.5, and 1.5 dB from the rateahieved with onventional relaying with adaptive odeword lengths, and within 5,84Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmission0 100 200 300 400 500123456Time slot iAveragedelayuntiltimesloti T0=5Figure 3.6: Average delay until time slot i for T0 = 5 and \u03b3 = 20 dB .4.5, and 3.5 dB from the rate ahieved with onventional relaying with \u001cxed odewordlengths. Considering the more stringent feedbak requirements for CSI aquisition ofonventional relaying without bu\u001ber, see Setion 3.3.4, this example learly shows thepotential of bu\u001ber-aided relaying for pratial delay-limited transmission senarios.Furthermore, for the parameters adopted in Fig. 3.5, we have plotted the averagedelay of the proposed delay-limited protool until time slot i in Fig. 3.6, for the asewhen T0 = 5 time slots, and \u03b3 = 15 dB. The average delay until time slot i, denotedby T\u00af (i) is omputed asT\u00af (i) =\u2211ij=1Q(i)\u2211ij=1(1\u2212 di) log2(1 + s(i)) ,i.e., the queue size and the arrival rates are both averaged from the \u001crst to thei-th time slot. Fig. 3.6 shows that with the protool proposed for delay limitedtransmission, the average delay until time slot i onverges to the desired delay T0relatively fast. Moreover, after the average delay has reahed T0, it exhibits relativelysmall \u001dutuations around T0.85Chapter 3. Bu\u001ber-Aided Relaying: Adaptive Rate Transmission3.8 ConlusionsIn this hapter, we proposed a novel adaptive reeption-transmission protool forrelays with bu\u001bers. In ontrast to onventional relaying, where the soure and therelay transmit aording to a pre-de\u001cned shedule regardless of the fading state, inthe proposed sheme, always the node with the relatively stronger link is seleted fortransmission. For delay-unonstrained transmission, we derived the optimal adap-tive reeption-transmission poliy for the ases of \u001cxed and variable soure and relaytransmit powers. In both ases, the optimal poliy for a given time slot only dependson the instantaneous CSI of that time slot and the statistial CSI of the involvedlinks. For delay-onstrained transmission, we proposed a bu\u001ber-aided protool whihontrols the delay introdued by the bu\u001ber at the relay. This protool needs onlyinstantaneous CSI and does not need statistial CSI of the involved links, and anbe implemented in real-time. Our analytial and simulation results showed thatbu\u001ber-aided relaying with adaptive reeption-transmission with and without delayonstraints is a promising approah to inrease the ahievable average data rate om-pared to onventional relaying.86Chapter 4Bu\u001ber-Aided Relaying With AdaptiveReeption-Transmission: Fixed andMixed Rate Transmission4.1 IntrodutionIn this hapter, we onsider the two-hop HD relay network where the soure-relayand the relay-destination links are AWGN hannels a\u001beted by fading, and assumethat that the soure and\/or the relay do not have CSIT and therefore have to trans-mit odewords with a \u001cxed data rate. Moreover, we assume that the transmittedodewords span one fading state. In this ase, a hannel apaity in the strit Shan-non sense does not exist and an appropriate measure for suh systems is the outageprobability. Depending on the availability of CSIT at the transmitting nodes (andtheir apability of using more than one modulation\/oding sheme), we onsider twodi\u001berent modes of transmission for the two-hop HD relay network: Fixed rate trans-mission and mixed rate transmission. In \u001cxed rate transmission, the node seletedfor transmission (soure or relay) does not have CSIT and transmits with \u001cxed rate.In ontrast, in mixed rate transmission, the relay has CSIT knowledge and exploitsit to transmit with variable rate so that outages are avoided. However, the soure87Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionstill transmits with \u001cxed rate to avoid the need for CSIT aquisition.To explore the performane limits of the proposed \u001cxed rate and mixed rateadaptive reeption-transmission shemes, we onsider \u001crst transmission without de-lay onstraints and derive the orresponding optimal bu\u001ber-aided relaying protoolswhih maximize the throughput of the onsidered two-hop HD relay network. Fur-thermore, we show that in Rayleigh fading the optimal bu\u001ber-aided relaying protoolwith adaptive reeption-transmission ahieves a diversity gain of two and a diversity-multiplexing tradeo\u001b of DM(r) = 2(1\u2212 2r), where r denotes the multiplexing gain.In ontrast, onventional relaying ahieves a diversity gain of one. For mixed ratetransmission, we show that a multiplexing gain of one an be ahieved with bu\u001ber-aided relaying with and without adaptive reeption-transmission implying that thereis no multiplexing gain loss ompared to ideal FD relaying. Sine it turns out thatthese optimal bu\u001ber-aided protools introdue in\u001cnite delay, in order to limit the de-lay, we also introdue modi\u001ced bu\u001ber-aided relaying protools for delay onstrainedtransmission. In partiular, for \u001cxed rate and mixed rate transmission with delay on-straints, in order to ontrol the average delay, we introdue appropriate modi\u001cationsto the bu\u001ber-aided relaying protools for the delay unonstrained ase. Surprisingly,for \u001cxed rate transmission, the full diversity gain is preserved as long as the tolerableaverage delay exeeds three time slots. For mixed rate transmission with an averagedelay of E{T} time slots, a multiplexing gain of r = 1\u2212 1\/(2E{T}) is ahieved.The remainder of this hapter is organized as follows. In Setion 4.2, the systemmodel of the onsidered two-hop HD relay network is presented. In Setion 4.3 weintrodue the bu\u001ber-aided relaying protools for \u001cxed and mixed rate transmission. InSetions 4.4 and 4.5, we analyze the proposed bu\u001ber-aided relaying protools for delayunonstrained and delay onstrained \u001cxed rate transmission, respetively. Protools88Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionfor delay unonstrained and delay onstrained mixed rate transmission are proposedand analyzed in Setion 4.6. The proposed protools and the derived analytialresults are veri\u001ced and illustrated with numerial examples in Setion 4.7, and someonlusions are drawn in Setion 4.8.4.2 System Model and Channel ModelWe onsider the two-hop HD relay network shown in Fig. 3.1, where both S-R andR-D links are AWGN hannels a\u001beted by slow fading. We assume that the relayis equipped with a bu\u001ber. The soure sends odewords to the relay, whih deodesthese odewords, possibly stores the deoded information in its bu\u001ber, and eventuallysends it to the destination. We assume that time is divided into slots of equal lengths,that the fading is onstant during one time slot, and that every odeword spans onetime slot. Throughout this hapter, we assume that the soure node has alwaysdata to transmit. Hene, the total number of time slots, denoted by N , satis\u001cesN \u2192 \u221e. Furthermore, unless spei\u001ced otherwise, we assume that the bu\u001ber at therelay is not limited in size. The ase of limited bu\u001ber size will be investigated inSetions 4.5 and 4.6.4 when we investigate delay limited transmission. In the ithtime slot, the transmit powers of soure and relay are denoted by PS(i) and PR(i),respetively, and the instantaneous squared hannel gains of the S-R and R-D linksare denoted by hS(i) and hR(i), respetively. hS(i) and hR(i) are modeled as mutuallyindependent, non-negative, stationary, and ergodi random proesses with expetedvalues \u2126\u00afS , E{hS(i)} and \u2126\u00afR , E{hR(i)}. We assume that the hannel gains areonstant during one time slot but hange from one time slot to the next due to,e.g., the mobility of the involved nodes and\/or frequeny hopping. We note thatfor most results derived in this hapter, we only require hS(i) and hR(i) to be not89Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionfully temporally orrelated, respetively. However, in some ases, we will assume thathS(i) and hR(i) are temporally unorrelated, respetively, to failitate the analysis.The instantaneous SNRs of the S-R and R-D hannels in the ith time slotare given by s(i) , \u03b3S(i)hS(i) and r(i) , \u03b3R(i)hR(i), respetively. Here, \u03b3S(i) ,PS(i)\/\u03c32nR and \u03b3R(i) , PR(i)\/\u03c32nD denote the transmit SNRs of the soure and therelay without fading, respetively, and \u03c32nR and \u03c32nD are the varianes of the omplexAWGN at the relay and the destination, respetively. The average reeived SNRs atrelay and destination are denoted by \u2126S , E{s(i)} and \u2126R , E{r(i)}, respetively.Throughout this hapter, we assume transmission with apaity ahieving odes.Hene, the transmitted odewords by soure and relay span one time slot, are om-prised of n \u2192 \u221e omplex symbols whih are generated independently aording tothe zero-mean omplex irular-invariant Gaussian distribution. In time slot i, thevariane of soure's and relay's odewords are PS(i) and PR(i), and their date ratewill be determined in the following setion.For onreteness, we speialize some of the derived results to Rayleigh fading.In this ase, the PDFs of s(i) and r(i) are given by fs(s) = e\u2212s\/\u2126S\/\u2126S and fr(r) =e\u2212r\/\u2126R\/\u2126R, respetively. Similarly, the PDFs of hS(i) and hR(i) are given by fhS(hS) =e\u2212hS\/\u2126\u00afS\/\u2126\u00afS and fhR(hR) = e\u2212hR\/\u2126\u00afR\/\u2126\u00afR, respetively.In the following, we outline the general bu\u001ber-aided adaptive reeption-transmissionprotool for transmission with \u001cxed and mixed rates.4.3 Preliminaries and Benhmark ShemesIn this setion, we desribe the general bu\u001ber-aided adaptive reeption-transmissionprotool for transmission with \u001cxed and mixed rates. In partiular, we outline thetransmission rates of the soure and relay in eah time slot, the CSI requirements,90Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionthe dynamis of the queue, and the throughput reeived at the destination.4.3.1 Adaptive Reeption-Transmission and CSIRequirementsThe general bu\u001ber-aided adaptive reeption-transmission protool is as follows. Atthe beginning of eah time slot, the relay deides to either reeive a odeword fromthe soure or to transmit a odeword to the destination, i.e., deides whether to seletthe S-R or R-D link for transmission in a given time slot i. To this end, the relay isassumed to know the statistis of the S-R and R-D hannels. One the relay makesthe deision, it broadasts its deision (ontaining one bit of information) to the othernodes before transmission in time slot i begins. If they are seleted for transmission,the soure and the relay transmit odewords spanning one time slot and with rateswhih will be determined below. For seletion of the reeption and transmission, thenodes require CSI knowledge as will be detailed in the following.CSI for Fixed Rate TransmissionFor \u001cxed rate transmission, neither the soure nor the relay have full CSIT, i.e.,soure and relay do not know hS(i) and hR(i), respetively. Therefore, both nodesan transmit only with predetermined \u001cxed rates S0 and R0, respetively, and annotperform power alloation, i.e., the transmit powers are a priori \u001cxed as PS(i) = PSand PR(i) = PR, \u2200i. The relay and destination are assumed to know the CSI of theirreeiving links, whih is needed for oherent detetion. For the relay to be able todeide whether it should reeive or transmit, it requires knowledge of the outage statesof the S-R and R-D links. The relay an determine whether or not the S-R link is inoutage based on S0, PS, \u03c32nR, and hS(i). The destination an do the same for the R-D91Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionlink based on R0, PR, \u03c32nD , and hR(i), and inform the relay whether or not the R-Dlink is in outage using one bit of feedbak8information. Based on the outage statesof the S-R and R-D links in a given time slot i and the statistis of both links, therelay selets the transmitting node aording to the adaptive reeption-transmissionprotools introdued in Setions 4.4 and 4.5, and informs the soure and destinationabout its deision using one bit of feedbak information.CSI for Mixed Rate TransmissionFor this mode of transmission, we assume that the relay has full CSIT, i.e., it knowshR(i), and an therefore adjust its transmission rate and transmit power PR(i) toavoid outages on the R-D link. However, the soure still does not have CSIT andtherefore has to transmit with \u001cxed rate S0 and \u001cxed power PS as it does not knowhS(i). Similar to the \u001cxed rate ase, the relay an determine the outage state of theS-R link based on S0, PS, \u03c32nR , and hS(i). However, di\u001berent from the \u001cxed rate ase,in the mixed rate transmission mode, the relay also has to estimate hR(i), e.g., basedon pilot symbols emitted by the destination. Based on the outage state of the S-R linkand hR(i), and on the statistis of both links, the relay selets the transmitting nodeaording to the adaptive reeption-transmission protools proposed in Setion 4.6,and informs the soure and destination about its deision using one bit of feedbakinformation.For both modes of transmission, the relay knows the outage state of the S-R andthe R-D links. Hene, if the relay is seleted for transmission but the R-D link is inoutage, the relay remains silent and an outage event ours. Whereas, if the soure is8We note that in onventional relaying, feedbak of few bits of information does not improve theoutage performane of the two-hop HD relay network. On the ontrary, the two bits of feedbak(one from D to R and the other from R to S or D), along with the bu\u001ber at the relay have a pivotalrole in the proposed protool.92Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionseleted for transmission and the S-R link is in outage, the relay does not transmit afeedbak signal so that the soure remains silent, i.e., again an outage event ours.One the deision regarding the transmitting node has been made, and the relay hasinformed the transmitting node (soure or relay) aordingly, transmission in timeslot i begins.Remark 4.1. We note that all the derivations and results for mixed rate transmissionin this hapter also hold for the ase when the soure transmits with an adaptive rateand the relay transmits with a \u001cxed rate. The only di\u001berene is that in the derivedresults, the subsripts S and R should swith positons.Remark 4.2. We note that \u001cxed rate transmission requires only two emissions of pi-lot symbols (by soure and relay). In ontrast, mixed rate transmission requires threeemissions of pilot symbols (by soure, relay, and destination). Thus, the CSI re-quirements and feedbak overhead of the bu\u001ber-aided adaptive reeption-transmissionprotools proposed in this hapter are similar to those of existing relaying protools,suh as the opportunisti protool proposed in [14\u2104. Namely, the protool proposed in[14\u2104 requires the relays to aquire the instantaneous CSI of the S-R and R-D links.Furthermore, a few bits of information are fed bak from the relays to both the soureand the destination.4.3.2 Transmission Rates and Queue DynamisIn the following, we disuss the transmission rates and the state of the bu\u001ber whensoure and relay transmit in a given time slot i for both \u001cxed and mixed rate trans-mission.If the soure is seleted for transmission in time slot i and an outage does notour, i.e., log2(1 + s(i))\u2265 S0, it transmits one odeword with rate SSR(i) = S0.93Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionHene, the relay reeives S0 bits\/symb from the soure and appends them to thequeue in its bu\u001ber. The number of bits\/symb in the bu\u001ber of the relay at the end ofthe i-th time slot is denoted by Q(i) and given byQ(i) = Q(i\u2212 1) + S0. (4.1)If the soure is seleted for transmission but the S-R link is in outage, i.e., log2(1 +s(i))< S0, the soure remains silent, i.e., SSR(i) = 0, and the queue in the bu\u001berremains unhanged, i.e., Q(i) = Q(i\u2212 1).For \u001cxed rate transmission, if the relay is seleted for transmission in time slot iand transmits one odeword with rate R0, an outage does not our if log2(1+r(i))\u2265R0. In this ase, the number of bits\/symb transmitted by the relay is given byRRD(i) = min{R0, Q(i\u2212 1)}, (4.2)where we take into aount that the maximum number of bits\/symb that an besend by the relay is limited by the number of bits\/symb in the bu\u001ber. The numberof bits\/symb remaining in the bu\u001ber at the end of time slot i is given byQ(i) = Q(i\u2212 1)\u2212 RRD(i), (4.3)whih is always non-negative beause of (4.2). If the relay is seleted for transmissionin time slot i but an outage ours, i.e., log2(1 + r(i))< R0, the relay remainssilent, i.e., RRD(i) = 0, while the queue in the bu\u001ber remains unhanged, i.e., Q(i) =Q(i\u2212 1).For mixed rate transmission, the relay is able to adapt its rate to the apaityof the R-D hannel, log2(1 + r(i)), and outages are avoided. If the relay is seleted94Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionfor transmission in time slot i, the number of bits\/symb transmitted by the relay isgiven byRRD(i) = min{log2(1 + r(i)), Q(i\u2212 1)}. (4.4)In this ase, the number of bits\/symb remaining in the bu\u001ber at the end of time sloti is still given by (4.3) where RRD(i) is now given by (4.4).Furthermore, beause of the HD onstraint, for both \u001cxed and mixed rate trans-mission, we have RRD(i) = 0 and SSR(i) = 0 if soure and relay are seleted fortransmission in time slot i, respetively.4.3.3 Link Outages and Indiator VariablesIn order to model the outages on the S-R and R-D links, we introdue the binarylink outage indiator variables OS(i) \u2208 {0, 1} and OR(i) \u2208 {0, 1} de\u001cned asOS(i) ,\uf8f1\uf8f4\uf8f2\uf8f4\uf8f30 if s(i) < 2S0 \u2212 11 if s(i) \u2265 2S0 \u2212 1(4.5)andOR(i) ,\uf8f1\uf8f4\uf8f2\uf8f4\uf8f30 if r(i) < 2R0 \u2212 11 if r(i) \u2265 2R0 \u2212 1, (4.6)respetively. In other words, OS(i) = 0 indiates that for transmission with rate S0,the S-R link is in outage, i.e., log2(1 + s(i)) < S0, and OS(i) = 1 indiates that thetransmission over the S-R hannel will be suessful. Similarly, OR(i) = 0 indiatesthat for transmission with rate R0, the R-D link is in outage, i.e., log2(1+r(i)) < R0,95Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionand OR(i) = 1 means that an outage will not our. Furthermore, we denote theoutage probabilities of the S-R and R-D hannels as PS and PR, respetively. Theseprobabilities are de\u001cned asPS , limN\u2192\u221e1NN\u2211i=1(1\u2212 OS(i)) (a)= Pr{s(i) < 2S0 \u2212 1}(4.7)andPR , limN\u2192\u221e1NN\u2211i=1(1\u2212 OR(i)) (a)= Pr{r(i) < 2R0 \u2212 1}, (4.8)respetively, where (a) follows from the assumed ergodiity of the fading.4.3.4 Performane MetrisIn this hapter, we adopt the throughput and the outage probability as performanemetris.Assuming the soure has always data to transmit, for both \u001cxed and mixed ratetransmission, the average number of bits\/symb that arrive at the destination per timeslot is given by\u03c4 = limN\u2192\u221e1NN\u2211i=1RRD(i), (4.9)i.e., \u03c4 is the throughput of the onsidered ommuniation system.The outage probability is de\u001cned in the literature as the probability that theinstantaneous hannel apaity is unable to support some predetermined \u001cxed trans-mission rate. In the onsidered system, an outage does not ause information losssine the relay knows in advane whether or not the seleted link an support thehosen transmission rate and data is only transmitted if the orresponding link is not96Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionin outage. Nevertheless, outages still a\u001bet the ahievable throughput negatively. Inthis ase, the outage probability an be interpreted as the fration of the throughputlost due to outages. Thus, denoting the maximum throughput of a system in theabsene of outages by \u03c40 and the throughput in the presene of outages by \u03c4 , theoutage probability, Fout, an be expressed asFout = 1\u2212\u03c4\u03c4o. (4.10)Note that maximizing the throughput is equivalent to minimizing the outage proba-bility.4.3.5 Performane Benhmarks for Fixed Rate TransmissionFor \u001cxed rate transmission, two onventional relaying shemes serve as performanebenhmarks for the proposed bu\u001ber-aided relaying sheme with adaptive reeption-transmission. In ontrast to the proposed sheme, the benhmark shemes employ apredetermined shedule for when soure and relay transmit whih is independent ofthe instantaneous link SNRs.In the \u001crst sheme, referred to as Conventional Relaying 1, the soure transmitsin the \u001crst \u03beN time slots, where 0 < \u03be < 1 and eah odeword spans one time slot.The relay tries to deode these odewords and, if the deoding is suessful, it storesthe orresponding information in its bu\u001ber. In the following (1\u2212 \u03be)N time slots, therelay transmits the stored information to the destination, transmitting one odewordper time slot. Assuming that for the benhmark shemes soure and relay transmitodewords having the same rate, i.e., S0 = R0, the throughput of Conventional97Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionRelaying 1 is obtained as\u03c4fixedconv,1 = limN\u2192\u221e1N min{ \u03beN\u2211i=1R0OS(i) ,N\u2211i=\u03beN+1R0OR(i)}= R0 min {\u03be(1\u2212 PS) , (1\u2212 \u03be)(1\u2212 PR)} . (4.11)The throughput is maximized if \u03be(1 \u2212 PS) = (1 \u2212 \u03be)(1 \u2212 PR) holds or equivalentlyif \u03be = (1 \u2212 PR)\/(2 \u2212 PS \u2212 PR). Inserting \u03be into (4.11) we obtain the maximizedthroughput as\u03c4fixedconv,1 = R0(1\u2212 PS)(1\u2212 PR)2\u2212 PS \u2212 PR. (4.12)The maximum throughput in the absene of outages is \u03c40 = R0\/2. Hene, using(4.10), the orresponding outage probability is obtained asF fixedout,conv,1 = 1\u2212 2(1\u2212 PS)(1\u2212 PR)2\u2212 PS \u2212 PR. (4.13)In the seond sheme, referred to as Conventional Relaying 2, see [12\u2104, in the\u001crst time slot, the soure transmits one odeword and the relay reeives and triesto deode the odeword. If the deoding is suessful, in the seond time slot, therelay retransmits the information to the destination, otherwise it remains silent. Thethroughput of Conventional Relaying 2 is obtained as\u03c4fixedconv,2 = limN\u2192\u221e1NN\/2\u2211i=1R0OS(2i\u2212 1)OR(2i) =R02 (1\u2212 PS)(1\u2212 PR). (4.14)Based on (4.10) the orresponding outage probability is given byF fixedout,conv,2 = 1\u2212 (1\u2212 PS)(1\u2212 PR), (4.15)98Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionwhih is idential to the outage probability obtained in [12\u2104 using the standard de\u001cni-tion for the outage probability. We note that \u03c4fixedconv,1 \u2265 \u03c4fixedconv,2 (F fixedout,conv,1 \u2264 F fixedout,conv,2)always holds. However, in order for Conventional Relaying 1 to realize this gain, anin\u001cnite delay is required, whereas Conventional Relaying 2 requires a delay of onlyone time slot.For the speial ase of Rayleigh fading, we obtain from (4.7) and (4.8) PS =1\u2212 e\u22122R0\u22121\u2126Sand PR = 1\u2212 e\u22122R0\u22121\u2126R, respetively. The orresponding throughputs andoutage probabilities for Conventional Relaying 1 and 2 an be obtained by applyingthese results in (4.12)-(4.15). In partiular, in the high SNR regime, when \u03b3S = \u03b3R =\u03b3 \u2192\u221e, we obtain \u03c4fixedconv,1 \u2192 R0\/2, \u03c4fixedconv,2 \u2192 R0\/2, andF fixedout,conv,1 \u21922R0 \u2212 12\u2126\u00afS + \u2126\u00afR\u2126\u00afS\u2126\u00afR1\u03b3 , as \u03b3 \u2192\u221e, (4.16)F fixedout,conv,2 \u2192 (2R0 \u2212 1)\u2126\u00afS + \u2126\u00afR\u2126\u00afS\u2126\u00afR1\u03b3 , as \u03b3 \u2192\u221e. (4.17)Hene, for \u001cxed rate transmission, the diversity gain of Conventional Relaying 1 and2 is one as expeted.Note that due to the \u001cxed sheduling of reeption and transmission at the HDrelay for Conventional Relaying 1 and 2, feedbak of few bits of information from Dto R and R to S or D, annot improve the outage peformane. On ontrary, as will beshown, in bu\u001ber-aided relaying with adaptive reeption-transmission, the feedbak offew bits of information is essential and signi\u001cantly improves the outage peformane.4.3.6 Performane Benhmarks for Mixed Rate TransmissionWe also provide two performane benhmarks with a priori \u001cxed reeption-transmissionshedule for mixed rate transmission. The two benhmark protools are analogous to99Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionthe orresponding protools in the \u001cxed rate ase. Thus, for Conventional Relaying1, the soure transmits in the \u001crst \u03beN time slots with \u001cxed rate S0 and the relaytransmits in the remaining (1\u2212 \u03be)N time slots with rate R(i) = log2(1+ r(i)). Thus,the throughput is given by\u03c4mixedconv,1= limN\u2192\u221e1N min{\u03beN\u2211i=1S0OS(i),N\u2211i=\u03beN+1log2(1 + r(i))}= min {\u03be(1\u2212PS)S0, (1\u2212 \u03be)E{log2(1 + r(i))}}. (4.18)The throughput is maximized if \u03be satis\u001ces\u03beS0(1\u2212 PS) = (1\u2212 \u03be)E{log2(1 + r(i))} . (4.19)From (4.19), we obtain \u03be as\u03be = E{log2(1 + r(i))}S0(1\u2212 PS) + E{log2(1 + r(i))}. (4.20)Inserting \u03be into (4.18) leads to the throughput of mixed rate transmission under theConventional Relaying 1 protool\u03c4mixedconv,1 =S0(1\u2212 PS)E{log2(1 + r(i))}S0(1\u2212 PS) + E{log2(1 + r(i))}. (4.21)Assuming Rayleigh fading links E{log2(1 + r(i))} is obtained asE{log2(1 + r(i))} =e1\/\u2126Rln(2)E1( 1\u2126R)(4.22)100Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionfor \u001cxed transmit powers. If adaptive power alloation is employed, E{log2(1+r(i))}beomesE{log2(1 + r(i))} =1ln(2)E1( \u03bbc\u2126\u00afR), (4.23)where \u03bbc is found from the power onstraint(1\u2212 PS)\u03b3S +\u222b \u221e\u03bbc( 1\u03bbc\u2212 1hR)fhR(hR)dhR = 2\u0393. (4.24)Here, \u0393 denotes the average transmit power. In the high SNR regime, where \u03b3S =\u03b3R = \u03b3 \u2192\u221e, E{log2(1 + r(i))} \u226b S0(1\u2212PS) holds. Thus, the throughput in (4.21)onverges to\u03c4mixedconv,1 \u2192 S0 , as \u03b3 \u2192\u221e , (4.25)whih leads to the interesting onlusion that mixed rate transmission ahieves amultiplexing rate of one even if suboptimal onventional relaying is used.For Conventional Relaying 2, the performane of mixed rate transmission is iden-tial to that of \u001cxed rate transmission. Sine the relay does not employ a bu\u001berfor Conventional Relaying 2, even with mixed rate transmission, the relay an onlytransmit suessfully all of the reeived information if S0 \u2264 log2(1 + r(i)) and has toremain silent otherwise.101Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmission4.4 Optimal Bu\u001ber-Aided Relaying for Fixed RateTransmission Without Delay ConstraintsIn this setion, we investigate bu\u001ber-aided relaying with adaptive reeption-transmis-sion for \u001cxed rate transmission without delay onstraints, i.e., the transmission ratesof the soure and the relay are \u001cxed. We derive the optimal adaptive reeption-transmission protool and analyze the orresponding throughput and outage prob-ability. The obtained results onstitute performane upper bounds for \u001cxed ratetransmission with delay onstraints, whih will be onsidered in Setion 4.5.4.4.1 Problem FormulationIn order to model the reeption and transmission of the relay, again we introduethe binary adaptive reeption-transmission variable di \u2208 {0, 1}. Here, again di = 1indiates that the R-D link is seleted for transmission in time slot i, i.e., the relaytransmits and the destination reeives. Similarly, if di = 0, the S-R link is seletedfor transmission in time slot i, i.e., the soure transmits and the relay reeives.Based on the de\u001cnitions of OS(i), OR(i), and di, the number of bits\/symb sentfrom the soure to the relay and from the relay to the destination in time slot i anbe written in ompat form asSSR(i) = (1\u2212 di)OS(i)S0 (4.26)andRRD(i) = diOR(i)min{R0, Q(i\u2212 1)}, (4.27)102Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionrespetively. Consequently, the throughput in (4.9) an be rewritten as\u03c4 = limN\u2192\u221e1NN\u2211i=1diOR(i)min{R0, Q(i\u2212 1)}. (4.28)In the following, we maximize the throughput by optimizing the adaptive reeption-transmission variable di, whih represents the only degree of freedom in the onsideredproblem. In partiular, as already mentioned in Setion 4.3, sine both transmittingnodes do not have the full CSI of their respetive transmit hannels, power alloationis not possible and we assume \u001cxed transmit powers PS(i) = PS and PR(i) = PR, \u2200i.4.4.2 Throughput MaximizationLet us \u001crst de\u001cne the average arrival rate of bits\/symb per slot into the queue of thebu\u001ber, A, and the average departure rate of bits\/symb per slot out of the queue ofthe bu\u001ber, D, as [83\u2104A , limN\u2192\u221e1NN\u2211i=1(1\u2212 di)OS(i)S0 (4.29)andD , limN\u2192\u221e1NN\u2211i=1diOR(i)min{R0, Q(i\u2212 1)}, (4.30)respetively. We note that the departure rate of the queue is equal to the throughput.The queue is said to be an absorbing queue if A > D = \u03c4 , in whih ase a frationof the information sent by the soure is trapped in the unlimited size bu\u001ber and annever be extrated from it. The following theorem provides a useful ondition for theoptimal poliy whih maximizes the throughput.103Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionTheorem 4.1. The adaptive reeption-transmission poliy that maximizes the through-put of the onsidered bu\u001ber-aided relaying system an be found in the set of adaptivereeption-transmission poliies that satisfylimN\u2192\u221e1NN\u2211i=1(1\u2212 di)OS(i)S0 = limN\u2192\u221e1NN\u2211i=1diOR(i)R0. (4.31)When (4.31) holds, the queue is non-absorbing but is at the edge of absorption, i.e.,a small inrease of the arrival rate will lead to an absorbing queue. Moreover, when(4.31) holds the throughput is given by\u03c4 = limN\u2192\u221e1NN\u2211i=1(1\u2212 di)OS(i)S0 = limN\u2192\u221e1NN\u2211i=1diOR(i)R0. (4.32)Proof. Please refer to Appendix C.1.Remark 4.3. A queue that meets ondition (4.31) is rate-stable sine there is no lossof information in the unlimited bu\u001ber, i.e., the information that goes in the bu\u001bereventually leaves the bu\u001ber without any loss.Remark 4.4. The min(\u00b7) funtion in (4.28) is absent in the throughput in (4.31),whih is ruial for \u001cnding a tratable analytial expression for the optimal adaptivereeption-transmission poliy. In partiular, as shown in Appendix C.1, ondition(4.31) automatially ensures that for N \u2192\u221e,\u03c4 = 1NN\u2211i=1diOR(i)min{R0, Q(i\u2212 1)} =1NN\u2211i=1diOR(i)R0is valid, i.e., the impat of event R0 > Q(i\u22121), i = 1, . . . , N , is negligible. Hene, forthe optimal adaptive reeption-transmission poliy, the queue is non-absorbing but isalmost always \u001clled to suh a level that the number of bits\/symb in the queue exeed104Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionthe number of bits\/symb that an be transmitted over the R-D hannel, i.e., the bu\u001beris pratially always fully baklogged. This result is intuitively pleasing. Namely, ifthe queue would be rate-unstable, it would absorb bits\/symb and the throughput ouldbe improved by having the relay transmit more frequently. On the other hand, if thequeue was not (pratially) fully baklogged, the e\u001bet of the event R0 > Q(i \u2212 1)would not be negligible and the system would loose out on transmission opportunitiesbeause of an insu\u001eient number of bits\/symb in the bu\u001ber.Aording to Theorem 4.1, in order to maximize the throughput, we have to searhfor the optimal poliy only in the set of poliies that satisfy (4.31). Therefore, thesearh for the optimal poliy an be formulated as an optimization problem, whihfor N \u2192\u221e has the following formMaximize :di1N\u2211Ni=1 diOR(i)R0Subject to : C1 : 1N\u2211Ni=1(1\u2212 di)OS(i)S0 = 1N\u2211Ni=1 diOR(i)R0C2 : di \u2208 {0, 1}, \u2200i,(4.33)where onstraint C1 ensures that the searh for the optimal poliy is onduted onlyamong those poliies that satisfy (4.31) and C2 ensures that di \u2208 {0, 1}. We notethat C1 and C2 do not exlude the ase that the relay is hosen for transmission ifR0 > Q(i \u2212 1). However, as explained in Remark 4.4, C1 ensures that the in\u001dueneof event R0 > Q(i\u2212 1) is negligible. Therefore, an additional onstraint dealing withthis event is not required.Before we solve problem (4.33), we note that, as will be shown in the following,the optimal adaptive reeption-transmission poliy may require a oin \u001dip. For thispurpose, let C denote the outome of a oin \u001dip whih takes values from the set{0, 1}, and let us denote the probabilities of the outomes by PC = Pr{C = 1} and105Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionPr{C = 0} = 1\u2212PC , respetively. Now, we are ready to provide the solution of (4.33),whih onstitutes the optimal adaptive reeption-transmission poliy maximizing thethroughput for \u001cxed rate transmission. This is onveyed in the following theorem.Theorem 4.2. For the optimal adaptive reeption-transmission poliy maximizing thethroughput of the onsidered bu\u001ber-aided relaying system for \u001cxed rate transmission,three mutually exlusive ases an be distinguished depending on the values of PS andPR:Case 1:PS \u2264S0S0 +R0(1\u2212 PR)AND PR \u2264R0R0 + S0(1\u2212 PS).(4.34)In this ase, the optimal adaptive reeption-transmission poliy is given bydi =\uf8f1\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f2\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f30 if OS(i) = 1 AND OR(i) = 01 if OS(i) = 0 AND OR(i) = 10 if OS(i) = 1 AND OR(i) = 1 AND C = 01 if OS(i) = 1 AND OR(i) = 1 AND C = 1\u03b5 if OS(i) = 0 AND OR(i) = 0(4.35)where \u03b5 an be set to 0 or 1 as neither the soure nor the relay will transmit be-ause both links are in outage. On the other hand, if both links are not in outage,i.e., OS(i) = 1 and OR(i) = 1, the oin \u001dip deides whih node transmits and theprobability of C = 1 is given byPC =S0(1\u2212 PS)\u2212 (1\u2212 PR)PSR0(1\u2212 PS)(1\u2212 PR)(S0 +R0). (4.36)106Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionBased on (4.35), the maximum throughput is obtained as\u03c4 = S0R0S0 +R0(1\u2212 PSPR). (4.37)Case 2:PR >R0R0 + S0(1\u2212 PS)(4.38)In this ase, the optimal adaptive reeption-transmission poliy is haraterized bydi =\uf8f1\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f2\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f30 if OS(i) = 1 AND OR(i) = 0 AND C = 01 if OS(i) = 1 AND OR(i) = 0 AND C = 11 if OS(i) = 0 AND OR(i) = 11 if OS(i) = 1 AND OR(i) = 1\u03b5 if OS(i) = 0 AND OR(i) = 0(4.39)The probability of outome C = 1 of the oin \u001dip is given byPC =S0(1\u2212 PS)PR \u2212 (1\u2212 PR)R0(1\u2212 PS)PRS0, (4.40)and the maximum throughput an be obtained as\u03c4 = R0(1\u2212 PR). (4.41)Case 3:PS >S0S0 +R0(1\u2212 PR). (4.42)107Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionIn this ase, the adaptive reeption-transmission poliy that maximizes the throughputis given bydi =\uf8f1\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f2\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f30 if OS(i) = 1 AND OR(i) = 00 if OS(i) = 0 AND OR(i) = 1 AND C = 01 if OS(i) = 0 AND OR(i) = 1 AND C = 10 if OS(i) = 1 AND OR(i) = 1\u03b5 if OS(i) = 0 AND OR(i) = 0(4.43)The probability of C = 1 is given byPC =S0(1\u2212 PS)R0(1\u2212 PR)PS, (4.44)and the maximum throughput is\u03c4 = S0(1\u2212 PS). (4.45)Proof. Please refer to Appendix C.2.Remark 4.5. We note that in the seond line of (4.39), we set di = 1 although theR-D link is in outage (OR(i) = 0) while the S-R link is not in outage (OS(i) = 1).In other words, in this ase, neither node transmits although the soure node ouldsuessfully transmit. However, if the soure node transmitted in this situation, thequeue at the relay would beome an absorbing queue. Similarly, in the seond lineof (4.43), we set di = 0 although the S-R link is in outage. Again, neither nodetransmits in order to ensure that ondition (4.31) is met. However, in this ase, theexat same throughput as in (4.45) an be ahieved with a simpler and more pratialadaptive reeption-transmission poliy than that in (4.43). This is addressed in the108Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionfollowing lemma.Lemma 4.1. The throughput ahieved by the adaptive reeption-transmission pol-iy in (4.43) an also be ahieved with the following simpler adaptive reeption-transmission poliy.IfPS >S0S0 +R0(1\u2212 PR), (4.46)an adaptive reeption-transmission poliy maximizing the throughput is given bydi =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f30 if OS(i) = 11 if OS(i) = 0, (4.47)and the maximum throughput is\u03c4 = S0(1\u2212 PS). (4.48)Proof. The poliy given by (4.43) has the same average arrival rate as poliy (4.47)sine for both poliies the soure always transmits when OS(i) = 1. Therefore, sinefor both poliies the queue is non-absorbing, by the law of onservation of \u001dow, theirthroughputs are idential to their arrival rates. Thus, both poliies ahieve identialthroughputs.Remark 4.6. Note that when PR > R0\/(R0+S0(1\u2212PS)) (PS > S0\/(S0+R0(1\u2212PR)))holds, the throughput is given by (4.41) ((4.45)), whih is idential to the maximalthroughput that an be obtained in a point-to-point ommuniation between relay anddestination (soure and relay). Therefore, when PR > R0\/(R0 + S0(1 \u2212 PS)) (PS >109Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionS0\/(S0 + R0(1 \u2212 PR))) holds, as far as the ahievable throughput is onerned, thetwo-hop HD relay hannel is equivalent to the point-to-point R-D (S-R) hannel.For omparison, we also provide the maximum throughput in the absene ofoutages \u03c40. The throughput in the absene of outages, \u03c40, an be obtained by settingOS(i) = OR(i) = 1, \u2200i, whih is equivalent to setting PS = PR = 0 in Theorem4.2. Then, Case 1 in Theorem 4.2 always holds and the optimal adaptive reeption-transmission poliy isdi =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f30 if C = 01 if C = 1(4.49)where the probability of C = 1 is given byPC =S0S0 +R0. (4.50)Based on (4.49), the maximum throughput in the absene of outages is\u03c40 =S0R0S0 +R0. (4.51)The throughput loss aused by outages an be observed by omparing (4.37), (4.41),and (4.45) with (4.51).We now provide the outage probability of the proposed bu\u001ber-aided relayingsheme with adaptive reeption-transmission.Lemma 4.2. The outage probability of the system onsidered in Theorem 4.2 is given110Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionbyFout =\uf8f1\uf8f4\uf8f4\uf8f4\uf8f4\uf8f2\uf8f4\uf8f4\uf8f4\uf8f4\uf8f3PR \u2212 (1\u2212 PR)R0\/S0 , if PR > R0R0+S0(1\u2212PS)PS \u2212 (1\u2212 PS)S0\/R0 , if PS > S0S0+R0(1\u2212PR)PSPR , otherwise.(4.52)Proof. Please refer to Appendix C.3.Remark 4.7. In the proof of Lemma 4.2 given in Appendix C.3, it is shown that anoutage event happens when neither the soure nor the relay transmit in a time slot,i.e., the number of silent slots is idential to the number of outage events.In the high SNR regime, when the outage probabilities of both involved linksare small, the expressions for the throughput and the outage probability an besimpli\u001ced to obtain further insight into the performane of bu\u001ber-aided relaying.This is addressed in the following lemma.Lemma 4.3. In the high SNR regime, \u03b3S = \u03b3R = \u03b3 \u2192 \u221e, the throughput andthe outage probability of the bu\u001ber-aided relaying system onsidered in Theorem 4.2onverge to\u03c4 \u2192 \u03c40 =S0R0S0 +R0, as \u03b3 \u2192\u221e , (4.53)Fout = PSPR. (4.54)Proof. In the high SNR regime, we have PS \u2192 0 and PR \u2192 0. Thus, ondition (4.34)always holds and therefore Fout is given by (4.54). Furthermore, as PS \u2192 0 andPR \u2192 0, (4.37) simpli\u001ces to (4.53).111Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmission4.4.3 Performane in Rayleigh FadingFor onreteness, we assume in this subsetion that both links of the onsidered two-hop HD relay network are Rayleigh fading. We examine the diversity order and thediversity-multiplexing trade-o\u001b.Lemma 4.4. For the speial ase of Rayleigh fading links, the bu\u001ber-aided relayingsystem onsidered in Theorem 4.2 ahieves a diversity gain of two, i.e., in the highSNR regime, when \u03b3S = \u03b3R = \u03b3 \u2192 \u221e, the outage probability, Fout, deays on alog-log sale with slope \u22122 as a funtion of the transmit SNR \u03b3, and is given byFout \u21922S0 \u2212 1\u2126\u00afS2R0 \u2212 1\u2126\u00afR1\u03b32 , as \u03b3 \u2192\u221e. (4.55)Furthermore, the onsidered bu\u001ber-aided relaying system ahieves a diversity-multiplexingtrade-o\u001b, DM(r), ofDM(r) = 2(1\u2212 2r), 0 < r < 1\/2. (4.56)Proof. Please refer to Appendix C.4.Remark 4.8. We reall that, for \u001cxed rate transmission, both onsidered onventionalrelaying shemes without adaptive reeption-transmission ahieved only a diversitygain of one, f. (4.16), (4.17), despite the fat that Conventional Relaying 1 alsohas an unlimited bu\u001ber and entails an in\u001cnite delay. Thus, we expet large gains interms of outage probability of the proposed bu\u001ber-aided relaying protool with adaptivereeption-transmission ompared to onventional relaying.The performane of the onsidered system an be further improved by optimizingthe transmission rates R0 and S0 based on the hannel statistis. For Rayleigh fading112Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionwith given \u2126\u00afS and \u2126\u00afR, we an optimize R0 and S0 for minimization of the outageprobability. This is addressed in the following lemma for high SNR.Lemma 4.5. Assuming Rayleigh fading, the optimal transmission rates S0 and R0that minimize the outage probability in the high SNR regime, while maintaining athroughput of \u03c40, are given by R0 = S0 = 2\u03c40.Proof. The throughput in the high SNR regime is given by (4.53), whih an berewritten as R0 = S0\u03c40\/(S0 \u2212 \u03c40). Inserting this into the asymptoti expression forFout in (4.55) and minimizing it with respet to S0 yields S0 = R0 = 2\u03c40.Remark 4.9. For Rayleigh fading, although in the low SNR regime, the optimal S0and R0 an be nonidential, in the high SNR regime, independent of the values of \u2126\u00afSand \u2126\u00afR, the minimum Fout is obtained for idential transmission rates for both links.Furthermore, in the high SNR regime, when \u03b3S = \u03b3R \u2192 \u221e, for S0 = R0, the oin\u001dip probability PC onverges to PC = Pr{C = 1} = Pr{C = 0} \u2192 1\/2.4.5 Bu\u001ber-Aided Relaying for Fixed RateTransmission With Delay ConstraintsThe protool proposed in Setion 4.4 does not impose any onstraint on the delaythat a transmitted bit of information experienes. However, in pratie, most om-muniation servies require delay onstraints. Therefore, in this setion, we modifythe bu\u001ber-aided relaying protool derived in the previous setion to aount for on-straints on the average delay. Furthermore, we analyze the e\u001bet of the applied mod-i\u001cation on the throughput and the outage probability. For simpliity, throughoutthis setion, we assume S0 = R0. We note that the adaptive reeption-transmission113Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionprotools proposed in Setion 4.5.2 are also appliable to the ase of S0 6= R0. How-ever, sine for S0 6= R0 the odewords transmitted by the soure do not ontain thesame number of bits\/symb as the odewords transmitted by the relay, the Markovhain based throughput and delay analyses in Setions 4.5.3 and 4.5.4 would be moreompliated. On the other hand, sine we found in the previous setion that, for highSNR, idential soure and relay transmission rates minimize the outage probability,we avoid these additional ompliations here and onentrate on the ase S0 = R0.Furthermore, to failitate our analysis, throughout this setion, we assume temporallyunorrelated fading.4.5.1 Average DelayWe de\u001cne the delay of a bit as the time interval from its transmission by the soure toits reeption at the destination. Thus, assuming that the propagation delays in theS-R and R-D links are negligible, the delay of a bit is idential to the time that thebit is held in the bu\u001ber. As a onsequene, we an use Little's law [85\u2104 and expressthe average delay in number of time slots asE{T} = E{Q}A , (4.57)where E{Q} = limN\u2192\u221e\u2211Ni=1Q(i)\/N is the average length of the queue in the bu\u001berof the relay and A is the arrival rate into the queue as de\u001cned in (4.29). From (4.57),we observe that the delay an be ontrolled via the queue size.114Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmission4.5.2 Adaptive Reeption-Transmission Protool for DelayLimited TransmissionAs mentioned before, we modify the optimal adaptive reeption-transmission protoolderived in Setion 4.4 in order to limit the average delay. However, depending onthe targeted average delay, somewhat di\u001berent modi\u001cations are neessary, sine itis not possible to ahieve any desired delay with one protool. Hene, three di\u001berentadaptive reeption-transmission protools are introdued in the following proposition.Proposition 4.1. For \u001cxed rate transmission with delay onstraint, depending onthe targeted average delay E{T} and the outage probabilities PS and PR, we proposethe following adaptive reeption-transmission poliies:Case 1: If PR < 1\/(2\u2212 PS) and the required delay E{T} satis\u001cesE{T} > 11\u2212 PR (2\u2212 PS)+ 2 (1\u2212 PS)1\u2212 PSPR (2\u2212 PS), (4.58)we propose the following adaptive reeption-transmission variable di to be used:If Q(i\u2212 1) \u2264 R0 and OS(i) = 1, then di = 0,otherwise di is given by (4.35). (4.59)Case 2: If PR < 1\/(2\u2212 PS) and the required delay E{T} satis\u001ces11\u2212 PR (2\u2212 PS)< E{T} \u2264 11\u2212 PR (2\u2212 PS)+ 2 (1\u2212 PS)1\u2212 PSPR (2\u2212 PS), (4.60)115Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionwe propose the following adaptive reeption-transmission variable di to be used:If Q(i\u2212 1) = 0 and OS(i) = 1, then di = 0,otherwise di is given by (4.35). (4.61)Case 3: If the required delay E{T} satis\u001ces11\u2212 PR< E{T} \u2264 11\u2212 PR (2\u2212 PS), (4.62)we propose the following adaptive reeption-transmission variable di to be used:If Q(i\u2212 1) = 0 and OS(i) = 1, then di = 0,otherwise di is given by (4.39). (4.63)For eah of the proposed adaptive reeption-transmission variables di, the requireddelay an be met by adjusting the value of PC = Pr{C = 1}, where the minimum andmaximum delays are ahieved with PC = 1 and PC = 0, respetively.Remark 4.10. The delay limits given by (4.58), (4.60), and (4.62) arise fromthe analysis of the proposed protools with adaptive reeption-transmission variables(4.59), (4.61), and (4.63), respetively. We will investigate these delay limits inLemma 4.7 in Setion 4.5.3 and the orresponding proof is provided in Appendix C.7.Remark 4.11. We have not proposed a bu\u001ber-aided relaying protool with adaptivereeption-transmission that an satisfy a required delay smaller than 1\/(1\u2212PR). Forsuh small delays, Conventional Relaying 2 without adaptive reeption-transmissionan be used. However, if retransmission of the outage odewords is taken into aount,then not even for Conventional Relaying 2 an ahieve a delay smaller than 1\/(1 \u2212116Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionPR).4.5.3 Throughput and DelayIn the following, we analyze the throughput, the average delay, and the probabilityof having k pakets in the queue for the modi\u001ced adaptive reeption-transmissionprotools proposed in Proposition 4.1 in the previous subsetion. The results aresummarized in the following theorem.Theorem 4.3. Consider a bu\u001ber-aided relaying system operating in temporally un-orrelated blok fading. Let soure and relay transmit with rate R0, respetively, andlet the bu\u001ber size at the relay be limited to L pakets eah omprised of R0 bits\/symb.Assume that the relay drops newly reeived pakets if the bu\u001ber is full. Then, depend-ing on the adopted adaptive reeption-transmission protool, the following ases anbe distinguished:Case 1: If the adaptive reeption-transmission variable di is given by (4.59), theprobability of the bu\u001ber having k pakets in its queue, Pr{Q = kR0}, is obtained asPr{Q = kR0} =\uf8f1\uf8f4\uf8f4\uf8f4\uf8f2\uf8f4\uf8f4\uf8f4\uf8f4\uf8f3pL\u22121(2p+q\u22121)(PS\u2212q)pL\u22121(2p(1\u2212q)+q(2\u2212q)\u2212PS (2\u2212PS))\u2212(1\u2212p\u2212q)L\u22121(1\u2212PS)2 , k = 0pL\u22121(2p+q\u22121)(1\u2212PS)pL\u22121(2p(1\u2212q)+q(2\u2212q)\u2212PS (2\u2212PS))\u2212(1\u2212p\u2212q)L\u22121(1\u2212PS)2 , k = 1pL\u2212k(2p+q\u22121)(1\u2212PS )2(1\u2212p\u2212q)k\u22122pL\u22121(2p(1\u2212q)+q(2\u2212q)\u2212PS (2\u2212PS))\u2212(1\u2212p\u2212q)L\u22121(1\u2212PS)2 , k=2, ..., L(4.64)where p and q are given byp = (1\u2212 PS)(1\u2212 PR)PC + PS(1\u2212 PR) ; q = PSPR. (4.65)117Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionFurthermore, the average queue length, E{Q}, the average delay, E{T}, and through-put, \u03c4 , are given byE{Q} = R01\u2212 PS2p+ q \u2212 1pL\u22121 ((2p+ q)2 \u2212 p\u2212 q \u2212 PS(3p+ q \u2212 1))\u2212 (1\u2212 PS)(1\u2212 p\u2212 q)L\u22121(L(2p+ q \u2212 1) + p)pL\u22121(2p(1\u2212 q) + (2\u2212 q)q \u2212 (2\u2212 PS)PS)\u2212 (1\u2212 PS)2(1\u2212 p\u2212 q)L\u22121(4.66)E{T} = 12p+ q \u2212 1pL\u22121 ((2p+ q)2 \u2212 PS(3p+ q \u2212 1)\u2212 p\u2212 q)\u2212 (1\u2212 PS)(1\u2212 p\u2212 q)L\u22121(L(2p+ q \u2212 1) + p)pL\u22121(PS(p+ q \u2212 1)\u2212 q(2p+ q) + p+ q)\u2212 (1\u2212 PS)p(1\u2212 p\u2212 q)L\u22121(4.67)\u03c4 = (1\u2212 PS)1\u2212 PS)p(1\u2212 p\u2212 q)L\u22121 + pL\u22121(PS(1\u2212 p\u2212 q) + q(2p+ q)\u2212 p\u2212 q)pL\u22121((2\u2212 PS)PS \u2212 2p(1\u2212 q)\u2212 (2\u2212 q)q)(1\u2212 PS)2(1\u2212 p\u2212 q)L\u22121. (4.68)Case 2: If adaptive reeption-transmission variable di is given by either (4.61) or(4.63), the probability of the bu\u001ber having k pakets in its queue, Pr{Q = kR0}, isgiven byPr{Q = kR0} =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f3pL(2p+q\u22121)pL(2p+q\u2212PS)\u2212(1\u2212PS)(1\u2212p\u2212q)L , k = 0(1\u2212PS)(2p+q\u22121)pL\u2212k(1\u2212p\u2212q)k\u22121pL(2p+q\u2212PS)\u2212(1\u2212PS)(1\u2212p\u2212q)L , k = 1, ..., L(4.69)where, if adaptive reeption-transmission variable di is given by (4.61), p and q are118Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissiongiven by (4.65), while if adaptive reeption-transmission variable di is given by (4.63),p and q are given byp = 1\u2212 PR and q = PSPR + (1\u2212 PS)PRPC . (4.70)Furthermore, the average queue length, E{Q}, the average delay, E{T}, and through-put, \u03c4 , are given byE{Q} = R01\u2212 PS2p+ q \u2212 1pL+1 \u2212 (1\u2212 p\u2212 q)L(L(2p+ q \u2212 1) + p)pL(2p+ q \u2212 PS)\u2212 (1\u2212 PS)(1\u2212 p\u2212 q)L, (4.71)E{T} = 12p+ q \u2212 11ppL+1 \u2212 (1\u2212 p\u2212 q)L(L(2p+ q \u2212 1) + p)pL \u2212 (1\u2212 p\u2212 q)L , (4.72)\u03c4 = R0(1\u2212 PS)ppL \u2212 (1\u2212 p\u2212 q)LpL(2p+ q \u2212 PS)\u2212 (1\u2212 PS)(1\u2212 p\u2212 q)L. (4.73)Proof. Please refer to Appendix C.5.Due to their omplexity, the equations in Theorem 4.3 do not provide muh insightinto the performane of the onsidered system. To overome this problem, we onsiderthe ase L\u226b 1, whih leads to signi\u001cant simpli\u001cations and design insight. This isaddressed in the following lemma.Lemma 4.6. For the system onsidered in Theorem 4.3, assume that L\u2192\u221e. In thisase, for a system with adaptive reeption-transmission variable di given by (4.59),(4.61), or (4.63) to be able to ahieve a \u001cxed delay, E{T}, that does not grow withL as L \u2192 \u221e, the ondition 2p + q \u2212 1 > 0 must hold. If 2p + q \u2212 1 > 0 holds, thefollowing simpli\u001cations an be made for eah of the onsidered adaptive reeption-transmission variables:119Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionCase 1: If the adaptive reeption-transmission variable di is given by (4.59), theprobability of the bu\u001ber being empty, the average delay, E{T}, and throughput, \u03c4 ,simplify toPr{Q = 0} = PS2PC(1\u2212 PR)(1\u2212 PS) + (2\u2212 PR)PS \u2212 12PC(1\u2212 PS)(1\u2212 PSPR) + P 2S(1\u2212 PR)(4.74)E{T} = 12PC(1\u2212 PR)(1\u2212 PS)\u2212 PRPS + 2PS \u2212 1+ 2PC(1\u2212 PS)P 2S(PC(2PR \u2212 1)\u2212 PR + 1)\u2212 2PCPRPS + PC(4.75)\u03c4 = R0(1\u2212 PS)P 2S(PC(2PR \u2212 1)\u2212 PR + 1)\u2212 2PCPRPS + PC2PC(1\u2212 PS)(1\u2212 PSPR) + (1\u2212 PR)P 2S. (4.76)Case 2: If the adaptive reeption-transmission variable di is given by (4.61), theprobability of the bu\u001ber being empty, the average delay, E{T}, and throughput, \u03c4 ,simplify toPr{Q=0}= 2PC(1\u2212 PR)(1\u2212 PS) + PS(2\u2212 PR)\u2212 1(1\u2212 PR)(PS + 2PC(1\u2212 PS))(4.77)E{T} = 12PC(1\u2212 PR)(1\u2212 PS)\u2212 PRPS + 2PS \u2212 1(4.78)\u03c4 = R0(1\u2212 PS)PC(1\u2212 PS) + PS2PC(1\u2212 PS) + PS. (4.79)Case 3: If the adaptive reeption-transmission variable di is given by (4.63), theprobability of the bu\u001ber being empty, the average delay, E{T}, and the throughput,120Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmission\u03c4 , simplify toPr{Q = 0} = 1\u2212 PR(2\u2212 PS \u2212 PC(1\u2212 PS))2\u2212 PS \u2212 PR(2\u2212 PS \u2212 PC(1\u2212 PS))(4.80)E{T} = 11\u2212 PR(2\u2212 PS \u2212 PC(1\u2212 PS))(4.81)\u03c4 = R01 + PSPR \u2212 PR \u2212 PS2\u2212 PS \u2212 PR(2\u2212 PS \u2212 PC(1\u2212 PS)). (4.82)For eah of the onsidered ases, the probability PC an be used to adjust the desiredaverage delay E{T} in (4.75), (4.78), and (4.81).Proof. Please refer to Appendix C.6.As already mentioned in Proposition 4.1, it is not possible to ahieve any desiredaverage delay with the proposed bu\u001ber-aided adaptive reeption-transmission proto-ols. The limits of the ahievable average delay for eah of the proposed adaptivereeption-transmission variables di in Proposition 4.1 are provided in the followinglemma.Lemma 4.7. Depending on the adopted adaptive reeption-transmission variable dithe following ases an be distinguished for the average delay:Case 1: If the adaptive reeption-transmission variable di is given by (4.59), thenif PR < 1\/(2\u2212 PS) and PS < 1\/(2\u2212 PR), the system an ahieve any average delayE{T} \u2265 Tmin,1, where Tmin,1 is given byTmin,1 =11\u2212 PR (2\u2212 PS)+ 2 (1\u2212 PS)1\u2212 PSPR (2\u2212 PS). (4.83)On the other hand, if PR < 1\/(2\u2212PS) and PS > 1\/(2\u2212PR), the system an ahieve121Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionany average delay in the interval Tmin,1 \u2264 E{T} \u2264 Tmax,1, where Tmax,1 is given byTmax,1 =1PS(2\u2212 PR)\u2212 1. (4.84)Case 2: If the adaptive reeption-transmission variable di is given by (4.61), thenif PR < 1\/(2\u2212 PS) and PS < 1\/(2\u2212 PR), the system an ahieve any average delayE{T} \u2265 Tmin,2, where Tmin,2 is given byTmin,2 =11\u2212 PR(2\u2212 PS). (4.85)However, if PR < 1\/(2 \u2212 PS) and PS > 1\/(2 \u2212 PR), the system an ahieve anyaverage delay Tmin,2 \u2264 E{T} \u2264 Tmax,2, where Tmax,2 = Tmax,1.Case 3: If the adaptive reeption-transmission variable di is given by (4.63), thenif PR > 1\/(2\u2212 PS), the system an ahieve any average delay E{T} \u2265 Tmin,3, whereTmin,3 is given byTmin,3 =11\u2212 PR. (4.86)On the other hand, if PR < 1\/(2 \u2212 PS), the system an ahieve any average delayTmin,3 \u2264 E{T} \u2264 Tmax,3, where Tmax,3 = Tmin,2.Proof. Please refer to Appendix C.7.In the following, we investigate the outage probability of the proposed bu\u001ber-aidedrelaying protool for delay onstrained \u001cxed rate transmission.4.5.4 Outage ProbabilityThe following theorem spei\u001ces the outage probability.122Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionTheorem 4.4. For the onsidered bu\u001ber-aided relaying protool in Proposition 4.1, ifthe required delay an be satis\u001ced by using the adaptive reeption-transmission variabledi in either (4.59) or (4.61), the outage probability is given byFout = PSPr{Q = 0}+ PSPR(1\u2212 Pr{Q = 0} \u2212 Pr{Q = LR0})+((1\u2212PS)PR + (1\u2212PSPR)(1\u2212PC))Pr{Q = LR0},(4.87)where if di is given by (4.59), Pr{Q = 0} and Pr{Q = LR0} are given by (4.64) withp and q given by (4.65). On the other hand, if di is given by (4.61), Pr{Q = 0} andPr{Q = LR0} are given by (4.69) with p and q given by (4.65).If the required delay is satis\u001ced by using the adaptive reeption-transmission vari-able di given by (4.63), then the outage probability is given byFout = PSPr{Q = 0}+ PSPR(1\u2212 Pr{Q = 0} \u2212 Pr{Q = LR0})+ (1\u2212 PS)PR(1\u2212 PC)Pr{Q = LR0}, (4.88)where Pr{Q = 0} and Pr{Q = LR0} are given by (4.61) with p and q given by (4.70).Proof. Please refer to Appendix C.8.The expressions for Fout in Theorem 4.4 are valid for general L. However, sig-ni\u001cant simpli\u001cations are possible if L \u226b 1. This is addressed in the followinglemma.Lemma 4.8. When L \u2192 \u221e, the outage probability given by (4.87) and (4.88) sim-123Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionpli\u001ces toFout = PSPr{Q = 0}+ PSPR(1\u2212 Pr{Q = 0}), (4.89)where Pr{Q = 0} is given by (4.74), (4.77), and (4.80) if di is given by (4.59), (4.61),and (4.63), respetively.Proof. Eq. (4.89) is obtained by letting Pr{Q = LR0} \u2192 0 when L \u2192 \u221e in (4.87)and (4.88).The expression for the outage probability in (4.89) an be further simpli\u001ced inthe high SNR regime, whih provides insight into the ahievable diversity gain. Thisis summarized in the following theorem.Theorem 4.5. In the high SNR regime, when \u03b3S = \u03b3R = \u03b3 \u2192 \u221e, depending on therequired delay that the system has to satisfy, two ases an be distinguished:Case 1: If 1 < E{T} \u2264 3, the outage probability asymptotially onverges toFout \u2192PSE{T}+ 1 , as \u03b3 \u2192\u221e. (4.90)Case 2: If E{T} > 3, the outage probability asymptotially onverges toFout \u2192P 2SE{T} \u2212 1 + PSPR, as \u03b3 \u2192\u221e. (4.91)Therefore, assuming Rayleigh fading, the onsidered system ahieves a diversity gainof two if and only if E{T} > 3.Proof. Please refer to Appendix C.9.Aording to Theorem 4.5, for Rayleigh fading, a diversity gain of two an be124Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionalso ahieved for delay onstrained transmission, whih underlines the appeal ofbu\u001ber-aided relaying with adaptive reeption-transmission ompared to onventionalrelaying, whih only ahieves a diversity gain of one even in ase of in\u001cnite delay(Conventional Relaying 1).4.6 Mixed Rate TransmissionIn this setion, we investigate bu\u001ber-aided relaying protools with adaptive reeption-transmission for mixed rate transmission. In partiular, we assume that the souredoes not have CSIT and transmits with \u001cxed rate S0 but the relay has full CSITand transmits with the maximum possible rate, RRD(i) = log2(1 + r(i)), that doesnot ause an outage in the R-D hannel. For this senario, we onsider \u001crst delayunonstrained transmission and derive the optimal adaptive reeption-transmissionbu\u001ber-aided relaying protools with and without power alloation. Subsequently, weinvestigate the impat of delay onstraints.Before we proeed, we note that for mixed rate transmission the throughput anbe expressed as\u03c4 = limN\u2192\u221e1NN\u2211i=1di min{log2(1 + r(i)), Q(i\u2212 1)}, (4.92)where we used (4.4) and (4.9). For the derivation of the maximum throughput ofbu\u001ber-aided relaying with adaptive reeption-transmission the following theorem isuseful.Theorem 4.6. The adaptive reeption-transmission poliy that maximizes the through-put of the onsidered bu\u001ber-aided relaying system for mixed rate transmission an be125Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionfound in the set of adaptive reeption-transmission poliies that satisfylimN\u2192\u221e1NN\u2211i=1(1\u2212 di)OS(i)S0 = limN\u2192\u221e1NN\u2211i=1di log2(1 + r(i)) . (4.93)Furthermore, for adaptive reeption-transmission poliies within this set, the through-put is given by the right (and left) hand side of (4.93).Proof. A proof of this theorem an obtained by replaing OR(i)R0 by log2(1 + r(i))in the proof of Theorem 4.1 given in Appendix C.1.Hene, similar to \u001cxed rate transmission, for the set of poliies onsidered in The-orem 4.6, for N \u2192 \u221e, the bu\u001ber at the relay is pratially always fully baklogged.Thus, the min(\u00b7) funtion in (4.92) an be omitted and the throughput is given bythe right hand side of (4.93).4.6.1 Optimal Adaptive Reeption-Transmission ProtoolWithout Power AlloationSine the relay has the instantaneous CSI of both links, it an also optimize its trans-mit power. However, to get more insight, we \u001crst onsider the ase where the relaytransmits with \u001cxed power. We note that power alloation is not always desirableas it requires highly linear power ampli\u001cers and thus, inreases the implementationomplexity of the relay.Aording to Theorem 4.6, the optimal adaptive reeption-transmission poliymaximizing the throughput an be found in the set of poliies that satisfy (4.93).Therefore, the optimal poliy an be obtained from the following optimization prob-126Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionlemMaximize :di1N\u2211Ni=1 di log2(1 + r(i))Subject to : C1 : 1N\u2211Ni=1(1\u2212 di)OS(i)S0 = 1N\u2211Ni=1 di log2(1 + r(i))C2 : di \u2208 {0, 1}, \u2200i,(4.94)where N \u2192 \u221e, onstraint C1 ensures that the searh for the optimal poliy isonduted only among the poliies that satisfy (4.93), and C2 ensures that di \u2208 {0, 1}.The solution of (4.94) leads to the following theorem.Theorem 4.7. Let the PDFs of s(i) and r(i) be denoted by fs(s) and fr(r), re-spetively. Then, for the onsidered bu\u001ber-aided relaying system in whih the souretransmits with a \u001cxed rate S0 and \u001cxed power PS , and the relay transmits with anadaptive rate RRD(i) = log2(1+r(i)) and \u001cxed power PR, two ases have to be distin-guished for the optimal adaptive reeption-transmission variable di, whih maximizesthe throughput:Case 1: IfPS \u2264S0S0 +\u222b\u221e0 log2(1 + r)fr(r)dr(4.95)holds, thendi =\uf8f1\uf8f4\uf8f4\uf8f4\uf8f4\uf8f2\uf8f4\uf8f4\uf8f4\uf8f4\uf8f31 if OS(i) = 01 if OS(i) = 1 AND r(i) \u2265 2\u03c1S0 \u2212 10 if OS(i) = 1 AND r(i) < 2\u03c1S0 \u2212 1 ,(4.96)127Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionwhere \u03c1 is a onstant whih an be found as the solution ofS0(1\u2212 PS)\u222b 2\u03c1S0\u221210fr(r)dr = PS\u222b \u221e0log2(1 + r)fr(r)dr + (1\u2212 PS)\u222b \u221e2\u03c1S0\u22121log2(1 + r)fr(r)dr .(4.97)In this ase, the maximum throughput is given by the right (and left) hand side of(4.97).Case 2: If (4.95) does not hold, thendi =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f30 if OS(i) = 11 if OS(i) = 0 .(4.98)In this ase, the maximum throughput is given by\u03c4 = S0(1\u2212 PS) . (4.99)Proof. Please refer to Appendix C.10.We note that with mixed rate transmission the S-R link is used only if it is notin outage, f. (4.96), (4.98). On the other hand, the R-D link is never in outage sinethe transmission rate is adjusted to the hannel onditions. Furthermore, bu\u001ber-aided relaying with adaptive reeption-transmission has a larger throughput thanConventional Relaying 1, and also ahieves a multiplexing gain of one.To get more insight, we speialize the results derived thus far in this setion toRayleigh fading links.Lemma 4.9. For Rayleigh fading links, ondition (4.95) simpli\u001ces toPS = 1\u2212 exp(\u22122S0 \u2212 1\u2126S)\u2264 S0S0 + e1\/\u2126RE1(1\/\u2126R)\/ ln(2). (4.100)128Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionFurthermore, (4.97) simpli\u001ces toS0 exp(\u22122S0 \u2212 1\u2126S)[1\u2212 exp(\u22122\u03c1S0 \u2212 1\u2126R)]= e1\/\u2126Rln(2)[(1\u2212 exp(\u22122S0 \u2212 1\u2126S))E1( 1\u2126R)+ exp(\u22122S0 \u2212 1\u2126S)E1(2\u03c1S0\u2126R)]+exp(\u22122\u03c1S0 \u2212 1\u2126R)exp(\u22122S0 \u2212 1\u2126S)\u03c1S0 , (4.101)and the maximum throughput is given by the right (and left) hand side of (4.101). If(4.100) does not hold, the throughput an be obtained by simplifying (4.99) to\u03c4 = S0 exp(\u22122S0 \u2212 1\u2126S). (4.102)Proof. Equations (4.100)-(4.102) are obtained by inserting the PDFs of s(i) and r(i)into (4.95), (4.97), and (4.99), respetively.4.6.2 Optimal Adaptive Reeption-Transmission Poliy WithPower AlloationAs mentioned before, sine for mixed rate transmission the relay is assumed to havethe full CSI of both links, power alloation an be applied to further improve perfor-mane. In other words, the relay an adjust its transmit power PR(i) to the hannelonditions while the soure still transmits with \u001cxed power PS(i) = PS, \u2200i. In thefollowing, for onveniene, we will use the transmit SNRs without fading, \u03b3S and\u03b3R(i), whih may be viewed as normalized powers, as variables instead of the atualpowers PS = \u03b3S\u03c32nR and PR(i) = \u03b3R(i)\u03c32nD .For the power alloation ase, Theorem 4.6 is still appliable but it is onvenient129Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionto rewrite the throughput as\u03c4 = limN\u2192\u221e1NN\u2211i=1di log2(1 + \u03b3R(i)hR(i)). (4.103)We note that (4.93) also applies to the ase of power alloation. Furthermore, inorder to meet the average power onstraint \u0393, the instantaneous (normalized) power\u03b3R(i) and the \u001cxed (normalized) power \u03b3S have to satisfy the following ondition:limN\u2192\u221e1NN\u2211i=1(1\u2212 di)OS(i)\u03b3S + limN\u2192\u221e1NN\u2211i=1di\u03b3R(i) \u2264 \u0393. (4.104)Thus, the optimal adaptive reeption-transmission poliy for mixed rate transmissionis the solution of the following optimization problem:Maximize :di,\u03b3R(i)1N\u2211Ni=1 di log2(1 + \u03b3R(i)hR(i))Subject to : C1 : 1N\u2211Ni=1(1\u2212 di)OS(i)S0 = 1N\u2211Ni=1 di log2(1 + \u03b3R(i)hR(i))C2 : di \u2208 {0, 1} , \u2200iC3 : 1N\u2211Ni=1(1\u2212 di)OS(i)\u03b3S + 1N\u2211Ni=1 di\u03b3R(i) \u2264 \u0393,(4.105)where N \u2192\u221e, onstraints C1 and C3 ensure that the searh for the optimal poliyis onduted only among those poliies that jointly satisfy (4.93) and the soure-relaypower onstraint (4.104), respetively, and C2 ensures that di \u2208 {0, 1}. The solutionof (4.105) is provided in the following theorem.Theorem 4.8. Let the PDFs of hS(i) and hR(i) be denoted by fhS(hS) and fhR(hR),respetively. Then, for the onsidered bu\u001ber-aided relaying system where the soure130Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissiontransmits with a \u001cxed rate S0 and \u001cxed power \u03b3S and the relay transmits with adaptiverate RRD(i) = log2(1 + r(i)) = log2(1 + \u03b3R(i)hR(i)) and adaptive power \u03b3R(i), twoases have to be onsidered for the optimal adaptive reeption-transmission variabledi whih maximizes the throughput:Case 1: IfPS \u2264S0S0 +\u222b\u221e\u03bbt log2(hR\/\u03bbt)fhR(hR)dhR, (4.106)holds, where \u03bbt is found as the solution toPS\u222b \u221e\u03bbt( 1\u03bbt\u2212 1hR)fhR(hR)dhR + \u03b3S(1\u2212 PS) = \u0393, (4.107)then the optimal power \u03b3R(i) and adaptive reeption-transmission variable di whihmaximize the throughput are given by\u03b3R(i) = max{0, 1\u03bb \u22121hR(i)}, (4.108)anddi =\uf8f1\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f2\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f4\uf8f31 if OS(i) = 0 AND hR(i) \u2265 \u03bb1 if OS(i) = 1 AND hR(i) \u2265 \u03bb AND ln(hR(i)\u03bb)+ \u03bbhR(i) \u2265 \u03c1S0 \u2212 \u03bb\u03b3S + 10 if OS(i) = 1 AND hR(i) < \u03bb0 if OS(i) = 1 AND hR(i) \u2265 \u03bb AND ln(hR(i)\u03bb)+ \u03bbhR(i) < \u03c1S0 \u2212 \u03bb\u03b3S + 1\u03b5 if OS(i) = 0 AND hR(i) < \u03bb ,(4.109)131Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionwhere \u03b5 is either 0 or 1 and has not impat on the throughput. Constants \u03c1 and \u03bb arehosen suh that onstraints C1 and C3 in (4.105) are satis\u001ced with equality. Thesetwo onstants an be found as the solution to the following system of equationsS0(1\u2212PS)\u222b G0fhR(hR)dhR = PS\u222b \u221e\u03bblog2(hR\u03bb)fhR(hR)dhR+(1\u2212 PS)\u222b \u221eGlog2(hR\u03bb)fhR(hR)dhR, (4.110)PS\u222b \u221e\u03bb(1\u03bb \u22121hR)fhR(hR)dhR + (1\u2212 PS)\u222b \u221eG(1\u03bb \u22121hR)fhR(hR)dhR+\u03b3S(1\u2212 PS)\u222b G0fhR(hR)dhR = \u0393, (4.111)where the integral limit G is given byG = \u2212 \u03bbW{\u2212e\u03bb\u03b3S\u2212\u03c1S0\u22121} . (4.112)Here, W{\u00b7} denotes the Lambert W -funtion de\u001cned in [84\u2104, whih is available asbuilt-in funtion in software pakages suh as Mathematia. In this ase, the maxi-mized throughput is given by the right (and left) hand side of (4.110).Case 2: If (4.106) does not hold, the optimal power \u03b3R(i) and adaptive reeption-transmission variable di are given by\u03b3R(i) = max{0, 1\u03bb \u22121hR(i)}, if OS(i) = 0; (4.113)di =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f30 if OS(i) = 11 if OS(i) = 0,(4.114)132Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionwhere \u03bb = \u03bbt is the solution to (4.107). In this ase, the maximum throughput isgiven by\u03c4 = S0(1\u2212 PS). (4.115)Proof. Please refer to Appendix C.11.Remark 4.12. Note that when onditions (4.95) and (4.106) do not hold, the through-put with and without power alloation is idential, f. (4.99) and (4.115). If onditions(4.95) and (4.106) do not hold, this means that the SNR in the S-R hannel is low,whereas the SNR in the R-D hannel is high. In this ase, power alloation is notbene\u001cial sine the S-R hannel is the bottlenek link, whih annot be improved bypower alloation at the relay. Furthermore, the throughput in (4.99) and (4.115) isidential to the throughput of a point-to-point ommuniation between the soure andthe relay sine the number of time slots required to transmit the information fromthe relay to the destination beomes negligible. Therefore, in this ase, as far as theahievable throughput is onerned, the two-hop HD relay hannel is transformed intoa point-to-point hannel between the soure and the relay.In the following lemma, we onentrate on Rayleigh fading for illustration purpose.Lemma 4.10. For Rayleigh fading hannels, PS is given byPS = 1\u2212 exp(\u22122S0 \u2212 1\u03b3S\u2126\u00afS).Furthermore, ondition (4.106) simpli\u001ces toPS \u2264S0S0 + E1(\u03bbt\/\u2126\u00afR)\/ ln(2), (4.116)133Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionwhere \u03bbt is found as the solution toPS[e\u2212\u03bbt\/\u2126\u00afR\u03bbt\u2212 1\u2126\u00afRE1( \u03bbt\u2126\u00afR)]= \u0393. (4.117)For the ase where (4.116) holds, (4.110) and (4.111) simplify toS0(1\u2212 PS)(1\u2212 e\u2212G\/\u2126\u00afR)= 1ln(2)[PSE1( \u03bb\u2126\u00afR)+(1\u2212 PS)(E1( G\u2126\u00afR)+ ln(G\u03bb)e\u2212G\/\u2126\u00afR)](4.118)andPS[e\u2212\u03bb\/\u2126\u00afR\u03bb \u22121\u2126\u00afRE1( \u03bb\u2126\u00afR)]+ (1\u2212 PS)[e\u2212G\/\u2126\u00afR\u03bb\u2212 1\u2126\u00afRE1( G\u2126\u00afR)]+ \u03b3S(1\u2212 PS)(1\u2212 e\u2212G\/\u2126\u00afR)= \u0393, (4.119)respetively, where integral limit G is given by (4.112). The maximum throughput isgiven by the right (and left) hand side of (4.118).For the ase, where (4.116) does not hold, the throughput is given by \u03c4 = S0(1 \u2212PS).Proof. Equations (4.116), (4.117), (4.118), and (4.119) are obtained by inserting thePDFs of hS(i) and hR(i) into (4.106), (4.107), (4.110), and (4.111), respetively.Remark 4.13. Conditions (4.95) and (4.106) depend only on the long term fadingstatistis and not on the instantaneous fading states. Therefore, for \u001cxed \u2126\u00afS and \u2126\u00afR,the optimal poliy for ondition (4.95) is given by either (4.96) or (4.98), but not byboth. Similarly, the optimal poliy for ondition (4.106) is given by either (4.109) or(4.114), but not by both.134Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate TransmissionRemark 4.14. We note that equations (4.107), (4.110), (4.111), (4.117), (4.118),and (4.119) an be solved using software pakages suh as Mathematia.4.6.3 Mixed Rate Transmission With Delay ConstraintsNow, we turn our attention to mixed rate transmission with delay onstraints. Forthe delay unonstrained ase, Theorem 4.6 was very useful to arrive at the optimalprotool sine it removed the omplexity of having to deal with the queue states.However, for the delay onstrained ase, the queue states determine the throughputand the average delay. Moreover, for mixed rate transmission, the queue statesan only be modeled by a Markov hain with ontinuous state spae, whih makesthe analysis ompliated. Therefore, we resort to a suboptimal adaptive reeption-transmission protool in the following.Proposition 4.2. Let the bu\u001ber size be limited to Qmax bits. For this ase, we proposethe following adaptive reeption-transmission protool for mixed rate transmissionwith delay onstraints:1. If OS(i) = 0, set di = 1.2. Otherwise, if log2(1 + r(i)) \u2264 Q(i \u2212 1) \u2264 Qmax \u2212 S0, selet di as proposed inTheorem 4.7 for the ase of transmission without delay onstraint.3. Otherwise, if Q(i\u2212 1) > Qmax \u2212 S0, set di = 1.4. Otherwise, if Q(i\u2212 1) < log2(1 + r(i)), set di = 0.If the S-R link is in outage, the relay transmits. Otherwise, if there is enoughroom in the bu\u001ber to aommodate the bits\/symb possibly sent from the soure tothe relay and there are enough bits\/symb in the bu\u001ber for the relay to transmit, the135Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionadaptive reeption-transmission protool introdued in Theorem 4.7 is employed. Onthe other hand, if there exists the possibility of a bu\u001ber over\u001dow, the relay transmitsto redue the amount of data in the bu\u001ber. If the number of bits\/symb in the bu\u001beris too low, the soure transmits. The value of Qmax an be used to adjust the averagedelay while maintaining a low throughput loss ompared to the throughput withoutdelay onstraint.Although oneptually simple, as pointed out before, a theoretial analysis ofthe throughput of the proposed queue size limiting protool is di\u001eult beause ofthe ontinuous state spae of the assoiated Markov hain. Thus, we will resort tosimulations to evaluate its performane in Setion 4.7.4.6.4 Conventional Relaying With Delay ConstraintsTo have a benhmark for delay onstrained bu\u001ber-aided relaying with adaptive reeption-transmission, we propose a orresponding onventional relaying protool, whih maybe viewed as a delay onstrained version of Conventional Relaying 1.Proposition 4.3. The soure transmits to the relay in k onseutive time slots fol-lowed by the relay transmitting to the destination in the following p time slots. Then,this pattern is repeated, i.e., the soure transmits again in k onseutive time slots,and so on. The values of k and p an be hosen to satisfy any delay and throughputrequirements.For this protool, the queue is non-absorbing ifk(1\u2212 PS)S0 \u2264 pE{log2(1 + r(i))}. (4.120)Assuming (4.120) holds, the average arrival rate is equal to the throughput and hene136Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionthe throughput is given by\u03c4 = kk + p(1\u2212 PS)S0 , (4.121)Using a numerial example, we will show in Setion 4.7 (f. Fig. 4.6) that theprotool with adaptive reeption-transmission in Proposition 4.2 ahieves a higherthroughput than the onventional protool in Proposition 4.3. However, the onven-tional protool is more amendable to analysis and it is interesting to investigate theorresponding throughput and multiplexing gain for a given average delay in the highSNR regime, \u03b3S = \u03b3R = \u03b3 \u2192\u221e. This is done in the following theorem.Theorem 4.9. For a given average delay onstraint, E{T}, the maximal throughput\u03c4 and multiplexing rate r of mixed rate transmission, for \u03b3S = \u03b3R = \u03b3 \u2192 \u221e, aregiven by\u03c4 \u2192 S0(1\u2212 12E{T}), as \u03b3 \u2192\u221e . (4.122)r \u2192 1\u2212 12E{T} , as \u03b3 \u2192\u221e . (4.123)Proof. Please refer to Appendix C.12.Remark 4.15. Theorem 4.9 reveals that, as expeted from the disussion of the asewithout delay onstraints, delay onstrained mixed rate transmission approahes amultiplexing gain of one as the allowed average delay inreases.4.7 Numerial and Simulation ResultsIn this setion, we evaluate the performane of the proposed \u001cxed rate and mixedrate transmission shemes for Rayleigh fading. We also on\u001crm some of our analytial137Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmission\u22125 0 5 10 15 20 25 3011.21.41.61.82\u03b3\u03c4\/\u03c4fixedconv,1  TheorySimulation\u2126\u00afS = 10\u2126\u00afS = 1\u2126\u00afS = 0.1Figure 4.1: Ratio of the throughputs of bu\u001ber-aided relaying and ConventionalRelaying 1, \u03c4\/\u03c4fixedconv,1, vs. \u03b3. Fixed rate transmission without delay onstraints.\u03b3S = \u03b3R = \u03b3, S0 = R0 = 2 bits\/symb, and \u2126\u00afR = 1.results with omputer simulations. We note that our analytial results are valid forN \u2192\u221e. For the simulations, N has to be \u001cnite, of ourse, and we adopted N = 107in all simulations.4.7.1 Fixed Rate TransmissionFor \u001cxed rate transmission, we evaluate the proposed adaptive reeption-transmissionprotools for transmission with and without delay onstraints. Throughout this se-tion we assume that soure and relay transmit with idential rates, i.e., S0 = R0.Transmission Without Delay ConstraintsIn Fig. 4.1, we show the ratio of the throughputs ahieved with the proposed bu\u001ber-aided relaying protool with adaptive reeption-transmission and Conventional Re-laying 1 as a funtion of the transmit SNR \u03b3S = \u03b3R = \u03b3 for \u2126\u00afR = 1, S0 = R0 = 2bits\/symb, and di\u001berent values of \u2126\u00afS. The throughput of bu\u001ber-aided relaying, \u03c4 ,was omputed based on (4.37), (4.41), and (4.45) in Theorem 4.2, while the through-138Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmission0 10 20 30 40 5010\u2212810\u2212610\u2212410\u22122100\u03b3 (in dB)F  out  Conventional Relaying 1BA Relaying (Theory)BA Relaying (Simulation)\u2126\u00afS = 0.1; 1; 10\u2126\u00afS = 10; 1; 0.1Figure 4.2: Outage probability of bu\u001ber-aided (BA) relaying and Conventional Re-laying 1 vs. \u03b3. Fixed rate transmission without delay onstraints. \u03b3S = \u03b3R = \u03b3,S0 = R0 = 2 bits\/symb, and \u2126\u00afR = 1.put of Conventional Relaying 1, \u03c4fixedconv,1, was obtained based on (4.12). Furthermore,we also show simulation results where the throughput of the bu\u001ber-aided relayingprotool was obtained via Monte Carlo simulation. From Fig. 4.1 we observe thattheory and simulation are in exellent agreement. Furthermore, Fig. 4.1 shows thatexept for \u2126\u00afS = \u2126\u00afR the proposed adaptive reeption-transmission sheme ahievesits largest gain for medium SNRs. For very high SNRs, both links are never in outageand thus, Conventional Relaying 1 and the adaptive reeption-transmission shemeahieve the same performane. On the other hand, for very low SNR, there are veryfew transmission opportunities on both links as the links are in outage most of thetime. The proposed adaptive reeption-transmission protool an exploit all of theseopportunities. In ontrast, for \u2126\u00afS = \u2126\u00afR, Conventional Relaying 1 hoses \u03be = 0.5 andwill miss half of the transmission opportunities by seleting the link that is in out-age instead of the link that is not in outage beause of the pre-determined shedulefor reeption and transmission. On the other hand, if \u2126\u00afS and \u2126\u00afR di\u001ber signi\u001cantly,Conventional Relaying 1 selets \u03be lose to 0 or 1 (depending on whih link is stronger)139Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmission0 5 10 15 2000.20.40.60.81\u03b3 (in dB)\u03c4(inbits\/symb)  Conventional Relaying 2BA Relaying (Theory)BA Relaying (Simulation)E{T} = 2.1E{T} = 3.1E{T} \u2192 \u221eE{T} = 1.1Figure 4.3: Throughputs of bu\u001ber-aided (BA) relaying and Conventional Relaying 2vs. \u03b3. Fixed rate transmission with delay onstraints. \u03b3S = \u03b3R = \u03b3, S0 = R0 = 2bits\/symb, \u2126\u00afR = 1, and \u2126\u00afS = 1.and the loss ompared to the link adaptive sheme beomes negligible.In Fig. 4.2, we show the outage probability, Fout, for the proposed bu\u001ber-aidedrelaying protool with adaptive reeption-transmission and Conventional Relaying 1.The same hannel and system parameters as for Fig. 4.1 were adopted for Fig. 4.2as well. For bu\u001ber-aided relaying with adaptive reeption-transmission, Fout wasobtained from (4.52) and on\u001crmed by Monte Carlo simulations. For onventionalrelaying, Fout was obtained from (4.13). As expeted from Lemma 4.4, bu\u001ber-aidedrelaying ahieves a diversity gain of two, whereas onventional relaying ahieves onlya diversity gain of one, whih underlines the superiority of bu\u001ber-aided relaying withadaptive reeption-transmission.Transmission With Delay ConstraintsIn Fig. 4.3, we show the throughput of bu\u001ber-aided relaying with adaptive reeption-transmission as a funtion of the transmit SNR \u03b3S = \u03b3R = \u03b3 for \u001cxed rate trans-mission with di\u001berent onstraints on the average delay E{T}. The theoretial urvesfor bu\u001ber-aided relaying were obtained from the expressions given in Lemma 4.6 for140Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmission0 10 20 30 40 5010\u2212610\u2212410\u22122100\u03b3 (in dB)F out  Conventional Relaying 2BA Relaying (theory)BA Relaying (simulation)E{T} \u2192 \u221eE{T} = 1.1E{T} = 2.1E{T} = 3.1Figure 4.4: Outage probability of bu\u001ber-aided (BA) relaying and Conventional Relay-ing 2 vs. \u03b3. Fixed rate transmission with delay onstraints. \u03b3S = \u03b3R = \u03b3, S0 = R0 = 2bits\/symb, \u2126\u00afR = 1, and \u2126\u00afS = 1.throughput and the average delay. For omparison, we also show the throughputof bu\u001ber-aided relaying with adaptive reeption-transmission and without delay on-straint (f. Theorem 4.2), and the throughput of Conventional Relaying 2 given by(4.14). These two shemes introdue an in\u001cnite delay, i.e., E{T} \u2192 \u221e as N \u2192 \u221e,and a delay of one time slot, respetively. In the low SNR regime, the proposed bu\u001ber-aided relaying sheme with adaptive reeption-transmission annot satisfy all delayrequirements as expeted from Lemma 4.7. Hene, for \u001cnite delays, the throughputurves in Fig. 4.3 do not extend to low SNRs. Nevertheless, as the a\u001bordable delayinreases, the throughput for delay onstrained transmission approahes the through-put for delay unonstrained transmission for su\u001eiently high SNR. Furthermore, theperformane gain ompared to Conventional Relaying 2 is substantial even for theomparatively small average delays E{T} onsidered in Fig. 4.3.In Fig. 4.4, we show the outage probability, Fout, for the same shemes and pa-rameters that were onsidered in Fig. 4.3. For bu\u001ber-aided relaying with adaptivereeption-transmission, the theoretial results shown in Fig. 4.4 were obtained from141Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmission(4.87) and (4.88). These theoretial results are on\u001crmed by the Monte Carlo simula-tion results also shown in Fig. 4.4. Furthermore, the urves for transmission withoutdelay onstraint (i.e., E{T} \u2192 \u221e as N \u2192 \u221e) were omputed from (4.52), andfor Conventional Relaying 2, we used (4.15). Fig. 4.4 shows that even for an aver-age delay as small as E{T} = 1.1 slots, the proposed bu\u001ber-aided relaying protoolwith adaptive reeption-transmission outperforms Conventional Relaying 2. Further-more, as expeted from Theorem 4.5, bu\u001ber-aided relaying with adaptive reeption-transmission ahieves a diversity gain of two when the average delay is larger thanthree time slots (e.g., E{T} = 3.1 time slots in Fig. 4.4 ). This leads to a large per-formane gain over onventional relaying whih ahieves only a diversity gain of one.For example, gains around 10 dB and 20 dB are ahieved for an outage probability of10\u22122 and 10\u22123, respetively. Finally, note that even for E{T} = 3.1 the performaneloss in dB is very small ompared to the ase of E{T} \u2192 \u221e.Remark 4.16. For the simulation results shown in Figs. 4.3 and 4.4, we adopted arelay with a bu\u001ber size of L = 60 pakets whih leads to a negligible probability ofdropped pakets. For example, for \u03b3 = 45 dB, the probability of a full bu\u001ber, Pr{Q =LR0}, is bounded by Pr{Q = LR0} < 10\u221260, and for lower SNRs, Pr{Q = LR0}is even higher. This also supports the laim in the proof of Theorem 4.5 that forlarge enough bu\u001ber sizes the probability of dropping a paket due to a bu\u001ber over\u001dowbeomes negligible.4.7.2 Mixed Rate TransmissionIn this setion, we investigate the ahievable throughput for mixed rate transmission.For this purpose, we onsider again the delay onstrained and the delay unonstrainedases separately.142Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmission0 5 10 15 20 25 30 35 40 450.60.811.21.41.61.8\u0393 (in dB)\u03c4(bits\/symb)  With Power AllocationWithout Power AllocationSimulation of Buffer-aided RelayingConventional Relaying 1Buffer\u2212aided RelayingFigure 4.5: Throughput of bu\u001ber-aided relaying with adaptive reeption-transmissionand Conventional Relaying 1 vs. \u0393. Mixed rate transmission without delay on-straints. \u2126\u00afS = 10, \u2126\u00afR = 1, and S0 = 2 bits\/symb.Transmission Without Delay ConstraintsIn Fig. 4.5, we ompare the throughputs of bu\u001ber-aided relaying with adaptivereeption-transmission and Conventional Relaying 1. In both ases, we onsider theases with and without power alloation. The theoretial results shown in Fig. 4.5 forthe four onsidered shemes were generated based on Theorem 4.7\/Lemma 4.9, The-orem 4.8\/Lemma 4.10, (4.21), (4.22), and (4.21), (4.23). The transmit SNRs of bothlinks are idential, i.e., \u03b3S = \u03b3R = \u0393, S0 = 2 bits\/symb, \u2126\u00afS = 10, and \u2126\u00afR = 1. Asan be observed from Fig. 4.5, for both bu\u001ber-aided relaying with adaptive reeption-transmission and Conventional Relaying 1, power alloation is bene\u001cial only for lowto moderate SNRs. Both shemes an ahieve a throughput of S0 bits\/symb in thehigh SNR regime. However, adaptive reeption-transmission ahieves a throughputgain ompared to Conventional Relaying 1 in the entire onsidered SNR range.143Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmission0 10 20 30 40 50 60 7000.20.40.60.811.21.41.61.8\u0393 (in dB)\u03c4(bits\/symb)  Mixed rate scheme with adaptive reception\u2212transmissionMixed rate scheme with conventional relayingFixed rate scheme with reception\u2212transmissionUpper bound for delay of 5 time slots and infinite transmit powerFigure 4.6: Throughput of bu\u001ber-aided relaying with adaptive reeption-transmissionand onventional relaying vs. \u0393. Mixed rate and \u001cxed rate transmission with delayonstraint. E{T} = 5 time slots, \u03b3S = \u03b3R = \u0393, S0 = 2 bits\/symb, and \u2126\u00afS = \u2126\u00afR = 1.Transmission With Delay ConstraintsIn Fig. 4.6, we ompare the throughputs of various mixed rate and \u001cxed rate trans-mission shemes for a maximum average delay of E{T} = 5 time slots and S0 = 2bits\/symb. The transmit SNRs of both links are idential, i.e., \u03b3S = \u03b3R = \u0393,\u2126\u00afS = \u2126\u00afR = 1. For mixed rate transmission, we simulated both the bu\u001ber-aidedrelaying protool with adaptive reeption-transmission desribed in Proposition 4.2and the onventional relaying protool desribed in Proposition 4.3. For \u001cxed ratetransmission, we hose R0 = S0 = 2 bits\/symb and inluded results for bu\u001ber-aided relaying with adaptive reeption-transmission obtained based on Lemma 4.6.Furthermore, for mixed rate transmission, we also show the maximum ahievablethroughput of bu\u001ber-aided relaying with adaptive reeption-transmission in the ab-sene of delay onstraints (as given by Theorem 4.7\/Lemma 4.9) and the maximumthroughput ahievable for a delay onstraint of E{T} = 5 time slots and in\u001cnitetransmit power (as given by (4.122)). Fig. 4.6 reveals that for mixed rate transmis-144Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionsion the protool with adaptive reeption-transmission proposed in Proposition 4.2is superior to the onventional relaying sheme proposed in Proposition 4.3, and forhigh SNR, both protools reah the upper bound for mixed rate transmission undera delay onstraint given by (4.122). Furthermore, Fig. 4.6 also shows that mixedrate transmission is superior to \u001cxed rate transmission sine the former an exploitthe additional \u001dexibility a\u001borded by having CSIT for the R-D link. For example, for\u0393 = 30 dB, mixed rate transmission with adaptive reeption-transmission ahieves athroughput gain of 65% ompared to \u001cxed rate transmission, and even onventionaladaptive reeption-transmission still ahieves a gain of 45%. Fig. 4.6 also shows thateven in the presene of severe delay onstraints mixed rate transmission an signi\u001c-antly redue the throughput loss aused by HD relaying ompared to FD relaying,whose maximum throughput is S0 = 2 bits\/symb.4.8 ConlusionsIn this hapter, we have onsidered a two-hop HD relay network. We have investi-gated both \u001cxed rate transmission, where soure and relay do not have full CSITand are fored to transmit with \u001cxed rate, and mixed rate transmission, wherethe soure does not have full CSIT and transmits with \u001cxed rate but the relayhas full CSIT and transmits with variable rate. For both modes of transmission,we have derived the throughput-optimal bu\u001ber-aided relaying protools with adap-tive reeption-transmission and the resulting throughputs and outage probabilities.Furthermore, we have shown that bu\u001ber-aided relaying with adaptive reeption-transmission leads to substantial performane gains ompared to onventional re-laying with non-adaptive reeption-transmission. In partiular, for \u001cxed rate trans-mission, bu\u001ber-aided relaying with adaptive reeption-transmission ahieves a di-145Chapter 4. Bu\u001ber-Aided Relaying: Fixed and Mixed Rate Transmissionversity gain of two, whereas onventional relaying is limited to a diversity gain ofone. For mixed rate transmission, both bu\u001ber-aided relaying with adaptive reeption-transmission and a newly proposed onventional relaying sheme with non-adaptivereeption-transmission have been shown to overome the HD loss typial for wire-less relaying protools and to ahieve a multiplexing gain of one. Sine the proposedthroughput-optimal protools introdue an in\u001cnite delay, we have also proposed mod-i\u001ced protools for delay onstrained transmission and have investigated the resultingthroughput-delay trade-o\u001b. Surprisingly, the diversity gain of \u001cxed rate transmissionwith bu\u001ber-aided relaying is also observed for delay onstrained transmission as longas the average delay exeeds three time slots. Furthermore, for mixed rate trans-mission, for an average delay E{T}, a multiplexing gain of r = 1 \u2212 1\/(2E{T}) isahieved even for onventional relaying.146Chapter 5Summary of Thesis and FutureResearh TopisIn this \u001cnal hapter, in Setion 5.1, we summarize our results and highlight theontributions of this thesis. In Setion 5.2, we also propose ideas for future researh.5.1 Summary of the ResultsIn this thesis, we designed new ommuniation protools for the two-hop HD relayhannel. In the following, we brie\u001dy review the main results of eah hapter.In Chapter 2, we have derived an easy-to-evaluate apaity expression of the two-hop HD relay hannel when fading is not present based on simplifying previouslyderived onverse expressions. Moreover, we have proposed an expliit oding shemewhih ahieves the apaity. We showed that the apaity is ahieved when the relayswithes between reeption and transmission in a symbol-by-symbol manner andwhen additional information is sent by the relay to the destination using the zerosymbol impliitly sent by the relay's silene during reeption. Furthermore, we haveevaluated the apaity for the ases when both links are BSCs and AWGN hannels,respetively. From the numerial examples, we have observed that the apaity ofthe two-hop HD relay hannel is signi\u001cantly higher than the rates ahieved withonventional relaying protools.147Chapter 5. Summary of Thesis and Future Researh TopisIn Chapter 3, we have devised new ommuniation protools for improving theahievable average rate of the two-hop HD relay hannel when both soure-relayand relay-destination links are AWGN hannels a\u001beted by fading, referred to asbu\u001ber-aided relaying with adaptive reeption-transmission protools. In ontrast toonventional relaying, where the relay reeives and transmits aording to a pre-de\u001cned shedule regardless of the hannel state, in the proposed protool, the relayreeives and transmits adaptively aording to the quality of the soure-relay andrelay-destination links. For delay-unonstrained transmission, we derived the op-timal adaptive reeption-transmission shedule for the ases of \u001cxed and variablesoure and relay transmit powers. For delay-onstrained transmission, we proposeda bu\u001ber-aided protool whih ontrols the delay introdued by the bu\u001ber at the re-lay. This protool needs only instantaneous CSI and the desired average delay, andan be implemented in real-time. Our analytial and simulation results showed thatbu\u001ber-aided relaying with adaptive reeption-transmission with and without delayonstraints is a promising approah to signi\u001cantly inrease the ahievable averagerate ompared to onventional HD relay-assisted transmission.In Chapter 4, we have devised new ommuniation protools for improving theoutage probability of the two-hop HD relay hannel when both soure-relay and relay-destination links are AWGN hannels a\u001beted by fading. We have investigated both\u001cxed rate transmission, where soure and relay do not have full CSIT and are foredto transmit with \u001cxed rate, and mixed rate transmission, where the soure does nothave full CSIT and transmits with \u001cxed rate but the relay has full CSIT and transmitswith variable rate. For both modes of transmission, we have derived the throughput-optimal bu\u001ber-aided relaying protools with adaptive reeption-transmission andthe resulting throughputs and outage probabilities. Furthermore, we ould show148Chapter 5. Summary of Thesis and Future Researh Topisthat bu\u001ber-aided relaying with adaptive reeption-transmission leads to substantialperformane gains ompared to onventional relaying with non-adaptive reeption-transmission. In partiular, for \u001cxed rate transmission, bu\u001ber-aided relaying withadaptive reeption-transmission ahieves a diversity gain of two, whereas onven-tional relaying is limited to a diversity gain of one. For mixed rate transmission,both bu\u001ber-aided relaying with adaptive reeption-transmission and a newly pro-posed onventional relaying sheme with non-adaptive reeption-transmission havebeen shown to overome the HD loss typial for wireless relaying protools and toahieve a multiplexing gain of one. Sine the proposed throughput-optimal protoolsintrodue an in\u001cnite delay, we have also proposed modi\u001ced protools for delay on-strained transmission and have investigated the resulting throughput-delay trade-o\u001b.Surprisingly, the diversity gain of \u001cxed rate transmission with bu\u001ber-aided relayingwith adaptive reeption-transmission is also observed for delay onstrained transmis-sion as long as the average delay exeeds three time slots. Furthermore, for mixed ratetransmission, for an average delay E{T}, a multiplexing gain of r = 1\u2212 1\/(2E{T})is ahieved even for onventional relaying.5.2 Future WorkFuture researh diretions may inlude the following:\u2022 Deriving the apaity of the two-hop HD relay hannel when both soure-relayand relay-destination links are a\u001beted by fading, and designing a oding shemewhih ahieves the apaity. Intuitively, we expet this oding sheme to be amix of the oding sheme introdued in Chapter 2 and the bu\u001ber-aided protoolintrodued in Chapter 3.149Chapter 5. Summary of Thesis and Future Researh Topis\u2022 Investigating the apaity of the two-hop FD relay hannel with self-interfereneand determining the amount of allowable self-interferene beyond whih therelay is better of by working in the HD mode. This requires a new information-theoretial analysis and taking into aount that the self-interferene is ausedby the transmitting node itself, and therefore the relay node has some knowledgeabout the self-interferene whih it an use to its bene\u001ct in order to inreaseits data rate.\u2022 Investigating the apaity and\/or devising new bu\u001ber-aided protools for HDrelay networks whih are more omplex than the two-hop HD relay hannel, e.g.networks omprised of more than one soure and\/or relay, and\/or destination.150Bibliography[1\u2104 A. El Gamal and Y. Kim, Network Information Theory. Cambridge UniversityPress, 2011.[2\u2104 A. Nosratinia, T. Hunter, and A. Hedayat, \u0010Cooperative Communiation inWireless Networks,\u0011 IEEE Communiations Magazine, vol. 42, pp. 74 \u0015 80, Ot.2004.[3\u2104 R. Pabst, B. H. Walke, D. C. Shultz, P. Herhold, H. Yanikomeroglu, S. Mukher-jee, and G. P. Fettweis, \u0010Relay-based Deployment Conepts for Wireless andMobile Broadband Radio,\u0011 IEEE Communiations Magazine, vol. 42, pp. 80\u001589, Sep. 2004.[4\u2104 E. C. V. D. Meulen, \u0010Three-Terminal Communiation Channels,\u0011 Advanes inApplied Probability, vol. 3, pp. 120\u0015154, 1971.[5\u2104 T. Cover and A. El Gamal, \u0010Capaity Theorems for the Relay Channel,\u0011 IEEETrans. Inform. Theory, vol. 25, pp. 572\u0015584, Sep. 1979.[6\u2104 Y. Yang, H. Hu, J. Xu, and G. Mao, \u0010Relay Tehnologies for WiMAX andLTE-advaned Mobile Systems,\u0011 IEEE Communiations Magazine, vol. 47, pp.100\u0015105, Ot. 2009.[7\u2104 P. M. R. Rost, Opportunities, Bene\u001cts, and Constraints of Relaying in MobileCommuniation Systems. J\u00f6rg Vogt Verlag, 2009.[8\u2104 G. Kramer, \u0010Models and Theory for Relay Channels with Reeive Constraints,\u0011in Pro. 42nd Annual Allerton Conf. on Commun., Control, and Computing,2004, pp. 1312\u00151321.[9\u2104 G. Kramer, I. Mari\u00a2, and R. D. Yates, Cooperative Communiations. NowPublishers In., 2006, vol. 1, no. 3.[10\u2104 A. Sendonaris, E. Erkip, and B. Aazhang, \u0010User Cooperation Diversity \u0016 PartI. System Desription,\u0011 IEEE Trans. Commun., vol. 51, pp. 1927\u00151938, Nov.2003.[11\u2104 \u0016\u0016, \u0010User Cooperation Diversity \u0016 Part II. Implementation Aspets and Per-formane Analysis,\u0011 IEEE Trans. Commun., vol. 51, pp. 1939\u00151948, Nov. 2003.151Bibliography[12\u2104 J. Laneman, D. Tse, and G. Wornell, \u0010Cooperative Diversity in Wireless Net-works: E\u001eient Protools and Outage Behavior,\u0011 IEEE Trans. Inform. Theory,vol. 50, pp. 3062\u00153080, De. 2004.[13\u2104 J. Laneman and G. Wornell, \u0010Distributed Spae\u0015Time Blok Coded Protools forExploiting Cooperative Diversity in Wireless Networks,\u0011 IEEE Trans. Inform.Theory, vol. IT-49, pp. 2415\u00152425, Ot. 2003.[14\u2104 A. Bletsas, A. Khisti, D. Reed, and A. Lippman, \u0010A Simple Cooperative Diver-sity Method Based on Network Path seletion,\u0011 IEEE J. Selet. Areas Commun.,vol. 24, pp. 659\u0015672, Mar. 2006.[15\u2104 G. Kramer, M. G. P., and Gupta, \u0010Cooperative Strategies and Capaity The-orems for Relay Networks,\u0011 IEEE Trans. Inform. Theory, vol. 51, pp. 3037 \u00153063, Sep. 2005.[16\u2104 R. Nabar, H. B\u00f6lskei, and F. Kneub\u00fchler, \u0010Fading Relay Channels: Perfor-mane Limits and Spae-Time Signal Design,\u0011 IEEE J. Selet. Areas Commun.,vol. 22, pp. 1099\u00151109, Aug. 2004.[17\u2104 K. Azarian, H. E. Gamal, and P. Shniter, \u0010On the Ahievable Diversity-Multiplexing Tradeo\u001b in Half-Duplex Cooperative Channels,\u0011 IEEE Trans. In-form. Theory, vol. 51, pp. 4152\u00154172, De. 2005.[18\u2104 A. Host-Madsen and J. Zhang, \u0010Capaity Bounds and Power Alloation forWireless Relay Channels,\u0011 IEEE Trans. Inform. Theory, vol. 51, pp. 2020 \u00152040,Jun. 2005.[19\u2104 B. Rankov and A. Wittneben, \u0010Spetral E\u001eient Protools for Half-Duplex Fad-ing Relay Channels,\u0011 IEEE J. Selet. Areas Commun., vol. 25, pp. 379\u0015389, Feb.2007.[20\u2104 H. El Gamal and Aktas, \u0010Distributed Spae\u0015Time Filtering for CooperativeWireless Networks,\u0011 in Proeedings of the IEEE Global Teleommuniation Con-ferene (GLOBECOM), San Franiso, 2003, pp. 1826\u00151830.[21\u2104 M. Hasna and M.-S. Alouini, \u0010End-to-End Performane of Transmission Systemswith Relays over Rayleigh-Fading Channels,\u0011 IEEE Trans. Wireless Commun.,vol. 2, pp. 1126\u00151131, Nov. 2003.[22\u2104 M. Janani, A. Hedayat, T. Hunter, and A. Nosratinia, \u0010Coded Cooperation inWireless Communiations: Spae-Time Transmission and Iterative Deoding,\u0011IEEE Trans. Signal Proessing, vol. SP-52, pp. 362\u0015371, Feb. 2004.[23\u2104 B. Wang, J. Zhang, and A. Host-Madsen, \u0010On the Capaity of MIMO RelayChannels,\u0011 IEEE Trans. Inform. Theory, vol. 51, no. 1, pp. 29\u001543, Jan. 2005.152Bibliography[24\u2104 J. Boyer, D. Faloner, and H. Yanikomeroglu, \u0010Multihop Diversity in WirelessRelaying Channels,\u0011 IEEE Trans. Commun., vol. COM-52, pp. 1820\u00151830, Ot.2004.[25\u2104 T. Hunter and A. Nosratinia, \u0010Diversity Through Coded Cooperation,\u0011 IEEETrans. Wireless Commun., vol. 5, pp. 283 \u0015 289, Feb. 2006.[26\u2104 T. Wang, A. Cano, G. Giannakis, and J. Laneman, \u0010High-Performane Coopera-tive Demodulation With Deode-and-Forward Relays,\u0011 IEEE Trans. Commun.,vol. 55, pp. 1427\u00151438, Jul. 2007.[27\u2104 M. Hasna and M.-S. Alouini, \u0010Harmoni Mean and End-to-End Performane ofTransmission Systems with Relays,\u0011 IEEE Trans. Commun., vol. 52, pp. 130\u0015135, Jan. 2004.[28\u2104 \u0016\u0016, \u0010A Performane Study of Dual-Hop Transmissions with Fixed Gain Re-lays,\u0011 IEEE Trans. Wireless Commun., vol. 3, pp. 1963\u00151968, Nov 2004.[29\u2104 A. Avestimehr, S. Diggavi, and D. Tse, \u0010Wireless Network Information Flow: ADeterministi Approah,\u0011 IEEE Trans. Inform. Theory, vol. 57, pp. 1872\u00151905,April 2011.[30\u2104 Y. Fan and J. Thompson, \u0010MIMO Con\u001cgurations for Relay Channels: Theoryand Pratie,\u0011 IEEE Trans. Wireless Commun., vol. 6, no. 5, pp. 1774\u00151786,2007.[31\u2104 P. Popovski and H. Yomo, \u0010Physial Network Coding in Two-Way Wireless RelayChannels,\u0011 in 2007 IEEE International Conferene on Communiations, June2007, pp. 707\u0015712.[32\u2104 M. Gastpar and M. Vetterli, \u0010On the apaity of large Gaussian relay networks,\u0011IEEE Trans. Inform. Theory, vol. 51, pp. 765\u0015779, Mar. 2005.[33\u2104 P. Gupta and P. Kumar, \u0010Towards an Information Theory of Large Networks:An Ahievable Rate Region,\u0011 IEEE Trans. Inform. Theory, vol. 49, pp. 1877\u00151894, Aug. 2003.[34\u2104 A. Ribeiro, X. Cai, and G. Giannakis, \u0010Symbol Error Probabilities for GeneralCooperative Links,\u0011 IEEE Trans. Wireless Commun., vol. 4, pp. 1264\u00151273, May2005.[35\u2104 G. Karagiannidis, \u0010Performane Bounds of Multihop Wireless Communiationswith Blind Relays over Generalized Fading Channels,\u0011 IEEE Trans. WirelessCommun., vol. 5, pp. 498\u0015503, Mar. 2006.153Bibliography[36\u2104 T. Ng and W. Yu, \u0010Joint Optimization of Relay Strategies and Resoure Al-loations in Cooperative Cellular Networks,\u0011 IEEE J. Selet. Areas Commun.,vol. 25, no. 2, pp. 328\u0015339, Feb. 2007.[37\u2104 B. Zhao and M. Valenti, \u0010Pratial RelayNetworks: A Generalization of Hybrid-ARQ,\u0011 IEEE J. Selet. Areas Commun., vol. 23, pp. 7\u001518, Jan. 2005.[38\u2104 S. J. Kim, P. Mitran, and V. Tarokh, \u0010Performane Bounds for BidiretionalCoded Cooperation Protools,\u0011 IEEE Trans. Inform. Theory, vol. 54, pp. 5235\u00155241, Nov 2008.[39\u2104 S. Yang and J.-C. Bel\u001core, \u0010Towards the Optimal Amplify-and-Forward Co-operative Diversity Sheme,\u0011 IEEE Trans. Inform. Theory, vol. 53, no. 9, pp.3114\u00153126, Sep. 2007.[40\u2104 L.-L. Xie and P. Kumar, \u0010A Network Information Theory for Wireless Commu-niation: Saling Laws and Optimal Operation,\u0011 IEEE Trans. Inform. Theory,vol. 50, pp. 748\u0015767, May 2004.[41\u2104 B. Nazer and M. Gastpar, \u0010Compute-and-Forward: Harnessing InterfereneThrough Strutured Codes,\u0011 IEEE Trans. Inform. Theory, vol. 57, pp. 6463\u00156486, Ot. 2011.[42\u2104 T. Oehtering, C. Shnurr, I. Bjelakovi, and H. Bohe, \u0010Broadast Capaity Re-gion of Two-Phase Bidiretional Relaying,\u0011 IEEE Trans. Inform. Theory, vol. 54,pp. 454\u0015458, Jan. 2008.[43\u2104 Y. Jing and H. Jafarkhani, \u0010Using Orthogonal and Quasi-Orthogonal Designs inWireless Relay Networks,\u0011 IEEE Trans. Inform. Theory, vol. 53, pp. 4106\u00154118,Nov. 2007.[44\u2104 A. Ibrahim, A. Sadek, W. Su, and K. Liu, \u0010Cooperative Communiations withRelay-Seletion: When to Cooperate and Whom to Cooperate With?\u0011 IEEETrans. Wireless Commun., vol. 7, pp. 2814\u00152827, Jul. 2008.[45\u2104 A. Ozgur, O. Leveque, and D. Tse, \u0010Hierarhial Cooperation Ahieves OptimalCapaity Saling in Ad Ho Networks,\u0011 IEEE Trans. Inform. Theory, vol. 53,pp. 3549\u00153572, Ot. 2007.[46\u2104 T. Koike-Akino, P. Popovski, and V. Tarokh, \u0010Optimized Constellations for Two-Way Wireless Relaying with Physial Network Coding,\u0011 IEEE J. Selet. AreasCommun., vol. 27, pp. 773\u0015787, Jun. 2009.[47\u2104 S. Lim, Y.-H. Kim, A. El Gamal, and S.-Y. Chung, \u0010Noisy Network Coding,\u0011IEEE Trans. Inform. Theory, vol. 57, pp. 3132\u00153152, May 2011.154Bibliography[48\u2104 M. Khojastepour, A. Sabharwal, and B. Aazhang, \u0010On the Capaity of 'Cheap'Relay Networks,\u0011 in Pro. Conf. on Inform. Sienes and Systems, 2003.[49\u2104 K. Loa, C.-C. Wu, S.-T. Sheu, Y. Yuan, M. Chion, D. Huo, and L. Xu, \u0010IMT-Advaned Relay Standards [WiMAX\/LTE Update\u2104,\u0011 IEEE CommuniationsMagazine, vol. 48, no. 8, pp. 40\u001548, Aug. 2010.[50\u2104 C. Hoymann, W. Chen, J. Montojo, A. Golitshek, C. Koutsimanis, and X. Shen,\u0010Relaying Operation in 3GPP LTE: Challenges and Solutions,\u0011 IEEE Commu-niations Magazine, vol. 50, no. 2, pp. 156\u0015162, Feb. 2012.[51\u2104 B. Xia, Y. Fan, J. Thompson, and H. V. Poor, \u0010Bu\u001bering in a Three-Node RelayNetwork,\u0011 IEEE Trans. Wireless Commun., vol. 7, pp. 4492\u00154496, Nov. 2008.[52\u2104 M. Jain, J. Choi, T. Kim, D. Bharadia, S. Seth, K. Srinivasan, P. Levis, S. Katti,and P. Sinha, \u0010Pratial, Real-Time, Full Duplex Wireless,\u0011 in 17th AnnualInternational Conferene on Mobile Computing and Networking. ACM, 2011,pp. 301\u0015312.[53\u2104 A. K. Khandani, \u0010Two-Way (True Full-Duplex) Wireless,\u0011 in Pro. 13th Cana-dian Workshop on Inform. Theory (CWIT), 2014.[54\u2104 A. Sabharwal, P. Shniter, D. Guo, D. Bliss, S. Rangarajan, and R. Wihman,\u0010In-Band Full-Duplex Wireless: Challenges and Opportunities,\u0011 IEEE J. Selet.Areas Commun., vol. 32, pp. 1637\u00151652, Sep. 2014.[55\u2104 N. Zlatanov, R. Shober, and P. Popovski, \u0010Throughput and Diversity Gainof Bu\u001ber-Aided Relaying,\u0011 in IEEE Global Teleommuniations Conferene(GLOBECOM 2011), De. 2011.[56\u2104 \u0016\u0016, \u0010Bu\u001ber-Aided Relaying with Adaptive Link Seletion,\u0011 IEEE J. Selet.Areas Commun., vol. 31, pp. 1530\u00151542, Aug. 2013.[57\u2104 N. Zlatanov and R. Shober, \u0010Bu\u001ber-Aided Relaying with Adaptive Link Se-letion \u0015 Fixed and Mixed Rate Transmission,\u0011 IEEE Trans. Inform. Theory,vol. 59, pp. 2816\u00152840, May 2013.[58\u2104 T. Islam, A. Ikhlef, R. Shober, and V. K. Bhargava, \u0010Diversity and Delay Anal-ysis of Bu\u001ber-Aided BICM-OFDM Relaying,\u0011 IEEE Trans. Wireless Commun.,vol. 12, pp. 5506\u00155519, Nov. 2013.[59\u2104 K. T. Phan and T. Le-Ngo, \u0010Adaptive Link Seletion in Bu\u001ber-Aided Relayingwith Statistial QoS Constraints,\u0011 in Pro. of IEEE International Conferene onCommuniations (ICC), London, UK, Jun. 2015.155Bibliography[60\u2104 H. Liu, P. Popovski, E. de Carvalho, and Y. Zhao, \u0010Sum-rate optimization in atwo-way relay network with bu\u001bering,\u0011 IEEE Commun. Letters, vol. 17, no. 1,pp. 95\u001598, 2013.[61\u2104 V. Jamali, N. Zlatanov, A. Ikhlef, and R. Shober, \u0010Ahievable Rate Region ofthe Bidiretional Bu\u001ber-Aided Relay Channel With Blok Fading,\u0011 IEEE Trans.Inform. Theory, vol. 60, pp. 7090\u00157111, Nov. 2014.[62\u2104 V. Jamali, N. Zlatanov, and R. Shober, \u0010Bidiretional Bu\u001ber-Aided Relay Net-works With Fixed Rate Transmission \u0015 Part I: Delay-Unonstrained Case,\u0011 IEEETrans. Wireless Commun., vol. 14, pp. 1323\u00151338, Mar. 2015.[63\u2104 \u0016\u0016, \u0010Bidiretional Bu\u001ber-Aided Relay Networks With Fixed Rate Transmission\u0015 Part II: Delay-Constrained Case,\u0011 IEEE Trans. Wireless Commun., vol. 14,pp. 1339\u00151355, Mar. 2015.[64\u2104 A. El Sha\u001ce, M. Khafagy, and A. Sultan, \u0010Optimization of a Relay-Assisted Linkwith Bu\u001ber State Information at the Soure,\u0011 IEEE Communi. Letters, vol. 18,pp. 2149\u00152152, De. 2014.[65\u2104 N. Zlatanov, R. Shober, and L. Lampe, \u0010Bu\u001ber-Aided Relaying in a Three NodeNetwork,\u0011 in 2012 IEEE Internat. Symposium on Informat. Theory Proeed.(ISIT), Jul. 2012, pp. 781\u0015785.[66\u2104 C. Dong, L.-L. Yang, and L. Hanzo, \u0010Performane Analysis of Multihop-Diversity-Aided Multihop Links,\u0011 IEEE Trans. Veh. Tehnol., vol. 61, pp. 2504\u00152516, Jul. 2012.[67\u2104 H. Shoukry, N. Zlatanov, V. Jamali, and R. Shober, \u0010Ahievable Rates for theFading Three-Hop Half-Duplex Relay Network using Bu\u001ber-Aided Relaying,\u0011 in2015 IEEE Globeom, Atlanta, USA, De. 2014.[68\u2104 A. Zafar, M. Shaqfeh, M.-S. Alouini, and H. Alnuweiri, \u0010Resoure Alloationfor Two Soure-Destination Pairs Sharing a Single Relay with a Bu\u001ber,\u0011 IEEETrans. Commun., vol. 62, pp. 1444\u00151457, May 2014.[69\u2104 J. Huang and A. Swindlehurst, \u0010Bu\u001ber-Aided Relaying for Two-Hop Seure Com-muniation,\u0011 IEEE Trans. Wireless Commun., vol. 14, pp. 152\u0015164, Jan. 2015.[70\u2104 G. Chen, Z. Tian, Y. Gong, Z. Chen, and J. Chambers, \u0010Max-Ratio RelaySeletion in Seure Bu\u001ber-Aided Cooperative Wireless Networks,\u0011 IEEE Trans.on Inform. Forensis and Seurity, vol. 9, pp. 719\u0015729, Apr. 2014.[71\u2104 Z. Tian, G. Chen, Y. Gong, Z. Chen, and J. Chambers, \u0010Bu\u001ber-Aided Max-LinkRelay Seletion in Amplify-and-Forward Cooperative Networks,\u0011 IEEE Trans.Veh. Tehnol., vol. 64, pp. 553\u0015565, Feb 2015.156Bibliography[72\u2104 I. Ahmed, A. Ikhlef, R. Shober, and R. Mallik, \u0010Power Alloation for Conven-tional and Bu\u001ber-Aided Link Adaptive Relaying Systems with Energy HarvestingNodes,\u0011 IEEE Trans. Wireless Commun., vol. 13, pp. 1182\u00151195, Mar. 2014.[73\u2104 I. Krikidis, T. Charalambous, and J. Thompson, \u0010Bu\u001ber-Aided Relay Seletionfor Cooperative Diversity Systems without Delay Constraints,\u0011 IEEE Trans.Wireless Commun., vol. 11, pp. 1957\u00151967, 2012.[74\u2104 A. Ikhlef, D. Mihalopoulos, and R. Shober, \u0010Max-Max Relay Seletion forRelays with Bu\u001bers,\u0011 IEEE Trans. Wireless Commun., vol. 11, no. 3, pp. 1124\u00151135, Mar. 2012.[75\u2104 S. Huang, J. Cai, and H. Zhang, \u0010Relay Seletion for Average Throughput Max-imization in Bu\u001ber-aided Relay Networks,\u0011 in Pro. of IEEE International Con-ferene on Communiations (ICC), London, UK, Jun. 2015.[76\u2104 M. G. Khafagyx, A. E. Sha\u001ce, A. Sultanx, and M.-S. Alouini, \u0010ThroughputMaximization for Bu\u001ber-Aided Hybrid Half-Full-Duplex Relaying with Self-Interferene,\u0011 in Pro. of IEEE International Conferene on Communiations(ICC), London, UK, Jun. 2015.[77\u2104 L. Ozarow, S. Shamai, and A. Wyner, \u0010Information Theoreti Considerations forCellular Mobile Radio,\u0011 IEEE Trans. Veh. Tehnol., vol. 43, pp. 359\u0015378, May1994.[78\u2104 M. Cardone, D. Tuninetti, R. Knopp, and U. Salim, \u0010On the Gaussian Half-Duplex Relay Channel,\u0011 IEEE Trans. Inform. Theory, vol. 60, pp. 2542\u00152562,May 2014.[79\u2104 T. Lutz, C. Hausl, and R. Kotter, \u0010Bits Through Deterministi Relay CasadesWith Half-Duplex Constraint,\u0011 IEEE Trans. Inform. Theory, vol. 58, pp. 369\u0015381, Jan 2012.[80\u2104 T. M. Cover and J. A. Thomas, Elements of Information Theory. John Wiley& Sons, 2012.[81\u2104 S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge UniversityPress, 2004.[82\u2104 P. Deu\u001dhard, Newton Methods for Nonlinear Problems: A\u001ene Invariane andAdaptive Algorithms. Springer, 2011, vol. 35.[83\u2104 L. Georgiadis, M. J. Neely, and L. Tassiulas, Resoure Alloation and CrossLayer Control in Wireless Networks. Now Publishers In, 2006.157Bibliography[84\u2104 R. Corless, G. Gonnet, D. Hare, D. Je\u001brey, and D. Knuth, \u0010On the LambertWfuntion,\u0011 Advanes in Computational Mathematis, vol. 5, no. 1, pp. 329\u0015359,1996.[85\u2104 J. D. C. Little, \u0010A Proof of the Queueing Formula: L = \u03bbw,\u0011 Operations Re-searh, vol. 9, no. 3, pp. 383\u0015388, May - Jun. 1961.[86\u2104 J. Fahs and I. Abou-Fayal, \u0010Using Hermite Bases in Studying Capaity-Ahieving Distributions Over AWGN Channels,\u0011 IEEE Trans. Inform. Theory,vol. 58, pp. 5302\u00155322, Aug. 2012.158Appendix AProofs for Chapter 2A.1 Proof That the Probability of Error at theRelay Goes to Zero When (2.25) HoldsIn order to prove that the relay an deode the soure's odeword in blok b, x1|r(b),where 1 \u2264 b \u2264 N , from the reeived odeword y1|r(b) when (2.25) holds, i.e., that theprobability of error at the relay goes to zero as k \u2192\u221e, we will follow the \u0010standard\"method in [80, Se. 7.7\u2104 for analyzing the probability of error for rates smaller thanthe apaity. To this end, note that the length of odeword x1|r(b) is k(1\u2212 P \u2217U). Onthe other hand, the length of odeword y1|r(b) is idential to the number of zeros9 inrelay's transmit odeword x2(b). Sine the zeros in x2(b) are generated independentlyusing a oin \u001dip, the number of zeros, i.e., the length of y1|r(b) is k(1 \u2212 P \u2217U) \u00b1 \u03b5(b),where \u03b5(b) is a non-negative integer. Due to the strong law of large numbers, thefollowing holdslimk\u2192\u221e\u03b5(b)k = 0, (A.1)limk\u2192\u221ek(1\u2212 P \u2217U)\u00b1 \u03b5(b)k(1\u2212 P \u2217U)= 1, (A.2)9For b = 1, note that the number of zeros in x2(1) is k. Therefore, for b = 1, we only take intoan aount the \u001crst k(1\u2212 P \u2217U ) zeros. As a result, the length of y1|r(b) is also k(1\u2212 P \u2217U ).159Appendix A. Proofs for Chapter 2i.e., for large k, the length of relay's reeived odeword y1|r(b) is approximately k(1\u2212P \u2217U).Now, for blok b, we de\u001cne a set R(b) whih ontains the symbol indies i in blokb for whih the symbols in x2(b) are zeros, i.e., for whih X2i = 0. Note that beforethe start of the transmission in blok b, the relay knows x2(b), thereby it knows apriori for whih symbol indies i in blok b, X2i = 0 holds. Furthermore, note that|R(b)| = k(1\u2212 P \u2217U)\u00b1 \u03b5(b) (A.3)holds, where | \u00b7 | denotes ardinality of a set. Depending on the relation between|R(b)| and k(1 \u2212 P \u2217U), the relay has to distinguish between two ases for deodingx1|r(b) from y1|r(b). In the \u001crst ase |R(b)| \u2265 k(1\u2212 P \u2217U) holds whereas in the seondase |R(b)| < k(1 \u2212 P \u2217U) holds. We \u001crst explain the deoding proedure for the \u001crstase.When |R(b)| = k(1 \u2212 P \u2217U) + \u03b5(b) \u2265 k(1 \u2212 P \u2217U) holds, the soure an transmit theentire odeword x1|r(b), whih is omprised of k(1 \u2212 P \u2217U) symbols, sine there areenough zeros in odeword x2(b). On the other hand, sine for this ase the reeivedodeword y1|r(b) is omprised of k(1 \u2212 P \u2217U) + \u03b5(b) symbols, and sine for the last\u03b5(b) symbols in y1|r(b) the soure is silent, the relay keeps from y1|r(b) only the \u001crstk(1 \u2212 P \u2217U) symbols and disards the remanning \u03b5(b) symbols. In this way, the relaykeeps only the reeived symbols whih are the result of the transmitted symbols inx1|r(b), and disards the rest of the symbols in y1|r(b) for whih the soure is silent.Thereby, from y1|r(b), the relay generates a new reeived odeword whih we denoteby y\u22171|r(b). Moreover, let R1(b) be a set whih ontains the symbol indies of thesymbols omprising odeword y\u22171|r(b). Now, note that the lengths of x1|r(b) andy\u22171|r(b), and the ardinality of set R1(b) are k(1 \u2212 P \u2217U), respetively. Having reated160Appendix A. Proofs for Chapter 2y\u22171|r(b) and R1(b), we now use a jointly typial deoder for deoding x1|r(b) fromy\u22171|r(b). In partiular, we de\u001cne a jointly typial set A|R1(b)|\u01eb asA|R1(b)|\u01eb ={(x1|r,y\u22171|r) \u2208 X|R1(b)|1 \u00d7 Y|R1(b)|1 :\u2223\u2223\u2223\u2223\u2223\u2223\u2212 1|R1(b)|\u2211i\u2208R1(b)log2 p(x1i|x2i = 0)\u2212H(X1|X2 = 0)\u2223\u2223\u2223\u2223\u2223\u2223\u2264 \u01eb, (A.4a)\u2223\u2223\u2223\u2223\u2223\u2223\u2212 1|R1(b)|\u2211i\u2208R1(b)log2 p(y1i|x2i = 0)\u2212H(Y1|X2 = 0)\u2223\u2223\u2223\u2223\u2223\u2223\u2264 \u01eb, (A.4b)\u2223\u2223\u2223\u2223\u2223\u2223\u2212 1|R1(b)|\u2211i\u2208R1(b)log2 p(x1i, y1i|x2i = 0)\u2212H(X1, Y1|X2 = 0)\u2223\u2223\u2223\u2223\u2223\u2223\u2264 \u01eb}, (A.4)where \u01eb is a small positive number. The transmitted odeword x1|r(b) is suessfullydeoded from reeived odeword y\u22171|r(b) if and only if (x1|r(b),y\u22171|r(b)) \u2208 A|R1(b)|\u01eb andno other odeword x\u02c61|r from odebook C1|r is jointly typial with y\u22171|r(b). In order toompute the probability of error, we de\u001cne the following eventsE0 = {(x1|r(b),y\u22171|r(b)) \/\u2208 A|R1(b)|\u01eb } and Ej = {(x\u02c6(j)1|r,y\u22171|r) \u2208 A|R1(b)|\u01eb }, (A.5)where x\u02c6(j)1|r is the j-th odeword in C1|r that is di\u001berent from x1|r(b). Note thatin C1|r there are |C1|r| \u2212 1 = 2kR \u2212 1 odewords that are di\u001berent from x1|r(b), i.e.,j = 1, ..., 2kR\u22121. Hene, an error ours if any of the events E0, E1, ..., E2kR\u22121 ours.Sine x1|r(b) is uniformly seleted from the odebook C1|r, the average probability oferror is given byPr(\u01eb) = Pr(E0 \u222a E1 \u222a ... \u222a E2kR\u22121) \u2264 Pr(E0) +2kR\u22121\u2211j=1Pr(Ej). (A.6)161Appendix A. Proofs for Chapter 2Sine |R1(b)| \u2192 \u221e as k \u2192\u221e, Pr(E0) in (A.6) is upper bounded as [80, Eq. (7.74)\u2104Pr(E0) \u2264 \u01eb. (A.7)On the other hand, sine |R1(b)| \u2192 \u221e as k \u2192\u221e, Pr(Ej) is upper bounded asPr(Ej) = Pr((x\u02c6(j)1|r,y\u22171|r(b))\u2208 A|R1(b)|\u01eb)=\u2211(x\u02c6(j)1|r ,y\u22171|r(b))\u2208A|R1(b)|\u01ebp(x\u02c6(j)1|r,y\u22171|r(b))(a)=\u2211(x\u02c6(j)1|r ,y\u22171|r(b))\u2208A|R1(b)|\u01ebp(x\u02c6(j)1|r)p(y\u22171|r(b))(b)\u2264\u2211(x\u02c6(j)1|r ,y\u22171|r(b))\u2208A|R1(b)|\u01eb2\u2212|R1(b)|(H(X1 |X2=0)\u2212\u01eb)2\u2212|R1(b)|(H(Y1|X2=0)\u2212\u01eb)= |A|R1(b)|\u01eb |2\u2212|R1(b)|(H(X1|X2=0)\u2212\u01eb)2\u2212|R1(b)|(H(Y1|X2=0)\u2212\u01eb)(c)\u2264 2|R1(b)|(H(X1,Y1|X2=0)+\u01eb)2\u2212|R1(b)|(H(X1 |X2=0)\u2212\u01eb)2\u2212|R1(b)|(H(Y1|X2=0)\u2212\u01eb)= 2\u2212|R1(b)|(H(X1|X2=0)+H(Y1|X2=0)\u2212H(X1,Y1|X2=0)\u22123\u01eb)= 2\u2212|R1(b)|(I(X1;Y1|X2=0)\u22123\u01eb), (A.8)where (a) follows sine x\u02c6(j)1|r and y\u22171|r(b) are independent, (b) follows sinep(x\u02c6(j)1|r) \u2264 2\u2212|R1(b)|(H(X1|X2=0)\u2212\u01eb) and p(y\u22171|r(b)) \u2264 2\u2212|R1(b)|(H(Y1|X2=0)\u2212\u01eb),whih follows from [80, Eq. (3.6)\u2104, respetively, and (c) follows sine|A|R1(b)|\u01eb | \u2264 2|R1(b)|(H(X1,Y1|X2=0)+\u01eb),whih follows from [80, Theorem 7.6.1\u2104. Inserting (A.7) and (A.8) into (A.6), we162Appendix A. Proofs for Chapter 2obtainPr(\u01eb) \u2264 \u01eb+2kR\u22121\u2211j=12\u2212|R1(b)|(I(X1;Y1|X2=0)\u22123\u01eb)\u2264 \u01eb+ (2kR \u2212 1)2\u2212|R1(b)|(I(X1;Y1|X2=0)\u22123\u01eb)\u2264 \u01eb+ 2kR2\u2212|R1(b)|(I(X1;Y1|X2=0)\u22123\u01eb)= \u01eb+ 2\u2212k((|R1(b)|\/k)I(X1;Y1|X2=0)\u2212R\u22123(1\u2212P \u2217U )\u01eb). (A.9)Hene, ifR < |R1(b)|k I(X1; Y1|X2 = 0)\u2212 3(1\u2212 P\u2217U)\u01eb= (1\u2212 P \u2217U)I(X1; Y1|X2 = 0)\u2212 3(1\u2212 P \u2217U)\u01eb, (A.10)then lim\u01eb\u21920limk\u2192\u221ePr(\u01eb) = 0. This onludes the proof for ase when |R(b)| \u2265 k(1 \u2212 P \u2217U)holds. We now turn to ase two when |R(b)| < k(1\u2212 P \u2217U) holds.When |R(b)| = k(1 \u2212 P \u2217U) \u2212 \u03b5(b) < k(1 \u2212 P \u2217U) holds, then the soure annottransmit all of its k(1\u2212P \u2217U) symbols omprising odeword x1|r(b) sine there are notenough zeros in odeword x2(b). Instead, the relay transmits only k(1 \u2212 P \u2217U) \u2212 \u03b5(b)symbols of odeword x1|r(b), and we denote the resulting transmitted odeword byx\u22171|r(b). Note that the length of odewords x\u22171|r(b) and y1|r(b), and the ardinalityof R(b) are all idential and equal to k(1 \u2212 P \u2217U) \u2212 \u03b5(b). In addition, let the relaygenerate a odebook C\u22171|r(b) by keeping only the \u001crst k(1\u2212 P \u2217U)\u2212 \u03b5(b) symbols fromeah odeword in odebook C1|r and disarding the remaining \u03b5(b) symbols in theorresponding odewords. Let us denote the odewords in C\u22171|r(b) by x\u22171|r. Note thatthere is a unique one to one mapping from the odewords in C\u22171|r(b) to the odewordsin C1|r(b) sine when k \u2192\u221e, k(1\u2212P \u2217U)\u2212\u03b5(b) \u2192\u221e also holds, i.e., the lengths of the163Appendix A. Proofs for Chapter 2odewords in C\u22171|r(b) and C1|r are of the same order due to (A.2). Hene, if the relayan deode x\u22171|r(b) from y1|r(b), then using this unique mapping between C\u22171|r(b) andC1|r(b), the relay an deode x1|r(b) and thereby deode the message w(b) sent fromthe soure.Now, for deoding x\u22171|r(b) from y1|r(b), we again use jointly typial deoding.Thereby, we de\u001cne a jointly typial set B|R|\u01eb asB|R|\u01eb ={(x\u22171|r,y1|r) \u2208 X|R|1 \u00d7 Y|R|1 :\u2223\u2223\u2223\u2223\u2223\u2212 1|R|\u2211i\u2208Rlog2 p(x1i|x2i = 0)\u2212H(X1|X2 = 0)\u2223\u2223\u2223\u2223\u2223\u2264 \u01eb, (A.11a)\u2223\u2223\u2223\u2223\u2223\u2212 1|R|\u2211i\u2208Rlog2 p(y1i|x2i = 0)\u2212H(Y1|X2 = 0)\u2223\u2223\u2223\u2223\u2223\u2264 \u01eb, (A.11b)\u2223\u2223\u2223\u2223\u2223\u2212 1|R|\u2211i\u2208Rlog2 p(x1i, y1i|x2i = 0)\u2212H(X1, Y1|X2 = 0)\u2223\u2223\u2223\u2223\u2223\u2264 \u01eb}. (A.11)Again, the transmitted odeword x\u22171|r(b) is suessfully deoded from reeivedodeword y1|r(b) if and only if (x\u22171|r(b),y1|r(b)) \u2208 B|R|\u01eb and no other odeword x\u02c6\u22171|rfrom odebook C\u22171|r is jointly typial with y1|r(b). In order to ompute the probabilityof error, we de\u001cne the following eventsE0 = {(x\u22171|r(b),y1|r(b)) \/\u2208 B|R|\u01eb } and Ej = {(x\u02c6\u2217(j)1|r ,y1|r(b)) \u2208 B|R|\u01eb }, (A.12)where x\u02c6\u2217(j)1|r is the j-th odeword in C\u22171|r that is di\u001berent from x\u22171|r(b). Note that inC\u22171|r there are |C\u22171|r| \u2212 1 = 2kR \u2212 1 odewords that are di\u001berent from x\u22171|r(b), i.e.,j = 1, ..., 2kR \u2212 1. Hene, an error ours if any of the events E0, E1, ..., E2kR\u22121ours. Now, using a similar proedure as for ase when |R(b)| \u2265 k(1 \u2212 P \u2217U), it an164Appendix A. Proofs for Chapter 2be proved that ifR < |R(b)|k I(X1; Y1|X2 = 0)\u2212 3(1\u2212 P\u2217U)\u01eb= (1\u2212 P \u2217U)I(X1; Y1|X2 = 0)\u2212\u03b5(b)k I(X1; Y1|X2 = 0)\u2212 3(1\u2212 P\u2217U)\u01eb, (A.13)then lim\u01eb\u21920limk\u2192\u221ePr(\u01eb) = 0. In (A.13), note thatlimk\u2192\u221e\u03b5(b)k I(X1; Y1|X2 = 0) = 0 (A.14)holds due to (A.1). This onludes the proof for the ase when |R(b)| < k(1\u2212 P \u2217U).A.2 Proof That the Probability of Error at theDestination Goes to Zero When (2.26) HoldsIn order to prove that the destination an deode the relay's odeword suessfullywhen (2.26) holds, i.e., that the probability of error at the destination goes to zero, wewill again follow the \u0010standard\" method in [80, Se. 7.7\u2104 for analyzing the probabilityof error for rates smaller than the apaity. To this end, we again use a jointly typial165Appendix A. Proofs for Chapter 2deoder. In partiular, we de\u001cne a jointly typial set Dk\u01eb as followsDk\u01eb = {(x2,y2) \u2208 X k2 \u00d7 Yk2 :\u2223\u2223\u2223\u2223\u2223\u22121kk\u2211i=1log2 p(x2i)\u2212H(X2)\u2223\u2223\u2223\u2223\u2223\u2264 \u01eb (A.15a)\u2223\u2223\u2223\u2223\u2223\u22121kk\u2211i=1log2 p(y2i)\u2212H(Y2)\u2223\u2223\u2223\u2223\u2223\u2264 \u01eb (A.15b)\u2223\u2223\u2223\u2223\u2223\u22121kk\u2211i=1log2 p(x2i, y2i)\u2212H(X2, Y2)\u2223\u2223\u2223\u2223\u2223\u2264 \u01eb}, (A.15)where p(x2) and p(y2) are given in (2.8)-(2.11) The reeived odeword y2 is suess-fully deoded as the transmitted odeword x2 if and only if (x2,y2) \u2208 Dk\u01eb , and noother odeword x\u02c62 from odebook C2 is jointly typial with y2. In order to omputethe probability of error, we de\u001cne the following eventsE0 = {(x2,y2) \/\u2208 Dk\u01eb } and Ej = {(x\u02c62(j),y2) \u2208 Dk\u01eb }, (A.16)where x\u02c62(j) is the j-th odeword in C2 that is di\u001berent from x2. Note that in C2 thereare |C2| \u2212 1 = 2kR \u2212 1 odewords whih are di\u001berent from x2, i.e., j = 1, ..., 2kR \u2212 1.An error ours if at least one of the events E0, E1,..., E2kR\u22121 ours. Sine x2 isuniformly seleted from odebook C2, the average probability of error is given byPr(\u01eb) = Pr(E0 \u222a E1 \u222a ... \u222a E2kR\u22121) \u2264 Pr(E0) +2kR\u22121\u2211j=1Pr(Ej). (A.17)In (A.17), Pr(E0) is upper bounded as [80, Eq. (7.74)\u2104Pr(E0) \u2264 \u01eb, (A.18)166Appendix A. Proofs for Chapter 2whereas Pr(Ej) is bounded asPr(Ej) = Pr((x\u02c62(j),y2) \u2208 Dk\u01eb ) =\u2211(x\u02c62(j),y2)\u2208Dk\u01ebp(x\u02c62(j),y2)(a)=\u2211(x\u02c62(j),y2)\u2208Dk\u01ebp(x\u02c62(j))p(y2)(b)\u2264\u2211(x\u02c62(j),y2)\u2208Dk\u01eb2\u2212k(H(X2)\u2212\u01eb)2\u2212k(H(Y2)\u2212\u01eb) = |Dk\u01eb |2\u2212k(H(X2)\u2212\u01eb)2\u2212k(H(Y2)\u2212\u01eb)(c)\u2264 2k(H(X2,Y2)+\u01eb)2\u2212k(H(X2)\u2212\u01eb)2\u2212k(H(Y2)\u2212\u01eb) = 2\u2212k(H(Y2)\u2212H(Y2|X2)\u22123\u01eb), (A.19)where (a) follows sine x\u02c62(j) and y2 are independent, (b) follows sine p(x\u02c62(j)) \u22642\u2212k(H(X2)\u2212\u01eb) and p(y2) \u2264 2\u2212k(H(Y2)\u2212\u01eb), whih follow from [80, Eq. (3.6)\u2104, respetively,and (c) follows sine |Dk\u01eb | \u2264 2k(H(X2,Y2)+\u01eb), whih follows from [80, Theorem 7.6.1\u2104.Inserting (A.18) and (A.19) into (A.17), we obtainPr(\u01eb) \u2264 \u01eb+2kR\u22121\u2211j=12\u2212k(H(Y2)\u2212H(Y2|X2)\u22123\u01eb) \u2264 \u01eb+ (2kR \u2212 1)2\u2212k(H(Y2)\u2212H(Y2|X2)\u22123\u01eb)\u2264 \u01eb+ 2kR2\u2212k(H(Y2)\u2212H(Y2|X2)\u22123\u01eb) = \u01eb+ 2\u2212k(H(Y2)\u2212H(Y2|X2)\u2212R\u22123\u01eb). (A.20)Hene, if R < H(Y2) \u2212 H(Y2|X2) \u2212 3\u01eb = I(X2; Y2) \u2212 3\u01eb, then lim\u01eb\u2192\u221e limk\u2192\u221ePr(\u01eb) = 0.This onludes the proof.A.3 Proof of Lemma 2.1To prove Lemma 2.1, we use results from [86\u2104. Hene, we \u001crst assume that pV (x2) isa ontinuous distribution and then see that this leads to a ontradition. If pV (x2) isa ontinuous distribution, then the distribution of X2 is also ontinuous. Now, our167Appendix A. Proofs for Chapter 2goal is to obtain the solution of the following optimization problemMaximize :pV (x2)H(Y2)Subject to :\u222bx2 x22pV (x2)dx2 \u2264 P2,(A.21)where Y2 = X2 + N2, N2 is a zero mean Gaussian distributed RV with variane \u03c322,and X2 has a ontinuous distribution with an average power onstraint. However, itis proved in [86\u2104 that the only possible solution for maximizing H(Y2) as in (A.21)is the distribution pV (x2) that yields a Gaussian distributed Y2. In our ase, theonly possible solution that yields a Gaussian distributed Y2 is if X2 is also Gaussiandistributed. On the other hand, the distribution of X2 an be written asp(x2) = pV (x2)PU + \u03b4(x2)(1\u2212 PU). (A.22)Hene, we have to \u001cnd a pV (x2) suh that p(x2) in (A.22) is Gaussian. However,as an be seen from (A.22), for PU < 1, a distribution for pV (x2) that makes p(x2)Gaussian does not exist. Therefore, as proved in [86\u2104, the only other possibility isthat pV (x2) is a disrete distribution. Only in the limiting ase when PU \u2192 1, p(x2)beomes a Gaussian distribution by setting pV (x2) to be a Gaussian distribution.This onludes the proof.168Appendix BProofs for Chapter 3B.1 Proof of Theorem 3.1We \u001crst note that, beause of the law of the onservation of \u001dow, A \u2265 R\u00afSD is alwaysvalid and equality holds if and only if the queue is non-absorbing. Assume \u001crstwe have an adaptive reeption-transmission poliy with average arrival rate A andahievable average rate R\u00afSD with A > R\u00afSD, i.e., the queue is absorbing. For thispoliy, we denote the set of indies with di = 1 by I\u00af and the set of indies with di = 0by I, and for N \u2192\u221e we haveA = 1N\u2211i\u2208I(1\u2212 di) log2(1 + s(i)) > R\u00afSD =1N\u2211i\u2208I\u00afdi min{log2(1 + r(i)), Q(i\u2212 1)}.(B.1)From (B.1) we observe that the onsidered protool annot be optimal as it an beimproved by moving some of the indies i in I to I\u00af whih leads to an inrease of R\u00afSDat the expense of a derease of A. However, one the point A = R\u00afSD is reahed,moving more indies i from I to I\u00af will derease both A and R\u00afSD beause of theonservation of \u001dow. Thus, a neessary ondition for the optimal poliy is that thequeue is non-absorbing but the queue is at the edge of non-absorption, i.e., the queueis at the boundary of a non-absorbing and an absorbing queue. This ompletes theproof.169Appendix B. Proofs for Chapter 3B.2 Proof of Theorem 3.2We denote the sets of indies i for whih di = 1 and di = 0 holds by I\u00af and I,respetively. \u01eb denotes a subset of I\u00af and | \u00b7 | is the ardinality of a set. Throughoutthe remainder of this proof N \u2192\u221e is assumed.If the queue in the bu\u001ber of the relay is absorbing, A > R\u00afSD holds and on averagethe number of bits\/symb arriving at the queue exeed the number of bits leavingthe queue. Thus, log2(1 + r(i)) \u2264 Q(i \u2212 1) holds almost always and as a result theaverage rate an be written asR\u00afSD =1N\u2211i\u2208I\u00afmin{log2(1 + r(i)), Q(i\u2212 1)} =1N\u2211i\u2208I\u00aflog2(1 + r(i)). (B.2)Now, we assume that the queue is at the edge of non-absorption. That isA = R\u00afSDholds but moving a small fration \u01eb, where |\u01eb|\/N \u2192 0, of indies from I\u00af to I will makethe queue an absorbing queue with A > R\u00afSD. For this ase, we wish to determinewhether or not1N\u2211i\u2208I\u00aflog2(1 + r(i)) > R\u00afSD =1N\u2211i\u2208I\u00afmin{log2(1 + r(i)), Q(i\u2212 1)}= A = 1N\u2211i\u2208Ilog2(1 + s(i)) (B.3)holds. To test this, we move a small fration \u01eb, where |\u01eb|\/N \u2192 0, of indies from I\u00afto I, thus making the queue an absorbing queue. As a result, (B.2) holds, and (B.3)170Appendix B. Proofs for Chapter 3beomes1N\u2211i\u2208I\u00af\\\u01eblog2(1 + r(i)) = R\u00afSD =1N\u2211i\u2208I\u00af\\\u01ebmin{log2(1 + r(i)), Q(i\u2212 1)}< A = 1N\u2211i\u2208I\u222a\u01eblog2(1 + s(i)). (B.4)From the above we onlude that if (B.2) holds, then based on (B.3) and (B.4), for|\u01eb|\/N \u2192 0, we must have1N\u2211i\u2208I\u00aflog2(1 + r(i)) >1N\u2211i\u2208Ilog2(1 + s(i)) (B.5)and1N\u2211i\u2208I\u00af\\\u01eblog2(1 + r(i)) <1N\u2211i\u2208I\u222a\u01eblog2(1 + s(i)). (B.6)However, for (B.5) and (B.6) to jointly hold, we require that the partiular onsideredmoving of indies from I\u00af to I has aused a disontinuity in 1N\u2211i\u2208I\u00af log2(1 + r(i))or\/and a disontinuity in1N\u2211i\u2208I log2(1 + s(i)) as |\u01eb|\/N \u2192 0 is assumed. Sine theapaities of the S-R and R-D links are suh that limN\u2192\u221e\u2211i\u2208\u01eb log2(1+s(i))\/N \u2192 0and limN\u2192\u221e\u2211i\u2208\u01eb log2(1 + r(i))\/N \u2192 0, \u2200i, suh disontinuities are not possible.Therefore, at the edge of non-absorption (B.3) is not true and we must have instead1N\u2211i\u2208I\u00aflog2(1 + r(i)) = R\u00afSD =1N\u2211i\u2208I\u00afmin{log2(1 + r(i)), Q(i\u2212 1)}= A = 1N\u2211i\u2208Ilog2(1 + s(i)) (B.7)Using (B.7), the average rate an be written as (3.18). This onludes the proof.171Appendix B. Proofs for Chapter 3B.3 Proof of Theorem 3.3To solve (3.19), we \u001crst relax the binary onstraints di \u2208 {0, 1} in (3.19) to 0 \u2264 di \u22641, \u2200i. Thereby, we transform the original problem (3.19) into the following linearoptimization problemMaximize :di1N\u2211Ni=1 di log2(1 + r(i))Subject to : C1 : 1N\u2211Ni=1(1\u2212 di) log2(1 + s(i)) = 1N\u2211Ni=1 di log2(1 + r(i))C2 : 0 \u2264 di \u2264 1, \u2200i,(B.8)In the following, we solve the relaxed problem (B.8) and then show that the optimalvalues of di, \u2200i, are at the boundaries, i.e., di \u2208 {0, 1}, \u2200i. Therefore, the solution ofthe relaxed problem (B.8) is also the solution to the original maximization problemin (3.19).Sine (B.8) is a linear optimization problem, we an solve it by using the methodof Lagrange multipliers. The Lagrangian funtion for maximization problem (B.8) isgiven byL = 1NN\u2211i=1di log2(1 + r(i))\u2212 \u00b51NN\u2211i=1[di log2(1 + r(i))\u2212 (1\u2212 di) log2(1 + s(i))]+ 1NN\u2211i=1\u03b2idi \u22121NN\u2211i=1\u03b1i(di \u2212 1), (B.9)where \u00b5, \u03b2i\/N , and \u03b1i\/N are Lagrange multipliers. The Lagrange multipliers \u03b2i\/Nand \u03b1i\/N have to satisfy\u03b2i\/N \u2265 0, \u03b1i\/N \u2265 0, di\u03b2i\/N = 0, (di \u2212 1)\u03b1i\/N = 0. (B.10)172Appendix B. Proofs for Chapter 3Di\u001berentiating L with respet to di and setting the result to zero leads to(1\u2212 \u00b5) log2(1 + r(i))\u2212 \u00b5 log2(1 + s(i)) + \u03b2i \u2212 \u03b1i = 0. (B.11)If we assume that 0 < di < 1, i.e., di is not at the boundary, then \u03b2i = \u03b1i = 0 holds,and from (B.11) we obtain that the following must hold(1\u2212 \u00b5) log2(1 + r(i))\u2212 \u00b5 log2(1 + s(i)) = 0. (B.12)However, sine r(i) and s(i) are random, i.e., hange values for di\u001berent i, (B.12)annot hold for all i. Therefore, di has to be at the boundary, i.e., di \u2208 {0, 1}. Now,assuming di = 0 leads \u03b2i \u2265 0 and \u03b1i = 0, whih simpli\u001ces (B.11) todi = 0 \u21d2 \u03b2i = \u00b5 log2(1 + s(i))\u2212 (1\u2212 \u00b5) log2(1 + r(i)) \u2265 0. (B.13)Whereas, assuming di = 1 leads \u03b2i = 0 and \u03b1i \u2265 0, whih simpli\u001ces (B.11) todi = 1 \u21d2 \u03b1i = (1\u2212 \u00b5) log2(1 + r(i))\u2212 \u00b5 log2(1 + s(i)) \u2265 0. (B.14)(B.13) and (B.14) an be written equivalently asdi =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f31 if (1\u2212 \u00b5) log2(1 + r(i))\u2212 \u00b5 log2(1 + s(i)) \u2265 00 if (1\u2212 \u00b5) log2(1 + r(i))\u2212 \u00b5 log2(1 + s(i)) \u2264 0,(B.15)whih is idential to (3.20) if we set \u03c1 = \u00b5\/(1\u2212 \u00b5) and note that the probability of(1 \u2212 \u00b5) log2(1 + r(i)) = \u00b5 log2(1 + s(i)) happening is zero due to s(i) and r(i) beingontinuous random variables. \u00b5 or equivalently \u03c1 are hosen suh that onstraint C1of problem (3.19) is met. This ompletes the proof.173Appendix B. Proofs for Chapter 3B.4 Proof of Theorem 3.4To solve (3.29), we \u001crst relax the binary onstraints di \u2208 {0, 1} in (3.29) to 0 \u2264 di \u2264 1,\u2200i. Thereby, we transform the original problem (3.29) into the following onaveoptimization problemMaximize :\u03b3S(i)\u22650, \u03b3R(i)\u22650, di1N\u2211Ni=1 di log2(1 + \u03b3R(i)hR(i))Subject to : C1 : 1N\u2211Ni=1(1\u2212 di) log2(1 + \u03b3S(i)hS(i))= 1N\u2211Ni=1 di log2(1 + \u03b3R(i)hR(i))C2 : 0 \u2264 di \u2264 1C3 : 1N\u2211Ni=1(1\u2212 di)\u03b3S(i) + 1N\u2211Ni=1 di\u03b3R(i) \u2264 \u0393(B.16)In the following, we solve the relaxed problem (B.16) and then show that the optimalvalues of di, \u2200i, are at the boundaries, i.e., di \u2208 {0, 1}, \u2200i. Therefore, the solution ofthe relaxed problem (B.16) is also the solution to the original maximization problemin (3.29).Sine (B.16) is a onave optimization problem, we an solve it by using themethod of Lagrange multipliers. The Lagrangian funtion for maximization problem(B.16) is given byL = 1NN\u2211i=1di log2(1 + \u03b3R(i)hR(i))\u2212\u00b5 1NN\u2211i=1[di log2(1 + \u03b3R(i)hR(i))\u2212 (1\u2212 di) log2(1 + \u03b3S(i)hS(i))]\u2212\u03bd 1NN\u2211i=1[(1\u2212 di)\u03b3S(i) + di\u03b3R(i)\u2212 \u0393]+ 1NN\u2211i=1\u03b2idi \u22121NN\u2211i=1\u03b1i(di \u2212 1),(B.17)174Appendix B. Proofs for Chapter 3where the Lagrange multipliers \u00b5 and \u03bd are hosen suh that C1 and C3 are satis\u001ced,respetively. On the other hand, the Lagrange multipliers \u03b2i\/N and \u03b1i\/N have tosatisfy (B.10).By di\u001berentiating L with respet to \u03b3S(i), \u03b3R(i), and di, and setting the resultsto zero, we obtain the following three equations\u2212\u03bd(1 \u2212 di) + \u00b5(1\u2212 di)hS(i)(1 + \u03b3S(i)hS(i)) ln(2)= 0, (B.18)\u2212\u03bddi +dihR(i)(1 + \u03b3R(i)hR(i)) ln(2)\u2212 \u00b5 dihR(i)(1 + \u03b3R(i)hR(i)) ln(2)= 0, (B.19)\u2212\u03b1i + \u03b2i \u2212 \u03bd(\u03b3R(i)\u2212 \u03b3S(i)) + (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i))\u2212\u00b5 log2(1 + \u03b3S(i)hS(i)) = 0. (B.20)If we assume that 0 < di < 1, i.e., di is not at the boundary, then \u03b2i = \u03b1i = 0 holds,and from (B.20) we obtain that the following must hold\u2212\u03bd(\u03b3R(i)\u2212 \u03b3S(i)) + (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i))\u2212 \u00b5 log2(1 + \u03b3S(i)hS(i)) = 0.(B.21)However, sine hR(i) and hR(i) are random, (B.21) annot hold for all i. Therefore,di has to be at the boundary, i.e., di \u2208 {0, 1}. Now, assuming di = 0 leads \u03b2i \u2265 0and \u03b1i = 0, whih simpli\u001ces (B.20) to\u03b2i = \u03bd(\u03b3R(i)\u2212 \u03b3S(i))\u2212 (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i)) + \u00b5 log2(1 + \u03b3S(i)hS(i)) \u2265 0.(B.22)175Appendix B. Proofs for Chapter 3Whereas, assuming di = 1 leads \u03b2i = 0 and \u03b1i \u2265 0, whih simpli\u001ces (B.20) to\u03b1i = \u2212\u03bd(\u03b3R(i)\u2212 \u03b3S(i)) + (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i))\u2212 \u00b5 log2(1 + \u03b3S(i)hS(i)) \u2265 0.(B.23)From (B.22) and (B.23), we obtain the following solution for didi =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f31 if (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i))\u2212 \u03bd\u03b3R(i) \u2265 \u00b5 log2(1 + \u03b3S(i)hS(i))\u2212 \u03bd\u03b3S(i)0 if (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i))\u2212 \u03bd\u03b3R(i) \u2264 \u00b5 log2(1 + \u03b3S(i)hS(i))\u2212 \u03bd\u03b3S(i)(B.24)Now, inserting the solution for di in (B.24) into (B.18) and (B.19), and solving thesystem of two equations with respet to \u03b3S(i) and \u03b3R(i), we obtain (3.30), (3.31),and (3.32) after letting \u03c1 = \u00b5\/(1\u2212\u00b5) and \u03bb = \u03bd ln(2)\/(1\u2212\u00b5), whih are hosen suhthat onstraints C1 and C3 are meet with equality. This ompletes the proof.B.5 Proof of Lemma 3.2Sine s(i) and r(i) are ergodi random proesses, for N \u2192 \u221e, the normalized sumsin C1 and C3 in (3.29) an be replaed by expetations. Therefore, the left handside of C1 is the expetation of variable (1 \u2212 di) log2(1 + \u03b3S(i)hS(i)). This variableis nonzero only when both (1 \u2212 di) and \u03b3S(i) are nonzero. The domain over whih(1\u2212 di) and \u03b3S(i) are jointly nonzero an be obtained from (3.30) and (3.32) and isgiven by(hS(i) > \u03bb\/\u03c1 AND hR(i) < \u03bb)OR (hS(i) > L1 AND hR(i) > \u03bb) (B.25)176Appendix B. Proofs for Chapter 3where L1 is given by (3.36). Variable (1\u2212di) log2(1+\u03b3S(i)hS(i)) has to be integratedover domain (B.25) to obtain its average. This leads to the left side of (3.34).Similarly, the right hand side of C1 is the expetation of the variable di log2(1 +\u03b3R(i)hR(i)). This variable is nonzero only when both di and \u03b3R(i) are nonzero. Thedomain over whih di and \u03b3R(i) are jointly nonzero an be obtained from (3.31) and(3.32) and is given by(hR(i) > \u03bb AND hS(i) < \u03bb\/\u03c1)OR (hR(i) > L2 AND hS(i) > \u03bb\/\u03c1) (B.26)where L2 is given by (3.36). Variable di log2(1+\u03b3R(i)hR(i)) has to be integrated overdomain (B.26) to obtain its average. This leads to the right side of (3.34).Following a similar proedure, we an obtain (3.35) from C3 in (3.29). Thisompletes the proof.177Appendix CProofs for Chapter 4C.1 Proof of Theorem 4.1We \u001crst note that, beause of the law of the onservation of \u001dow, A \u2265 \u03c4 is alwaysvalid and equality holds if and only if the queue is non-absorbing.We denote the set of indies with di = 1 by I\u00af and the set of indies with di = 0by I. Assume that we have an adaptive reeption-transmission protool with arrivalrate A and throughput \u03c4 with A > \u03c4 , i.e., the queue is absorbing. Then, for N \u2192\u221e,we haveA = 1N\u2211i\u2208I(1\u2212 di)OS(i)S0 > \u03c4 =1N\u2211i\u2208I\u00afdiOR(i)min{R0, Q(i\u2212 1)}. (C.1)From (C.1) we observe that the onsidered protool annot be optimal as the through-put an be improved by moving some of the indies i in I to I\u00af whih leads to aninrease of \u03c4 at the expense of a derease of A. As we ontinue moving indies fromI to I\u00af we reah a point where A = \u03c4 holds. At this point, the queue beomes non-absorbing (but is at the boundary between a non-absorbing and an absorbing queue)and the throughput is maximized. If we ontinue moving indies from I to I\u00af, ingeneral, A will derease and as a onsequene of the law of onservation of \u001dow, \u03c4will also derease. We note that A does not derease if we move only those indiesfrom I to I\u00af for whih OS(i) = 0 holds. In this ase, A will not hange, and as a178Appendix C. Proofs for Chapter 4onsequene of the law of onservation of \u001dow, the value of \u03c4 also remains unhanged.Note that this is used in Lemma 4.1. However, the queue is moved from the edgeof non-absorption if OR(i) = 1 holds for some of the indies moved from I to I\u00af. Aswill be seen later, if the queue of the bu\u001ber operates at the edge of non-absorption,the throughput beomes independent of the state of the queue, whih is desirable foranalytial throughput maximization.In the following, we will prove that when the queue is at the edge of non-absorptionthe following holds\u03c4 = limN\u2192\u221e1NN\u2211i=1diOR(i)R0 = A = limN\u2192\u221e1NN\u2211i=1(1\u2212 di)OS(i)S0. (C.2)Let \u01eb denote a small subset of I\u00af ontaining only indies i for whih OS(i) = 1,where |\u01eb|\/N \u2192 0 for N \u2192 \u221e and | \u00b7 | denotes the ardinality of a set. Throughoutthe remainder of this proof N \u2192\u221e is assumed.If the queue in the bu\u001ber of the relay is absorbing, A > \u03c4 holds and on averagethe number of bits arriving at the queue exeed the number of bits leaving the queue.Thus, R0 \u2264 Q(i \u2212 1) holds almost always and as a result the throughput an bewritten as\u03c4 = 1N\u2211i\u2208I\u00afOR(i)min{R0, Q(i\u2212 1)} =1N\u2211i\u2208I\u00afOR(i)R0. (C.3)Now, we assume that the queue is at the edge of non-absorption. That is A = \u03c4holds but moving the small fration of indies in \u01eb, where |\u01eb|\/N \u2192 0, from I\u00af to I willmake the queue an absorbing queue with A > \u03c4 . For this ase, we wish to determinewhether or not1N\u2211i\u2208I\u00afOR(i)R0 > \u03c4 =1N\u2211i\u2208I\u00afOR(i)min{R0, Q(i\u2212 1)} = A =1N\u2211i\u2208IOS(i)S0 (C.4)179Appendix C. Proofs for Chapter 4holds. To test this, we move a small fration \u01eb, where |\u01eb|\/N \u2192 0, of indies from I\u00afto I, thus making the queue an absorbing queue. As a result, (C.3) holds and (C.4)beomes1N\u2211i\u2208I\u00af\\\u01ebOR(i)R0 = \u03c4 =1N\u2211i\u2208I\u00af\\\u01ebOR(i)min{R0), Q(i\u2212 1)} = A =1N\u2211i\u2208I\u222a\u01ebOS(i)S0.(C.5)From the above we onlude that if (C.3) holds, then based on (C.4) and (C.5), for|\u01eb|\/N \u2192 0, we must have1N\u2211i\u2208I\u00afOR(i)R0 >1N\u2211i\u2208IOS(i)S0 (C.6)and1N\u2211i\u2208I\u00af\\\u01ebOR(i)R0 <1N\u2211i\u2208I\u222a\u01ebOS(i)S0. (C.7)However, for (C.6) and (C.7) to jointly hold, we require that the partiular onsid-ered move of indies from I\u00af to I auses a disontinuity in 1N\u2211i\u2208I\u00af OR(i)R0 or\/anda disontinuity in1N\u2211i\u2208I OS(i)S0 as |\u01eb|\/N \u2192 0 is assumed. Sine S0 and R0are \u001cnite, limN\u2192\u221e\u2211i\u2208\u01eb S0\/N = limN\u2192\u221e S0|\u01eb|\/N = 0 and limN\u2192\u221e\u2211i\u2208\u01ebR0\/N =limN\u2192\u221eR0|\u01eb|\/N = 0. Hene, suh disontinuities are not possible. Therefore, at theedge of non-absorption the inequality in (C.4) annot hold and we must have1N\u2211i\u2208I\u00afOR(i)R0 = \u03c4 =1N\u2211i\u2208I\u00afOR(i)min{R0, Q(i\u2212 1)} = A =1N\u2211i\u2208IOS(i)S0. (C.8)Eq. (C.8) an be written as (4.31). This onludes the proof.180Appendix C. Proofs for Chapter 4C.2 Proof of Theorem 4.2To solve (4.33), we \u001crst relax the binary onstraints di \u2208 {0, 1} in (4.33) to 0 \u2264 di \u22641, \u2200i. Thereby, we transform the original problem (4.33) into the following linearoptimization problemMaximize :di1N\u2211Ni=1 diOR(i)R0Subject to : C1 : 1N\u2211Ni=1(1\u2212 di)OS(i)S0 = 1N\u2211Ni=1 diOR(i)R0C2 : 0 \u2264 di \u2264 1, \u2200i.(C.9)In the following, we solve the relaxed problem (C.9) and then show that the optimalvalues of di, \u2200i are at the boundaries, i.e., di \u2208 {0, 1}, \u2200i. Therefore, the solution ofthe relaxed problem (C.9) is also the solution to the original maximization problemin (4.33).Sine (C.9) is a linear optimization problem, we an solve it by using the methodof Lagrange multipliers. The Lagrangian for Problem (4.33) is given byL = 1NN\u2211i=1diOR(i)R0 \u2212 \u00b51NN\u2211i=1[diOR(i)R0 \u2212 (1\u2212 di)OS(i)S0]+ 1NN\u2211i=1\u03b2idi \u22121NN\u2211i=1\u03b1i(di \u2212 1), (C.10)where \u00b5, \u03b2i\/N , and \u03b1i\/N are Lagrange multipliers. The Lagrange multipliers \u03b2i\/Nand \u03b1i\/N have to satisfy (B.10).Di\u001berentiating L with respet to di and setting the result to zero leads to(1\u2212 \u00b5)OR(i)R0 \u2212 \u00b5OS(i)S0 + \u03b2i \u2212 \u03b1i = 0. (C.11)If we assume that 0 < di < 1, i.e., di is not at the boundary, then \u03b2i = \u03b1i = 0 holds,181Appendix C. Proofs for Chapter 4and from (C.11) we obtain that the following must hold(1\u2212 \u00b5)OR(i)R0 \u2212 \u00b5OS(i)S0 = 0. (C.12)However, sine OR(i) and OR(i) are independent random variables, (C.12) annothold for all i. Therefore, di has to be at the boundary, i.e., di \u2208 {0, 1}. Now,assuming di = 0 leads \u03b2i \u2265 0 and \u03b1i = 0, whih simpli\u001ces (C.11) todi = 0 \u21d2 \u03b2i = \u00b5OS(i)S0 \u2212 (1\u2212 \u00b5)OR(i)R0 \u2265 0. (C.13)Whereas, assuming di = 1 leads \u03b2i = 0 and \u03b1i \u2265 0, whih simpli\u001ces (C.11) todi = 1 \u21d2 \u03b1i = (1\u2212 \u00b5)OR(i)R0 \u2212 \u00b5OS(i)S0 \u2265 0. (C.14)respetively. (C.13) and (C.14) an be written equivalently asdi =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f31 if (1\u2212 \u00b5)OR(i)R0 \u2265 \u00b5OS(i)S00 if (1\u2212 \u00b5)OR(i)R0 \u2264 \u00b5OS(i)S0.(C.15)Furthermore, 0 \u2264 \u00b5 \u2264 1 has to hold sine for \u00b5 < 0 and \u00b5 > 1 we have alwaysdi = 1 and di = 0, respetively, irrespetive of any non-negative values of OS(i)S0and OR(i)R0. In this ase, sine OS(i) and OR(i) are disrete random variables, whihtake the values zero or one, the probability of (1\u2212\u00b5)OR(i)R0 = \u00b5OS(i)S0 happeningis non-zero, and therefore this event has to be analyzed. This is done in the following.First, we onsider the ase 0 < \u00b5 < 1. The boundary values \u00b5 = 0 and \u00b5 = 1 willbe investigated later. From (C.15), for 0 < \u00b5 < 1, we have four possibilities:1. If OR(i) = 1 and OS(i) = 0, then di = 1.182Appendix C. Proofs for Chapter 42. If OR(i) = 0 and OS(i) = 1, then di = 0.3. If OR(i) = 0 and OS(i) = 0, then di an be hosen to be either di = 0 or di = 1and the hoie does not in\u001duene the throughput as both the soure and therelay remain silent.4. If OR(i) = 1 and OS(i) = 1 and \u00b5 is hosen suh that 0 < \u00b5 < R0\/(S0+R0) thendi = 1 in all time slots with OR(i) = 1 and OS(i) = 1, and as a result, onditionC1 annot be satis\u001ced. Similarly, if \u00b5 is hosen suh that R0\/(S0+R0) < \u00b5 < 1,then di = 0 in all time slots with OR(i) = 1 and OS(i) = 1, and as a resultondition C1 an also not be satis\u001ced. Thus, we onlude that \u00b5 must be setto \u00b5 = R0\/(S0 +R0) sine only in this ase an di be hosen to be either di = 0or di = 1, whih is neessary for satisfying ondition C1. Sine for OR(i) = 1and OS(i) = 1 neither link is in outage, di an be hosen to be either zero orone, as long as ondition C1 is satis\u001ced. In order to satisfy C1, we propose to\u001dip a oin and the outome of the oin toss deides whether di = 1 or di = 0.Let the oin have two outomes C \u2208 {0, 1} with probabilities Pr{C = 0} andPr{C = 1}. We set di = 0 if C = 0 and di = 1 if C = 1. Thus, the probabilitiesPr{C = 0} and Pr{C = 1} have to be hosen suh that C1 is satis\u001ced.Choosing the link seletion variable as in (4.35) and exploiting the independene ofs(i) and r(i), ondition C1 results inS0 [(1\u2212 PS)PR + (1\u2212 PS)(1\u2212 PR)Pr{C = 0}]= R0 [(1\u2212 PR)PS + (1\u2212 PS)(1\u2212 PR)Pr{C = 1}] . (C.16)From (C.16), we an obtain the probabilities Pr{C = 0} and Pr{C = 1}, whih aftersome basi algebrai manipulations leads to (4.36). The throughput is given by the183Appendix C. Proofs for Chapter 4right (or left) hand side of (C.16), whih leads to (4.37).For (4.36) to be valid, Pr{C = 0} and Pr{C = 1} have to meet 0 \u2264 Pr{C = 0} \u2264 1and 0 \u2264 Pr{C = 1} \u2264 1, whih leads to the onditionsS0(1\u2212 PS)\u2212 (1\u2212 PR)PSR0 \u2265 0 (C.17)R0(1\u2212 PR)\u2212 (1\u2212 PS)PRS0 \u2265 0. (C.18)Solving (C.17) and (C.18), we obtain that for the link seletion variable di given in(4.35) to be valid, ondition (4.34) has to be ful\u001clled.Next, we onsider the ase where \u00b5 = 0. Inserting \u00b5 = 0 in (C.15), we obtainthree possible ases:1. If OR(i) = 1, then di = 1.2. If OR(i) = 0 and OS(i) = 0, then di an be hosen to be either di = 0 or di = 1and the hoie has no in\u001duene on the throughput.3. If OR(i) = 0 and OS(i) = 1, then di an be hosen to be either di = 0 or di = 1as long as ondition C1 is satis\u001ced. Similar to before, in order to satisfy C1,we propose to \u001dip a oin and the outome of the oin \u001dip determines whetherdi = 1 or di = 0.Choosing the link seletion variable as in (4.39) and exploiting the independene ofs(i) and r(i), ondition C1 an be rewritten asS0PR(1\u2212 PS)Pr{C = 0} = R0(1\u2212 PR). (C.19)After basi manipulations (C.19) simpli\u001ces to (4.40). The throughput is given by theright (or left) hand side of (C.19) and an be simpli\u001ced to (4.41). Imposing again the184Appendix C. Proofs for Chapter 4onditions 0 \u2264 Pr{C = 0} \u2264 1 and 0 \u2264 Pr{C = 1} \u2264 1, we \u001cnd that for \u00b5 = 0, (C.17)still has to hold but (C.18) an be violated, whih is equivalent to the new onditionPR >R0R0 + S0(1\u2212 PS). (C.20)For the third and \u001cnal ase, letting \u00b5 = 1 and following a similar path as for\u00b5 = 0 leads to (4.43)\u0015(4.45) and ondition (4.42).Finally, we have to prove that the three onsidered ases are mutually exlusive,i.e., for any ombination of PS and PR only one ase applies. Considering (4.34),(4.38), and (4.42) it is obvious that Cases 1 and 2 and Cases 1 and 3 are mutuallyexlusive, respetively. For Cases 2 and 3, the mutual exlusiveness is less obvious.Thus, we rewrite (4.38) and (4.42) asPR > PR,2 (C.21)andPR < PR,3, (C.22)respetively, where PR,2 = R0\/(R0 + S0(1\u2212PS)) and PR,3 = 1+ S0\/R0 \u2212 S0\/(R0PS).It an be shown that PR,2 > PR,3 for any 0 \u2264 PS < 1. Hene, for 0 \u2264 PS < 1, atmost one of (C.21) and (C.22) is satis\u001ced and Cases 2 and 3 are mutually exlusive.For PS = 1 (i.e., the S-R link is always in outage), we have PR,2 = PR,3 = 1 andCase 1 and Case 3 apply for PR = 1 and PR < 1, respetively. Therefore, for anyombination of PS and PR only one of the three ases onsidered in Theorem 4.2applies. This onludes the proof.185Appendix C. Proofs for Chapter 4C.3 Proof of Lemma 4.2We provide two di\u001berent proofs for the outage probability, Fout, in (4.52). The\u001crst proof is more straightforward and based on (4.10). However, the seond proofprovides more insight into when outages our.Proof 1: In the absene of outages, the maximum ahievable throughput, denotedby \u03c40, is given by (4.51). Thus, when (4.34) holds, Fout is obtained by inserting (4.37)and (4.51) into (4.10). Similarly, when (4.38) holds, Fout is obtained by inserting(4.41) and (4.51) into (4.10). Finally, when (4.42) holds, Fout is obtained by inserting(4.45) and (4.51) into (4.10). After basi simpli\u001cations, (4.52) is obtained. Thisonludes the proof.Proof 2: The seond proof exploits the fat that an outage ours when both thesoure and the relay are silent, i.e., when none of the links is used. When (4.34) holds,from di given by (4.35), we observe that no transmission ours only when both linksare in outage. This happens with probability Fout = PSPR. In ontrast, when (4.38)holds, from di given by (4.39), we observe that no node transmits when both links arein outage or when the S-R link is not in outage, while the R-D link is in outage andthe oin \u001dip hooses the relay for transmission. This event happens with probabilityFout = PSPR+(1\u2212PS)PRPC , whih after inserting PC given by (4.40) leads to (4.52).Finally, when (4.42) holds, from di, given by (4.43), we see that no node transmitswhen both links are in outage or when the S-R link is in outage, while the R-D linkis not in outage and the oin \u001dip hooses the soure for transmission. This happenswith probability Fout = PSPR+PS(1\u2212PR)(1\u2212PC), whih after introduing PC givenby (4.44) leads to (4.52).186Appendix C. Proofs for Chapter 4C.4 Proof of Lemma 4.4Computing the link outages in (4.7) and (4.8) for Rayleigh fading and exploiting(4.54), we obtain (4.55) by employing \u2126S = \u03b3\u2126\u00afS and \u2126R = \u03b3\u2126\u00afR in the resultingexpression and using a Taylor series expansion for \u03b3 \u2192 \u221e. As an be seen from(4.55), the transmit SNR \u03b3 has an exponent of \u22122. Thus, the diversity order is two.Moreover, for \u2126\u00afS = \u2126\u00afR = \u2126\u00af and S0 = R0, the asymptoti expression for Fout in(4.55) simpli\u001ces toFout \u2192(2R0 \u2212 1)2\u2126\u00af2\u03b32 , as \u03b3 \u2192\u221e. (C.23)Furthermore, for S0 = R0, the asymptoti throughput in (4.53) simpli\u001ces to \u03c4 =R0\/2. Thus, letting \u03c4 = r log2(1 + \u03b3) we obtain R0 = 2r log2(1 + \u03b3). Inserting R0 =2r log2(1+\u03b3) into (C.23), the diversity-multiplexing trade-o\u001b, DM(r), is obtained asDM(r) = \u2212 lim\u03b3\u2192\u221elog2(Fout)log2(\u03b3)= \u2212 lim\u03b3\u2192\u221e2 log2(22r log2(1+\u03b3) \u2212 1)\u2212 2 log2(\u2126\u00af)\u2212 2 log2(\u03b3)log2(\u03b3)= 2\u2212 lim\u03b3\u2192\u221e2 log2((1 + \u03b3)2r \u2212 1)log2(\u03b3)= 2\u2212 4r . (C.24)This ompletes the proof.C.5 Proof of Theorem 4.3Let di be given by (4.59). Then, the following events are possible for the queue inthe bu\u001ber:1. If the bu\u001ber is empty, it stays empty with probability PS and reeives one paketwith probability 1\u2212 PS.187Appendix C. Proofs for Chapter 40 1 2 L. . . .1-PS 1-PS 1-p-q 1-p-q1-pPSP -qS p ppq q31-p-qpq41-p-qpqFigure C.1: Markov hain for the number of pakets in the queue of the bu\u001ber if thelink seletion variable di is given by (4.59).2. If the bu\u001ber ontains one paket, it stays in the same state with probabilityPSPR, sends the paket with probability PS(1\u2212PR), and reeives a new paketwith probability 1\u2212 PS.3. If the bu\u001ber ontains more than one paket but less than L pakets, it stays inthe same state with probability PSPR, reeives a new paket with probability(1\u2212 PS)PR + (1\u2212 PS)(1\u2212 PR)(1\u2212 PC), and sends one paket with probability(1\u2212 PR)PS + (1\u2212 PS)(1\u2212 PR)PC .4. If the bu\u001ber ontains L pakets, it stays in the same state with probabilityPSPR + (1 \u2212 PS)PR + (1 \u2212 PS)(1 \u2212 PR)(1 \u2212 PC), and sends one paket withprobability (1\u2212 PR)PS + (1\u2212 PS)(1\u2212 PR)PC .The events for the queue of the bu\u001ber detailed above, form a Markov hain whosestates are de\u001cned by the number of pakets in the queue. This Markov hain is shownin Fig. C.1, where the probabilities p and q are given by (4.65). Let M denote thestate transition matrix of the Markov hain and let mi,j denote the element in thei-th row and j-th olumn of M. Then, mi,j is the probability that the bu\u001ber willtransition from having i\u2212 1 pakets in its queue in the previous time slot to havingj\u22121 pakets in its queue in the following time slot. The non-zero elements of matrix188Appendix C. Proofs for Chapter 4M are given bym1,1 = PS , m1,2 = 1\u2212 PS , m2,1 = PS \u2212 q ,m2,3 = 1\u2212 PS , mL+1,L+1 = 1\u2212 pmi,i+1 = 1\u2212 p\u2212 q , mi+1,i = p , mi,i = q , for i = 1...L.(C.25)Let Pr{Q} = [Pr{Q = 0}, Pr{Q = R0}, ...,Pr{Q = LR0}] denote the steady stateprobability vetor of the onsidered Markov hain, where Pr{Q = kR0}, k = 0, . . . , L,is the probability of having k pakets in the bu\u001ber. The steady state probability vetoris obtained by solving the following system of equations\uf8f1\uf8f4\uf8f2\uf8f4\uf8f3Pr{Q}M = Pr{Q}\u2211Lk=0 Pr{Q = kR0} = 1, (C.26)whih leads to (4.64). Using (4.64) the average queue size E{Q} an be obtainedfromE{Q} = R0L\u2211k=0kPr{Q = kR0}, (C.27)whih leads to (4.66). Furthermore, the average arrival rate an be found asA = R0[(1\u2212 PS)(Pr{Q = 0}+ Pr{Q = R0})+(1\u2212 p\u2212 q)(1\u2212 Pr{Q = 0} \u2212 Pr{Q = R0} \u2212 Pr{Q = LR0})]. (C.28)Inserting the average arrival rate given by (C.28) and the average queue size givenby (4.66) into (4.57) yields the average delay in (4.67).189Appendix C. Proofs for Chapter 40 1 2 L. . . .1-PS 1-p-q 1-p-q 1-p-q1-pPSp p ppq q31-p-qpq41-p-qpqFigure C.2: Markov hain for the number of pakets in the queue of the bu\u001ber if thelink seletion variable di is given by (4.61) or (4.63).For the ase when di is given by either (4.61) or (4.63), the queue in the bu\u001berof the relay an be modeled by the Markov hain shown in Fig. C.2. If the linkseletion variable di is given by (4.61), p and q are given by (4.65), and if the linkseletion variable di is given by (4.63), p and q are given by (4.70). Following thesame proedure as before, (4.69)-(4.73) an be obtained. This ompletes the proof.C.6 Proof of Lemma 4.6Let us \u001crst assume that 2p + q \u2212 1 < 0, whih is equivalent to p < 1 \u2212 p\u2212 q. Now,sine L \u2192 \u221e, pL goes to zero faster than (1 \u2212 p \u2212 q)L. Thus, by using pL = 0 asL\u2192\u221e in (4.67) and (4.72) , we obtain in both asesE{T} = Lp \u221211\u2212 2p\u2212 q . (C.29)Thus, we onlude that if 2p + q \u2212 1 < 0, E{T} grows with L and is unlimited asL\u2192\u221e. Thus, if E{T} is to be limited as L\u2192\u221e, 2p+ q \u2212 1 > 0 has to hold.If 2p + q \u2212 1 > 0, as L \u2192 \u221e, (1 \u2212 p \u2212 q)L goes to zero faster than pL. Hene,(4.74)-(4.82) are obtained by letting (1 \u2212 p \u2212 q)L = 0, as L \u2192 \u221e, in the relevantequations in Theorem 4.3 and inserting the orresponding p and q given by (4.65)and (4.70) into the resulting expressions. This onludes the proof.190Appendix C. Proofs for Chapter 4C.7 Proof of Lemma 4.7The minimum and maximum possible delays that the onsidered bu\u001ber-aided relayingsystem an ahieve are obtained for PC = 1 and PC = 0, respetively. If di is givenby (4.59), the delay is given by (4.75). By setting PC = 1 in (4.75) we obtainthe minimum possible delay in (4.83). However, sine (4.75) is valid only when2p+ q\u2212 1 > 0, (4.83) is valid only when PR < 1\/(2\u2212PS). This ondition is obtainedby inserting PC = 1 into the expressions for p and q given by (4.65) and exploiting2p + q \u2212 1 > 0. On the other hand, in order to get the maximum delay given in(4.84), we set PC = 0 in (4.75). The derived maximum delay is valid only whenPS > 1\/(2 \u2212 PR), whih is obtained from 2p + q \u2212 1 > 0 and inserting PC = 0 intothe expressions for p and q given by (4.65).A similar approah an be used to derive the delay limits Tmin,2, Tmax,2, Tmin,3,and Tmax,3 valid for the ases when di is given by (4.61) and (4.63). This onludesthe proof.C.8 Proof of Theorem 4.4The outage probability, Fout, an be derived based on two di\u001berent approahes. The\u001crst approah is straightforward and based on (4.10). However, the seond approahprovides more insight into how and when the outages our and is based on ountingthe time slots in whih no transmissions our. In the following, we provide a proofbased on the latter approah.If di is given by (4.59) or (4.61), there are four di\u001berent ases where no nodetransmits.1. The bu\u001ber is empty and the S-R link is in outage.191Appendix C. Proofs for Chapter 42. The bu\u001ber in not empty nor full and both the S-R and R-D links are in outage.3. The bu\u001ber is full and the S-R link is not in outage while the R-D link is inoutage. In this ase, the soure is seleted for transmission but sine the bu\u001beris full, the paket is dropped.4. The bu\u001ber is full, both the S-R and R-D links are not in outage, and the soureis seleted for transmission based on the oin \u001dip. In this ase, sine the bu\u001beris full, the paket is dropped.Summing up the probabilities for eah of the above four ases, we obtain (4.87).If di is given by (4.63), an outage ours in three ases: Case 1 and Case 2 asdesribed above, and a new Case 3. In the new Case 3, the bu\u001ber is full, the S-Rlink is not in outage while the R-D link is in outage, and the soure is seleted fortransmission based on the oin \u001dip. Summing up the probabilities for eah of thethree ases, we obtain (4.88).C.9 Proof of Theorem 4.5For delay onstrained transmission with E{T} < L, the probability of dropped pak-ets Pr{Q = LR0} an be made arbitrarily small by inreasing the bu\u001ber size L. Thus,for large enough L, we an set Pr{Q = LR0} = 0 in (4.87) and (4.88).In the high SNR regime, when PS \u2192 0 and PR \u2192 0, PR < 1\/(2 \u2212 PS) andPS < 1\/(2 \u2212 PR) always hold. Using PS \u2192 0 and PR \u2192 0 in the delays spei\u001cedin Proposition 4.1, we obtain the onditions E{T} > 3 and 1 < E{T} \u2264 3 if linkseletion variable di is given by (4.59) and (4.61), respetively.We \u001crst onsider the ase E{T} > 3, where di is given by (4.59). Thus, theprobability of the bu\u001ber being empty, Pr{Q = 0}, is given by (4.74). Using PS \u2192 0192Appendix C. Proofs for Chapter 4and PR \u2192 0 in (4.74), we obtainPr{Q = 0} = PS(1\u2212 12PC). (C.30)On the other hand, using PS \u2192 0 and PR \u2192 0 in the expression for E{T} in (4.75),we obtainE{T} = 12PC \u2212 1+ 2. (C.31)Solving (C.31) for PC yieldsPC =12(1 + 1E{T} \u2212 2). (C.32)Inserting (C.32) into (C.30) we obtainPr{Q = 0} = PSE{T} \u2212 1 . (C.33)Finally, inserting (C.33) into (4.87) and setting Pr{Q = LR0} = 0, we obtain (4.91).Now, we onsider the ase 1 < E{T} \u2264 3, where di is given by (4.61). Here, theprobability of the bu\u001ber being empty, Pr{Q = 0}, is given by (4.77). For PS \u2192 0and PR \u2192 0, we obtain from (4.77)Pr{Q = 0} = 1\u2212 12Pr{C = 1} . (C.34)Furthermore, for PS \u2192 0 and PR \u2192 0, we obtain from (4.78) the asymptoti delayE{T} = 12PC \u2212 1(C.35)193Appendix C. Proofs for Chapter 4or equivalentlyPC =12(1 + 1E{T}). (C.36)Inserting (C.36) into (C.34) we obtainPr{Q = 0} = 1E{T}+ 1 . (C.37)Finally, inserting (C.37) into (4.88) and setting Pr{Q = LR0} = 0, we obtain (4.90).This onludes the proof.C.10 Proof of Theorem 4.7To solve (4.94), we \u001crst relax the binary onstraints di \u2208 {0, 1} in (4.94) to 0 \u2264 di \u2264 1,\u2200i. Thereby, we transform the original problem (4.94) into a linear programingproblem whose Lagrangian is given byL = 1NN\u2211i=1di log2(1 + r(i))\u2212 \u00b5 1NN\u2211i=1[di log2(1 + r(i))\u2212(1\u2212 di)OS(i)S0]+ 1NN\u2211i=1\u03b2idi \u22121NN\u2211i=1\u03b1i(di \u2212 1), (C.38)where \u00b5, \u03b2i\/N , and \u03b1i\/N are Lagrange multipliers. The Lagrange multipliers \u03b2i\/Nand \u03b1i\/N have to satisfy (B.10). Di\u001berentiating L with respet to di and setting theresult to zero leads to(1\u2212 \u00b5) log2(1 + r(i))\u2212 \u00b5OS(i)S0 + \u03b2i \u2212 \u03b1i = 0. (C.39)194Appendix C. Proofs for Chapter 4If we assume that 0 < di < 1, i.e., di is not at the boundary, then \u03b2i = \u03b1i = 0 holds,and from (C.39) we obtain that the following must hold(1\u2212 \u00b5) log2(1 + r(i))\u2212 \u00b5OS(i)S0 = 0. (C.40)However, sine r(i) and OR(i) are independent random variables, (C.40) annot holdfor all i. Therefore, di has to be at the boundary, i.e., di \u2208 {0, 1}. Now, assumingdi = 0 leads \u03b2i \u2265 0 and \u03b1i = 0, whih simpli\u001ces (C.39) todi = 0 \u21d2 \u03b2i = \u00b5OS(i)S0 \u2212 (1\u2212 \u00b5) log2(1 + r(i))\u2265 0. (C.41)Whereas, assuming di = 1 leads \u03b2i = 0 and \u03b1i \u2265 0, whih simpli\u001ces (C.39) todi = 0 \u21d2 \u03b1i = \u2212\u00b5OS(i)S0 + (1\u2212 \u00b5) log2(1 + r(i))\u2265 0. (C.42)Relations (C.41) and (C.42), an be written equivalently asdi =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f31 if (1\u2212 \u00b5) log2(1 + r(i))\u2265 \u00b5OS(i)S00 if (1\u2212 \u00b5) log2(1 + r(i))\u2264 \u00b5OS(i)S0,(C.43)Sine for \u00b5 < 0 and \u00b5 > 1, we have always di = 1 and di = 0, respetively, irrespetiveof the (non-negative) values of log2(1 + r(i))and OS(i)S0, 0 \u2264 \u00b5 \u2264 1 has to hold.Let us \u001crst onsider the ase 0 < \u00b5 < 1 and investigate the boundary values \u00b5 = 0and \u00b5 = 1 later. For 0 < \u00b5 < 1, (C.43) an be written in the form of (4.96) aftersetting \u03c1 = \u00b5\/(1\u2212\u00b5), where \u03c1 is hosen suh that onstraint C1 of problem (4.94) ismet. Denoting the PDFs of s(i) and r(i) by fs(s) and fr(r) onstraint C1 of problem(4.94) an be rewritten as in (4.97), whih is valid for \u03c1 in the range of \u03c1 = [0,\u221e).195Appendix C. Proofs for Chapter 4Thus, by setting \u03c1 = \u221e in (4.97), we obtain the entire domain over whih (4.96) isvalid, whih leads to ondition (4.95).Next, we onsider the boundary values \u00b5 = 0 and \u00b5 = 1. The boundary value\u00b5 = 0 or equivalently \u03c1 = 0 is relevant only in the trivial ase when the S-R link isnever in outage (i.e. PS = 0) and S0 = \u221e, where a trivial solution is given by d1 = 0and di = 1 for i = 2, . . . , N and N \u2192\u221e.The other boundary value, \u00b5 = 1, is invoked only when by using di as de\u001cned in(4.96), onstraint C1 annot be satis\u001ced even when \u03c1 \u2192 \u221e, whih is the ase whenondition (4.95) does not hold. Therefore, if (4.95) does not hold, we set \u00b5 = 1 in(C.43) and obtain the following ases:1. If OS(i) = 1, then di = 0.2. If OS(i) = 0, then di an be hosen arbitrarily to be either zero or one as longas onstraint C1 holds.However, the same throughput as obtained when OS(i) = 0 and di is hosen suh thatonstraint C1 holds, an also be obtained by hoosing always di = 1 when OS(i) = 0resulting in (4.98). The reason behind this is as follows: Assume there is a poliy forwhih when OS(i) = 0, di is hosen suh that onstraint C1 holds. Now, we hange difrom 0 to 1 for OS(i) = 0. However, this hange does not a\u001bet the (average) amountof data entering the bu\u001ber. Thus, beause of the law of onservation of \u001dow, theaverage amount of data entering the bu\u001ber per time slot is idential to the averageamount of data leaving the bu\u001ber per time slot (the throughput), and the throughputis not a\u001beted by the hange.196Appendix C. Proofs for Chapter 4C.11 Proof of Theorem 4.8The Lagrangian of the relaxed optimization problem of (4.105) where 0 \u2264 di \u2264 1 isassumed, is given byL = 1NN\u2211i=1di log2(1 + \u03b3R(i)hR(i)) +1NN\u2211i=1\u03b2idi \u22121NN\u2211i=1\u03b1i(di \u2212 1)\u2212 \u00b5 1NN\u2211i=1[di log2(1 + \u03b3R(i)hR(i))\u2212 (1\u2212 di)OS(i)S0]\u2212 \u03bd 1NN\u2211i=1[(1\u2212 di)OS(i)\u03b3S + di\u03b3R(i)], (C.44)where \u03b2i\/N and \u03b1i\/N have to satisfy (B.10), and where the Lagrange multipliers \u00b5and \u03bd are hosen suh that C1 and C3 hold, respetively.By di\u001berentiating L with respet to \u03b3R(i) and di, and setting the results to zero,we obtain the following two equations\u2212\u03bddi +dihR(i)(1 + \u03b3R(i)hR(i)) ln(2)\u2212 \u00b5 dihR(i)(1 + \u03b3R(i)hR(i)) ln(2)= 0, (C.45)\u2212\u03b1i + \u03b2i \u2212 \u03bd(\u03b3R(i)\u2212 OS(i)\u03b3S) + (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i))\u2212 \u00b5OS(i)S0 = 0. (C.46)If we assume that 0 < di < 1, i.e., di is not at the boundary, then \u03b2i = \u03b1i = 0 holds,and from (C.46) we obtain that the following must hold\u2212\u03bd(\u03b3R(i)\u2212OS(i)\u03b3S) + (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i))\u2212 \u00b5OS(i)S0 = 0. (C.47)However, sine hR(i) and OS(i) are random, (C.47) annot hold for all i. Therefore,di has to be at the boundary, i.e., di \u2208 {0, 1}. Now, assuming di = 0 leads \u03b2i \u2265 0197Appendix C. Proofs for Chapter 4and \u03b1i = 0, whih simpli\u001ces (C.46) to\u03b2i = \u03bd(\u03b3R(i)\u2212 OS(i)\u03b3S)\u2212 (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i)) + \u00b5OS(i)S0 \u2265 0. (C.48)Whereas, assuming di = 1 leads \u03b2i = 0 and \u03b1i \u2265 0, whih simpli\u001ces (C.46) to\u03b1i = \u2212\u03bd(\u03b3R(i)\u2212 OS(i)\u03b3S) + (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i))\u2212 \u00b5OS(i)S0 \u2265 0. (C.49)From (C.48) and (C.49), we obtain the following solution for didi =\uf8f1\uf8f4\uf8f2\uf8f4\uf8f31 if (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i))\u2212 \u03bd\u03b3R(i) \u2265 \u00b5OS(i)S0 \u2212 \u03bdOS(i)\u03b3S0 if (1\u2212 \u00b5) log2(1 + \u03b3R(i)hR(i))\u2212 \u03bd\u03b3R(i) \u2264 \u00b5OS(i)S0 \u2212 \u03bdOS(i)\u03b3S.(C.50)Inserting (C.50) into (C.45) and solving with respet to \u03b3R(i), and taking into aountthat 0 < \u00b5 < 1, and \u03bd > 0, we obtain (4.108) and (4.109) after letting \u03c1 = ln(2)\u00b5\/(1\u2212\u00b5) and \u03bb = ln(2)\u03bd\/(1\u2212\u00b5), whih are hosen suh that onstraints C1 and C3 are metwith equality. Given the PDFs fhS(hS) and fhR(hR), onditions (4.93) and (4.104)an be diretly written as (4.110) and (4.111), respetively. Setting \u03c1\u2192\u221e in (4.110)and (4.111), we obtain ondition (4.106) whih is neessary for the validity of (4.98).Similar to the \u001cxed transmit power ase, the boundary value \u00b5 = 0 is trivial. Onthe other hand, for \u00b5 = 1, we obtain that di has to be set to di = 0 when OS(i) = 1and for OS(i) = 0, di an be hosen arbitrarily. Similar to the \u001cxed power ase, weset di = 1 when OS(i) = 1 in order to minimize the delay. Thus, the optimal powerand link seletion variables are given by (4.113) and (4.114), respetively, and thethroughput is given by (4.115).198Appendix C. Proofs for Chapter 4C.12 Proof of Theorem 4.9For \u03b3S = \u03b3R = \u03b3 \u2192 \u221e, the protool in Proposition 4.3 is optimal in the sensethat it maximizes the throughput while satisfying the average delay onstraint. Inpartiular, for high SNR in the S-R link, the probability that the link is in outageapproahes zero and the relay reeives S0 bits per soure transmission. On the otherhand, the number of bits transmitted by the relay in one time slot over the R-Dlink inreases with the SNR. Thus, for su\u001eiently high SNR, the soure transmitskS0 bits in k time slots and the relay needs just p = 1 time slot to forward theentire information to the destination. Hene, every transmission period omprisesk + p = k + 1 time slots, where the queue length at the relay inreases from S0 tokS0 in the \u001crst k time slots and is redued to zero in the (k+ 1)th time slot. Hene,the average queue length, E{Q}, an be written asE{Q} \u2192 1k + 1(1 + 2 + ... + k + 0)S0 =1k + 1k(k + 1)2 S0= k2S0, as \u03b3 \u2192\u221e . (C.51)On the other hand, the arrival rate is idential to the throughput and given by (4.121),and for high SNR it onverges toA = \u03c4 \u2192 S0kk + 1 , as \u03b3 \u2192\u221e . (C.52)Combining (4.57), (C.51), and (C.52) the average delay is found asE{T} \u2192 k + 12 , as \u03b3 \u2192\u221e . (C.53)199Appendix C. Proofs for Chapter 4Finally, ombining (C.52) and (C.53) the throughput an be expressed as (4.122),and the multiplexing gain in (4.123) follows diretly.200Appendix DOther ContributionsI have also o-authored other researh works whih have been published or submittedfor publiation during my time as a Ph.D. student at UBC. In partiular, the followingpapers have been published or submitted for publiation.Journal Papers:\u2022 N. Zlatanov, V. Jamali, and R. Shober, \u0010Ahievable Rates for the Fading Half-Duplex Single Relay Seletion Network Using Bu\u001ber-Aided Relaying,\u0011 Aeptedto IEEE Transations on Wireless Communiations, 2015.\u2022 V. Jamali, N. Zlatanov, H. Shoukry, and R. Shober, \u0010Ahievable Rate of theHalf-Duplex Multi-Hop Bu\u001ber-Aided Relay Channel with Blok Fading,\u0011 A-epted to IEEE Transations on Wireless Communiations, 2015.\u2022 V. Jamali, N. Zlatanov, and R. Shober, \u0010Bu\u001ber-Aided Bidiretional RelayNetworks with Fixed Rate Transmission \u0015 Part I: Delay-Unonstrained Case,\u0011IEEE Transations on Wireless Communiations, vol. 14, no. 3, pp. 1323 -1338, Mar. 2015.\u2022 V. Jamali, N. Zlatanov, and R. Shober, \u0010Bidiretional Bu\u001ber-Aided RelayNetworks with Fixed Rate Transmission \u0015 Part II: Delay-Constrained Case,\u0011IEEE Transations on Wireless Communiations, vol. 14, no. 3, pp. 1339 -1355, Mar. 2015.201Appendix D. Other Contributions\u2022 Z. Hadzi-Velkov, N. Zlatanov, and R. Shober, \u0010Multiple-aess Fading Channelwith Wireless Power Transfer and Energy Harvesting,\u0011 IEEE CommuniationsLetters, vol. 52, no. 4, pp. 1863 - 1866, Sep. 2014.\u2022 V. Jamali, N. Zlatanov, A. Ikhlef, and R. Shober, \u0010Ahievable Rate Regionof the Bidiretional Bu\u001ber-Aided Relay Channel with Blok Fading,\u0011 IEEETransations on Information Theory, vol. 60, no. 11, pp. 7090 - 7111, Sep.2014.\u2022 N. Zlatanov, A. Ikhlef, T. Islam, and R. Shober, \u0010Bu\u001ber-Aided CooperativeCommuniations: Opportunities and Challenges,\u0011 IEEE Communiations Mag-azine, Vol. 52, no. 4, Apr. 2014.\u2022 N. Zlatanov and R. Shober, \u0010Bu\u001ber-Aided Half-Duplex Relaying Can Outper-form Ideal Full-Duplex Relaying,\u0011 IEEE Communiations Letters, vol. 17, no.3, pp. 479-482, Mar. 2013.\u2022 N. Zlatanov, R. Shober, and Z. Hadzi-Velkov, \u0010Asymptotially Optimal PowerAlloation for Energy Harvesting Communiation Networks,\u0011 Submitted forpubliation.Conferene Papers:\u2022 W. Wike, N. Zlatanov, V. Jamali, and R. Shober, \u0010Bu\u001ber-Aided Relayingwith Disrete Transmission Rates,\u0011 Pro. of IEEE 14th Canadian Workshopon Information Theory (CWIT), St. John's, NL, Canada, July 2015.\u2022 R. Simoni, V. Jamali, N. Zlatanov, R. Shober, L. Pierui, and R. Fantai,\u0010Bu\u001ber-Aided Diamond Relay Network with Blok Fading,\u0011 Pro. of IEEEInternational Conferene on Communiations (ICC), London, UK, June 2015.202Appendix D. Other Contributions\u2022 N. Zlatanov, V. Jamali, and R. Shober, \u0010Ahievable Rates for the Fading Half-Duplex Single Relay Seletion Network Using Bu\u001ber-Aided Relaying,\u0011 Pro. ofIEEE Globeom 2014, Austin, TX, De. 2014\u2022 V. Jamali, N. Zlatanov, and R. Shober, \u0010A Delay-Constrained Protool withAdaptive Mode Seletion for Bidiretional Relay Networks,\u0011 Pro. of IEEEGlobeom 2014, Austin, TX, De. 2014\u2022 H. Shoukry, N. Zlatanov, V. Jamali, and R. Shober, \u0010Ahievable Rates for theFading Three-Hop Half-Duplex Relay Network using Bu\u001ber-Aided Relaying,\u0011Pro. of IEEE Globeom 2014, Austin, TX, De. 2014\u2022 V. Jamali, N. Zlatanov, and R. Shober, \u0010Adaptive Mode Seletion for Bidire-tional Relay Networks - Fixed Rate Transmission,\u0011 Pro. of IEEE InternationalConferene on Communiations (ICC), Sydney, Australia, June 2014.\u2022 N. Zlatanov, Z. Hadzi-Velkov, and R. Shober, \u0010Asymptotially Optimal PowerAlloation for Point-to-Point Energy Harvesting Communiation Systems,\u0011 Pro.of IEEE Globeom 2013, Atlanta, GA, De. 2013.\u2022 V. Jamali, N. Zlatanov, A. Ikhlef, and R. Shober, \u0010Adaptive Mode Seletion inBidiretional Bu\u001ber-aided Relay Networks with Fixed Transmit Powers,\u0011 Pro.of IEEE Globeom 2013, Atlanta, GA, De. 2013.\u2022 Z. Hadzi-Velkov, N. Zlatanov, and R. Shober, \u0010Optimal Power Control forAnalog Bidiretional Relaying with Long-Term Relay Power Constraint,\u0011 Pro.of IEEE Globeom 2013, Atlanta, GA, De. 2013.\u2022 V. Jamali, N. Zlatanov, A. Ikhlef, and R. Shober, \u0010Adaptive Mode Seletion inBidiretional Bu\u001ber-aided Relay Networks with Fixed Transmit Powers,\u0011 Pro.203Appendix D. Other Contributionsof EUSIPCO, Marrakeh, Maroo, Sep. 2013.\u2022 Z. Hadzi-Velkov, N. Zlatanov, and R. Shober, \u0010Optimal Power Alloation forThree-phase Bidiretional DF Relaying with Fixed Rates,\u0011 Pro. of ISWCS2013, Ilmenau, Germany, Aug. 2013.\u2022 N. Zlatanov, R. Shober, and L. Lampe, \u0010Bu\u001ber-Aided Relaying in a Three NodeNetwork,\u0011 Pro. of IEEE International Symposium on Information Theory(ISIT 2012), Cambridge, MA, July 2012.\u2022 N. Zlatanov, Z. Hadzi-Velkov, G. K. Karagiannidis, and R. Shober, \u0010OutageRate and Outage Duration of Deode-and-Forward Cooperative Diversity Sys-tems,\u0011 Pro. of IEEE International Conferene on Communiations (ICC),Kyoto, Japan, June 2011.\u2022 N. Zlatanov, R. Shober, G. K. Karagiannidis, and Z. Hadzi-Velkov, \u0010Aver-age Outage and Non-Outage Duration of Seletive Deode-and-Forward Relay-ing,\u0011 Pro. of IEEE 12th Canadian Workshop on Information Theory (CWIT),Kelowna, Canada, May 2011.204","type":"literal","lang":"en"}],"http:\/\/www.europeana.eu\/schemas\/edm\/hasType":[{"value":"Thesis\/Dissertation","type":"literal","lang":"en"}],"http:\/\/vivoweb.org\/ontology\/core#dateIssued":[{"value":"2015-09","type":"literal","lang":"en"}],"http:\/\/www.europeana.eu\/schemas\/edm\/isShownAt":[{"value":"10.14288\/1.0166356","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/language":[{"value":"eng","type":"literal","lang":"en"}],"https:\/\/open.library.ubc.ca\/terms#degreeDiscipline":[{"value":"Electrical and Computer Engineering","type":"literal","lang":"en"}],"http:\/\/www.europeana.eu\/schemas\/edm\/provider":[{"value":"Vancouver : University of British Columbia Library","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/publisher":[{"value":"University of British Columbia","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/rights":[{"value":"Attribution-NonCommercial-NoDerivs 2.5 Canada","type":"literal","lang":"en"}],"https:\/\/open.library.ubc.ca\/terms#rightsURI":[{"value":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/2.5\/ca\/","type":"literal","lang":"en"}],"https:\/\/open.library.ubc.ca\/terms#scholarLevel":[{"value":"Graduate","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/title":[{"value":"Novel protocols for the two-hop half-duplex relay network","type":"literal","lang":"en"}],"http:\/\/purl.org\/dc\/terms\/type":[{"value":"Text","type":"literal","lang":"en"}],"https:\/\/open.library.ubc.ca\/terms#identifierURI":[{"value":"http:\/\/hdl.handle.net\/2429\/54010","type":"literal","lang":"en"}]}}