Consider a wireless network where each communication link has a minimum bandwidth quality-of-service requirement. Certain pairs of wireless links interfere with each other due to being in the same vicinity, and this interference is modeled by a conflict graph. Given the conflict graph and link bandwidth requirements, the objective is to determine, using only localized information, whether the demands of all the links can be satisfied. At one extreme, each node knows the demands of only its neighbors; at the other extreme, there exists an optimal, centralized scheduler that has global information. The present work interpolates between these two extremes by quantifying the tradeoff between the degree of decentralization and the performance of the distributed algorithm. This open problem is resolved for the primary interference model, and the following general result is obtained: if each node knows the demands of all links in a ball of radius $d$ centered at the node, then there is a distributed algorithm whose performance is away from that of an optimal, centralized algorithm by a factor of at most ${{ (2d+3)}}/{{ (2d+2)}}$ . The tradeoff between performance and complexity of the distributed algorithm is also analyzed. It is shown that for line networks under the protocol interference model, the row constraints are a factor of at most 3 away from optimal. Both bounds are best possible.

中文翻译：

---

无线Ad Hoc网络中QoS分布式算法的性能保证。

考虑一个无线网络，其中每个通信链路具有最低带宽服务质量要求。某些成对的无线链路由于在同一附近而彼此干扰，并且此冲突由冲突图建模。给定冲突图和链路带宽要求，目标是仅使用局部信息来确定是否可以满足所有链路的要求。在一个极端情况下，每个节点仅知道其邻居的需求。在另一个极端，存在具有全局信息的最佳，集中式调度程序。通过量化分散程度和分布式算法性能之间的折衷，当前工作在这两个极端之间进行插值。对于主要干扰模型，已经解决了这个开放问题， $ d $ 然后以该节点为中心，存在一种分布式算法，其性能与最佳集中式算法的性能相差最大为 $ {{（2d + 3）}} / {{（2d + 2）}} $ 。还分析了分布式算法的性能和复杂性之间的权衡。结果表明，对于协议干扰模型下的线路网络，行约束距离最佳值最多3倍。两个界限都是最好的。