2,789 research outputs found

    Range-Free Localization with the Radical Line

    Full text link
    Due to hardware and computational constraints, wireless sensor networks (WSNs) normally do not take measurements of time-of-arrival or time-difference-of-arrival for rangebased localization. Instead, WSNs in some applications use rangefree localization for simple but less accurate determination of sensor positions. A well-known algorithm for this purpose is the centroid algorithm. This paper presents a range-free localization technique based on the radical line of intersecting circles. This technique provides greater accuracy than the centroid algorithm, at the expense of a slight increase in computational load. Simulation results show that for the scenarios studied, the radical line method can give an approximately 2 to 30% increase in accuracy over the centroid algorithm, depending on whether or not the anchors have identical ranges, and on the value of DOI.Comment: Proc. IEEE ICC'10, Cape Town, South Africa, May, 201

    Accurate range free localization in multi-hop wireless sensor networks

    Get PDF
    To localize wireless sensor networks (WSN)s nodes, only the hop-based data have been so far utilized by range free techniques, with poor-accuracy, though. In this thesis, we show that localization accuracy may importantly advantage from mutual utilization, at no cost, of the information already offered by the advancing nodes (i.e., relays) between all anchors (i.e., position-aware) and sensor nodes join up. In addition, energy-based informant localization approaches are generally established corresponding to the channel path-loss models in which the noise is mostly expected to shadow Gaussian distributions. In this thesis, we signify the applied additive noise by the Gaussian mixture model and improve a localization algorithm depend on the received signal intensity to attain the greatest likelihood location, estimator. By employing Jensen’s inequality and semidefinite relaxation, the originally offered nonlinear and nonconvex estimator is relaxed into a convex optimization difficulty, which is able to be professionally resolved to acquire the totally best solution. Moreover, the resultant Cramer–Rao lower bound is originated for occurrence comparison. Simulation and experimental results show a substantial performance gain achieved by our proposed localization algorithm in wireless sensor networks. The performance is evaluated in terms of RMSE in terms of three algorithms WLS, CRLR, and GMSDP based on using the Monte Carlo simulation with account the number of anchors that varying from anchor=4 to anchor =20. Finally, the GMSDP- algorithm achieves and provides a better value of RMSEs and the greatest localization estimation errors comparing with the CRLR algorithm and WLS algorithm

    Lower bounds for Arrangement-based Range-Free Localization in Sensor Networks

    Full text link
    Colander are location aware entities that collaborate to determine approximate location of mobile or static objects when beacons from an object are received by all colanders that are within its distance RR. This model, referred to as arrangement-based localization, does not require distance estimation between entities, which has been shown to be highly erroneous in practice. Colander are applicable in localization in sensor networks and tracking of mobile objects. A set SR2S \subset {\mathbb R}^2 is an (R,ϵ)(R,\epsilon)-colander if by placing receivers at the points of SS, a wireless device with transmission radius RR can be localized to within a circle of radius ϵ\epsilon. We present tight upper and lower bounds on the size of (R,ϵ)(R,\epsilon)-colanders. We measure the expected size of colanders that will form (R,ϵ)(R, \epsilon)-colanders if they distributed uniformly over the plane

    THz-range free-electron laser ESR spectroscopy: techniques and applications in high magnetic fields

    Full text link
    The successful use of picosecond-pulse free-electron-laser (FEL) radiation for the continuous-wave THz-range electron spin resonance (ESR) spectroscopy has been demonstrated. The combination of two linac-based FELs (covering the wavelength range of 4 - 250 μ\mum) with pulsed magnetic fields up to 70 T allows for multi-frequency ESR spectroscopy in a frequency range of 1.2 - 75 THz with a spectral resolution better than 1%. The performance of the spectrometer is illustrated with ESR spectra obtained in the 2,2-diphenyl-1-picrylhydrazyl (DPPH) and the low-dimensional organic material (C6_6H9_9N2_2)CuCl3_3.Comment: 9 pages, 9 figures. Rev. Sci. Instrum., accepte

    Accurate range-free localization for anisotropic wireless sensor networks

    Get PDF
    Journal ArticlePosition information plays a pivotal role in wireless sensor network (WSN) applications and protocol/ algorithm design. In recent years, range-free localization algorithms have drawn much research attention due to their low cost and applicability to large-scale WSNs. However, the application of range-free localization algorithms is restricted because of their dramatic accuracy degradation in practical anisotropic WSNs, which is mainly caused by large error of distance estimation. Distance estimation in the existing range-free algorithms usually relies on a unified per hop length (PHL) metric between nodes. But the PHL between different nodes might be greatly different in anisotropic WSNs, resulting in large error in distance estimation. We find that, although the PHL between different nodes might be greatly different, it exhibits significant locality; that is, nearby nodes share a similar PHL to anchors that know their positions in advance. Based on the locality of the PHL, a novel distance estimation approach is proposed in this article. Theoretical analyses show that the error of distance estimation in the proposed approach is only one-fourth of that in the state-of-the-art pattern-driven scheme (PDS). An anchor selection algorithm is also devised to further improve localization accuracy by mitigating the negative effects from the anchors that are poorly distributed in geometry. By combining the locality-based distance estimation and the anchor selection, a range-free localization algorithm named Selective Multilateration (SM) is proposed. Simulation results demonstrate that SM achieves localization accuracy higher than 0.3r, where r is the communication radius of nodes. Compared to the state-of-the-art solution, SM improves the distance estimation accuracy by up to 57% and improves localization accuracy by up to 52% consequently.This work is partially supported by the National Science Foundation of China (61103203, 61173169, 61332004, and 61420106009), the Hong Kong RGC General Research Fund (PolyU 5106/11E), the International Science & Technology Cooperation Program of China (2013DFB10070), and the EU FP7 QUICK project (PIRSES-GA-2013-612652)

    Range Free Localization Techniques in Wireless Sensor Networks: A Review

    Get PDF
    AbstractRecent developments in micro electro mechanical systems (MEMS) technology and wireless communication have propelled the growing applications of wireless sensor networks (WSNs). Wireless sensor network is comprised of large number of small and cheap devices known as sensors. One of the important functions of sensor network is collection and forwarding of data. In most of the applications, it is of much interest to find out the location of the data. This type of information can be obtained by use of localization techniques. So node localization is very crucial to find out the position of node with the help of localization algorithms. Hence, node localization becomes one of the fundamental challenges in WSNs. We make the rigorous reviews on different schemes of localization in sensor networks. On the basis of range measurements, the localization schemes can be broadly classified in two categories such as: range based and range free schemes. The cost and hardware limitation on sensing node preclude the use of range based localization schemes. In most of the sensor network application coarse accuracy is sufficient so range free localization schemes are considered as a substitute to range based schemes. In this paper, the detailed study has been carried out to understand and select the best range free localization algorithm for WSNs. At the end some issues are discussed for future research in the area of localization techniques for WSNs
    corecore