1,300 research outputs found

    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

    Eigenvector Synchronization, Graph Rigidity and the Molecule Problem

    Full text link
    The graph realization problem has received a great deal of attention in recent years, due to its importance in applications such as wireless sensor networks and structural biology. In this paper, we extend on previous work and propose the 3D-ASAP algorithm, for the graph realization problem in R3\mathbb{R}^3, given a sparse and noisy set of distance measurements. 3D-ASAP is a divide and conquer, non-incremental and non-iterative algorithm, which integrates local distance information into a global structure determination. Our approach starts with identifying, for every node, a subgraph of its 1-hop neighborhood graph, which can be accurately embedded in its own coordinate system. In the noise-free case, the computed coordinates of the sensors in each patch must agree with their global positioning up to some unknown rigid motion, that is, up to translation, rotation and possibly reflection. In other words, to every patch there corresponds an element of the Euclidean group Euc(3) of rigid transformations in R3\mathbb{R}^3, and the goal is to estimate the group elements that will properly align all the patches in a globally consistent way. Furthermore, 3D-ASAP successfully incorporates information specific to the molecule problem in structural biology, in particular information on known substructures and their orientation. In addition, we also propose 3D-SP-ASAP, a faster version of 3D-ASAP, which uses a spectral partitioning algorithm as a preprocessing step for dividing the initial graph into smaller subgraphs. Our extensive numerical simulations show that 3D-ASAP and 3D-SP-ASAP are very robust to high levels of noise in the measured distances and to sparse connectivity in the measurement graph, and compare favorably to similar state-of-the art localization algorithms.Comment: 49 pages, 8 figure

    Distance-based sensor node localization by using ultrasound, RSSI and ultra-wideband - A comparision between the techniques

    Get PDF
    Wireless sensor networks (WSNs) have become one of the most important topics in wireless communication during the last decade. In a wireless sensor system, sensors are spread over a region to build a sensor network and the sensors in a region co-operate to each other to sense, process, filter and routing. Sensor Positioning is a fundamental and crucial issue for sensor network operation and management. WSNs have so many applications in different areas such as health-care, monitoring and control, rescuing and military; they all depend on nodes being able to accurately determine their locations. This master’s thesis is focused on distance-based sensor node localization techniques; Received signal strength indicator, ultrasound and ultra-wideband. Characteristics and factors which affect these distance estimation techniques are analyzed theoretically and through simulation the quality of these techniques are compared in different scenarios. MDS, a centralized algorithm is used for solving the coordinates. It is a set of data analysis techniques that display the structure of distance-like data as a geometrical picture. Centralized and distributed implementations of MDS are also discussed. All simulations and computations in this thesis are done in Matlab. Virtual WSN is simulated on Sensorviz. Sensorviz is a simulation and visualization tool written by Andreas Savvides.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format

    Distance-based sensor node localization by using ultrasound, RSSI and ultra-wideband - A comparision between the techniques

    Get PDF
    Wireless sensor networks (WSNs) have become one of the most important topics in wireless communication during the last decade. In a wireless sensor system, sensors are spread over a region to build a sensor network and the sensors in a region co-operate to each other to sense, process, filter and routing. Sensor Positioning is a fundamental and crucial issue for sensor network operation and management. WSNs have so many applications in different areas such as health-care, monitoring and control, rescuing and military; they all depend on nodes being able to accurately determine their locations. This master’s thesis is focused on distance-based sensor node localization techniques; Received signal strength indicator, ultrasound and ultra-wideband. Characteristics and factors which affect these distance estimation techniques are analyzed theoretically and through simulation the quality of these techniques are compared in different scenarios. MDS, a centralized algorithm is used for solving the coordinates. It is a set of data analysis techniques that display the structure of distance-like data as a geometrical picture. Centralized and distributed implementations of MDS are also discussed. All simulations and computations in this thesis are done in Matlab. Virtual WSN is simulated on Sensorviz. Sensorviz is a simulation and visualization tool written by Andreas Savvides.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format

    Anchor Self-Calibrating Schemes for UWB based Indoor Localization

    Get PDF
    Traditional indoor localization techniques that use Received Signal Strength or Inertial Measurement Units for dead-reckoning suffer from signal attenuation and sensor drift, resulting in inaccurate position estimates. Newly available Ultra-Wideband radio modules can measure distances at a centimeter-level accuracy while mitigating the effects of multipath propagation due to their very fine time resolution. Known locations of fixed anchor nodes are required to determine the position of tag nodes within an indoor environment. For a large system consisting of several anchor nodes spanning a wide area, physically mapping out the locations of each anchor node is a tedious task and thus makes the scalability of such systems difficult. Hence it is important to develop indoor localization systems wherein the anchors can self-calibrate by determining their relative positions in Euclidean 3D space with respect to each other. In this thesis, we propose two novel anchor self-calibrating algorithms - Triangle Reconstruction Algorithm (TRA) and Channel Impulse Response Positioning (CIRPos) that improve upon existing range-based implementations and solve existing problems such as flip ambiguity and node localization success rate. The localization accuracy and scalability of the self-calibrating anchor schemes are tested in a simulated environment based on the ranging accuracy of the Ultra-Wideband modules

    Graph Optimization Approach to Range-based Localization

    Full text link
    In this paper, we propose a general graph optimization based framework for localization, which can accommodate different types of measurements with varying measurement time intervals. Special emphasis will be on range-based localization. Range and trajectory smoothness constraints are constructed in a position graph, then the robot trajectory over a sliding window is estimated by a graph based optimization algorithm. Moreover, convergence analysis of the algorithm is provided, and the effects of the number of iterations and window size in the optimization on the localization accuracy are analyzed. Extensive experiments on quadcopter under a variety of scenarios verify the effectiveness of the proposed algorithm and demonstrate a much higher localization accuracy than the existing range-based localization methods, especially in the altitude direction

    Distributed Calibration of Wireless Multimedia Sensor Networks

    Get PDF
    Wireless Multimedia Sensor Networks (WMSNs) are gaining popularity among researchers over the past few years. Knowledge of the geographic locations of the sensor nodes is very important in such sensor networks. Location calibration is a method that uses the connectivity information, the estimated distance information among the sensor nodes, as well as the vision images to find the location of the sensor nodes in WMSNs. We generate local maps for nodes in immediate vicinity and merge them together to get a global map. Local maps are prone to be incorrect mainly due to distribution symmetry in a grid based network and uncertainties in the classical multidimensional scaling. Performance measures to calculate and study the same have been developed and described in detail. In this research we propose a new algorithm which corrects the error to improve the location calibration in WMSN. The major contribution of our thesis lies in developing the theoretical framework for distributed camera calibration based on vision data, local inter-node distances and local topology. Moreover our work does not need any moving targets to perform distributed camera calibration. We further develop innovative algorithms for local map generation and map merging. We evaluated the proposed approach through computer simulations. This location calibration algorithm can thus be used to develop self-organized wireless multimedia sensor networks. We demonstrate the effectiveness of our proposed approach through computer simulation. We demonstrate the proposed approach for different base node and successfully build the global map. The percentage of accuracy obtained demonstrate that the 80% of the nodes can have a good local map, however the global map obtained can accurately localize all the nodes in the network. This brings a completion to the scope of this thesis, the framework developed further provides an opportunity to extend this algorithm to real time wireless multimedia sensor networks.School of Electrical & Computer Engineerin

    A Low-Complexity Geometric Bilateration Method for Localization in Wireless Sensor Networks and Its Comparison with Least-Squares Methods

    Get PDF
    This research presents a distributed and formula-based bilateration algorithm that can be used to provide initial set of locations. In this scheme each node uses distance estimates to anchors to solve a set of circle-circle intersection (CCI) problems, solved through a purely geometric formulation. The resulting CCIs are processed to pick those that cluster together and then take the average to produce an initial node location. The algorithm is compared in terms of accuracy and computational complexity with a Least-Squares localization algorithm, based on the Levenberg–Marquardt methodology. Results in accuracy vs. computational performance show that the bilateration algorithm is competitive compared with well known optimized localization algorithms
    corecore