Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks

DOI10.1287/ijoc.2022.1175OpenAlexW4220723787WikidataQ114058182 ScholiaQ114058182MaRDI QIDQ5106396

Marco Casazza, Alberto Ceselli

Publication date: 19 September 2022

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

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

zbMATH Keywords

energy conservationspanning treeexact algorithmssensor networksdata aggregation

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Uses Software

• CPLEX
• GitHub
• BranchBoundforWSN

Cites Work

• An exact approach to extend network lifetime in a general class of wireless sensor networks
• Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints
• A Branch-and-Bound Algorithm for Building Optimal Data Gathering Tree in Wireless Sensor Networks
• Benchmarking optimization software with performance profiles.

This page was built for publication: Exact Algorithms for Maximum Lifetime Data-Gathering Tree in Wireless Sensor Networks