Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Randomized algorithms
Adaptive protocols for information dissemination in wireless sensor networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
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
A two-tier data dissemination model for large-scale wireless 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
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
DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks
IEEE Transactions on Wireless Communications
Distributed source coding using syndromes (DISCUS): design and construction
IEEE Transactions on Information Theory
IEEE Communications Magazine
Energy efficient routing with adaptive data fusion in sensor networks
DIALM-POMC '05 Proceedings of the 2005 joint workshop on Foundations of mobile computing
Adaptive Data Fusion for Energy Efficient Routing in Wireless Sensor Networks
IEEE Transactions on Computers
How smart are our environments? An updated look at the state of the art
Pervasive and Mobile Computing
An ontology-driven ambiguous contexts mediation framework for smart healthcare applications
Proceedings of the 1st international conference on PErvasive Technologies Related to Assistive Environments
Data aggregation in wireless sensor networks using ant colony algorithm
Journal of Network and Computer Applications
Information intensive wireless sensor networks: challenges and solutions
MSN'07 Proceedings of the 3rd international conference on Mobile ad-hoc and sensor networks
Information quality aware routing in event-driven sensor networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
Balancing energy consumption with mobile agents in wireless sensor networks
Future Generation Computer Systems
International Journal of Advanced Pervasive and Ubiquitous Computing
Active node determination for correlated data gathering in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
In this paper, we propose a routing algorithm called Minimum Fusion Steiner Tree (MFST) for energy efficient data gathering with aggregation (fusion) in wireless sensor networks. Different from existing schemes, MFST not only optimizes over the data transmission cost, but also incorporates the cost for data fusion, which can be significant for emerging sensor networks with vectorial data and/or security requirements. By employing a randomized algorithm that allows fusion points to be chosen according to the nodes' data amounts, MFST achieves an approximation ratio of {\frac{5}{4}}\log(k+1), where k denotes the number of source nodes, to the optimal solution for extremely general system setups, provided that fusion cost and data aggregation are nondecreasing against the total input data. Consequently, in contrast to algorithms that only excel in full or nonaggregation scenarios without considering fusion cost, MFST can thrive in a wide range of applications.