We consider the link scheduling problem in wireless mesh networks for capacity maximization. Unlike all previous approaches, ours views capacity in terms of covering a graph’s edges by matchings that are feasible in the sense of the physical interference model, thus leading to a novel fractional edge-chromatic indicator of the graph. Network capacity is then defined as a function of this indicator, whose exact computation can be formulated as a linear programming problem. Solving this problem for an extensive collection of random geometric graphs that instantiate networks in the physical interference model reveals that, depending on node density, often a network admits increased capacity by virtue of simply scheduling links based on fractional, rather than integer, edge coloring. This settles a heretofore unaddressed issue in the physical interference model.

中文翻译：

---

通过分数边缘着色在物理干扰模型中调度无线链路

我们考虑无线网状网络中的链路调度问题以实现容量最大化。与之前的所有方法不同，我们的方法是通过在物理干扰模型意义上可行的匹配来覆盖图的边缘来看待容量，从而导致图的一种新颖的分数边色指标。然后将网络容量定义为该指标的函数，其精确计算可以表述为线性规划问题。为在物理干扰模型中实例化网络的大量随机几何图解决这个问题表明，根据节点密度，网络通常通过基于分数而不是整数边缘着色简单地调度链路来增加容量。