Scholarlink

<p>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.</p>

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Finding Minimum Cost Data Collection Tree with Aggregation

  • 期刊论文

  • 出版模式：

    开放获取

  • 发表日期：

    2025年5月20日

查看全文
  • Ihor Rusnak,
  • Michael Segal

摘要

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.