Elements of information theory
Elements of information theory
Online power-aware routing in wireless Ad-hoc networks
Proceedings of the 7th annual international conference on Mobile computing and networking
Wireless Communications: Principles and Practice
Wireless Communications: Principles and Practice
Opportunistic media access for multirate ad hoc networks
Proceedings of the 8th annual international conference on Mobile computing and networking
On the interdependence of routing and data compression in multi-hop sensor networks
Proceedings of the 8th annual international conference on Mobile computing and networking
Distributed Source Coding Using Syndromes (DISCUS): Design and Construction
DCC '99 Proceedings of the Conference on Data Compression
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
IEEE Transactions on Wireless Communications
IEEE Transactions on Information Theory
CDMA/HDR: a bandwidth efficient high speed wireless data service for nomadic users
IEEE Communications Magazine
Access control of data in integrated voice/data CDMA systems: benefits and tradeoffs
IEEE Journal on Selected Areas in Communications
Minimum energy mobile wireless networks
IEEE Journal on Selected Areas in Communications
IEEE Journal on Selected Areas in Communications
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
Predictive modeling-based data collection in wireless sensor networks
EWSN'08 Proceedings of the 5th European conference on Wireless sensor networks
On computing compression trees for data collection in wireless sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Hi-index | 0.00 |
In this article, we examine the energy consumption of a set of sensors that transmit correlated information to a base station either directly or in an ad-hoc multihop fashion. Building on a single-hop distributed data rate allocation scheme, we present an efficient approximation algorithm for the NP-hard joint routing and data compression problem whose objective is to maximize the operation lifetime of the sensor networks. We prove that the performance of our algorithm lies within 1/O(log n) of the optimum value where n is the number of sensors. We use simulations to validate our intuitions and provide additional insights on the factors that impact the performance of the approximation scheme. The numerical results show that the proposed scheme performs close to the optimum.