Elements of information theory
Elements of information theory
Power-aware routing in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Wireless integrated network sensors
Communications of the ACM
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
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Directed diffusion for wireless sensor networking
IEEE/ACM Transactions on Networking (TON)
Simultaneous optimization for concave costs: single sink aggregation or single source buy-at-bulk
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Energy-Efficient Communication Protocol for Wireless Microsensor Networks
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 8 - Volume 8
Backcasting: adaptive sampling for sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Universal distributed sensing via random projections
Proceedings of the 5th international conference on Information processing in sensor networks
Designing routes for source coding with explicit side information in sensor networks
IEEE/ACM Transactions on Networking (TON)
Data acquisition through joint compressive sensing and principal component analysis
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Hi-index | 0.00 |
Two difficulties in designing data-centric routes [2,3,4,5] in wireless sensor networks are the lack of reasonably practical data aggregation models and the high computational complexity resulting from the coupling of routing and in-network data fusion. In this paper, we study combined routing and source coding with explicit side information in wireless sensor networks. Our data aggregation model is built upon the observation that in many physical situations the side information that provides the most coding gain comes from a small number of nearby sensors. Based on this model, we propose a routing strategy that separately routes the explicit side information to achieve data compression and cost minimization. The overall optimization problem is NP hard since it has the minimum Steiner tree as a subproblem. We propose a suboptimal algorithm based on maximum weight branching and the shortest path heuristic for the Steiner tree problem. The worst case and average performances of the algorithm are studied through analysis and simulation.