论文标题
最小化不对称传感器网络的总干扰
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.
