To meet the requirements of various emerging manufacturing applications, multiple Industrial Wireless Networks (IWNs) are employed to operate in the same region. However, the limited communication resources inevitably incur interference in the time and frequency domains, which is known as the coexistence problem. Existing centralized mechanisms suffer from a low computational efficiency in a large-scale network scenario, and the globally shared information cannot be fully obtained in practice. To this end, we first design an incomplete information sharing protocol to clarify the decentralized coordination among coexisting IWNs. We then formulate the coexistence problem as a non-cooperative game, which is proven to be a potential game. In addition, considering the deterministic deadlines of data transmissions in industrial applications, we propose a Deadline-aware Incomplete-Information-based Decentralized Resource Coordination (DIIDRC) algorithm. We also mathematically analyze that the DIIDRC algorithm converges to a collision-free optimal schedule in a resource-sufficient scenario or a nearly-optimal schedule in a resource-insufficient scenario. We conduct extensive simulations to verify the effectiveness of the DIIDRC algorithm. Evaluation results show that the DIIDRC algorithm has obvious superiorities over existing works in terms of the convergence rate and schedulable ratio.

中文翻译：

---

共存 IWN 中分散资源协调的潜在博弈方法


为了满足各种新兴制造应用的要求，在同一区域采用多个工业无线网络（IWN）运行。然而，有限的通信资源不可避免地会产生时域和频域的干扰，这就是所谓的共存问题。现有的中心化机制在大规模网络场景下计算效率较低，并且在实践中无法充分获得全局共享的信息。为此，我们首先设计了一个不完整的信息共享协议，以阐明共存的 IWN 之间的去中心化协调。然后，我们将共存问题表述为非合作博弈，这被证明是一个潜在的博弈。此外，考虑到工业应用中数据传输的确定性截止日期，我们提出了一种基于截止日期的不完整信息的去中心化资源协调（DIIDRC）算法。我们还从数学角度分析了 DIIDRC 算法在资源充足的情况下收敛到无冲突的最优调度，或者在资源不足的情况下收敛到接近最优的调度。我们进行了大量的模拟来验证 DIIDRC 算法的有效性。评估结果表明，DIIDRC算法在收敛速度和可调度率方面比现有作品具有明显的优越性。