关于SINR模型中一致功率连通性的注记
A note on uniform power connectivity in the SINR model
摘要:
在本文中,我们研究了信号干扰加噪声比(SINR)模型下的无线网络的连通性问题。给定一组分布在某个区域的无线电发射机,我们试图建立一个有向强连通通信图,并计算该图的边染色,使得每个颜色类中的发射机-接收机对可以同时通信。根据干扰模型,需要对应于频率或时隙数量的更多或更少的颜色。我们考虑SINR模型,该模型将接收器处的信号的接收功率与其他信号的强度加上环境噪声的总和进行比较。信号的强度被假定为随与发送者的距离多项式地衰减,这取决于所谓的路径损耗指数$α$。我们表明,当所有的发射机使用相同的功率,所需的颜色的数量是恒定的,在一维网格,如果$α>1$以及在二维网格,如果$α>2$。对于较小的路径损耗指数和二维网格,我们证明了上界和下界的顺序$\mathcal{O}(\log n)$和$Ω(\log n/\log\log n)$ $α=2$和$Θ(n^{2/α-1})$ $α<2$分别。如果节点在$[0,1]$区间上随机均匀分布,则$\mathcal{O}(\log n)$颜色的\emph{regular}着色保证连通性,而任何着色都需要$Ω(\log \log n)$颜色。
英文摘要:
In this paper we study the connectivity problem for wireless networks under the Signal to Interference plus Noise Ratio (SINR) model. Given a set of radio transmitters distributed in some area, we seek to build a directed strongly connected communication graph, and compute an edge coloring of this graph such that the transmitter-receiver pairs in each color class can communicate simultaneously. Depending on the interference model, more or less colors, corresponding to the number of frequencies or time slots, are necessary. We consider the SINR model that compares the received power of a signal at a receiver to the sum of the strength of other signals plus ambient noise . The strength of a signal is assumed to fade polynomially with the distance from the sender, depending on the so-called path-loss exponent $α$. We show that, when all transmitters use the same power, the number of colors needed is constant in one-dimensional grids if $α>1$ as well as in two-dimensional grids if $α>2$. For smaller path-loss exponents and two-dimensional grids we prove upper and lower bounds in the order of $\mathcal{O}(\log n)$ and $Ω(\log n/\log\log n)$ for $α=2$ and $Θ(n^{2/α-1})$ for $α<2$ respectively. If nodes are distributed uniformly at random on the interval $[0,1]$, a \emph{regular} coloring of $\mathcal{O}(\log n)$ colors guarantees connectivity, while $Ω(\log \log n)$ colors are required for any coloring.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。