Scaling Laws for Dense Gaussian Sensor Networks and the Order Optimality of Separation

DOI10.1109/TIT.2007.904966MaRDI QIDQ3548804zbMATH OpenOpenAlexFDO

Authors Nan Liu, Sennur Ulukus

Publication date 21 December 2008

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/cs/0611095

Mathematics Subject Classification ID

Circuits, networks (94C99) Source coding (94A29) Channel models (including quantum) in information and communication theory (94A40)

Abstract: We investigate the optimal performance of dense sensor networks by studying the joint source-channel coding problem. The overall goal of the sensor network is to take measurements from an underlying random process, code and transmit those measurement samples to a collector node in a cooperative multiple access channel with potential feedback, and reconstruct the entire random process at the collector node. We provide lower and upper bounds for the minimum achievable expected distortion when the underlying random process is Gaussian. When the Gaussian random process satisfies some general conditions, we evaluate the lower and upper bounds explicitly, and show that they are of the same order for a wide range of power constraints. Thus, for these random processes, under these power constraints, we express the minimum achievable expected distortion as a function of the power constraint. Further, we show that the achievability scheme that achieves the lower bound on the distortion is a separation-based scheme that is composed of multi-terminal rate-distortion coding and amplify-and-forward channel coding. Therefore, we conclude that separation is order-optimal for the dense Gaussian sensor network scenario under consideration, when the underlying random process satisfies some general conditions.

Recommendations

• On the Scaling Laws of Dense Wireless Sensor Networks: The Data Gathering Channel
• Separation theorems and partial orderings for sensor network problems
• Scale-free aggregation in sensor networks
• Algorithmic Aspects of Wireless Sensor Networks
• Sensor network design for the estimation of spatially distributed processes
• Ordering for Reduced Transmission Energy Detection in Sensor Networks Testing a Shift in the Mean of a Gaussian Graphical Model
• Scaling Laws for Ad Hoc Wireless Networks: An Information Theoretic Approach
• Scaling Laws for Ad Hoc Wireless Networks: An Information Theoretic Approach
• Optimal Node Density for Detection in Energy-Constrained Random Networks
• Distributed density estimation in sensor networks based on variational approximations

Cited in

(8)

• scientific article; zbMATH DE number 2135150 (Why is no real title available?)
• scientific article; zbMATH DE number 1978126 (Why is no real title available?)
• Separation theorems and partial orderings for sensor network problems
• scientific article; zbMATH DE number 1978127 (Why is no real title available?)
• Ordering for Reduced Transmission Energy Detection in Sensor Networks Testing a Shift in the Mean of a Gaussian Graphical Model
• On the Scaling Laws of Dense Wireless Sensor Networks: The Data Gathering Channel
• scientific article; zbMATH DE number 1978136 (Why is no real title available?)
• How Dense Should a Sensor Network Be for Detection With Correlated Observations?

This page was built for publication: Scaling Laws for Dense Gaussian Sensor Networks and the Order Optimality of Separation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3548804)