Robustness vs. efficiency in sensor networks
IPSN '05 Proceedings of the 4th international symposium on Information processing in sensor networks
Study of an energy efficient multi rate scheme for wireless sensor network MAC protocol
Proceedings of the 2nd ACM international workshop on Quality of service & security for wireless and mobile networks
High-rate quantization and transform coding with side information at the decoder
Signal Processing - Special section: Distributed source coding
IEEE Transactions on Signal Processing
Energy planning for progressive estimation in multihop sensor networks
IEEE Transactions on Signal Processing
Optimal rate allocation in successively structured Gaussian CEO problem
IEEE Transactions on Wireless Communications
Cross-layer multirate interaction with distributed source coding in wireless sensor networks
IEEE Transactions on Wireless Communications
Distributed MIMO receiver: achievable rates and upper bounds
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
ACM Transactions on Sensor Networks (TOSN)
To sort or not to sort: optimal sensor scheduling for successive compress-and-estimate encoding
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
IEEE Transactions on Information Theory
Random field estimation with delay-constrained and delay-tolerant wireless sensor networks
EURASIP Journal on Wireless Communications and Networking - Special issue on signal processing-assisted protocols and algorithms for cooperating objects and wireless sensor networks
Hi-index | 0.26 |
We develop coding strategies for estimation under communication constraints in tree-structured sensor networks. The strategies have a modular and decentralized architecture. This promotes the flexibility, robustness, and scalability that wireless sensor networks need to operate in uncertain, changing, and resource-constrained environments. The strategies are based on a generalization of Wyner-Ziv source coding with decoder side information. We develop solutions for general trees, and illustrate our results in serial (pipeline) and parallel (hub-and-spoke) networks. Additionally, the strategies can be applied to other network information theory problems. They have a successive coding structure that gives an inherently less complex way to attain a number of prior results, as well as some novel results, for the Chief Executive Officer problem, multiterminal source coding, and certain classes of relay channels.