<?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-22T20:17:36Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/10840" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/10840</identifier><datestamp>2025-03-26T23:37:02Z</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="advisor">Gebotys, Catherine</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="advisor">Damen, Oussama</dim:field>
   <dim:field mdschema="dc" element="contributor" qualifier="author" authority="97e8b926-75ea-4e34-ad48-faeca10e160e" confidence="600">Hesammohseni, Seyed Ali</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2016-09-14T20:37:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2016-09-14T20:37:11Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2016-09-14</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="submitted">2016-09-08</dim:field>
   <dim:field mdschema="dc" element="identifier" qualifier="uri">http://hdl.handle.net/10012/10840</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">Increasing demand for bandwidth intensive activities on high-penetration wireless hand-held&#xd;
personal devices, combined with their processing power and advanced radio features, has&#xd;
necessitated a new look at the problems of resource provisioning and distributed management&#xd;
of coexistence in wireless networks. Information theory, as the science of studying&#xd;
the ultimate limits of communication e ciency, plays an important role in outlining guiding&#xd;
principles in the design and analysis of such communication schemes. Network information&#xd;
theory, the branch of information theory that investigates problems of multiuser and&#xd;
distributed nature in information transmission is ideally poised to answer questions about&#xd;
the design and analysis of multiuser communication systems. In the past few years, there&#xd;
have been major advances in network information theory, in particular in the generalized&#xd;
degrees of freedom framework for asymptotic analysis and interference alignment which have&#xd;
led to constant gap to capacity results for Gaussian interference channels. Unfortunately,&#xd;
practical adoption of these results has been slowed by their reliance on unrealistic assumptions&#xd;
like perfect channel state information at the transmitter and intricate constructions&#xd;
based on alignment over transcendental dimensions of real numbers. It is therefore necessary&#xd;
to devise transmission methods and coexistence schemes that fall under the umbrella of&#xd;
existing interference management and cognitive radio toolbox and deliver close to optimal&#xd;
performance.&#xd;
In this thesis we work on the theme of designing and characterizing the performance of&#xd;
conceptually simple transmission schemes that are robust and achieve performance that is&#xd;
close to optimal. In particular, our work is broadly divided into two parts. In the  rst part,&#xd;
looking at cognitive radio networks, we seek to relax the assumption of non-causal knowledge&#xd;
of primary user&amp;apos;s message at the secondary user&amp;apos;s transmitter. We study a cognitive channel&#xd;
model based on Gaussian interference channel that does not assume anything about users&#xd;
other than primary user&amp;apos;s priority over secondary user in reaching its desired quality of&#xd;
service. We characterize this quality of service requirement as a minimum rate that the&#xd;
primary user should be able to achieve. Studying the achievable performance of simple&#xd;
encoding and decoding schemes in this scenario, we propose a few di erent simple encoding&#xd;
schemes and explore di erent decoder designs. We show that surprisingly, all these schemes&#xd;
achieve the same rate region. Next, we study the problem of rate maximization faced by&#xd;
the secondary user subject to primary&amp;apos;s QoS constraint. We show that this problem is not&#xd;
convex or smooth in general. We then use the symmetry properties of the problem to reduce&#xd;
its solution to a feasibly implementable line search. We also provide numerical results to&#xd;
demonstrate the performance of the scheme.&#xd;
Continuing on the theme of simple yet well-performing schemes for wireless networks, in&#xd;
the second part of the thesis, we direct our attention from two-user cognitive networks to&#xd;
the problem of smart interference management in large wireless networks. Here, we study&#xd;
the problem of interference-aware wireless link scheduling. Link scheduling is the problem of&#xd;
allocating a set of transmission requests into as small a set of time slots as possible such that&#xd;
all transmissions satisfy some condition of feasibility. The feasibility criterion has traditionally&#xd;
been lack of pair of links that interfere too much. This makes the problem amenable to&#xd;
solution using graph theoretical tools. Inspired by the recent results that the simple approach&#xd;
of treating interference as noise achieves maximal Generalized Degrees of Freedom (which is&#xd;
a measure that roughly captures how many equivalent single-user channels are contained in&#xd;
a given multi-user channel) and the generalization that it can attain rates within a constant&#xd;
gap of the capacity for a large class of Gaussian interference networks, we study the problem&#xd;
of scheduling links under a set Signal to Interference plus Noise Ratio (SINR) constraint.&#xd;
We show that for nodes distributed in a metric space and obeying path loss channel model, a&#xd;
re ned framework based on combining geometric and graph theoretic results can be devised&#xd;
to analyze the problem of  nding the feasible sets of transmissions for a given level of desired&#xd;
SINR. We use this general framework to give a link scheduling algorithm that is provably&#xd;
within a logarithmic factor of the best possible schedule. Numerical simulations con rm&#xd;
that this approach outperforms other recently proposed SINR-based approaches. Finally, we&#xd;
conclude by identifying open problems and possible directions for extending these results.</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">Information theory</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Cognitive radio</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Interference management</dim:field>
   <dim:field mdschema="dc" element="subject" lang="en">Link scheduling</dim:field>
   <dim:field mdschema="dc" element="title" lang="en">Practical interference management strategies in Gaussian networks</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="pending">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" qualifier="discipline" lang="en">Electrical and Computer Engineering</dim:field>
   <dim:field mdschema="uws-etd" element="degree" qualifier="grantor" lang="en">University of Waterloo</dim:field>
   <dim:field mdschema="uws-etd" element="degree" lang="en">Doctor of Philosophy</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Gebotys, Catherine</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="advisor">Damen, Oussama</dim:field>
   <dim:field mdschema="uws" element="contributor" qualifier="affiliation1" lang="en">Faculty of Engineering</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="city" lang="en">Waterloo</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="country" lang="en">Canada</dim:field>
   <dim:field mdschema="uws" element="published" qualifier="province" lang="en">Ontario</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>