Terahertz Multiple Access: A Deep Reinforcement Learning Controlled Multihop IRS Topology
<p dir="ltr">We explore THz communication uplink multi-access with multi-hop Intelligent reflecting surfaces (IRSs) under correlated channels. Our aims are twofold: 1) enhancing the data rate of a desired user while dealing with interference from another user and 2) maximizing the co...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , , , , , |
| منشور في: |
2024
|
| الموضوعات: | |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| الملخص: | <p dir="ltr">We explore THz communication uplink multi-access with multi-hop Intelligent reflecting surfaces (IRSs) under correlated channels. Our aims are twofold: 1) enhancing the data rate of a desired user while dealing with interference from another user and 2) maximizing the combined data rate. Both tasks involve non-convex optimization challenges. For the first aim, we devise a sub-optimal analytical approach that focuses on maximizing the desired user’s received power, leading to an over-determined system. We also attempt to use approximate solutions utilizing pseudo-inverse (P<sub><em>i</em></sub><sub><em>n</em></sub><sub><em>v</em></sub>) and block solution <i>(</i><i>B</i><i>L</i><i>S</i><i>)</i> based methods. For the second aim, we establish a loose upper bound and employ an exhaustive search <i>(</i><i>E</i><i>S</i><i>)</i> . We employ deep reinforcement learning (DRL) to address both aims, demonstrating its effectiveness in complex scenarios. DRL outperforms mathematical approaches for the first aim, with the performance improvement of DDPG over the block solution ranging from 8% to 57.12%, and over the pseudo-inverse ranging from 41% to 190% for a correlation-factor equal to 1. Moreover, DRL closely approximates the <i>E</i><i>S</i><i> </i>for the second aim. Furthermore, our findings show that as channel correlation increases, DRL’s performance improves, capitalizing on the correlation for enhanced statistical learning</p><h2>Other Information</h2><p dir="ltr">Published in: IEEE Open Journal of the Communications Society<br>License: <a href="https://creativecommons.org/licenses/by/4.0/deed.en" target="_blank">https://creativecommons.org/licenses/by/4.0/</a><br>See article on publisher's website: <a href="https://dx.doi.org/10.1109/ojcoms.2024.3357701" target="_blank">https://dx.doi.org/10.1109/ojcoms.2024.3357701</a></p> |
|---|