1,318 research outputs found

    Can we trust trusted nodes in wireless sensor networks?

    Full text link
    In this paper we extend our previously designed trust model in wireless sensor networks to include both; communication trust and data trust. Trust management in wireless sensor networks is predominantly based on routing messages; whether the communication has happened or not (successful and unsuccessful transactions). The uniqueness of sensing data in wireless sensor networks introduces new challenges in calculating trust between nodes (data trust). If the overall trust is based on just the communication trust, it might mislead the network, that is; untrustworthy nodes in terms of sensed data can be classified as trusted nodes due to their communication capabilities. Hence we need to develop new trust models to address the issue of the actual sensed data. Here we are comparing the two trust models and proving that one model by itself is not enough to decide on the trustworthiness of a node, so new techniques are required to combine both data trust and communication trust. ©2008 IEEE

    Recursive bayesian approaches for auto calibration in drift aware wireless sensor networks

    Full text link
    The purpose for wireless sensor networks is to deploy low cost sensors with sufficient computing and communication capabilities to support networked sensing applications. Even when the sensors are properly calibrated at the time of their deployment, they develop drift in their readings leading to biased sensor measurements. Noting that a physical phenomenon in a certain area follows some spatio-temporal correlation, we assume that the sensors readings in that area are correlated. We also assume that the instantiations of drifts are uncorrelated. Based on these assumptions, and inspired by the resemblance of registration problem in radar target tracking with the bias error problem in wireless sensor networks, we follow a Bayesian framework to solve the Drift/Bias problem in wireless sensor networks. We present two methods for solving the drift problem in a densely deployed sensor network, one for smooth drifts and the other for unsmooth drifts. We also show that both methods successfully detect and correct sensor errors and extend the effective life time of the sensor network

    Topology of event distribution as a generalized definition of phase transitions in finite systems

    Full text link
    We propose a definition of phase transitions in finite systems based on topology anomalies of the event distribution in the space of observations. This generalizes all the definitions based on the curvature anomalies of thermodynamical potentials and provides a natural definition of order parameters. The proposed definition is directly operational from the experimental point of view. It allows to study phase transitions in Gibbs equilibria as well as in other ensembles such as the Tsallis ensemble.Comment: 4 pages, 3 figure

    Bayesian fusion algorithm for inferring trust in wireless sensor networks

    Full text link
    This paper introduces a new Bayesian fusion algorithm to combine more than one trust component (data trust and communication trust) to infer the overall trust between nodes. This research work proposes that one trust component is not enough when deciding on whether or not to trust a specific node in a wireless sensor network. This paper discusses and analyses the results from the communication trust component (binary) and the data trust component (continuous) and proves that either component by itself, can mislead the network and eventually cause a total breakdown of the network. As a result of this, new algorithms are needed to combine more than one trust component to infer the overall trust. The proposed algorithm is simple and generic as it allows trust components to be added and deleted easily. Simulation results demonstrate that a node is highly trustworthy provided that both trust components simultaneously confirm its trustworthiness and conversely, a node is highly untrustworthy if its untrustworthiness is asserted by both components. © 2010 ACADEMY PUBLISHER

    Composition of Binary Compressed Sensing Matrices

    Get PDF
    In the recent past, various methods have been proposed to construct deterministic compressed sensing (CS) matrices. Of interest has been the construction of binary sensing matrices as they are useful for multiplierless and faster dimensionality reduction. In most of these binary constructions, the matrix size depends on primes or their powers. In this study, we propose a composition rule which exploits sparsity and block structure of existing binary CS matrices to construct matrices of general size. We also show that these matrices satisfy optimal theoretical guarantees and have similar density compared to matrices obtained using Kronecker product. Simulation work shows that the synthesized matrices provide comparable results against Gaussian random matrices

    Depinning Transition of a Two Dimensional Vortex Lattice in a Commensurate Periodic Potential

    Full text link
    We use Monte Carlo simulations of the 2D one component Coulomb gas on a triangular lattice, to study the depinning transition of a 2D vortex lattice in a commensurate periodic potential. A detailed finite size scaling analysis indicates this transition to be first order. No significant changes in behavior were found as vortex density was varied over a wide range.Comment: 5 pages, 8 figures. Revised discussion of correlation length exponent using a more accurate finite size scaling analysis. New figs. 5 and 6. Old figs. 6 and 7 now figs. 7 and

    Finite-Size Scaling Study of the Surface and Bulk Critical Behavior in the Random-Bond 8-state Potts Model

    Full text link
    The self-dual random-bond eight-state Potts model is studied numerically through large-scale Monte Carlo simulations using the Swendsen-Wang cluster flipping algorithm. We compute bulk and surface order parameters and susceptibilities and deduce the corresponding critical exponents at the random fixed point using standard finite-size scaling techniques. The scaling laws are suitably satisfied. We find that a belonging of the model to the 2D Ising model universality class can be conclusively ruled out, and the dimensions of the relevant bulk and surface scaling fields are found to take the values yh=1.849y_h=1.849, yt=0.977y_t=0.977, yhs=0.54y_{h_s}=0.54, to be compared to their Ising values: 15/8, 1, and 1/2.Comment: LaTeX file with Revtex, 4 pages, 4 eps figures, to appear in Phys. Rev. Let

    The Phases and Triviality of Scalar Quantum Electrodynamics

    Get PDF
    The phase diagram and critical behavior of scalar quantum electrodynamics are investigated using lattice gauge theory techniques. The lattice action fixes the length of the scalar (``Higgs'') field and treats the gauge field as non-compact. The phase diagram is two dimensional. No fine tuning or extrapolations are needed to study the theory's critical behovior. Two lines of second order phase transitions are discovered and the scaling laws for each are studied by finite size scaling methods on lattices ranging from 646^4 through 24424^4. One line corresponds to monopole percolation and the other to a transition between a ``Higgs'' and a ``Coulomb'' phase, labelled by divergent specific heats. The lines of transitions cross in the interior of the phase diagram and appear to be unrelated. The monopole percolation transition has critical indices which are compatible with ordinary four dimensional percolation uneffected by interactions. Finite size scaling and histogram methods reveal that the specific heats on the ``Higgs-Coulomb'' transition line are well-fit by the hypothesis that scalar quantum electrodynamics is logarithmically trivial. The logarithms are measured in both finite size scaling of the specific heat peaks as a function of volume as well as in the coupling constant dependence of the specific heats measured on fixed but large lattices. The theory is seen to be qualitatively similar to λϕ4\lambda\phi^{4}. The standard CRAY random number generator RANF proved to be inadequateComment: 25pages,26figures;revtex;ILL-(TH)-94-#12; only hardcopy of figures availabl
    corecore