13,561 research outputs found
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints
We introduce a new structure for a set of points in the plane and an angle
, which is similar in flavor to a bounded-degree MST. We name this
structure -MST. Let be a set of points in the plane and let be an angle. An -ST of is a spanning tree of the
complete Euclidean graph induced by , with the additional property that for
each point , the smallest angle around containing all the edges
adjacent to is at most . An -MST of is then an
-ST of of minimum weight. For , an -ST does
not always exist, and, for , it always exists. In this paper,
we study the problem of computing an -MST for several common values of
.
Motivated by wireless networks, we formulate the problem in terms of
directional antennas. With each point , we associate a wedge of
angle and apex . The goal is to assign an orientation and a radius
to each wedge , such that the resulting graph is connected and its
MST is an -MST. (We draw an edge between and if , , and .) Unsurprisingly, the problem of computing an
-MST is NP-hard, at least for and . We
present constant-factor approximation algorithms for .
One of our major results is a surprising theorem for ,
which, besides being interesting from a geometric point of view, has important
applications. For example, the theorem guarantees that given any set of
points in the plane and any partitioning of the points into triplets,
one can orient the wedges of each triplet {\em independently}, such that the
graph induced by is connected. We apply the theorem to the {\em antenna
conversion} problem
Modelling Aspects of Planar Multi-Mode Antennas for Direction-of-Arrival Estimation
Multi-mode antennas are an alternative to classical antenna arrays, and hence
a promising emerging sensor technology for a vast variety of applications in
the areas of array signal processing and digital communications. An unsolved
problem is to describe the radiation pattern of multi-mode antennas in closed
analytic form based on calibration measurements or on electromagnetic field
(EMF) simulation data. As a solution, we investigate two modeling methods: One
is based on the array interpolation technique (AIT), the other one on wavefield
modeling (WM). Both methods are able to accurately interpolate quantized EMF
data of a given multi-mode antenna, in our case a planar four-port antenna
developed for the 6-8.5 GHz range. Since the modeling methods inherently depend
on parameter sets, we investigate the influence of the parameter choice on the
accuracy of both models. Furthermore, we evaluate the impact of modeling errors
for coherent maximum-likelihood direction-of-arrival (DoA) estimation given
different model parameters. Numerical results are presented for a single
polarization component. Simulations reveal that the estimation bias introduced
by model errors is subject to the chosen model parameters. Finally, we provide
optimized sets of AIT and WM parameters for the multi-mode antenna under
investigation. With these parameter sets, EMF data samples can be reproduced in
interpolated form with high angular resolution
Robust Near-Field 3D Localization of an Unaligned Single-Coil Agent Using Unobtrusive Anchors
The magnetic near-field provides a suitable means for indoor localization,
due to its insensitivity to the environment and strong spatial gradients. We
consider indoor localization setups consisting of flat coils, allowing for
convenient integration of the agent coil into a mobile device (e.g., a smart
phone or wristband) and flush mounting of the anchor coils to walls. In order
to study such setups systematically, we first express the Cram\'er-Rao lower
bound (CRLB) on the position error for unknown orientation and evaluate its
distribution within a square room of variable size, using 15 x 10cm anchor
coils and a commercial NFC antenna at the agent. Thereby, we find cm-accuracy
being achievable in a room of 10 x 10 x 3 meters with 12 flat wall-mounted
anchors and with 10mW used for the generation of magnetic fields. Practically
achieving such estimation performance is, however, difficult because of the
non-convex 5D likelihood function. To that end, we propose a fast and accurate
weighted least squares (WLS) algorithm which is insensitive to initialization.
This is enabled by effectively eliminating the orientation nuisance parameter
in a rigorous fashion and scaling the individual anchor observations, leading
to a smoothed 3D cost function. Using WLS estimates to initialize a
maximum-likelihood (ML) solver yields accuracy near the theoretical limit in up
to 98% of cases, thus enabling robust indoor localization with unobtrusive
infrastructure, with a computational efficiency suitable for real-time
processing.Comment: 7 pages, to be presented at IEEE PIMRC 201
Optimal fault-tolerant placement of relay nodes in a mission critical wireless network
The operations of many critical infrastructures (e.g., airports) heavily depend on proper functioning of the radio communication network supporting operations. As a result, such a communication network is indeed a mission-critical communication network that needs adequate protection from external electromagnetic interferences. This is usually done through radiogoniometers. Basically, by using at least three suitably deployed radiogoniometers and a gateway gathering information from them, sources of electromagnetic emissions that are not supposed to be present in the monitored area can be localised. Typically, relay nodes are used to connect radiogoniometers to the gateway. As a result, some degree of fault-tolerance for the network of relay nodes is essential in order to offer a reliable monitoring. On the other hand, deployment of relay nodes is typically quite expensive. As a result, we have two conflicting requirements: minimise costs while guaranteeing a given fault-tolerance. In this paper address the problem of computing a deployment for relay nodes that minimises the relay node network cost while at the same time guaranteeing proper working of the network even when some of the relay nodes (up to a given maximum number) become faulty (fault-tolerance). We show that the above problem can be formulated as a Mixed Integer Linear Programming (MILP) as well as a Pseudo-Boolean Satisfiability (PB-SAT) optimisation problem and present experimental results com- paring the two approaches on realistic scenarios
Fast Cell Discovery in mm-wave 5G Networks with Context Information
The exploitation of mm-wave bands is one of the key-enabler for 5G mobile
radio networks. However, the introduction of mm-wave technologies in cellular
networks is not straightforward due to harsh propagation conditions that limit
the mm-wave access availability. Mm-wave technologies require high-gain antenna
systems to compensate for high path loss and limited power. As a consequence,
directional transmissions must be used for cell discovery and synchronization
processes: this can lead to a non-negligible access delay caused by the
exploration of the cell area with multiple transmissions along different
directions.
The integration of mm-wave technologies and conventional wireless access
networks with the objective of speeding up the cell search process requires new
5G network architectural solutions. Such architectures introduce a functional
split between C-plane and U-plane, thereby guaranteeing the availability of a
reliable signaling channel through conventional wireless technologies that
provides the opportunity to collect useful context information from the network
edge.
In this article, we leverage the context information related to user
positions to improve the directional cell discovery process. We investigate
fundamental trade-offs of this process and the effects of the context
information accuracy on the overall system performance. We also cope with
obstacle obstructions in the cell area and propose an approach based on a
geo-located context database where information gathered over time is stored to
guide future searches. Analytic models and numerical results are provided to
validate proposed strategies.Comment: 14 pages, submitted to IEEE Transaction on Mobile Computin
A Sensitivity and Array-Configuration Study for Measuring the Power Spectrum of 21cm Emission from Reionization
Telescopes aiming to measure 21cm emission from the Epoch of Reionization
must toe a careful line, balancing the need for raw sensitivity against the
stringent calibration requirements for removing bright foregrounds. It is
unclear what the optimal design is for achieving both of these goals. Via a
pedagogical derivation of an interferometer's response to the power spectrum of
21cm reionization fluctuations, we show that even under optimistic scenarios,
first-generation arrays will yield low-SNR detections, and that different
compact array configurations can substantially alter sensitivity. We explore
the sensitivity gains of array configurations that yield high redundancy in the
uv-plane -- configurations that have been largely ignored since the advent of
self-calibration for high-dynamic-range imaging. We first introduce a
mathematical framework to generate optimal minimum-redundancy configurations
for imaging. We contrast the sensitivity of such configurations with
high-redundancy configurations, finding that high-redundancy configurations can
improve power-spectrum sensitivity by more than an order of magnitude. We
explore how high-redundancy array configurations can be tuned to various
angular scales, enabling array sensitivity to be directed away from regions of
the uv-plane (such as the origin) where foregrounds are brighter and where
instrumental systematics are more problematic. We demonstrate that a
132-antenna deployment of the Precision Array for Probing the Epoch of
Reionization (PAPER) observing for 120 days in a high-redundancy configuration
will, under ideal conditions, have the requisite sensitivity to detect the
power spectrum of the 21cm signal from reionization at a 3\sigma level at
k<0.25h Mpc^{-1} in a bin of \Delta ln k=1. We discuss the tradeoffs of low-
versus high-redundancy configurations.Comment: 34 pages, 5 figures, 2 appendices. Version accepted to Ap
- …