Scheduling for Downlink OFDMA With IRS Reconfiguration Constraints
Fuente:
arXiv
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866913187692019712 |
|---|---|
| author | Rech, Alberto Badia, Leonardo Tomasin, Stefano |
| author_facet | Rech, Alberto Badia, Leonardo Tomasin, Stefano |
| contents | The technical limitations of the intelligent reflecting surface (IRS) (re)configurations in terms of both communication overhead and energy efficiency must be considered when IRSs are used in cellular networks. In this paper, we investigate the downlink time-frequency scheduling of an IRS-assisted multi-user system in the orthogonal frequency-division multiple access (OFDMA) framework wherein both the set of possible IRS configurations and the number of IRS reconfigurations within a time frame are limited. We formulate the sum rate maximization problem as a non-polynomial (NP)-complete generalized multi-knapsack problem. A heuristic greedy algorithm for the joint IRS configuration and time-frequency scheduling is also proposed. Numerical simulations prove the effectiveness of our greedy solution. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2401_03062 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Scheduling for Downlink OFDMA With IRS Reconfiguration Constraints Rech, Alberto Badia, Leonardo Tomasin, Stefano Information Theory Networking and Internet Architecture Signal Processing The technical limitations of the intelligent reflecting surface (IRS) (re)configurations in terms of both communication overhead and energy efficiency must be considered when IRSs are used in cellular networks. In this paper, we investigate the downlink time-frequency scheduling of an IRS-assisted multi-user system in the orthogonal frequency-division multiple access (OFDMA) framework wherein both the set of possible IRS configurations and the number of IRS reconfigurations within a time frame are limited. We formulate the sum rate maximization problem as a non-polynomial (NP)-complete generalized multi-knapsack problem. A heuristic greedy algorithm for the joint IRS configuration and time-frequency scheduling is also proposed. Numerical simulations prove the effectiveness of our greedy solution. |
| title | Scheduling for Downlink OFDMA With IRS Reconfiguration Constraints |
| topic | Information Theory Networking and Internet Architecture Signal Processing |
| url | https://arxiv.org/abs/2401.03062 |