The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper a novel distance-based source localization algorithm is proposed that is effective in minimizing the error due to biased measurements. In particular, we show how to exploit the knowledge of the feasibility region, constructed via trilateration, to contract the measured distances such that the cost-function of the LS formulation becomes convex and the global optimum is closer to the true...
We employ the semidefinite programming (SDP) framework to first analyze, and then solve, the problem of flip-ambiguity afflicting range-based network localization algorithms with incomplete ranging information. First, we study the occurrence of flip-ambiguous nodes and errors due to flip ambiguity by considering random network topologies with successively smaller connectivity ranges RMax > RMax...
A new optimization algorithm is presented for the solution of the range-based source-localization problem employing a least-squares (LS) multidimensional scaling (MDS) formulation over non-squared distances. The algorithm is based on an progressive objective-smoothing technique known as global distance continuation (GDC). The fundamental requirements to implement a GCD method, namely, expressions...
We propose a robust non-parametric strategy to weight scarce and imperfect ranging information, which is shown to significantly improve the accuracy of distance-based network localization algorithms. The proposed weights have a dispersion component, which captures the effect of noise under the assumption of bias-free samples, and a penalty component, which quantifies the risk of the latter assumption...
A method to derive weights to be used in distance-based multi-dimensional scaling (MDS) source localization algorithms under scarce information is discussed. In particular, a family of weighing function is derived with basis on small-scale statistics and the parameter that drives the choice of a particular weighing function out of such a family is optimized with basis on an information-theoretical...
Wireless sensor networks (WSNs) are considered an adequate solutions for environmental monitoring and surveillance applications, where the physical presence of humans is impossible or costly. In the next future, it is foreseen that nodes will be part of a localization system, that will be able to estimate their locations, aiding the coordination for the most consuming activities such as relaying and...
We propose a novel non-parametric solution for accurate distance-based source localization in wireless sensor networks (WSN's). The proposed technique includes a method to detect whether or not ranging is affected by bias due to non- line-of-sight (NLOS) conditions, requiring no a-priori knowledge of distance estimate statistics. Instead, we exploit the triangular inequality property of the Euclidean...
Localization and tracking (LT) algorithms for low data rate (LDR) ultra wideband (UWB) systems developed within the Integrated Project PULSERS Phase II are reviewed and compared. In particular, two localization algorithms, designed for static networks with mesh topologies, and one Tracking Algorithm, designed for dynamic network with star topologies are described and/or compared. Each of the localization...
We consider the simultaneous localization of multiple sources from distance and angle information. An extension of the multidimensional scaling (MDS) technique is given, which allows for both distance and angle information to be processed algebraically (without iteration) and simultaneously. Simulations demonstrate the superiority the super MDS algorithm compared to conventional metric MDS, which...
We present a low-complexity, accurate and robust localization algorithm suitable for large scale wireless sensor networks (WSNs). The algorithm is a clusterized version of the weighted least-squares (WLS) localization technique which we recently introduced in (Destino, 2006). The WLS algorithm is a low-complexity localization technique that owes its high-accuracy to the ability to complete and approximate...
Time delay rather then throughput, is a constraint of greater importance in tracking systems. In particular, the maximum accces delay permissible by the application ins strongly related to the dynamics of theracked objects. The purpose of this article is to study the performance of a new media access control (MAC) technology specifically suited for LDR UWB systems [3] under the point of view of a...
A non-parametric, low-complexity algorithm for accurate and simultaneous localization of multiple sensors from scarce and imperfect ranging information is proposed. The technique is based on a weighted least-squares (WLS) optimization, where the gradient and Hessian of the quadratic objective are given in closed-form. The performance of the proposed technique is studied through extensive computer...
Source localization from imperfect and incomplete range information is considered. The problem is formulated as a combination of the well-known Euclidean distance matrix (EDM) approximation/completion problem and multidimensional scaling (MDS). A powerful technique that solves the EDM approximation/completion problem by exploiting the semi-definiteness property of a corresponding Euclidean kernel...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.