Robust IRS-Element Activation for Energy Efficiency Optimization in IRS-Assisted Communication Systems With Imperfect CSI
In this paper, we study an intelligent reflecting surface (IRS)-aided communication system with single-antenna transmitter and receiver, under imperfect channel state information (CSI). More specifically, we deal with the robust selection of binary (on/off) states of the IRS elements in order to max...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2024-06 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Efrem, Christos N Krikidis, Ioannis |
description | In this paper, we study an intelligent reflecting surface (IRS)-aided communication system with single-antenna transmitter and receiver, under imperfect channel state information (CSI). More specifically, we deal with the robust selection of binary (on/off) states of the IRS elements in order to maximize the worst-case energy efficiency (EE), given a bounded CSI uncertainty, while satisfying a minimum signal-to-noise ratio (SNR). In addition, we consider not only continuous but also discrete IRS phase shifts. First, we derive closed-form expressions of the worst-case SNRs, and then formulate the robust (discrete) optimization problems for each case. In the case of continuous phase shifts, we design a dynamic programming (DP) algorithm that is theoretically guaranteed to achieve the global maximum with polynomial complexity \(O(L\,{\log L})\), where \(L\) is the number of IRS elements. In the case of discrete phase shifts, we develop a convex-relaxation-based method (CRBM) to obtain a feasible (sub-optimal) solution in polynomial time \(O(L^{3.5})\), with a posteriori performance guarantee. Furthermore, numerical simulations provide useful insights and confirm the theoretical results. In particular, the proposed algorithms are several orders of magnitude faster than the exhaustive search when \(L\) is large, thus being highly scalable and suitable for practical applications. Moreover, both algorithms outperform a baseline scheme, namely, the activation of all IRS elements. |
doi_str_mv | 10.48550/arxiv.2309.08526 |
format | Article |
fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2309_08526</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2865944153</sourcerecordid><originalsourceid>FETCH-LOGICAL-a956-6efc1229117258f7fa5de474028e42e1a5a03b7939a1a198cf729b29b4e8dc473</originalsourceid><addsrcrecordid>eNotkF1LwzAUhoMgOOZ-gFcGvO7MZ5tcjlK1MBhsAy9LliWasX6YpMP6662rcODAOc85vDwAPGC0ZIJz9Kz8t7ssCUVyiQQn6Q2YEUpxIhghd2ARwgkhRNKMcE5nYNi2hz5EWG53SXE2tWkiXOnoLiq6toG29bBojP8YYGGt0840eoCbLrra_UyIa67HqxBciOYI87au-8bpabsbxmEd4LuLn7CsO-Ot0RHmu_Ie3Fp1Dmbx3-dg_1Ls87dkvXkt89U6UZKnSWqsxoRIjMfAwmZW8aNhGUNEGEYMVlwhesgklQorLIW2GZGHsZgRR80yOgeP09url6rzrlZ-qP78VFc_I_E0EZ1vv3oTYnVqe9-MmSoiUi4Zw5zSXxnPaP4</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2865944153</pqid></control><display><type>article</type><title>Robust IRS-Element Activation for Energy Efficiency Optimization in IRS-Assisted Communication Systems With Imperfect CSI</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Efrem, Christos N ; Krikidis, Ioannis</creator><creatorcontrib>Efrem, Christos N ; Krikidis, Ioannis</creatorcontrib><description>In this paper, we study an intelligent reflecting surface (IRS)-aided communication system with single-antenna transmitter and receiver, under imperfect channel state information (CSI). More specifically, we deal with the robust selection of binary (on/off) states of the IRS elements in order to maximize the worst-case energy efficiency (EE), given a bounded CSI uncertainty, while satisfying a minimum signal-to-noise ratio (SNR). In addition, we consider not only continuous but also discrete IRS phase shifts. First, we derive closed-form expressions of the worst-case SNRs, and then formulate the robust (discrete) optimization problems for each case. In the case of continuous phase shifts, we design a dynamic programming (DP) algorithm that is theoretically guaranteed to achieve the global maximum with polynomial complexity \(O(L\,{\log L})\), where \(L\) is the number of IRS elements. In the case of discrete phase shifts, we develop a convex-relaxation-based method (CRBM) to obtain a feasible (sub-optimal) solution in polynomial time \(O(L^{3.5})\), with a posteriori performance guarantee. Furthermore, numerical simulations provide useful insights and confirm the theoretical results. In particular, the proposed algorithms are several orders of magnitude faster than the exhaustive search when \(L\) is large, thus being highly scalable and suitable for practical applications. Moreover, both algorithms outperform a baseline scheme, namely, the activation of all IRS elements.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2309.08526</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Codes ; Communications systems ; Computer Science - Information Theory ; Dynamic programming ; Energy efficiency ; Mathematical analysis ; Mathematics - Information Theory ; Optimization ; Polynomials ; Robustness (mathematics) ; Signal to noise ratio</subject><ispartof>arXiv.org, 2024-06</ispartof><rights>2024. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27925</link.rule.ids><backlink>$$Uhttps://doi.org/10.1109/TWC.2024.3413022$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.48550/arXiv.2309.08526$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Efrem, Christos N</creatorcontrib><creatorcontrib>Krikidis, Ioannis</creatorcontrib><title>Robust IRS-Element Activation for Energy Efficiency Optimization in IRS-Assisted Communication Systems With Imperfect CSI</title><title>arXiv.org</title><description>In this paper, we study an intelligent reflecting surface (IRS)-aided communication system with single-antenna transmitter and receiver, under imperfect channel state information (CSI). More specifically, we deal with the robust selection of binary (on/off) states of the IRS elements in order to maximize the worst-case energy efficiency (EE), given a bounded CSI uncertainty, while satisfying a minimum signal-to-noise ratio (SNR). In addition, we consider not only continuous but also discrete IRS phase shifts. First, we derive closed-form expressions of the worst-case SNRs, and then formulate the robust (discrete) optimization problems for each case. In the case of continuous phase shifts, we design a dynamic programming (DP) algorithm that is theoretically guaranteed to achieve the global maximum with polynomial complexity \(O(L\,{\log L})\), where \(L\) is the number of IRS elements. In the case of discrete phase shifts, we develop a convex-relaxation-based method (CRBM) to obtain a feasible (sub-optimal) solution in polynomial time \(O(L^{3.5})\), with a posteriori performance guarantee. Furthermore, numerical simulations provide useful insights and confirm the theoretical results. In particular, the proposed algorithms are several orders of magnitude faster than the exhaustive search when \(L\) is large, thus being highly scalable and suitable for practical applications. Moreover, both algorithms outperform a baseline scheme, namely, the activation of all IRS elements.</description><subject>Algorithms</subject><subject>Codes</subject><subject>Communications systems</subject><subject>Computer Science - Information Theory</subject><subject>Dynamic programming</subject><subject>Energy efficiency</subject><subject>Mathematical analysis</subject><subject>Mathematics - Information Theory</subject><subject>Optimization</subject><subject>Polynomials</subject><subject>Robustness (mathematics)</subject><subject>Signal to noise ratio</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2024</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotkF1LwzAUhoMgOOZ-gFcGvO7MZ5tcjlK1MBhsAy9LliWasX6YpMP6662rcODAOc85vDwAPGC0ZIJz9Kz8t7ssCUVyiQQn6Q2YEUpxIhghd2ARwgkhRNKMcE5nYNi2hz5EWG53SXE2tWkiXOnoLiq6toG29bBojP8YYGGt0840eoCbLrra_UyIa67HqxBciOYI87au-8bpabsbxmEd4LuLn7CsO-Ot0RHmu_Ie3Fp1Dmbx3-dg_1Ls87dkvXkt89U6UZKnSWqsxoRIjMfAwmZW8aNhGUNEGEYMVlwhesgklQorLIW2GZGHsZgRR80yOgeP09url6rzrlZ-qP78VFc_I_E0EZ1vv3oTYnVqe9-MmSoiUi4Zw5zSXxnPaP4</recordid><startdate>20240610</startdate><enddate>20240610</enddate><creator>Efrem, Christos N</creator><creator>Krikidis, Ioannis</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20240610</creationdate><title>Robust IRS-Element Activation for Energy Efficiency Optimization in IRS-Assisted Communication Systems With Imperfect CSI</title><author>Efrem, Christos N ; Krikidis, Ioannis</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a956-6efc1229117258f7fa5de474028e42e1a5a03b7939a1a198cf729b29b4e8dc473</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2024</creationdate><topic>Algorithms</topic><topic>Codes</topic><topic>Communications systems</topic><topic>Computer Science - Information Theory</topic><topic>Dynamic programming</topic><topic>Energy efficiency</topic><topic>Mathematical analysis</topic><topic>Mathematics - Information Theory</topic><topic>Optimization</topic><topic>Polynomials</topic><topic>Robustness (mathematics)</topic><topic>Signal to noise ratio</topic><toplevel>online_resources</toplevel><creatorcontrib>Efrem, Christos N</creatorcontrib><creatorcontrib>Krikidis, Ioannis</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Efrem, Christos N</au><au>Krikidis, Ioannis</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Robust IRS-Element Activation for Energy Efficiency Optimization in IRS-Assisted Communication Systems With Imperfect CSI</atitle><jtitle>arXiv.org</jtitle><date>2024-06-10</date><risdate>2024</risdate><eissn>2331-8422</eissn><abstract>In this paper, we study an intelligent reflecting surface (IRS)-aided communication system with single-antenna transmitter and receiver, under imperfect channel state information (CSI). More specifically, we deal with the robust selection of binary (on/off) states of the IRS elements in order to maximize the worst-case energy efficiency (EE), given a bounded CSI uncertainty, while satisfying a minimum signal-to-noise ratio (SNR). In addition, we consider not only continuous but also discrete IRS phase shifts. First, we derive closed-form expressions of the worst-case SNRs, and then formulate the robust (discrete) optimization problems for each case. In the case of continuous phase shifts, we design a dynamic programming (DP) algorithm that is theoretically guaranteed to achieve the global maximum with polynomial complexity \(O(L\,{\log L})\), where \(L\) is the number of IRS elements. In the case of discrete phase shifts, we develop a convex-relaxation-based method (CRBM) to obtain a feasible (sub-optimal) solution in polynomial time \(O(L^{3.5})\), with a posteriori performance guarantee. Furthermore, numerical simulations provide useful insights and confirm the theoretical results. In particular, the proposed algorithms are several orders of magnitude faster than the exhaustive search when \(L\) is large, thus being highly scalable and suitable for practical applications. Moreover, both algorithms outperform a baseline scheme, namely, the activation of all IRS elements.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2309.08526</doi><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2024-06 |
issn | 2331-8422 |
language | eng |
recordid | cdi_arxiv_primary_2309_08526 |
source | arXiv.org; Free E- Journals |
subjects | Algorithms Codes Communications systems Computer Science - Information Theory Dynamic programming Energy efficiency Mathematical analysis Mathematics - Information Theory Optimization Polynomials Robustness (mathematics) Signal to noise ratio |
title | Robust IRS-Element Activation for Energy Efficiency Optimization in IRS-Assisted Communication Systems With Imperfect CSI |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T15%3A21%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Robust%20IRS-Element%20Activation%20for%20Energy%20Efficiency%20Optimization%20in%20IRS-Assisted%20Communication%20Systems%20With%20Imperfect%20CSI&rft.jtitle=arXiv.org&rft.au=Efrem,%20Christos%20N&rft.date=2024-06-10&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2309.08526&rft_dat=%3Cproquest_arxiv%3E2865944153%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2865944153&rft_id=info:pmid/&rfr_iscdi=true |