{"id":"https://openalex.org/W7155082639","doi":"https://doi.org/10.1109/ncc68160.2026.11478931","title":"RIS-Assisted SWIPT Under Bounded CSI Uncertainty: A Worst-Case Max-Min Approach","display_name":"RIS-Assisted SWIPT Under Bounded CSI Uncertainty: A Worst-Case Max-Min Approach","publication_year":2026,"publication_date":"2026-02-26","ids":{"openalex":"https://openalex.org/W7155082639","doi":"https://doi.org/10.1109/ncc68160.2026.11478931"},"language":null,"primary_location":{"id":"doi:10.1109/ncc68160.2026.11478931","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc68160.2026.11478931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 National Conference on Communications (NCC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5134204433","display_name":"Dev Shah","orcid":null},"institutions":[{"id":"https://openalex.org/I98389781","display_name":"Dhirubhai Ambani University","ror":"https://ror.org/02d5b7g69","country_code":"IN","type":"education","lineage":["https://openalex.org/I98389781"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Dev Shah","raw_affiliation_strings":["School of Technology, Dhirubhai Ambani University (Formerly DA-IICT),Gandhinagar,India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Technology, Dhirubhai Ambani University (Formerly DA-IICT),Gandhinagar,India","institution_ids":["https://openalex.org/I98389781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008632201","display_name":"Kunwar Pritiraj Rajput","orcid":"https://orcid.org/0000-0001-5411-6269"},"institutions":[{"id":"https://openalex.org/I186903577","display_name":"University of Luxembourg","ror":"https://ror.org/036x5ad56","country_code":"LU","type":"education","lineage":["https://openalex.org/I186903577"]}],"countries":["LU"],"is_corresponding":false,"raw_author_name":"Kunwar Pritiraj Rajput","raw_affiliation_strings":["Interdisciplinary Center for Security, Reliability and Trust (SnT), University of Luxembourg,Luxembourg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Interdisciplinary Center for Security, Reliability and Trust (SnT), University of Luxembourg,Luxembourg","institution_ids":["https://openalex.org/I186903577"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5018728658","display_name":"Manish Kumar","orcid":"https://orcid.org/0000-0002-1311-0976"},"institutions":[{"id":"https://openalex.org/I98389781","display_name":"Dhirubhai Ambani University","ror":"https://ror.org/02d5b7g69","country_code":"IN","type":"education","lineage":["https://openalex.org/I98389781"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Manish Kumar","raw_affiliation_strings":["School of Technology, Dhirubhai Ambani University (Formerly DA-IICT),Gandhinagar,India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Technology, Dhirubhai Ambani University (Formerly DA-IICT),Gandhinagar,India","institution_ids":["https://openalex.org/I98389781"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.61437543,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"388","last_page":"393"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.39649999141693115,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11413","display_name":"Risk and Portfolio Optimization","score":0.39649999141693115,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.15129999816417694,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.029999999329447746,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6072999835014343},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.27549999952316284},{"id":"https://openalex.org/keywords/control-theory","display_name":"Control theory (sociology)","score":0.2718999981880188},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.24410000443458557}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6072999835014343},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5292999744415283},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3269999921321869},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30000001192092896},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.27549999952316284},{"id":"https://openalex.org/C47446073","wikidata":"https://www.wikidata.org/wiki/Q5165890","display_name":"Control theory (sociology)","level":3,"score":0.2718999981880188},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2498999983072281},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.24410000443458557},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.23319999873638153},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2304999977350235}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ncc68160.2026.11478931","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ncc68160.2026.11478931","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2026 National Conference on Communications (NCC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W2034539682","https://openalex.org/W2053249558","https://openalex.org/W3210839039","https://openalex.org/W3214581113","https://openalex.org/W4250589301","https://openalex.org/W4312565222","https://openalex.org/W4312805416","https://openalex.org/W4312979465","https://openalex.org/W4313477275","https://openalex.org/W4319866159","https://openalex.org/W4372046401","https://openalex.org/W4387415367","https://openalex.org/W4391697091","https://openalex.org/W4392309073","https://openalex.org/W4396754493","https://openalex.org/W4403598759","https://openalex.org/W4405718404","https://openalex.org/W4408126041","https://openalex.org/W4408280926","https://openalex.org/W4416114257"],"related_works":[],"abstract_inverted_index":{"This":[0],"work":[1],"studies":[2],"a":[3,15,34,39],"multiuser":[4],"simultaneous":[5],"wireless":[6],"information":[7,27],"and":[8,31,62,71,112,126],"power":[9,70],"transfer":[10],"(SWIPT)":[11],"network":[12],"assisted":[13],"by":[14,51,101],"reconfigurable":[16],"intelligent":[17],"surface":[18],"(RIS).":[19],"A":[20],"realistic":[21],"scenario":[22],"with":[23],"imperfect":[24],"channel":[25],"state":[26],"(CSI)":[28],"is":[29,80,99],"considered":[30],"modeled":[32],"using":[33],"bounded":[35],"uncertainty":[36],"framework.":[37],"With":[38],"user":[40,63],"fairness":[41],"objective,":[42],"we":[43],"maximize":[44],"the":[45,54,89,103,119,122,135,138],"minimum":[46,72],"worst-case":[47,104],"signal-to-interference-plus-noise":[48],"ratio":[49],"(SINR)":[50],"jointly":[52],"optimizing":[53],"base":[55],"station":[56],"(BS)":[57],"beamformers,":[58],"RIS":[59],"reflection":[60],"coefficients,":[61],"power-splitting":[64],"ratios":[65],"subject":[66],"to":[67],"BS":[68],"transmit":[69],"harvested":[73],"energy":[74],"constraints.":[75],"The":[76],"resulting":[77],"nonconvex":[78],"problem":[79],"solved":[81],"through":[82],"an":[83],"alternating":[84],"optimization":[85],"method":[86],"that":[87],"divides":[88],"design":[90,125],"into":[91,106],"three":[92],"tractable":[93],"parts.":[94],"Robustness":[95],"against":[96],"CSI":[97],"errors":[98],"achieved":[100],"reformulating":[102],"constraints":[105],"linear":[107],"matrix":[108],"inequalities":[109],"via":[110],"S-procedure":[111],"sign":[113],"definiteness-based":[114],"tools.":[115],"Simulation":[116],"results":[117],"confirm":[118],"effectiveness":[120],"of":[121,137],"proposed":[123,139],"robust":[124,140],"demonstrate":[127],"clear":[128],"SINR":[129],"gains":[130],"over":[131],"uncertainty-agnostic":[132],"schemes,":[133],"highlighting":[134],"benefit":[136],"design.":[141]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-22T00:00:00"}
