<?xml version="1.0" encoding="UTF-8"?><?xml-stylesheet type="text/xsl" href="static/style.xsl"?><OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd"><responseDate>2026-11-22T21:07:50Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5473" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5473</identifier><datestamp>2017-03-21T17:01:46Z</datestamp><setSpec>com_10012_9900</setSpec><setSpec>com_10012_1</setSpec><setSpec>col_10012_9908</setSpec><setSpec>col_10012_6</setSpec></header><metadata><dim:dim xmlns:dim="http://www.dspace.org/xmlns/dspace/dim" xmlns:doc="http://www.lyncode.com/xoai" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.dspace.org/xmlns/dspace/dim http://www.dspace.org/schema/dim.xsd">
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="c90a49c6-5e8b-4132-a760-91c0de29f002" confidence="600">Bagheri, Hossein</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-09-02T15:15:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-09-02T15:15:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-09-02T15:15:02Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2010</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/5473</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Enabling cooperation among nodes of a wireless network can significantly reduce the required&#xd;
transmit power as well as the induced intra-network interference. Due to the practical&#xd;
half-duplexity constraint of the cooperating nodes, they are prohibited to simultaneously&#xd;
transmit and receive data at the same time-frequency resource. The purpose of this&#xd;
dissertation is to illustrate the value of cooperation in such an environment. To understand&#xd;
how to cooperate efficiently, information theory is employed as a useful tool, which not only&#xd;
determines the fundamental limits of communication (i.e., capacity) over the considered&#xd;
network, but also provides insights into the design of a proper transmission scheme for that&#xd;
network.&#xd;
In this thesis, two simple but yet important types of wireless networks, namely Relay&#xd;
Channel, and Interference Channel are studied. In fact, these models constitute building&#xd;
blocks for larger networks. The first considered channel is a diamond-shaped relay channel&#xd;
consisting of a source, a destination, and two parallel relays. The second analyzed channel&#xd;
is an interference channel composed of two transmitter-receiver pairs with out-of-band&#xd;
transmitter cooperation, also referred to as conferencing encoders. While characterizing&#xd;
the capacity of these channels are difficult, a simpler and a more common approach is to&#xd;
find an achievable scheme for each channel that ensures a small gap from the capacity for&#xd;
all channel parameters.&#xd;
In chapter 2, the diamond relay channel is investigated in detail. Because of the half-duplex&#xd;
nature of the relays, each relay is either in transmit or receive mode, making&#xd;
four modes possible for the two-relay combination, specifically, 1) broadcast mode (both&#xd;
relays receive) 2,3) routing modes (one relay transmits, another receives) 4) multiple-access&#xd;
mode (both relays transmit). An appropriate scheduling ( i.e., timing over the modes) and&#xd;
transmission scheme based on the decode-and-forward strategy are proposed and shown&#xd;
to be able to achieve either the capacity for certain channel conditions or at most 3.6 bits below the capacity for general channel conditions. Particularly, by assuming each&#xd;
transmitter has a constant power constraint over all modes, a parameter Δ is defined,&#xd;
which captures some important features of the channel. It is proven that for Δ=0 the&#xd;
capacity of the channel can be attained by successive relaying, i.e., using modes 2 and 3&#xd;
defined above in a successive manner. This strategy may have an infinite gap from the&#xd;
capacity of the channel when Δ≠0. To achieve rates as close as 0.71 bits to the capacity,&#xd;
it is shown that the cases of Δ&amp;gt;0 and Δ&amp;lt;0 should be treated differently. Using new&#xd;
upper bounds based on the dual problem of the linear program associated with the cut-set&#xd;
bounds, it is proven that the successive relaying strategy needs to be enhanced by an&#xd;
additional broadcast mode (mode 1), or multiple access mode (mode 4), for the cases of Δ&amp;lt;0 and Δ&amp;gt;0, respectively. Furthermore, it is established that under average power&#xd;
constraints the aforementioned strategies achieve rates as close as 3.6 bits to the capacity&#xd;
of the channel.&#xd;
&#xd;
In chapter 3, a two-user Gaussian Interference Channel (GIC) is considered, in which&#xd;
encoders are connected through noiseless links with finite capacities. The setup can be&#xd;
motivated by downlink cellular systems, where base stations are connected via infrastructure&#xd;
backhaul networks. In this setting, prior to each transmission block the encoders&#xd;
communicate with each other over the cooperative links. The capacity region and the&#xd;
sum-capacity of the channel are characterized within some constant number of bits for&#xd;
some special classes of symmetric and Z interference channels. It is also established that&#xd;
properly sharing the total limited cooperation capacity between the cooperative links may&#xd;
enhance the achievable region, even when compared to the case of unidirectional transmitter&#xd;
cooperation with infinite cooperation capacity. To obtain the results, genie-aided upper&#xd;
bounds on the sum-capacity and cut-set bounds on the individual rates are compared with&#xd;
the achievable rate region. The achievable scheme enjoys a simple type of Han-Kobayashi&#xd;
signaling, together with the zero-forcing, and basic relaying techniques.</dim:field>
   <dim:field mdschema="dc" element="language" qualifier="iso" lang="en">en</dim:field>
   <dim:field mdschema="dc" element="publisher" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Relay Channel</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Interference Channel</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">channel capacity</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">information theory</dim:field>
   <dim:field mdschema="dc" element="subject" qualifier="program" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Cooperative Protocols for Relay and Interference Channels with Half-Duplex Constraint</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending" lang="en">false</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="department" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="typeOfResource" lang="en">Text</dim:field>
   <dim:field mdschema="uws" element="peerReviewStatus" lang="en">Unreviewed</dim:field>
   <dim:field mdschema="uws" element="scholarLevel" lang="en">Graduate</dim:field>
   <dim:field mdschema="others" element="access-status">open.access</dim:field>
</dim:dim>
</metadata></record></GetRecord></OAI-PMH>