arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2408.14633cs.DScs.CCcs.DM
收藏

通过图的1-可扩展性重新审视信道分配

Channel allocation revisited through 1-extendability of graphs

Anthony Busson, Malory Marin, Rémi Watrigant

AI总结:

本文重新审视Wi-Fi接入点的信道分配问题,引入1-可扩展色数以最小化顶点集划分,使每部分导出1-可扩展图,并从算法复杂度、模分解、余图准多项式时间计算及极值性质等多角度研究该参数。

摘要:

我们重新审视了Wi-Fi接入点(AP)的经典信道分配问题。通过CSMA/CA协议等机制,在同一信道上存在冲突的Wi-Fi接入点仍然能够与终端通信。用图论术语来说,这意味着信道分配不一定要对应于冲突图的正常着色。然而,最近的研究表明,冲突的结构——而非冲突的数量——对每个AP的性能起着至关重要的作用。更确切地说,每个信道所导出的图必须满足所谓的1-可扩展性(1-extendability)性质,该性质要求每个顶点都包含在一个具有最大基数的独立集中。在本文中,我们引入了1-可扩展色数,即将图的顶点集划分为若干部分的最小数量,使得每个部分导出一个1-可扩展图。我们从不同角度研究了该参数及相关优化问题:算法与复杂度、结构以及极值性质。我们首先展示了如何使用图的模分解来计算该数值,并分析了关于输入图模宽度的运行时间。我们还关注了余图(cographs)的特殊情况,并证明了在该图类中,1-可扩展色数可以在准多项式时间内计算得出。关于极值结果,我们证明了具有n个顶点的图的1-可扩展色数最多为2√n,而经典色数可以大到n。我们还能构造出其1-可扩展色数至少为顶点数量的对数级的图。

英文摘要:

We revisit the classical problem of channel allocation for Wi-Fi access points (AP). Using mechanisms such as the CSMA/CA protocol, Wi-Fi access points which are in conflict within a same channel are still able to communicate to terminals. In graph theoretical terms, it means that it is not mandatory for the channel allocation to correspond to a proper coloring of the conflict graph. However, recent studies suggest that the structure -- rather than the number -- of conflicts plays a crucial role in the performance of each AP. More precisely, the graph induced by each channel must satisfy the so-called $1$-extendability property, which requires each vertex to be contained in an independent set of maximum cardinality. In this paper we introduce the 1-extendable chromatic number, which is the minimum size of a partition of the vertex set of a graph such that each part induces a 1-extendable graph. We study this parameter and the related optimization problem through different perspectives: algorithms and complexity, structure, and extremal properties. We first show how to compute this number using modular decompositions of graphs, and analyze the running time with respect to the modular width of the input graph. We also focus on the special case of cographs, and prove that the 1-extendable chromatic number can be computed in quasi-polynomial time in this class. Concerning extremal results, we show that the 1-extendable chromatic number of a graph with $n$ vertices is at most $2\sqrt{n}$, whereas the classical chromatic number can be as large as $n$. We are also able to construct graphs whose 1-extendable chromatic number is at least logarithmic in the number of vertices.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑