<?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-22T10:08:34Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3961" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3961</identifier><datestamp>2017-03-21T21:26:23Z</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="5e71f216-b34e-4482-b569-3bc75d7ca337" confidence="600">Wang, Suhuan</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-09-09T15:55:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-09-09T15:55:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-09-09T15:55:40Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2008-08-18</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3961</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">This thesis explores the optimal node placement for linear Gaussian multiple relay&#xd;
networks of an arbitrary size and with one source-destination pair. Consider&#xd;
the the&#xd;
low attenuation regime (path loss exponent  less than 3/2). Under the condition that the&#xd;
minimum achievable rate from source to destination is maintained, we derive upper&#xd;
bounds of node placement with the incoherent and coherent coding schemes, and examine&#xd;
the optimal power assignment related to the node placement with the coherent&#xd;
coding scheme. We prove that the farthest distance between two adjacent nodes is&#xd;
bounded even for an infinite total number of relay nodes, and closed-form formulas&#xd;
of the bounds are derived for both the coding schemes. Furthermore, the distance&#xd;
from the source to the destination is of the same order as the total number of nodes,&#xd;
given the path loss exponent greater than one half under the incoherent coding scheme and the path loss exponent greater than 1&#xd;
with coherent relaying with interference subtraction coding scheme. Conditioned on&#xd;
a conjecture based on the simulation results, we also provide heuristic upper bounds,&#xd;
which are a little tighter than the strictly proved bounds. The bounds provided in&#xd;
this thesis can serve as a helpful guideline for the relay extension problem in practical&#xd;
network implementation.</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">wireless networks</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">multiple relay networks</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">Optimal Node Placement in Wireless Multiple Relay Networks</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Master 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">Master of Applied Science</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>