8,628 research outputs found

    Efficient collection of sensor data via a new accelerated random walk

    Get PDF
    Motivated by the problem of efficiently collecting data from wireless sensor networks via a mobile sink, we present an accelerated random walk on random geometric graphs (RGG). Random walks in wireless sensor networks can serve as fully local, lightweight strategies for sink motion that significantly reduce energy dissipation but introduce higher latency in the data collection process. In most cases, random walks are studied on graphs like Gn,p and grid. Instead, we here choose the RGG model, which abstracts more accurately spatial proximity in a wireless sensor network. We first evaluate an adaptive walk (the random walk with inertia) on the RGG model; its performance proved to be poor and led us to define and experimentally evaluate a novel random walk that we call Îł-stretched random walk. Its basic idea is to favour visiting distant neighbours of the current node towards reducing node overlap and accelerate the cover time. We also define a new performance metric called proximity cover time that, along with other metrics such as visit overlap statistics and proximity variation, we use to evaluate the performance properties and features of the various walks

    Gossip Algorithms for Distributed Signal Processing

    Full text link
    Gossip algorithms are attractive for in-network processing in sensor networks because they do not require any specialized routing, there is no bottleneck or single point of failure, and they are robust to unreliable wireless network conditions. Recently, there has been a surge of activity in the computer science, control, signal processing, and information theory communities, developing faster and more robust gossip algorithms and deriving theoretical performance guarantees. This article presents an overview of recent work in the area. We describe convergence rate results, which are related to the number of transmitted messages and thus the amount of energy consumed in the network for gossiping. We discuss issues related to gossiping over wireless links, including the effects of quantization and noise, and we illustrate the use of gossip algorithms for canonical signal processing tasks including distributed estimation, source localization, and compression.Comment: Submitted to Proceedings of the IEEE, 29 page

    Accelerated collection of sensor data by mobility-enabled topology ranks

    Get PDF
    We study the problem of fast and energy-efficient data collection of sensory data using a mobile sink, in wireless sensor networks in which both the sensors and the sink move. Motivated by relevant applications, we focus on dynamic sensory mobility and heterogeneous sensor placement. Our approach basically suggests to exploit the sensor motion to adaptively propagate information based on local conditions (such as high placement concentrations), so that the sink gradually “learns” the network and accordingly optimizes its motion. Compared to relevant solutions in the state of the art (such as the blind random walk, biased walks, and even optimized deterministic sink mobility), our method significantly reduces latency (the improvement ranges from 40% for uniform placements, to 800% for heterogeneous ones), while also improving the success rate and keeping the energy dissipation at very satisfactory level

    The Maximum Traveling Salesman Problem with Submodular Rewards

    Full text link
    In this paper, we look at the problem of finding the tour of maximum reward on an undirected graph where the reward is a submodular function, that has a curvature of Îș\kappa, of the edges in the tour. This problem is known to be NP-hard. We analyze two simple algorithms for finding an approximate solution. Both algorithms require O(∣V∣3)O(|V|^3) oracle calls to the submodular function. The approximation factors are shown to be 12+Îș\frac{1}{2+\kappa} and max⁥{ 23(2+Îș),2/3(1−Îș) }\max\set{\frac{2}{3(2+\kappa)},2/3(1-\kappa)}, respectively; so the second method has better bounds for low values of Îș\kappa. We also look at how these algorithms perform for a directed graph and investigate a method to consider edge costs in addition to rewards. The problem has direct applications in monitoring an environment using autonomous mobile sensors where the sensing reward depends on the path taken. We provide simulation results to empirically evaluate the performance of the algorithms.Comment: Extended version of ACC 2013 submission (including p-system greedy bound with curvature

    Strengths and Weaknesses of Prominent Data Dissemination Techniques in Wireless Sensor Networks

    Get PDF
    Data dissemination is the most significant task in a Wireless Sensor Network (WSN). From the bootstrapping stage to the full functioning stage, a WSN must disseminate data in various patterns like from the sink to node, from node to sink, from node to node, or the like. This is what a WSN is deployed for. Hence, this issue comes with various data routing models and often there are different types of network settings that influence the way of data collection and/or distribution. Considering the importance of this issue, in this paper, we present a survey on various prominent data dissemination techniques in such network. Our classification of the existing works is based on two main parameters: the number of sink (single or multiple) and the nature of its movement (static or mobile). Under these categories, we have analyzed various previous works for their relative strengths and weaknesses. A comparison is also made based on the operational methods of various data dissemination schemes

    Enabling Explainable Fusion in Deep Learning with Fuzzy Integral Neural Networks

    Full text link
    Information fusion is an essential part of numerous engineering systems and biological functions, e.g., human cognition. Fusion occurs at many levels, ranging from the low-level combination of signals to the high-level aggregation of heterogeneous decision-making processes. While the last decade has witnessed an explosion of research in deep learning, fusion in neural networks has not observed the same revolution. Specifically, most neural fusion approaches are ad hoc, are not understood, are distributed versus localized, and/or explainability is low (if present at all). Herein, we prove that the fuzzy Choquet integral (ChI), a powerful nonlinear aggregation function, can be represented as a multi-layer network, referred to hereafter as ChIMP. We also put forth an improved ChIMP (iChIMP) that leads to a stochastic gradient descent-based optimization in light of the exponential number of ChI inequality constraints. An additional benefit of ChIMP/iChIMP is that it enables eXplainable AI (XAI). Synthetic validation experiments are provided and iChIMP is applied to the fusion of a set of heterogeneous architecture deep models in remote sensing. We show an improvement in model accuracy and our previously established XAI indices shed light on the quality of our data, model, and its decisions.Comment: IEEE Transactions on Fuzzy System
    • 

    corecore