<?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-22T16:12:09Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/6974" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/6974</identifier><datestamp>2017-03-21T20:02:59Z</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="289e28f0-cd63-4a70-8724-63c66b0e0ac7" confidence="600">Zoghalchi, Farshid</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2012-09-01T14:39:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2012-09-01T14:39:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2012-09-01T14:39:22Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2012</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/6974</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">A network of n transmitters and n receivers is considered. We assume that transmitter&#xd;
i aims to send data to its designated destination, receiver i. Communications occur in&#xd;
a single-hop fashion and destination nodes are simple linear receivers without multi-user&#xd;
detection. Therefore, in each time slot every source node can only talk to one other&#xd;
destination node. Thus, there is a total of n communication links. An important question&#xd;
now arises. How many links can be active in such a network so that each of them supports&#xd;
a minimum rate Rmin? This dissertation is devoted to this problem and tries to solve it&#xd;
in two di erent settings, dense and extended networks. In both settings our approach is&#xd;
asymptotic, meaning, we only examine the behaviour of the network when the number&#xd;
of nodes tends to in nity. We are also interested in the events that occur asymptotically&#xd;
almost surely (a.a.s.), i.e., events that have probabilities approaching one as the size of&#xd;
the networks gets large. In the  rst part of the thesis, we consider a dense network where&#xd;
fading is the dominant factor a ecting the quality of transmissions. Rayliegh channels are&#xd;
used to model the impact of fading. It is shown that a.a.s. log(n)^2 links can simultaneously&#xd;
maintain Rmin and thus be active. In the second part, an extended network is considered&#xd;
where nodes are distant from each other and thus, a more complete model must take internode&#xd;
distances into account. We will show that in this case, almost all of the links can be&#xd;
active while maintaining the minimum rate.</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">Random Network</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Interference Channel</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Active Link</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">On the Asymptotic Number of Active Links in a Random Network</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>