Literature Database Entry

rezaei2022energ-yefficient


Atefeh Rezaei, Ata Khalili, Jalal Jalali, Hossein Shafiei and Qingqing Wu, "Energy-Efficient Resource Allocation and Antenna Selection for IRS-Assisted Multicell Downlink Networks," IEEE Wireless Communications Letters, vol. 11 (6), pp. 1229–1233, June 2022.


Abstract

This letter considers a network-assisted intelligent reflecting surface (IRS) technology. We aim to adopt an energy-efficient strategy via an antenna selection (AS) framework that determines which base station (BS) antennas transmit the data to the user equipment. In particular, we select the best set of antennas to increase energy efficiency (EE) while reducing power consumption. Also, the network takes advantage of the IRS system to increase the coverage and overall throughput of the network. We first propose an efficient algorithm for the considered scenario based on the successive convex approximation (SCA). Then we employ the Dinkelbach method that jointly selects the best set of antennas and optimizes their beamforming. Second, by introducing the slack variable and SCA method, we propose a tight approximation to solve the passive beamforming at the IRS. Simulation results unveil the performance of the proposed method and its influence on the power consumption at each antenna’s RF chain.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Atefeh Rezaei
Ata Khalili
Jalal Jalali
Hossein Shafiei
Qingqing Wu

BibTeX reference

@article{rezaei2022energ-yefficient,
    author = {Rezaei, Atefeh and Khalili, Ata and Jalali, Jalal and Shafiei, Hossein and Wu, Qingqing},
    doi = {10.1109/lwc.2022.3161410},
    title = {{Energy-Efficient Resource Allocation and Antenna Selection for IRS-Assisted Multicell Downlink Networks}},
    pages = {1229--1233},
    journal = {IEEE Wireless Communications Letters},
    issn = {2162-2337},
    publisher = {IEEE},
    month = {6},
    number = {6},
    volume = {11},
    year = {2022},
   }
   
   

Copyright notice

Links to final or draft versions of papers are presented here to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted or distributed for commercial purposes without the explicit permission of the copyright holder.

The following applies to all papers listed above that have IEEE copyrights: Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.

The following applies to all papers listed above that are in submission to IEEE conference/workshop proceedings or journals: This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible.

The following applies to all papers listed above that have ACM copyrights: ACM COPYRIGHT NOTICE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from Publications Dept., ACM, Inc., fax +1 (212) 869-0481, or permissions@acm.org.

The following applies to all SpringerLink papers listed above that have Springer Science+Business Media copyrights: The original publication is available at www.springerlink.com.

This page was automatically generated using BibDB and bib2web.

Last modified: 2024-07-21