Fast Approximation Algorithm for Maximum Lifetime Aggregation Trees in Wireless Sensor Networks

DOI10.1287/ijoc.2015.0688zbMath1348.90610OpenAlexW2367228402MaRDI QIDQ2830947

Shaojie Tang, Xiaobing Wu, Xiaojun Zhu, Chen, Bing, Guihai Chen

Publication date: 1 November 2016

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.2015.0688

zbMATH Keywords

approximation algorithmwireless sensor networksenergy and resource managementin-network processing and aggregation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Approximation methods and heuristics in mathematical programming (90C59)

Related Items (2)

Constant Approximation for the Lifetime Scheduling Problem of p-Percent Coverage ⋮ Exact Algorithms for the Minimum Load Spanning Tree Problem

Cites Work

• Maximizing system lifetime in wireless sensor networks
• Approximating minimum bounded degree spanning trees to within one of optimal
• Worst-case Analysis of Set Union Algorithms
• Approximating the Minimum-Degree Steiner Tree to within One of Optimal

This page was built for publication: Fast Approximation Algorithm for Maximum Lifetime Aggregation Trees in Wireless Sensor Networks