In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For foreign coding we propose the MEGA algorithm which yields a minimum-energy data gathering topology in O (n3) time. We also consider self-coding for which the problem of finding an optimal data gathering tree was recently shown to be NP-complete; with LEGA, we present the first approximation algorithm for this problem with approximation ratio 2(1+ √2 ) and running time O m + n log n.
展开▼
机译:在本文中,我们考虑在传感器网络中的相关数据的节能聚会。我们专注于单输入编码 i>策略,以汇总相关数据。对于外来编码 i>我们提出了Mega算法,其在O (n i> 3)中产生最小能量数据收集拓扑。我们还考虑自编码 sup>,最近发现找到最佳数据收集树的问题是np-complete;通过乐高,我们向近似比2(1+√2)和运行时间O m i> log n 我>。
展开▼