47,539 research outputs found
Seeing the Unobservable: Channel Learning for Wireless Communication Networks
Wireless communication networks rely heavily on channel state information
(CSI) to make informed decision for signal processing and network operations.
However, the traditional CSI acquisition methods is facing many difficulties:
pilot-aided channel training consumes a great deal of channel resources and
reduces the opportunities for energy saving, while location-aided channel
estimation suffers from inaccurate and insufficient location information. In
this paper, we propose a novel channel learning framework, which can tackle
these difficulties by inferring unobservable CSI from the observable one. We
formulate this framework theoretically and illustrate a special case in which
the learnability of the unobservable CSI can be guaranteed. Possible
applications of channel learning are then described, including cell selection
in multi-tier networks, device discovery for device-to-device (D2D)
communications, as well as end-to-end user association for load balancing. We
also propose a neuron-network-based algorithm for the cell selection problem in
multi-tier networks. The performance of this algorithm is evaluated using
geometry-based stochastic channel model (GSCM). In settings with 5 small cells,
the average cell-selection accuracy is 73% - only a 3.9% loss compared with a
location-aided algorithm which requires genuine location information.Comment: 6 pages, 4 figures, accepted by GlobeCom'1
A Survey of Positioning Systems Using Visible LED Lights
© 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.As Global Positioning System (GPS) cannot provide satisfying performance in indoor environments, indoor positioning technology, which utilizes indoor wireless signals instead of GPS signals, has grown rapidly in recent years. Meanwhile, visible light communication (VLC) using light devices such as light emitting diodes (LEDs) has been deemed to be a promising candidate in the heterogeneous wireless networks that may collaborate with radio frequencies (RF) wireless networks. In particular, light-fidelity has a great potential for deployment in future indoor environments because of its high throughput and security advantages. This paper provides a comprehensive study of a novel positioning technology based on visible white LED lights, which has attracted much attention from both academia and industry. The essential characteristics and principles of this system are deeply discussed, and relevant positioning algorithms and designs are classified and elaborated. This paper undertakes a thorough investigation into current LED-based indoor positioning systems and compares their performance through many aspects, such as test environment, accuracy, and cost. It presents indoor hybrid positioning systems among VLC and other systems (e.g., inertial sensors and RF systems). We also review and classify outdoor VLC positioning applications for the first time. Finally, this paper surveys major advances as well as open issues, challenges, and future research directions in VLC positioning systems.Peer reviewe
Efficient Algorithms for Distributed Detection of Holes and Boundaries in Wireless Networks
We propose two novel algorithms for distributed and location-free boundary
recognition in wireless sensor networks. Both approaches enable a node to
decide autonomously whether it is a boundary node, based solely on connectivity
information of a small neighborhood. This makes our algorithms highly
applicable for dynamic networks where nodes can move or become inoperative.
We compare our algorithms qualitatively and quantitatively with several
previous approaches. In extensive simulations, we consider various models and
scenarios. Although our algorithms use less information than most other
approaches, they produce significantly better results. They are very robust
against variations in node degree and do not rely on simplified assumptions of
the communication model. Moreover, they are much easier to implement on real
sensor nodes than most existing approaches.Comment: extended version of accepted submission to SEA 201
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
We consider geometric instances of the Maximum Weighted Matching Problem
(MWMP) and the Maximum Traveling Salesman Problem (MTSP) with up to 3,000,000
vertices. Making use of a geometric duality relationship between MWMP, MTSP,
and the Fermat-Weber-Problem (FWP), we develop a heuristic approach that yields
in near-linear time solutions as well as upper bounds. Using various
computational tools, we get solutions within considerably less than 1% of the
optimum.
An interesting feature of our approach is that, even though an FWP is hard to
compute in theory and Edmonds' algorithm for maximum weighted matching yields a
polynomial solution for the MWMP, the practical behavior is just the opposite,
and we can solve the FWP with high accuracy in order to find a good heuristic
solution for the MWMP.Comment: 20 pages, 14 figures, Latex, to appear in Journal of Experimental
Algorithms, 200
Massive MIMO-based Localization and Mapping Exploiting Phase Information of Multipath Components
In this paper, we present a robust multipath-based localization and mapping
framework that exploits the phases of specular multipath components (MPCs)
using a massive multiple-input multiple-output (MIMO) array at the base
station. Utilizing the phase information related to the propagation distances
of the MPCs enables the possibility of localization with extraordinary accuracy
even with limited bandwidth. The specular MPC parameters along with the
parameters of the noise and the dense multipath component (DMC) are tracked
using an extended Kalman filter (EKF), which enables to preserve the
distance-related phase changes of the MPC complex amplitudes. The DMC comprises
all non-resolvable MPCs, which occur due to finite measurement aperture. The
estimation of the DMC parameters enhances the estimation quality of the
specular MPCs and therefore also the quality of localization and mapping. The
estimated MPC propagation distances are subsequently used as input to a
distance-based localization and mapping algorithm. This algorithm does not need
prior knowledge about the surrounding environment and base station position.
The performance is demonstrated with real radio-channel measurements using an
antenna array with 128 ports at the base station side and a standard cellular
signal bandwidth of 40 MHz. The results show that high accuracy localization is
possible even with such a low bandwidth.Comment: 14 pages (two columns), 13 figures. This work has been submitted to
the IEEE Transaction on Wireless Communications for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessibl
A distributed optimization framework for localization and formation control: applications to vision-based measurements
Multiagent systems have been a major area of research for the last 15 years. This interest has been motivated by tasks that can be executed more rapidly in a collaborative manner or that are nearly impossible to carry out otherwise. To be effective, the agents need to have the notion of a common goal shared by the entire network (for instance, a desired formation) and individual control laws to realize the goal. The common goal is typically centralized, in the sense that it involves the state of all the agents at the same time. On the other hand, it is often desirable to have individual control laws that are distributed, in the sense that the desired action of an agent depends only on the measurements and states available at the node and at a small number of neighbors. This is an attractive quality because it implies an overall system that is modular and intrinsically more robust to communication delays and node failures
- …