<?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:11:06Z</responseDate><request verb="GetRecord" identifier="oai:uwspace.uwaterloo.ca:10012/5167" metadataPrefix="dim">https://dspacemainprd01.lib.uwaterloo.ca/server/oai/request</request><GetRecord><record><header><identifier>oai:uwspace.uwaterloo.ca:10012/5167</identifier><datestamp>2017-03-21T17:30:14Z</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="e90aa4a8-d89b-46d9-a8d8-1beb5ced1376" confidence="600">Bagheri-Karam, Ghadamali</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="accessioned">2010-05-17T15:49:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="available">2010-05-17T15:49:56Z</dim:field>
   <dim:field mdschema="dc" element="date" qualifier="issued">2010-05-17T15:49:56Z</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/5167</dim:field>
   <dim:field mdschema="dc" element="description" qualifier="abstract" lang="en">The use of wireless networks has grown significantly in contemporary&#xd;
times, and continues to develop further. The broadcast nature of&#xd;
wireless communications, however, makes them particularly vulnerable&#xd;
to eavesdropping. Unlike traditional solutions, which usually handle&#xd;
security at the application layer, the primary concern of this&#xd;
dissertation is to analyze and develop solutions based on coding&#xd;
techniques at the physical-layer.&#xd;
&#xd;
First, in chapter $2$, we consider a scenario where a source node&#xd;
wishes to broadcast two confidential messages to two receivers,&#xd;
while a wire-tapper also receives the transmitted signal. This model&#xd;
is motivated by wireless communications, where individual secure&#xd;
messages are broadcast over open media and can be received by any&#xd;
illegitimate receiver. The secrecy level is measured by the&#xd;
equivocation rate at the eavesdropper. We first study the general&#xd;
(non-degraded) broadcast channel with an eavesdropper, and present&#xd;
an inner bound on the secrecy capacity region for this model. This&#xd;
inner bound is based on a combination of random binning, and the&#xd;
Gelfand-Pinsker binning. We further study the situation in which the&#xd;
channels are degraded. For the degraded broadcast channel with an&#xd;
eavesdropper, we present the secrecy capacity region. Our achievable&#xd;
coding scheme is based on Cover&amp;apos;s superposition scheme and random&#xd;
binning. We refer to this scheme as the Secret Superposition Scheme.&#xd;
Our converse proof is based on a combination of the converse proof&#xd;
of the conventional degraded broadcast channel and Csiszar Lemma. We&#xd;
then assume that the channels are Additive White Gaussian Noise and&#xd;
show that the Secret Superposition Scheme with Gaussian codebook is&#xd;
optimal. The converse proof is based on Costa&amp;apos;s entropy power&#xd;
inequality. Finally, we use a broadcast strategy for the slowly&#xd;
fading wire-tap channel when only the eavesdropper&amp;apos;s channel is&#xd;
fixed and known at the transmitter. We derive the optimum power&#xd;
allocation for the coding layers, which maximizes the total average&#xd;
rate.&#xd;
&#xd;
&#xd;
Second, in chapter $3$ , we consider the&#xd;
Multiple-Input-Multiple-Output (MIMO) scenario of a broadcast&#xd;
channel where a wiretapper also receives the transmitted signal via&#xd;
another MIMO channel. First, we assume that the channels are&#xd;
degraded and the wiretapper has the worst channel. We establish the&#xd;
capacity region of this scenario. Our achievability scheme is the&#xd;
Secret Superposition Coding. For the outerbound, we use notion of&#xd;
the enhanced channels to show that the secret superposition of&#xd;
Gaussian codes is optimal. We show that we only need to enhance the&#xd;
channels of the legitimate receivers, and the channel of the&#xd;
eavesdropper remains unchanged. We then extend the result of the&#xd;
degraded case to a non-degraded case. We show that the secret&#xd;
superposition of Gaussian codes, along with successive decoding,&#xd;
cannot work when the channels are not degraded. We develop a Secret&#xd;
Dirty Paper Coding scheme and show that it is optimal for this&#xd;
channel. We then present a corollary generalizing the capacity&#xd;
region of the two receivers case to the case of multiple receivers.&#xd;
Finally, we investigate a scenario which frequently occurs in the&#xd;
practice of wireless networks. In this scenario, the transmitter and&#xd;
the eavesdropper have multiple antennae, while both intended&#xd;
receivers have a single antenna (representing resource limited&#xd;
mobile units). We characterize the secrecy capacity region in terms&#xd;
of generalized eigenvalues of the receivers&amp;apos; channels and the&#xd;
eavesdropper&amp;apos;s channel. We refer to this configuration as the MISOME&#xd;
case. We then present a corollary generalizing the results of the&#xd;
two receivers case to multiple receivers. In the high SNR regime, we&#xd;
show that the capacity region is a convex closure of rectangular&#xd;
regions.&#xd;
&#xd;
&#xd;
Finally, in chapter $4$, we consider a $K$-user secure Gaussian&#xd;
Multiple-Access-Channel with an external eavesdropper. We establish&#xd;
an achievable rate region for the secure discrete memoryless MAC.&#xd;
Thereafter, we prove the secrecy sum capacity of the degraded&#xd;
Gaussian MIMO MAC using Gaussian codebooks. For the non-degraded&#xd;
Gaussian MIMO MAC, we propose an algorithm inspired by the&#xd;
interference alignment technique to achieve the largest possible&#xd;
total Secure-Degrees-of-Freedom . When all the terminals are&#xd;
equipped with a single antenna, Gaussian codebooks have shown to be&#xd;
inefficient in providing a positive S-DoF. Instead, we propose a&#xd;
novel secure coding scheme to achieve a positive S-DoF in the single&#xd;
antenna MAC. This scheme converts the single-antenna system into a&#xd;
multiple-dimension system with fractional dimensions. The&#xd;
achievability scheme is based on the alignment of signals into a&#xd;
small sub-space at the eavesdropper, and the simultaneous separation&#xd;
of the signals at the intended receiver. We use tools from the field&#xd;
of Diophantine Approximation in number theory to analyze the&#xd;
probability of error in the coding scheme. We prove that the total&#xd;
S-DoF of $\frac{K-1}{K}$ can be achieved for almost all channel&#xd;
gains. For the other channel gains, we propose a multi-layer coding&#xd;
scheme  to achieve a positive S-DoF. As a function of channel gains,&#xd;
therefore, the achievable S-DoF is discontinued.</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">Physical-Layer Security</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">Physical-Layer Security in Wireless Communication Systems</dim:field>
   <dim:field mdschema="dc" element="type" lang="en">Doctoral Thesis</dim:field>
   <dim:field mdschema="dc" element="comment" qualifier="hidden" lang="en">The works in this thesis are published/submitted to different IEEE confrences and journals.</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>