最小化非对称传感器网络中的总干扰
Minimizing Total Interference in Asymmetric Sensor Networks
摘要：
计算具有最小干扰的连通网络的问题是无线传感器网络中的一个基本问题。在文献中已经研究了几种干扰模型。最常见的模型是以接收机为中心的模型，其中节点$p$的干扰被定义为传输范围覆盖$p$的其他节点的数量。在本文中，我们研究的问题，分配一个传输范围，每个传感器，这样产生的网络是强连接和网络的总干扰最小化。对于一维的情况下，我们展示了如何在$O(n^3)$时间内最佳地解决问题。对于二维情形，我们证明了该问题是NP-完全的，并给出了该问题的多项式时间2-近似算法。
英文摘要：
The problem of computing a connected network with minimum interference is a fundamental problem in wireless sensor networks. Several models of interference have been studied in the literature. The most common model is the receiver-centric, in which the interference of a node $p$ is defined as the number of other nodes whose transmission range covers $p$. In this paper, we study the problem of assigning a transmission range to each sensor, such that the resulting network is strongly connected and the total interference of the network is minimized. For the one-dimensional case, we show how to solve the problem optimally in $O(n^3)$ time. For the two-dimensional case, we show that the problem is NP-complete and give a polynomial-time 2-approximation algorithm for the problem.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
