Multihop Progressive Decentralized Estimation in Wireless Sensor Networks

IEEE Signal Processing LettersPublished 21 November 2007Open access

Yi Huang, Yingbo Hua

DOI10.1109/lsp.2007.904701

Citations42

TL;DR

A multihop progressive decentralized estimation scheme is presented for 1- D, 2-D, or 3-D sensor networks where routing trees are available and is shown to be much more efficient in energy consumption than the nonprogressive decentralized estimation schemes available in the literature.

Abstract

A multihop progressive decentralized estimation scheme is presented for 1-D, 2-D, or 3-D sensor networks where routing trees are available. The bit allocation for each sensor is optimized in a multihop setting. This new scheme is shown to be much more efficient in energy consumption than the nonprogressive decentralized estimation scheme available in the literature. The transmission energy model is based on spectrum-limited applications.

Keywords

Computer Science

IEEE Transactions on Signal ProcessingPower scheduling of universal decentralized estimation in sensor networks

373 Citations2006Jin‐Jun Xiao, Shuguang Cui +2 more

The proposed power scheduling scheme suggests that the sensors with bad channels or poor observation qualities should decrease their quantization resolutions or simply become inactive in order to save power.

IEEE Transactions on Information TheoryUniversal Decentralized Estimation in a Bandwidth Constrained Sensor Network

369 Citations2005Zhongqiang Luo

This correspondence investigates optimal local estimation and final fusion schemes under the constraint that the communication from each sensor to the fusion center must be a one-bit message.

Handbook of Combinatorial Optimization

288 Citations1998Ding‐Zhu Du, Pãnos M. Pardalos

The Steiner Ratio of Banach-Minkowski Space and Probabilistic Verification and Non-Approximability and Network-Based Model and Algorithms in Data Mining and Knowledge Discovery are studied.

IEEE Transactions on Information TheoryDecentralized Estimation in an Inhomogeneous Sensing Environment

237 Citations2005J.-J. Xiao, Zhongqiang Luo

A decentralized estimation scheme (DES) where each sensor compresses its observation to a small number of bits with length proportional to the logarithm of its local signal-to-noise ratio (SNR) and the MSE is within a constant factor of 25/8 of that achieved by the classical centralized BLUE estimator.

IEEE Journal on Selected Areas in CommunicationsAn isotropic universal decentralized estimation scheme for a bandwidth constrained ad hoc sensor network

165 Citations2005Zhi-Quan Luo

This paper proposes a simple probabilistic local quantization rule that allows sensors in the network to operate identically and autonomously even when the network undergoes changes in size or topology.

IEEE Signal Processing MagazineMaximizing the throughput of large ad hoc wireless networks

17 Citations2006Yingbo Hua, Yi Huang +1 more

This paper shows examples of how to maximize the throughput of a large ad hoc network through a closed-loop analysis of two medium access control (MAC) schemes: synchronous array method (SAM) and asynchronousarray method (AAM).

Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work

8 Citations1998J. S. Harris

This paper focuses on the problem of minimizing the length of a network’s length by finding the point P that minimizes the sum of the distances from P to each of three given points in the plane.