TY - GEN
T1 - Optimal Path Selection in Cascaded Intelligent Reflecting Surfaces
AU - Asif, Awais Bin
AU - Liaskos, Christos
AU - Pitsillides, Andreas
AU - Qureshi, Hassaan Khaliq
AU - Lestas, Marios
N1 - Publisher Copyright:
© 2022 IEEE.
PY - 2022
Y1 - 2022
N2 - Metasurfaces constitute a revolutionary technology for the realization of intelligent reflecting surfaces (IRS) which can alleviate the blockage problem in mmWave and Thz communications in the absence of Line of Sight (LOS). In this work, we consider the use of multiple IRSs to provide LOS paths between a sender and a receiver via reflection. Unlike previous work, we use the directivity as a means to incorporate the metasurface reflection behavior in the channel model and parameterize with respect to the design parameters. The design problem considered is the choice of the 'best' IRSs for consecutive reflection of the transmitted signal to optimize the communication channel. The problem is formulated as an optimization problem which is challenging to solve due to the dependence of each link cost on the previous link. We consider a relaxation which decouples the link costs, we apply Dijkstra's algorithm for the solution and we show that the performance degradation as compared to the original problem which is solved using exhaustive search is not significant.
AB - Metasurfaces constitute a revolutionary technology for the realization of intelligent reflecting surfaces (IRS) which can alleviate the blockage problem in mmWave and Thz communications in the absence of Line of Sight (LOS). In this work, we consider the use of multiple IRSs to provide LOS paths between a sender and a receiver via reflection. Unlike previous work, we use the directivity as a means to incorporate the metasurface reflection behavior in the channel model and parameterize with respect to the design parameters. The design problem considered is the choice of the 'best' IRSs for consecutive reflection of the transmitted signal to optimize the communication channel. The problem is formulated as an optimization problem which is challenging to solve due to the dependence of each link cost on the previous link. We consider a relaxation which decouples the link costs, we apply Dijkstra's algorithm for the solution and we show that the performance degradation as compared to the original problem which is solved using exhaustive search is not significant.
KW - Cascaded Metasurfaces
KW - IRS
KW - Routing
KW - mmWave
UR - http://www.scopus.com/inward/record.url?scp=85146982107&partnerID=8YFLogxK
U2 - 10.1109/VTC2022-Fall57202.2022.10012750
DO - 10.1109/VTC2022-Fall57202.2022.10012750
M3 - Conference contribution
AN - SCOPUS:85146982107
T3 - IEEE Vehicular Technology Conference
BT - 2022 IEEE 96th Vehicular Technology Conference, VTC 2022-Fall 2022 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 96th IEEE Vehicular Technology Conference, VTC 2022-Fall 2022
Y2 - 26 September 2022 through 29 September 2022
ER -