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
Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maximizing lifetime for data aggregation in wireless sensor networks
Mobile Networks and Applications
A survey of communication/networking in Smart Grids
Future Generation Computer Systems
RETRACTED: Impacts of sensor node distributions on coverage in sensor networks
Journal of Parallel and Distributed Computing
Improved minimum latency aggregation scheduling in wireless sensor networks under the SINR model
International Journal of Sensor Networks
Hi-index | 0.00 |
We consider the problem of maximising the lifetime of sensor networks with data aggregation, which was previously investigated by Kalpakis et al. (2003). They propose an exact polynomial-time algorithm, which is however very slow, and faster heuristics, where an approximation ratio is not guaranteed. In this paper, we demonstrate an alternative approach based on the Garg and Konemann (1998) algorithm for packing linear programs, combined with the exact computation of minimum cost arborescence. For any ε > 0, our approach obtains a solution achieving at least 1-ε times the optimum lifetime with significantly faster running time than that of the exact algorithm. The simulation result also shows that our algorithm achieves a solution that is within 0.02% of optimum and is not slower than the heuristics previously proposed by Kalpakis et al. (2003).