通信半径有界的ad-hoc网络干扰最小化
Minimizing interference in ad-hoc networks with bounded communication radius
摘要：
我们考虑一个拓扑控制问题，在这个问题中，我们给出了一组$n$传感器在平面上，我们想分配一个通信半径给他们每个人。半径分配必须生成强连接的网络并且具有低的基于接收器的干扰（即，我们最小化网络的最大入度）。我们给出了一个算法，产生一个网络与$O(\log Δ)$干扰，其中$Δ$是一个均匀半径的ad-hoc网络的干扰。然后，我们适应建设的情况下，没有传感器可以有一个通信半径大于$R_{\min}$，需要获得连接的最小值。我们还表明，$\log Δ$干扰是必要的，在某些情况下，使我们的算法渐近最优。
英文摘要：
We consider a topology control problem in which we are given a set of $n$ sensors in the plane and we would like to assign a communication radius to each of them. The radii assignment must generate a strongly connected network and have low receiver-based interference (i.e., we minimize the largest in-degree of the network). We give an algorithm that generates a network with $O(\log Δ)$ interference, where $Δ$ is the interference of a uniform-radius ad-hoc network. We then adapt the construction to the case in which no sensor can have a communication radius larger than $R_{\min}$, the minimum value needed to obtain connectivity. We also show that $\log Δ$ interference is needed for some instances, making our algorithms asymptotically optimal.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
