Finding Minimum Cost Data Collection Tree with Aggregation

Ihor Rusnak and Michael Segal ()
Additional contact information
Ihor Rusnak: Ben-Gurion University of the Negev
Michael Segal: Ben-Gurion University of the Negev

Journal of Optimization Theory and Applications, 2025, vol. 206, issue 1, No 19, 12 pages

Abstract: Abstract In this paper we consider a special case of building a minimum cost data aggregation tree problem raised in the context of wireless sensor networks, when the sensors correspond to the nodes in the two-dimensional plane, and the distances between nodes are measured according to the (squared) Euclidean norm. We show that the problem is NP-hard for the general metric case and provide a number of approximation algorithms for this problem based on the concept of Dijkstra’s cheapest paths tree, Bounded-Hop Diameter Tree and Hamiltonian Cycle construction.

Keywords: Data aggregation; Routing tree; Dijkstra tree; Bounded hop diameter tree (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10957-025-02715-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:joptap:v:206:y:2025:i:1:d:10.1007_s10957-025-02715-3

Ordering information: This journal article can be ordered from
http://www.springer. ... cs/journal/10957/PS2

DOI: 10.1007/s10957-025-02715-3

Access Statistics for this article

Journal of Optimization Theory and Applications is currently edited by Franco Giannessi and David G. Hull

More articles in Journal of Optimization Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().