In this paper, the joint access point (AP) association and transmission time allocation problem in densely deployed multirate WLANs based on time sharing medium access control (MAC) is considered. In our study, the centralized coordinated joint AP association and transmission time allocation problem with heterogeneous station (STA) throughput demands is first formulated as an NP-hard single non-zero programming (SNZP) optimization problem with proportionally fair (PF) throughput based objective function. To solve the NP-hard SNZP problem, two novel algorithms, the SNZP relaxation (SNZPR) algorithm and the iterative SNZPR (iSNZPR) algorithm, are proposed. The property and complexity of the proposed algorithms are analyzed. In addition, for dynamic network scenarios where there are new STAs arriving at and trying to join the network, a distributed joint admission, AP association and transmission time allocation (DAAA) algorithm is proposed to determine whether to admit a new STA arriving at the network or not. The performance of the proposed algorithms is then investigated and compared with that of some existing algorithms based on numerical results.

中文翻译：

---

WLAN 中基于吞吐量优化的联合接入点关联和传输时间分配


本文考虑了基于分时媒体访问控制（MAC）的密集部署的多速率WLAN中的联合接入点（AP）关联和传输时间分配问题。在我们的研究中，具有异构站（STA）吞吐量需求的集中协调联合AP关联和传输时间分配问题首先被表述为具有基于比例公平（PF）吞吐量目标的NP难单非零规划（SNZP）优化问题功能。为了解决NP-hard SNZP问题，提出了两种新颖的算法：SNZP松弛（SNZPR）算法和迭代SNZPR（iSNZPR）算法。分析了所提出算法的性质和复杂性。此外，针对有新的STA到达并尝试加入网络的动态网络场景，提出了分布式联合准入、AP关联和传输时间分配（DAAA）算法来确定是否准许新的STA到达网络或不。然后根据数值结果研究所提出的算法的性能并与一些现有算法的性能进行比较。