Introduction | |
Information-theoretic Bounds on Sensor Network Performance | |
Introduction | |
Sensor Network Models | |
The Linear Gaussian Sensor Network | |
Digital Architectures | |
Distributed Source Coding | |
Distributed Channel Coding | |
End-to-end Performance of Digital Architectures | |
The Price of Digital Architectures | |
Bounds on General Architectures | |
Concluding Remarks and Some Interesting Questions Bibliography | |
In-Network Information Processing in Wireless Sensor Networks | |
Introduction | |
Communication Complexity Model | |
Computing Functions Over Wireless Networks: Spatial Reuse and Block Computation | |
Geographical Models of Wireless Communication Networks | |
Block Computation and Computational Throughput | |
Symmetric Functionsand Types | |
The Collocated Network | |
Subclasses of Symmetric Functions: Type-sensitive and Type-threshold | |
Results on Maximum Throughput in Collocated Networks | |
Multi-Hop Networks: The Random Planar Network | |
Other Acyclic Networks | |
Wireless Networks with Noisy Communications: Reliable Computation in a Collocated Broadcast Network | |
The Sum of the Parity of the Measurements | |
Threshold Functions | |
Towards an Information Theoretic Formulation | |
Concluding | |
Remarks | |
Bibliography | |
The Sensing Capacity of Sensor Networks | |
Introduction | |
Large-Scale Detection Applications | |
Sensor Network as an Encoder | |
Information | |
Theory | |
Context | |
Sensing Capacity of Sensor Networks | |
Sensor Network Model with Arbitrary Connections | |
Random Coding and Method of Types | |
Sensing Capacity Theorem | |
Illustration of Sensing Capacity Bound | |
Extensions to other Sensor Network Models | |
Models with Localized Sensing | |
Target Models | |
Discussion and Open Problems | |
Bibliography | |
Law of Sensor Network Lifetime and Its Applications | |
Introduction | |
Law of Network Lifetime and General Design Principle | |
Network characteristics and lifetime definition | |
Law of lifetime | |
Ageneraldesignprinciplefor lifetimemaximization | |
Fundamental Performance Limit: A Stochastic Shortest Path Framework | |
Problemstatement | |
SSPformulation | |
Fundamental performance limit on network lifetime | |
Computing the limiting performance with polynomial complexity in networksize | |
Distributed Asymptotically Optimal Transmission Scheduling | |
Dynamicprotocol for lifetimemaximization | |
Dynamicnature of DPLM | |
Asymptotic optimality of DPLM | |
Distributedimplementation | |
Simulationstudies | |
ABrief Overview of Network Lifetime Analysis | |
Conclusion | |
Bibliography | |
Detection in Sensor Networks | |
Centralized Detection | |
The Classical Decentralized Detection Framework | |
Asymptotic Regime | |
Decentralized Detection in Wireless Sensor Networks | |
Sensor Nodes | |
Network Architectures | |
Data Processing | |
Wireless Sensor Networks | |
Detection under Capacity Constraint | |
Wireless Channel Considerations | |
Correlated Observations | |
Attenuationand Fading | |
New Paradigms | |
Constructive Interference | |
Message Passing | |
Cross-Layer Considerations | |
Energy Savings via Censoringand Sleeping | |
Extensions and Generalizations | |
Discussion and Concluding Remarks | |
Bibliography | |
Distributed Estimation Under Bandwidth and Energy Constraints | |
DistributedQ | |
Table of Contents provided by Publisher. All Rights Reserved. |
The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any access cards, study guides, lab manuals, CDs, etc.
The Used, Rental and eBook copies of this book are not guaranteed to include any supplemental materials. Typically, only the book itself is included. This is true even if the title states it includes any access cards, study guides, lab manuals, CDs, etc.