Gossip Algorithms for Distributed Signal Processing

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

Geographic Gossip: Efficient Averaging for Sensor Networks

Gossip algorithms for distributed computation are attractive due to their simplicity, distributed nature, and robustness in noisy and uncertain environments. However, using standard gossip algorithms can lead to a significant waste in energy by repeatedly recirculating redundant information. For realistic sensor network model topologies like grids and random geometric graphs, the inefficiency of gossip schemes is related to the slow mixing times of random walks on the communication graph. We propose and analyze an alternative gossiping scheme that exploits geographic information. By utilizing geographic routing combined with a simple resampling method, we demonstrate substantial gains over previously proposed gossip protocols. For regular graphs such as the ring or grid, our algorithm improves standard gossip by factors of $n$ and $\sqrt{n}$ respectively. For the more challenging case of random geometric graphs, our algorithm computes the true average to accuracy $\epsilon$ using $O(\frac{n^{1.5}}{\sqrt{\log n}} \log \epsilon^{-1})$ radio transmissions, which yields a $\sqrt{\frac{n}{\log n}}$ factor improvement over standard gossip algorithms. We illustrate these theoretical results with experimental comparisons between our algorithm and standard methods as applied to various classes of random fields.Comment: To appear, IEEE Transactions on Signal Processin

Toward a Robust Sparse Data Representation for Wireless Sensor Networks

Compressive sensing has been successfully used for optimized operations in wireless sensor networks. However, raw data collected by sensors may be neither originally sparse nor easily transformed into a sparse data representation. This paper addresses the problem of transforming source data collected by sensor nodes into a sparse representation with a few nonzero elements. Our contributions that address three major issues include: 1) an effective method that extracts population sparsity of the data, 2) a sparsity ratio guarantee scheme, and 3) a customized learning algorithm of the sparsifying dictionary. We introduce an unsupervised neural network to extract an intrinsic sparse coding of the data. The sparse codes are generated at the activation of the hidden layer using a sparsity nomination constraint and a shrinking mechanism. Our analysis using real data samples shows that the proposed method outperforms conventional sparsity-inducing methods.Comment: 8 page

Optimization of the overall success probability of the energy harvesting cognitive wireless sensor networks

Wireless energy harvesting can improve the performance of cognitive wireless sensor networks (WSNs). This paper considers radio frequency (RF) energy harvesting from transmissions in the primary spectrum for cognitive WSNs. The overall success probability of the energy harvesting cognitive WSN depends on the transmission success probability and energy success probability. Using the tools from stochastic geometry, we show that the overall success probability can be optimized with respect to: 1) transmit power of the sensors; 2) transmit power of the primary transmitters; and 3) spatial density of the primary transmitters. In this context, an optimization algorithm is proposed to maximize the overall success probability of the WSNs. Simulation results show that the overall success probability and the throughput of the WSN can be significantly improved by optimizing the aforementioned three parameters. As RF energy harvesting can also be performed indoors, hence, our solution can be directly applied to the cognitive WSNs that are installed in smart buildings

Experiments Validating the Effectiveness of Multi-point Wireless Energy Transmission with Carrier Shift Diversity

This paper presents a method to seamlessly extend the coverage of energy supply field for wireless sensor networks in order to free sensors from wires and batteries, where the multi-point scheme is employed to overcome path-loss attenuation, while the carrier shift diversity is introduced to mitigate the effect of interference between multiple wave sources. As we focus on the energy transmission part, sensor or communication schemes are out of scope of this paper. To verify the effectiveness of the proposed wireless energy transmission, this paper conducts indoor experiments in which we compare the power distribution and the coverage performance of different energy transmission schemes including conventional single-point, simple multi-point and our proposed multi-point scheme. To easily observe the effect of the standing-wave caused by multipath and interference between multiple wave sources, 3D measurements are performed in an empty room. The results of our experiments together with those of a simulation that assumes a similar antenna setting in free space environment show that the coverage of single-point and multi-point wireless energy transmission without carrier shift diversity are limited by path-loss, standing-wave created by multipath and interference between multiple wave sources. On the other hand, the proposed scheme can overcome power attenuation due to the path-loss as well as the effect of standing-wave created by multipath and interference between multiple wave sources.Comment: This paper is submitted to IEICE IEICE Transactions on Communications.