11,249 research outputs found

    Distributed Cooperative Localization in Wireless Sensor Networks without NLOS Identification

    Full text link
    In this paper, a 2-stage robust distributed algorithm is proposed for cooperative sensor network localization using time of arrival (TOA) data without identification of non-line of sight (NLOS) links. In the first stage, to overcome the effect of outliers, a convex relaxation of the Huber loss function is applied so that by using iterative optimization techniques, good estimates of the true sensor locations can be obtained. In the second stage, the original (non-relaxed) Huber cost function is further optimized to obtain refined location estimates based on those obtained in the first stage. In both stages, a simple gradient descent technique is used to carry out the optimization. Through simulations and real data analysis, it is shown that the proposed convex relaxation generally achieves a lower root mean squared error (RMSE) compared to other convex relaxation techniques in the literature. Also by doing the second stage, the position estimates are improved and we can achieve an RMSE close to that of the other distributed algorithms which know \textit{a priori} which links are in NLOS.Comment: Accepted in WPNC 201

    A survey of localization in wireless sensor network

    Get PDF
    Localization is one of the key techniques in wireless sensor network. The location estimation methods can be classified into target/source localization and node self-localization. In target localization, we mainly introduce the energy-based method. Then we investigate the node self-localization methods. Since the widespread adoption of the wireless sensor network, the localization methods are different in various applications. And there are several challenges in some special scenarios. In this paper, we present a comprehensive survey of these challenges: localization in non-line-of-sight, node selection criteria for localization in energy-constrained network, scheduling the sensor node to optimize the tradeoff between localization performance and energy consumption, cooperative node localization, and localization algorithm in heterogeneous network. Finally, we introduce the evaluation criteria for localization in wireless sensor network

    Non-line-of-sight Node Localization based on Semi-Definite Programming in Wireless Sensor Networks

    Full text link
    An unknown-position sensor can be localized if there are three or more anchors making time-of-arrival (TOA) measurements of a signal from it. However, the location errors can be very large due to the fact that some of the measurements are from non-line-of-sight (NLOS) paths. In this paper, we propose a semi-definite programming (SDP) based node localization algorithm in NLOS environment for ultra-wideband (UWB) wireless sensor networks. The positions of sensors can be estimated using the distance estimates from location-aware anchors as well as other sensors. However, in the absence of LOS paths, e.g., in indoor networks, the NLOS range estimates can be significantly biased. As a result, the NLOS error can remarkably decrease the location accuracy. And it is not easy to efficiently distinguish LOS from NLOS measurements. In this paper, an algorithm is proposed that achieves high location accuracy without the need of identifying NLOS and LOS measurement.Comment: submitted to IEEE ICC'1

    Cooperative and Distributed Localization for Wireless Sensor Networks in Multipath Environments

    Full text link
    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

    Space-Time diversity for NLOS mitigation in TDOA-based positioning systems

    Get PDF
    This paper studies the potential impact of using space-Time information in the mitigation of the Non-LineOf-Sight condition in mobile subscriber's positioning systems. First of all, this work discusses the positioning problem based on measures of Time Differences Of Arrival departing from a more exact characterization of the signal statistics and including some geometrical restrictions to achieve an improved accurate. Furthermore, a novel approach that integrates signal propagation characteristics to information provided by a suitable timing estimation model based on Cramer Rao Bound for a Rayleigh-fading channel, when antenna arrays are used at the receiver and when a set ofchannel vector estimates are available, has been introduced to study the positive benefits of space-Time diversity. These approaches are evaluated within a realistic simulation scenario.Peer ReviewedPostprint (published version

    Detection of variance changes and mean value jumps in measurement noise for multipath mitigation in urban navigation

    Get PDF
    This paper studies an urban navigation filter for land vehicles. Typical urban-canyon phenomena as multipath and GPS outages seriously degrade positioning performance. To deal with these scenarios a hybrid navigation system using GPS and dead-reckoning sensors is presented. This navigation system is complemented by a two-step detection procedure that classifies outliers according to their associated source of error. Two different situations will be considered in the presence of multipath. These situations correspond to the presence or absence of line of sight for the different GPS satellites. Therefore, two kinds of errors are potentially “corrupting” the pseudo-ranges, modeled as variance changes or mean value jumps in noise measurements. An original multiple model approach is proposed to detect, identify and correct these errors and provide a final consistent solution

    Cramer-Rao bounds in the estimation of time of arrival in fading channels

    Get PDF
    This paper computes the Cramer-Rao bounds for the time of arrival estimation in a multipath Rice and Rayleigh fading scenario, conditioned to the previous estimation of a set of propagation channels, since these channel estimates (correlation between received signal and the pilot sequence) are sufficient statistics in the estimation of delays. Furthermore, channel estimation is a constitutive block in receivers, so we can take advantage of this information to improve timing estimation by using time and space diversity. The received signal is modeled as coming from a scattering environment that disperses the signal both in space and time. Spatial scattering is modeled with a Gaussian distribution and temporal dispersion as an exponential random variable. The impact of the sampling rate, the roll-off factor, the spatial and temporal correlation among channel estimates, the number of channel estimates, and the use of multiple sensors in the antenna at the receiver is studied and related to the mobile subscriber positioning issue. To our knowledge, this model is the only one of its kind as a result of the relationship between the space-time diversity and the accuracy of the timing estimation.Peer ReviewedPostprint (published version
    corecore