52 research outputs found
Power Optimization for Network Localization
Reliable and accurate localization of mobile objects is essential for many
applications in wireless networks. In range-based localization, the position of
the object can be inferred using the distance measurements from wireless
signals exchanged with active objects or reflected by passive ones. Power
allocation for ranging signals is important since it affects not only network
lifetime and throughput but also localization accuracy. In this paper, we
establish a unifying optimization framework for power allocation in both active
and passive localization networks. In particular, we first determine the
functional properties of the localization accuracy metric, which enable us to
transform the power allocation problems into second-order cone programs
(SOCPs). We then propose the robust counterparts of the problems in the
presence of parameter uncertainty and develop asymptotically optimal and
efficient near-optimal SOCP-based algorithms. Our simulation results validate
the efficiency and robustness of the proposed algorithms.Comment: 15 pages, 7 figure
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
Target Localization and Tracking in Wireless Sensor Networks
This thesis addresses the target localization problem in wireless sensor networks (WSNs) by employing statistical modeling and convex relaxation techniques. The first and the second part of the thesis focus on received signal strength (RSS)- and RSS-angle of arrival (AoA)-based target localization problem, respectively. Both non-cooperative and cooperative WSNs are investigated and various settings of the localization problem are of interest (e.g. known and unknown target transmit power, perfectly and imperfectly known path loss exponent). For all cases, maximum likelihood (ML) estimation problem is first formulated.
The general idea is to tightly approximate the ML estimator by another one whose
global solution is a close representation of the ML solution, but is easily obtained due to greater smoothness of the derived objective function. By applying certain relaxations, the solution to the derived estimator is readily obtained through general-purpose solvers. Both centralized (assumes existence of a central node that collects all measurements and carries out all necessary processing for network mapping) and distributed (each target determines its own location by iteratively solving a local representation of the derived estimator) algorithms are described. More specifically, in the case of centralized RSS-based localization, second-order cone programming (SOCP) and semidefinite programming (SDP) estimators are derived by applying SOCP and SDP relaxation techniques in non-cooperative and cooperative WSNs, respectively. It is also shown that the derived SOCP estimator can be extended for distributed implementation in cooperative WSNs. In the second part of the thesis, derivation procedure of a weighted least squares (WLS) estimator by converting the centralized non-cooperative RSS-AoA localization problem into a generalized trust region
sub-problem (GTRS) framework, and an SDP estimator by applying SDP relaxations to
the centralized cooperative RSS-AoA localization problem are described. Furthermore, a distributed SOCP estimator is developed, and an extension of the centralized WLS estimator for non-cooperative WSNs to distributed conduction in cooperative WSNs is also presented. The third part of the thesis is committed to RSS-AoA-based target tracking problem. Both cases of target tracking with fixed/static anchors and mobile sensors are investigated. First, the non-linear measurement model is linearized by applying Cartesian to polar coordinates conversion. Prior information extracted from target transition model is then added to the derived model, and by following maximum a posteriori (MAP) criterion, a MAP algorithm is developed. Similarly, by taking advantage of the derived model and the prior knowledge, Kalman filter (KF) algorithm is designed. Moreover, by allowing sensor mobility, a simple navigation routine for sensors’ movement management is described, which significantly enhances the estimation accuracy of the presented algorithms even for a reduced number of sensors.
The described algorithms are assessed and validated through simulation results and
real indoor measurements
Distributed Algorithm for Target Localization in Wireless Sensor Networks Using RSS and AoA Measurements
This paper addresses target localization problem in a cooperative 3-D wireless sensor network (WSN). We employ a hybrid system that fuses distance and angle measurements, extracted from the received signal strength (RSS) and angle-of-arrival (AoA) information, respectively. Based on range measurement model and simple geometry, we derive a novel non-convex estimator based on the least squares (LS) criterion. The derived non-convex estimator tightly approximates the maximum likelihood (ML) one for small noise levels. We show that the developed non-convex estimator is suitable for distributed implementation, and that it can be transformed into a convex one by applying a second-order cone programming (SOCP) relaxation technique. We also show that the developed non-convex estimator can be transformed into a generalized trust region sub-problem (GTRS) framework, by following the squared range (SR) approach. The proposed SOCP algorithm for known transmit powers is then generalized to the case where the transmit powers are different and not known. Furthermore, we provide a detailed analysis of the computational complexity of the proposed algorithms. Our simulation results show that the new estimators have excellent performance in terms of the estimation accuracy and convergence, and they confirm the effectiveness of combining two radio measurements
Distributed RSS-Based Localization in Wireless Sensor Networks Based on Second-Order Cone Programming
In this paper, we propose a new approach based on convex optimization to address
the received signal strength (RSS)-based cooperative localization problem in wireless sensor
networks (WSNs). By using iterative procedures and measurements between two adjacent
nodes in the network exclusively, each target node determines its own position locally. The
localization problem is formulated using the maximum likelihood (ML) criterion, since
ML-based solutions have the property of being asymptotically efficient. To overcome
the non-convexity of the ML optimization problem, we employ the appropriate convex
relaxation technique leading to second-order cone programming (SOCP). Additionally, a
simple heuristic approach for improving the convergence of the proposed scheme for the
case when the transmit power is known is introduced. Furthermore, we provide details about
the computational complexity and energy consumption of the considered approaches. Our
simulation results show that the proposed approach outperforms the existing ones in terms
of the estimation accuracy for more than 1.5 m. Moreover, the new approach requires a
lower number of iterations to converge, and consequently, it is likely to preserve energy in
all presented scenarios, in comparison to the state-of-the-art approaches
Localization and security algorithms for wireless sensor networks and the usage of signals of opportunity
In this dissertation we consider the problem of localization of wireless devices in environments and applications where GPS (Global Positioning System) is not a viable option. The _x000C_rst part of the dissertation studies a novel positioning system based on narrowband radio frequency (RF) signals of opportunity, and develops near optimum estimation algorithms for localization of a mobile receiver. It is assumed that a reference receiver (RR) with known position is available to aid with the positioning of the mobile receiver (MR). The new positioning system is reminiscent of GPS and involves two similar estimation problems. The _x000C_rst is localization using estimates of time-di_x000B_erence of arrival (TDOA). The second is TDOA estimation based on the received narrowband signals at the RR and the MR. In both cases near optimum estimation algorithms are developed in the sense of maximum likelihood estimation (MLE) under some mild assumptions, and both algorithms compute approximate MLEs in the form of a weighted least-squares (WLS) solution. The proposed positioning system is illustrated with simulation studies based on FM radio signals. The numerical results show that the position errors are comparable to those of other positioning systems, including GPS. Next, we present a novel algorithm for localization of wireless sensor networks (WSNs) called distributed randomized gradient descent (DRGD), and prove that in the case of noise-free distance measurements, the algorithm converges and provides the true location of the nodes. For noisy distance measurements, the convergence properties of DRGD are discussed and an error bound on the location estimation error is obtained. In contrast to several recently proposed methods, DRGD does not require that blind nodes be contained in the convex hull of the anchor nodes, and can accurately localize the network with only a few anchors. Performance of DRGD is evaluated through extensive simulations and compared with three other algorithms, namely the relaxation-based second order cone programming (SOCP), the simulated annealing (SA), and the semi-de_x000C_nite programing (SDP) procedures. Similar to DRGD, SOCP and SA are distributed algorithms, whereas SDP is centralized. The results show that DRGD successfully localizes the nodes in all the cases, whereas in many cases SOCP and SA fail. We also present a modi_x000C_cation of DRGD for mobile WSNs and demonstrate the e_x000E_cacy of DRGD for localization of mobile networks with several simulation results. We then extend this method for secure localization in the presence of outlier distance measurements or distance spoo_x000C_ng attacks. In this case we present a centralized algorithm to estimate the position of the nodes in WSNs, where outlier distance measurements may be present
A Simple and Efficient RSS-AOA Based Localization with Heterogeneous Anchor Nodes
Accurate and reliable localization is crucial for various wireless
communication applications. Numerous studies have proposed accurate
localization methods using hybrid received signal strength (RSS) and angle of
arrival (AOA) measurements. However, these studies typically assume identical
measurement noise distributions for different anchor nodes, which may not
accurately reflect real-world scenarios with varying noise distributions. In
this paper, we propose a simple and efficient localization method based on
hybrid RSS-AOA measurements that accounts for the varying measurement noises of
different nodes. We derive a closed-form estimator for the target location
based on the linear weighted least squares (LWLS) algorithm, with each LWLS
equation weight being the inverse of its residual variance. Due to the unknown
variances of LWLS equation residuals, we employ a two-stage LWLS method for
estimation. The proposed method is computationally efficient, adaptable to
different types of wireless communication systems and environments, and
provides more accurate and reliable localization results compared to existing
RSS-AOA localization techniques. Additionally, we derive the Cramer-Rao Lower
Bound (CRLB) for the RSS-AOA signal sequences used in the proposed method.
Simulation results demonstrate the superiority of the proposed method
- …