186 research outputs found
A New RSSI-based Centroid Localization Algorithm by Use of Virtual Reference Tags
A good design of node location is critical for efficient
and effective wireless communications. This paper presents an
improved algorithm, in order to solve the low localization
accuracy caused by traditional centroid algorithm. The
improved algorithm combined with VIRE system and
traditional centroid algorithm. The VIRE algorithm is
introduced and the signal propagation model is utilized to
construct virtual reference tags in the location area. Simulation shows that this further developed algorithm has further improved the accuracy of positioning up to 35.12% compared
to the traditional centroid algorithm. It is concluded that this algorithm can further improve the locating accuracy in comparison with the original centroid algorithm
Fingerprinting-Based Positioning in Distributed Massive MIMO Systems
Location awareness in wireless networks may enable many applications such as
emergency services, autonomous driving and geographic routing. Although there
are many available positioning techniques, none of them is adapted to work with
massive multiple-in-multiple-out (MIMO) systems, which represent a leading 5G
technology candidate. In this paper, we discuss possible solutions for
positioning of mobile stations using a vector of signals at the base station,
equipped with many antennas distributed over deployment area. Our main proposal
is to use fingerprinting techniques based on a vector of received signal
strengths. This kind of methods are able to work in highly-cluttered multipath
environments, and require just one base station, in contrast to standard
range-based and angle-based techniques. We also provide a solution for
fingerprinting-based positioning based on Gaussian process regression, and
discuss main applications and challenges.Comment: Proc. of IEEE 82nd Vehicular Technology Conference (VTC2015-Fall
Cooperative and Distributed Localization for Wireless Sensor Networks in Multipath Environments
We consider the problem of sensor localization in a wireless network in a
multipath environment, where time and angle of arrival information are
available at each sensor. We propose a distributed algorithm based on belief
propagation, which allows sensors to cooperatively self-localize with respect
to one single anchor in a multihop network. The algorithm has low overhead and
is scalable. Simulations show that although the network is loopy, the proposed
algorithm converges, and achieves good localization accuracy
Energy-Efficient Data Acquisition in Wireless Sensor Networks through Spatial Correlation
The application of Wireless Sensor Networks (WSNs) is restrained by their often-limited lifetime. A sensor node's lifetime is fundamentally linked to the volume of data that it senses, processes and reports. Spatial correlation between sensor nodes is an inherent phenomenon to WSNs, induced by redundant nodes which report duplicated information. In this paper, we report on the design of a distributed sampling scheme referred to as the 'Virtual Sampling Scheme' (VSS). This scheme is formed from two components: an algorithm for forming virtual clusters, and a distributed sampling method. VSS primarily utilizes redundancy of sensor nodes to get only a subset to sense the environment at any one time. Sensor nodes that are not sensing the environment are in a low-power sleep state, thus conserving energy. Furthermore, VSS balances the energy consumption amongst nodes by using a round robin method
Bearing-Based Distributed Control and Estimation of Multi-Agent Systems
This paper studies the distributed control and estimation of multi-agent
systems based on bearing information. In particular, we consider two problems:
(i) the distributed control of bearing-constrained formations using relative
position measurements and (ii) the distributed localization of sensor networks
using bearing measurements. Both of the two problems are considered in
arbitrary dimensional spaces. The analyses of the two problems rely on the
recently developed bearing rigidity theory. We show that the two problems have
the same mathematical formulation and can be solved by identical protocols. The
proposed controller and estimator can globally solve the two problems without
ambiguity. The results are supported with illustrative simulations.Comment: 6 pages, to appear in the 2015 European Control Conferenc
Accurate angle-of-arrival measurement using particle swarm optimization
As one of the major methods for location positioning, angle-of-arrival (AOA) estimation is a significant technology in radar, sonar, radio astronomy, and mobile communications. AOA measurements can be exploited to locate mobile units, enhance communication efficiency and network capacity, and support location-aided routing, dynamic network management, and many location-based services. In this paper, we propose an algorithm for AOA estimation in colored noise fields and harsh application scenarios. By modeling the unknown noise covariance as a linear combination of known weighting matrices, a maximum likelihood (ML) criterion is established, and a particle swarm optimization (PSO) paradigm is designed to optimize the cost function. Simulation results demonstrate that the paired estimator PSO-ML significantly outperforms other popular techniques and produces superior AOA estimates
Large-Scale Sensor Network Localization via Rigid Subnetwork Registration
In this paper, we describe an algorithm for sensor network localization (SNL)
that proceeds by dividing the whole network into smaller subnetworks, then
localizes them in parallel using some fast and accurate algorithm, and finally
registers the localized subnetworks in a global coordinate system. We
demonstrate that this divide-and-conquer algorithm can be used to leverage
existing high-precision SNL algorithms to large-scale networks, which could
otherwise only be applied to small-to-medium sized networks. The main
contribution of this paper concerns the final registration phase. In
particular, we consider a least-squares formulation of the registration problem
(both with and without anchor constraints) and demonstrate how this otherwise
non-convex problem can be relaxed into a tractable convex program. We provide
some preliminary simulation results for large-scale SNL demonstrating that the
proposed registration algorithm (together with an accurate localization scheme)
offers a good tradeoff between run time and accuracy.Comment: 5 pages, 8 figures, 1 table. To appear in Proc. IEEE International
Conference on Acoustics, Speech, and Signal Processing, April 19-24, 201
- …