Joint Access Point Placement and Power-Channel-Resource-Unit Assignment for IEEE 802.11ax-Based Dense WiFi Network With QoS Requirements
| العنوان: | Joint Access Point Placement and Power-Channel-Resource-Unit Assignment for IEEE 802.11ax-Based Dense WiFi Network With QoS Requirements |
|---|---|
| المؤلفون: | Yiu-Wing Leung, Shuwei Qiu, Joseph Kee-Yin Ng, Xiaowen Chu |
| المصدر: | IEEE Transactions on Mobile Computing. 22:2771-2788 |
| بيانات النشر: | Institute of Electrical and Electronics Engineers (IEEE), 2023. |
| سنة النشر: | 2023 |
| مصطلحات موضوعية: | Computer Networks and Communications, Computer science, business.industry, Quality of service, ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS, Fault tolerance, Interference (wave propagation), IEEE 802.11ax, Power (physics), Point (geometry), Electrical and Electronic Engineering, business, Greedy algorithm, Throughput (business), Software, Computer network |
| الوصف: | IEEE 802.11ax is the standard for the new generation WiFi networks. In this paper, we formulate the problem of joint access point (AP) placement and power-channel-resource unit assignment for 802.11ax-based dense WiFi. The objective is to minimize the number of APs. Two quality-of-service (QoS) requirements are to be fulfilled: (1) a two-tier throughput requirement which ensures that the throughput of each station is good enough, and (2) a fault tolerance requirement which ensures that the stations could still use WiFi even when some APs fail. We prove that this problem is NP-hard. To tackle this problem, we first develop an analytic model to derive the throughput of each station under the OFDMA mechanism and a widely used interference model. We then design a heuristic algorithm to find high-quality solutions with polynomial time complexity. Simulation results under both fixed-user and mobile-user cases show that: (1) when the area is small (50 x 50 m2), our algorithm gives the optimal solutions; when the area is larger (80 x 60 m2), our algorithm can reduce the number of APs by 34.9-87.7% as compared to the Random and Greedy algorithms. (2) Our algorithm can always get feasible solutions that fulfill the QoS requirements. |
| تدمد: | 2161-9875 1536-1233 |
| الوصول الحر: | https://explore.openaire.eu/search/publication?articleId=doi_________::fd6aea2855c5b56cd304da98d0b0d139Test https://doi.org/10.1109/tmc.2021.3129596Test |
| حقوق: | CLOSED |
| رقم الانضمام: | edsair.doi...........fd6aea2855c5b56cd304da98d0b0d139 |
| قاعدة البيانات: | OpenAIRE |
| تدمد: | 21619875 15361233 |
|---|