非对称传感器网络中的干扰最小化
Interference Minimization in Asymmetric Sensor Networks
摘要:
无线传感器网络中的一个基本问题是连接一组给定的传感器,同时最小化\emph{receiver interference}。这被建模如下:每个传感器节点对应于$\mathbb{R}^d$中的点,并且每个\emph{transmission range}对应于球。传感器节点的接收机干扰定义为它所处的传输范围的数量。我们的目标是选择传输半径,最大限度地减少干扰,同时保持强连接的非对称通信图。对于二维的情况下,我们表明,它是NP-完全的,以决定是否可以实现接收机干扰最多$5$。在一维的情况下,我们证明了存在最优解与非平凡的结构特性。利用这些性质可以获得在准多项式时间内运行的精确算法。这将Tan等人的结果推广到了非对称情形。
英文摘要:
A fundamental problem in wireless sensor networks is to connect a given set of sensors while minimizing the \emph{receiver interference}. This is modeled as follows: each sensor node corresponds to a point in $\mathbb{R}^d$ and each \emph{transmission range} corresponds to a ball. The receiver interference of a sensor node is defined as the number of transmission ranges it lies in. Our goal is to choose transmission radii that minimize the maximum interference while maintaining a strongly connected asymmetric communication graph. For the two-dimensional case, we show that it is NP-complete to decide whether one can achieve a receiver interference of at most $5$. In the one-dimensional case, we prove that there are optimal solutions with nontrivial structural properties. These properties can be exploited to obtain an exact algorithm that runs in quasi-polynomial time. This generalizes a result by Tan et al. to the asymmetric case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。