Capacity-Maximizing Dynamic User Association in Double RIS-Aided Broadcast Networks
Fuente:
arXiv
Salvato in:
| Autore principale: | |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2024
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866916595341721600 |
|---|---|
| author | Vahid, Alireza |
| author_facet | Vahid, Alireza |
| contents | We introduce an information-theoretic framework to dynamically pair up different reconfigurable intelligent surfaces (RISs) with wireless users with goal of maximizing the fundamental network capacity. We focus on a double RIS-aided broadcast packet network with two users. We show using a dynamic RIS-user association and an opportunistic protocol, the network capacity could be significantly enhanced and superior to other benchmarks with static associations. The results include new outer-bounds on network capacity and their achievability. We discuss the optimal RIS-user association. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2405_18546 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Capacity-Maximizing Dynamic User Association in Double RIS-Aided Broadcast Networks Vahid, Alireza Information Theory We introduce an information-theoretic framework to dynamically pair up different reconfigurable intelligent surfaces (RISs) with wireless users with goal of maximizing the fundamental network capacity. We focus on a double RIS-aided broadcast packet network with two users. We show using a dynamic RIS-user association and an opportunistic protocol, the network capacity could be significantly enhanced and superior to other benchmarks with static associations. The results include new outer-bounds on network capacity and their achievability. We discuss the optimal RIS-user association. |
| title | Capacity-Maximizing Dynamic User Association in Double RIS-Aided Broadcast Networks |
| topic | Information Theory |
| url | https://arxiv.org/abs/2405.18546 |