<?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-22T18:49:15Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/3825" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/3825</identifier><datestamp>2017-03-21T15:56:24Z</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="57754ea1-08f4-4611-8558-213cb4d3289c" confidence="600">Ghaderi Dehkordi, Javad</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2008-07-24T20:16:43Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2008-07-24T20:16:43Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2008-07-24T20:16:43Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2008-07-15</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/3825</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">How much information can be transferred over a wireless network&#xd;
and what is the optimal strategy for the operation of such&#xd;
network? This thesis tries to answer some of these questions from&#xd;
an information theoretic approach.&#xd;
&#xd;
A model of wireless network is formulated to capture the main&#xd;
features of the wireless medium as well as topology of the&#xd;
network. The performance metrics are throughput and transport&#xd;
capacity. The throughput is the summation of all reliable&#xd;
communication rates for all source-destination pairs in the&#xd;
network. The transport capacity is a sum rate where each rate is&#xd;
weighted by the distance over which it is transported. Based on&#xd;
the network model, we study the scaling laws for the performance&#xd;
measures as the number of users in the network grows.&#xd;
&#xd;
First, we analyze the performance of multihop wireless network&#xd;
under different criteria for successful reception of packets at&#xd;
the receiver. Then, we consider the problem of information&#xd;
transfer without arbitrary assumptions on the operation of the&#xd;
network. We observe that there is a dichotomy between the cases of&#xd;
relatively high signal attenuation and low attenuation. Moreover,&#xd;
a fundamental relationship between the performance metrics and the&#xd;
total transmitted power of users is discovered. As a result, the&#xd;
optimality of multihop is demonstrated for some scenarios in high&#xd;
attenuation regime, and better strategies than multihop are&#xd;
proposed for the operation in the low attenuation regime. Then, we&#xd;
study the performance of a special class of networks, random&#xd;
networks, where the traffic is uniformly distributed inside the&#xd;
networks. For this special class, the upperbounds on the&#xd;
throughput are presented for both low and high attenuation cases.&#xd;
To achieve the presented upperbounds, a hierarchical cooperation&#xd;
scheme is analyzed and optimized by choosing the number of&#xd;
hierarchical stages and the corresponding cluster sizes that&#xd;
maximize the total throughput. In addition, to apply the&#xd;
hierarchical cooperation scheme to random networks, a clustering&#xd;
algorithm is developed, which divides the whole network into&#xd;
quadrilateral clusters, each with exactly the number of nodes&#xd;
required.</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">Scaling</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Capacity</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Hierarchical</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Transport</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">Capacity Scaling and Optimal Operation of Wireless 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>