1,696 research outputs found
Performance of Optimum Combining in a Poisson Field of Interferers and Rayleigh Fading Channels
This paper studies the performance of antenna array processing in distributed
multiple access networks without power control. The interference is represented
as a Poisson point process. Desired and interfering signals are subject to both
path-loss fading (with an exponent greater than 2) and to independent Rayleigh
fading. Using these assumptions, we derive the exact closed form expression for
the cumulative distribution function of the output
signal-to-interference-plus-noise ratio when optimum combining is applied. This
results in a pertinent measure of the network performance in terms of the
outage probability, which in turn provides insights into the network capacity
gain that could be achieved with antenna array processing. We present and
discuss examples of applications, as well as some numerical results.Comment: Submitted to IEEE Trans. on Wireless Communication (Jan. 2009
Maximal Ratio Transmission in Wireless Poisson Networks under Spatially Correlated Fading Channels
The downlink of a wireless network where multi-antenna base stations (BSs)
communicate with single-antenna mobile stations (MSs) using maximal ratio
transmission (MRT) is considered here. The locations of BSs are modeled by a
homogeneous Poisson point process (PPP) and the channel gains between the
multiple antennas of each BS and the single antenna of each MS are modeled as
spatially arbitrarily correlated Rayleigh random variables. We first present
novel closed-form expressions for the distribution of the power of the
interference resulting from the coexistence of one intended and one unintended
MRT over the considered correlated fading channels. The derived expressions are
then used to obtain closed-form expressions for the success probability and
area spectral efficiency of the wireless communication network under
investigation. Simulation results corroborate the validity of the presented
expressions. A key result of this work is that the effect of spatial
correlation on the network throughput may be contrasting depending on the
density of BSs, the signal-to-interference-plus-noise ratio (SINR) level, and
the background noise power.Comment: 6 pages, 6 figures, IEEE GLOBECOM 201
Non-atomic Games for Multi-User Systems
In this contribution, the performance of a multi-user system is analyzed in
the context of frequency selective fading channels. Using game theoretic tools,
a useful framework is provided in order to determine the optimal power
allocation when users know only their own channel (while perfect channel state
information is assumed at the base station). We consider the realistic case of
frequency selective channels for uplink CDMA. This scenario illustrates the
case of decentralized schemes, where limited information on the network is
available at the terminal. Various receivers are considered, namely the Matched
filter, the MMSE filter and the optimum filter. The goal of this paper is to
derive simple expressions for the non-cooperative Nash equilibrium as the
number of mobiles becomes large and the spreading length increases. To that end
two asymptotic methodologies are combined. The first is asymptotic random
matrix theory which allows us to obtain explicit expressions of the impact of
all other mobiles on any given tagged mobile. The second is the theory of
non-atomic games which computes good approximations of the Nash equilibrium as
the number of mobiles grows.Comment: 17 pages, 4 figures, submitted to IEEE JSAC Special Issue on ``Game
Theory in Communication Systems'
A Light Signalling Approach to Node Grouping for Massive MIMO IoT Networks
Massive MIMO is a promising technology to connect very large numbers of
energy constrained nodes, as it offers both extensive spatial multiplexing and
large array gain. A challenge resides in partitioning the many nodes in groups
that can communicate simultaneously such that the mutual interference is
minimized. We here propose node partitioning strategies that do not require
full channel state information, but rather are based on nodes' respective
directional channel properties. In our considered scenarios, these typically
have a time constant that is far larger than the coherence time of the channel.
We developed both an optimal and an approximation algorithm to partition users
based on directional channel properties, and evaluated them numerically. Our
results show that both algorithms, despite using only these directional channel
properties, achieve similar performance in terms of the minimum
signal-to-interference-plus-noise ratio for any user, compared with a reference
method using full channel knowledge. In particular, we demonstrate that
grouping nodes with related directional properties is to be avoided. We hence
realise a simple partitioning method requiring minimal information to be
collected from the nodes, and where this information typically remains stable
over a long term, thus promoting their autonomy and energy efficiency
- …