2,231 research outputs found
Distributed Algorithms for Target Localization in Wireless Sensor Networks Using Hybrid Measurements
This dissertation addresses the target localization problem in wireless sensor networks
(WSNs). WSNs is now a widely applicable technology which can have numerous practical applications and offer the possibility to improve people’s lives. A required feature to many functions of a WSN, is the ability to indicate where the data reported by each sensor was measured. For this reason, locating each sensor node in a WSN is an essential issue that should be considered.
In this dissertation, a performance analysis of two recently proposed distributed localization algorithms for cooperative 3-D wireless sensor networks (WSNs) is presented. The tested algorithms rely on distance and angle measurements obtained from received signal strength (RSS) and angle-of-arrival (AoA) information, respectively. The measurements are then used to derive a convex estimator, based on second-order cone programming (SOCP) relaxation techniques, and a non-convex one that can be formulated as a generalized trust region sub-problem (GTRS). Both estimators have shown excellent performance assuming a static network scenario, giving accurate location estimates in addition to converging in few iterations.
The results obtained in this dissertation confirm the novel algorithms’ performance
and accuracy. Additionally, a change to the algorithms is proposed, allowing the study of a more realistic and challenging scenario where different probabilities of communication failure between neighbor nodes at the broadcast phase are considered. Computational simulations performed in the scope of this dissertation, show that the algorithms’ performance holds for high probability of communication failure and that convergence is still achieved in a reasonable number of iterations
Joint 3D Deployment and Resource Allocation for UAV-assisted Integrated Communication and Localization
In this paper, we investigate an unmanned aerial vehicle (UAV)-assisted
integrated communication and localization network in emergency scenarios where
a single UAV is deployed as both an airborne base station (BS) and anchor node
to assist ground BSs in communication and localization services. We formulate
an optimization problem to maximize the sum communication rate of all users
under localization accuracy constraints by jointly optimizing the 3D position
of the UAV, and communication bandwidth and power allocation of the UAV and
ground BSs. To address the intractable localization accuracy constraints, we
introduce a new performance metric and geometrically characterize the UAV
feasible deployment region in which the localization accuracy constraints are
satisfied. Accordingly, we combine Gibbs sampling (GS) and block coordinate
descent (BCD) techniques to tackle the non-convex joint optimization problem.
Numerical results show that the proposed method attains almost identical rate
performance as the meta-heuristic benchmark method while reducing the CPU time
by 89.3%.Comment: The paper has been accepted for publication by IEEE Wireless
Communications Letter
Recurrent Neural Networks For Accurate RSSI Indoor Localization
This paper proposes recurrent neuron networks (RNNs) for a fingerprinting
indoor localization using WiFi. Instead of locating user's position one at a
time as in the cases of conventional algorithms, our RNN solution aims at
trajectory positioning and takes into account the relation among the received
signal strength indicator (RSSI) measurements in a trajectory. Furthermore, a
weighted average filter is proposed for both input RSSI data and sequential
output locations to enhance the accuracy among the temporal fluctuations of
RSSI. The results using different types of RNN including vanilla RNN, long
short-term memory (LSTM), gated recurrent unit (GRU) and bidirectional LSTM
(BiLSTM) are presented. On-site experiments demonstrate that the proposed
structure achieves an average localization error of m with of the
errors under m, which outperforms the conventional KNN algorithms and
probabilistic algorithms by approximately under the same test
environment.Comment: Received signal strength indicator (RSSI), WiFi indoor localization,
recurrent neuron network (RNN), long shortterm memory (LSTM),
fingerprint-based localizatio
Parameter selection and performance comparison of particle swarm optimization in sensor networks localization
Localization is a key technology in wireless sensor networks. Faced with the challenges of the sensors\u27 memory, computational constraints, and limited energy, particle swarm optimization has been widely applied in the localization of wireless sensor networks, demonstrating better performance than other optimization methods. In particle swarm optimization-based localization algorithms, the variants and parameters should be chosen elaborately to achieve the best performance. However, there is a lack of guidance on how to choose these variants and parameters. Further, there is no comprehensive performance comparison among particle swarm optimization algorithms. The main contribution of this paper is three-fold. First, it surveys the popular particle swarm optimization variants and particle swarm optimization-based localization algorithms for wireless sensor networks. Secondly, it presents parameter selection of nine particle swarm optimization variants and six types of swarm topologies by extensive simulations. Thirdly, it comprehensively compares the performance of these algorithms. The results show that the particle swarm optimization with constriction coefficient using ring topology outperforms other variants and swarm topologies, and it performs better than the second-order cone programming algorithm
Analyze Large Multidimensional Datasets Using Algebraic Topology
This paper presents an efficient algorithm to extract knowledge from high-dimensionality, high- complexity datasets using algebraic topology, namely simplicial complexes. Based on concept of isomorphism of relations, our method turn a relational table into a geometric object (a simplicial complex is a polyhedron). So, conceptually association rule searching is turned into a geometric traversal problem. By leveraging on the core concepts behind Simplicial Complex, we use a new technique (in computer science) that improves the performance over existing methods and uses far less memory. It was designed and developed with a strong emphasis on scalability, reliability, and extensibility. This paper also investigate the possibility of Hadoop integration and the challenges that come with the framework
Practical considerations for acoustic source localization in the IoT era: Platforms, energy efficiency, and performance
The rapid development of the Internet of Things (IoT) has posed important changes in the way emerging acoustic signal processing applications are conceived. While traditional acoustic processing applications have been developed taking into account high-throughput computing platforms equipped with expensive multichannel audio interfaces, the IoT paradigm is demanding the use of more flexible and energy-efficient systems. In this context, algorithms for source localization and ranging in wireless acoustic sensor networks can be considered an enabling technology for many IoT-based environments, including security, industrial, and health-care applications. This paper is aimed at evaluating important aspects dealing with the practical deployment of IoT systems for acoustic source localization. Recent systems-on-chip composed of low-power multicore processors, combined with a small graphics accelerator (or GPU), yield a notable increment of the computational capacity needed in intensive signal processing algorithms while partially retaining the appealing low power consumption of embedded systems. Different algorithms and implementations over several state-of-the-art platforms are discussed, analyzing important aspects, such as the tradeoffs between performance, energy efficiency, and exploitation of parallelism by taking into account real-time constraintsThis work was supported in part by the Post-Doctoral Fellowship from Generalitat
Valenciana under Grant APOSTD/2016/069, in part by the Spanish
Government under Grant TIN2014-53495-R, Grant TIN2015-65277-R, and
Grant BIA2016-76957-C3-1-R, and in part by the Universidad Jaume I under
Project UJI-B2016-20.Publicad
- …