Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Balancing minimum spanning and shortest path trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Balancing Steiner trees and shortest path trees online
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Energy-Scalable Protocols for Battery-Operated MicroSensor Networks
Journal of VLSI Signal Processing Systems - Special issue on signal processing systems design and implementation
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
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
The Impact of Data Aggregation in Wireless Sensor Networks
ICDCSW '02 Proceedings of the 22nd International Conference on Distributed Computing Systems
The Access Network Design Problem
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Cost-distance: two metric network design
FOCS '00 Proceedings of the 41st 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
Impact of Network Density on Data Aggregation in Wireless Sensor Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
The impact of spatial correlation on routing with compression in wireless sensor networks
Proceedings of the 3rd international symposium on Information processing in sensor networks
Gathering correlated data in sensor networks
Proceedings of the 2004 joint workshop on Foundations of mobile computing
Routing Correlated Data with Fusion Cost in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Distributed source coding using syndromes (DISCUS): design and construction
IEEE Transactions on Information Theory
Scalable data aggregation for dynamic events in sensor networks
Proceedings of the 4th international conference on Embedded networked sensor systems
Efficient aggregation using first hop selection in WSNs
International Journal of Sensor Networks
An online energy-efficient routing protocol with traffic load prospects in wireless sensor networks
International Journal of Sensor Networks
Utility-based data-gathering in wireless sensor networks with unstable links
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Adaptive data collection in sensor networks
WD'09 Proceedings of the 2nd IFIP conference on Wireless days
| Hi-index | 0.00 |
While in-network data fusion can reduce data redundancy and hence curtail network load, the fusion process itself may introduce significant energy consumption for emerging wireless sensor networks with vectorial data. Therefore, fusion-driven routing protocols for sensor networks cannot optimize over communication cost only -- fusion cost must also be accounted for. Towards this end, we design a novel routing algorithm, called Adaptive Fusion Steiner Tree (AFST), for energy efficient data gathering in sensor networks that jointly optimizes over the costs for data transmission and data fusion. Furthermore, AFST evaluates the benefit and cost of data fusion along information routes and adaptively adjusts whether fusion shall be performed. Analytically and experimentally, we show that AFST achieves better performance than existing algorithms including SLT, MFST, and SPT.