39 research outputs found
Outage Probability Analysis of Dual Hop Relay Networks in Presence of Interference
Cooperative relaying improves the performance of wireless networks by forming a network of multiple independent virtual sources transmitting the same information as the source node. However, interference induced in the network reduces the performance of cooperative communications. In this work the statistical properties, the cumulative distribution function (CDF) and the probability density function (PDF) for a basic dual hop cooperative relay network with an arbitrary number of interferers over Rayleigh fading channels are derived. Two system models are considered: in the first system model, the interferers are only at the relay node; and in the second system model, interferers are both at the relay and the destination. This work is further extended to Nakagami-m faded interfering channels. Simulation results are presented on outage probability performance to verify the theoretical analysis
Network lifetime extension, power conservation and interference suppression for next generation mobile wireless networks
Two major focus research areas related to the design of the next generation multihop wireless networks are network lifetime extension and interference suppression. In this dissertation, these two issues are addressed.
In the area of interference suppression, a new family of projection multiuser detectors, based on a generalized, two-stage design is proposed. Projection multiuser detectors provide efficient protection against undesired interference of unknown power, while preserving simple design, with closed-form solution for error probabilities. It is shown that these detectors are linearly optimal, if the interference power is unknown.
In the area of network lifetime extension, a new approach to minimum energy routing for multihop wireless networks in Rayleigh fading channels is proposed. It is based on the concept of power combining, whereby two users transmit same signal to the destination user, emulating transmit diversity with two transmit antennas. Analytical framework for the evaluation of the benefits of power combining, in terms of the total transmit power reduction, is defined. Simulation results, which match closely the analytical results, indicate that significant improvements, in terms of transmit power reduction and network lifetime extension, are achievable. The messaging load, generated by the new scheme, is moderate, and can be further optimized
Diversity Combining under Interference Correlation in Wireless Networks
A theoretical framework is developed for analyzing the performance of diversity combining under interference correlation. Stochastic models for different types of diversity combining and networks are presented and used for analysis. These models consider relevant system aspects such as network density, path loss, channel fading, number of antennas, and transmitter/receiver processing. Theoretical results are derived, performance comparisons are presented, and design insights are obtained
Recommended from our members
System design issues in dense urban millimeter wave cellular networks
Upcoming deployments of cellular networks will see an increasing use of millimeter wave (mmWave) frequencies, roughly between 20-100 GHz. The goal of this dissertation is to investigate some key design issues in dense urban mmWave cellular networks by developing mathematical models that are representative of these networks.
In the first contribution, stochastic geometry (SG) is used to study the per user rate performance of multi-user MIMO (MU-MIMO) in downlink mmWave cellular network incorporating the impact of a spatially sparse blockage dependent multipath channel and hybrid precoding. Performance of MU-MIMO is then compared with single-user beamforming and spatial multiplexing in different network scenarios considering coverage, rate and power consumption tradeoffs to suggest when to use which MIMO scheme.
The second contribution reconsiders a popular received signal power model used in system capacity analysis of MIMO wireless networks employing single user beamforming. A modification is suggested to the model by introducing a correction factor. An approximate analysis is done to justify incorporating such a factor and simulations are performed to validate it's importance. Although this contribution does not study a new system design issue for mmWave cellular, it highlights a shortcoming with using the popular received signal power model to study design issues in mmWave cellular networks.
The third and fourth contributions investigate resource allocation in self-backhauled mmWave cellular networks. In order to enable affordable initial deployments of mmWave cellular, self-backhauling is envisioned as a cost-saving solution. The third contribution investigates how to divide resources between uplink and downlink for access and backhaul in self-backhauled networks with single hop wireless backhauling. The performance of dynamic time division duplexing (TDD) and integrated access-backhaul (IAB) is compared with static TDD and orthogonal access backhaul (OAB) strategies using a SG based model. The last contribution of this dissertation addresses the following key question for self-backhauled networks. What is the maximum extended coverage area that a single fiber site can support using multi-hop relaying, while still achieving a minimum target per user data rate? The problem of maximizing minimum per user rates is studied considering a series of deployments with a single fiber site and varying number of relays. Several design guidelines for multi-hop mmWave cellular networks are provided based on the analytical and empirical results.Electrical and Computer Engineerin
On the Distribution of MIMO Mutual Information: An In-Depth Painlev\'{e} Based Characterization
This paper builds upon our recent work which computed the moment generating
function of the MIMO mutual information exactly in terms of a Painlev\'{e} V
differential equation. By exploiting this key analytical tool, we provide an
in-depth characterization of the mutual information distribution for
sufficiently large (but finite) antenna numbers. In particular, we derive
systematic closed-form expansions for the high order cumulants. These results
yield considerable new insight, such as providing a technical explanation as to
why the well known Gaussian approximation is quite robust to large SNR for the
case of unequal antenna arrays, whilst it deviates strongly for equal antenna
arrays. In addition, by drawing upon our high order cumulant expansions, we
employ the Edgeworth expansion technique to propose a refined Gaussian
approximation which is shown to give a very accurate closed-form
characterization of the mutual information distribution, both around the mean
and for moderate deviations into the tails (where the Gaussian approximation
fails remarkably). For stronger deviations where the Edgeworth expansion
becomes unwieldy, we employ the saddle point method and asymptotic integration
tools to establish new analytical characterizations which are shown to be very
simple and accurate. Based on these results we also recover key well
established properties of the tail distribution, including the
diversity-multiplexing-tradeoff.Comment: Submitted to IEEE Transaction on Information Theory (under revision
Capacity and performance analysis of advanced multiple antenna communication systems
Multiple-input multiple-output (MIMO) antenna systems have been shown to be able to substantially
increase date rate and improve reliability without extra spectrum and power resources. The increasing
popularity and enormous prospect of MIMO technology calls for a better understanding of the performance
of MIMO systems operating over practical environments. Motivated by this, this thesis provides
an analytical characterization of the capacity and performance of advanced MIMO antenna systems.
First, the ergodic capacity of MIMO Nakagami-m fading channels is investigated. A unified way of
deriving ergodic capacity bounds is developed under the majorization theory framework. The key idea is
to study the ergodic capacity through the distribution of the diagonal elements of the quadratic channel
HHy which is relatively easy to handle, avoiding the need of the eigenvalue distribution of the channel
matrix which is extremely difficult to obtain. The proposed method is first applied on the conventional
point-to-point MIMO systems under Nakagami-m fading, and later extended to the more general distributed
MIMO systems.
Second, the ergodic capacity of MIMO multi-keyhole and MIMO amplify-and-forward (AF) dual-hop
systems is studied. A set of new statistical properties involving product of random complex Gaussian
matrix, i.e., probability density function (p.d.f.) of an unordered eigenvalue, p.d.f. of the maximum
eigenvalue, expected determinant and log-determinant, is derived. Based on these, analytical closedform
expressions for the ergodic capacity of the systems are obtained and the connection between the
product channels and conventional point-to-point MIMO channels is also revealed.
Finally, the effect of co-channel interference is investigated. First, the performance of optimum combining
(OC) systems operating in Rayleigh-product channels is analyzed based on novel closed-form
expression of the cumulative distribution function (c.d.f.) of the maximum eigenvalue of the resultant
channel matrix. Then, for MIMO Rician channels and MIMO Rayleigh-product channels, the ergodic capacity
at low signal-to-noise ratio (SNR) regime is studied, and the impact of various system parameters,
such as transmit and receive antenna number, Rician factor, channel mean matrix and interference-tonoise-
ratio, is examined
Analysis and Ad-hoc Networking Solutions for Cooperative Relaying Systems
Users of mobile networks are increasingly demanding higher data rates from
their service providers. To cater to this demand, various signal processing
and networking algorithms have been proposed. Amongst them the multiple
input multiple output (MIMO) scheme of wireless communications is one of
the most promising options. However, due to certain physical restrictions,
e.g., size, it is not possible for many devices to have multiple antennas
on them. Also, most of the devices currently in use are single-antenna
devices. Such devices can make use of the MIMO scheme by employing
cooperative MIMO methods. This involves nearby nodes utilizing the antennas
of each other to form virtual antenna arrays (VAAs). Nodes with limited
communication ranges can further employ multi-hopping to be able to
communicate with far away nodes. However, an ad-hoc communications scheme
with cooperative MIMO multi-hopping can be challenging to implement because
of its de-centralized nature and lack of a centralized controling entity
such as a base-station. This thesis looks at methods to alleviate the
problems faced by such networks.In the first part of this thesis, we look,
analytically, at the relaying scheme under consideration and derive closed
form expressions for certain performance measures (signal to noise ratio
(SNR), symbol error rate (SER), bit error rate (BER), and capacity) for the
co-located and cooperative multiple antenna schemes in different relaying
configurations (amplify-and-forward and decode-and-forward) and different
antenna configurations (single input single output (SISO), single input
multiple output (SIMO) and MIMO). These expressions show the importance of
reducing the number of hops in multi-hop communications to achieve a better
performance. We can also see the impact of different antenna configurations
and different transmit powers on the number of hops through these
simplified expressions.We also look at the impact of synchronization errors
on the cooperative MIMO communications scheme and derive a lower bound of
the SINR and an expression for the BER in the high SNR regime. These
expressions can help the network designers to ensure that the quality of
service (QoS) is satisfied even in the worst-case scenarios. In the second
part of the thesis we present some algorithms developed by us to help the
set-up and functioning of cluster-based ad-hoc networks that employ
cooperative relaying. We present a clustering algorithm that takes into
account the battery status of nodes in order to ensure a longer network
life-time. We also present a routing mechanism that is tailored for use in
cooperative MIMO multi-hop relaying. The benefits of both schemes are shown
through simulations.A method to handle data in ad-hoc networks using
distributed hash tables (DHTs) is also presented. Moreover, we also present
a physical layer security mechanism for multi-hop relaying. We also analyze
the physical layer security mechanism for the cooperative MIMO scheme. This
analysis shows that the cooperative MIMO scheme is more beneficial than
co-located MIMO in terms of the information theoretic limits of the
physical layer security.Nutzer mobiler Netzwerke fordern zunehmend höhere Datenraten von ihren
Dienstleistern. Um diesem Bedarf gerecht zu werden, wurden verschiedene
Signalverarbeitungsalgorithmen entwickelt. Dabei ist das "Multiple input
multiple output" (MIMO)-Verfahren für die drahtlose Kommunikation eine der
vielversprechendsten Techniken. Jedoch ist aufgrund bestimmter
physikalischer Beschränkungen, wie zum Beispiel die Baugröße, die
Verwendung von mehreren Antennen für viele Endgeräte nicht möglich. Dennoch
können solche Ein-Antennen-Geräte durch den Einsatz kooperativer
MIMO-Verfahren von den Vorteilen des MIMO-Prinzips profitieren.
Dabei schließen sich naheliegende Knoten zusammen um ein sogenanntes
virtuelles Antennen-Array zu bilden. Weiterhin können Knoten mit
beschränktem Kommunikationsbereich durch mehrere Hops mit weiter
entfernten Knoten kommunizieren. Allerdings stellt der Aufbau eines solchen
Ad-hoc-Netzwerks mit kooperativen MIMO-Fähigkeiten aufgrund der dezentralen
Natur und das Fehlen einer zentral-steuernden Einheit, wie einer
Basisstation, eine große Herausforderung dar. Diese Arbeit befasst sich mit
den Problemstellungen dieser Netzwerke und bietet verschiedene
Lösungsansätze.Im ersten Teil dieser Arbeit werden analytisch in
sich geschlossene Ausdrücke für ein kooperatives
Relaying-System bezüglicher verschiedener Metriken, wie das
Signal-Rausch-Verhältnis, die Symbolfehlerrate, die Bitfehlerrate und die
Kapazität, hergeleitet. Dabei werden die "Amplify-and forward" und
"Decode-and-forward" Relaying-Protokolle, sowie unterschiedliche
Mehrantennen-Konfigurationen, wie "Single input single output" (SISO),
"Single input multiple output" (SIMO) und MIMO betrachtet. Diese Ausdrücke
zeigen die Bedeutung der Reduzierung der Hop-Anzahl in Mehr-Hop-Systemen,
um eine höhere Leistung zu erzielen. Zudem werden die Auswirkungen
verschiedener Antennen-Konfigurationen und Sendeleistungen auf die Anzahl
der Hops analysiert. Weiterhin wird der Einfluss von
Synchronisationsfehlern auf das kooperative MIMO-Verfahren herausgestellt
und daraus eine untere Grenze für das
Signal-zu-Interferenz-und-Rausch-Verhältnis, sowie ein Ausdruck für die
Bitfehlerrate bei hohem Signal-Rausch-Verhältnis entwickelt.
Diese Zusammenhänge sollen Netzwerk-Designern helfen die Qualität des
Services auch in den Worst-Case-Szenarien sicherzustellen.
Im zweiten Teil der Arbeit werden einige innovative
Algorithmen vorgestellt, die die Einrichtung und die Funktionsweise von
Cluster-basierten Ad-hoc-Netzwerken, die kooperative Relays verwenden,
erleichtern und verbessern. Darunter befinden sich ein
Clustering-Algorithmus, der den Batteriestatus der Knoten berücksichtigt,
um eine längere Lebensdauer des Netzwerks zu gewährleisten und ein
Routing-Mechanismus, der auf den Einsatz in kooperativen MIMO
Mehr-Hop-Systemen zugeschnitten ist. Die Vorteile beider Algorithmen werden
durch Simulationen veranschaulicht.
Eine Methode, die Daten in Ad-hoc-Netzwerken mit verteilten Hash-Tabellen
behandelt wird ebenfalls vorgestellt. Darüber hinaus wird auch
ein Sicherheitsmechanismus für die physikalische Schicht in
Multi-Hop-Systemen und kooperativen MIMO-Systemen präsentiert. Eine Analyse
zeigt, dass das kooperative MIMO-Verfahren deutliche Vorteile gegenüber dem
konventionellen MIMO-Verfahren hinsichtlich der informationstheoretischen
Grenzen der Sicherheit auf der physikalischen Schicht aufweist