Literature Database Entry

arafat2024multi-user


Nouran Arafat, Engy A. Maher, Ahmed El-Mahdy and Falko Dressler, "Multi-User Fairness in Reconfigurable Intelligent Surface Assisted mmWave MIMO-NOMA System," Proceedings of IEEE International Conference on Ubiquitous Networking (UNet 2024), Marrakesh, Morocco, June 2024.


Abstract

Reconfigurable Intelligent Surface (RIS) enabled wireless communications with Non Orthogonal Multiple Access (NOMA) is a promising technology for the next generation mobile communications. Millimeter wave (mmWave) communication has high frequency ranges from 30 to 300 GHz and supports giga- bit per second data rates. The path loss attenuation is very high at high frequencies compared to low frequencies. In this paper, we consider a downlink mmWave MIMO-NOMA cellular system aided by RIS where the base station is mounted with multiple antennas and multiple single antenna users. RIS phase shifts and users power are optimized to maximize energy efficiency such that the rate of each user exceeds a certain threshold. The optimization problem is a non-convex problem, which can be solved using Dinkelbach’s algorithm with fractional program- ming. The maximization problem is converted to Quadratic Constraint Quadratic programming (QCQP), and the Lagrange augmented method is applied to get the optimum RIS phases. Numerical results show that all users satisfy the rate constraint under optimal power allocation.

Quick access

Authors' Version PDF (PDF on this web site)
BibTeX BibTeX

Contact

Nouran Arafat
Engy A. Maher
Ahmed El-Mahdy
Falko Dressler

BibTeX reference

@inproceedings{arafat2024multi-user,
    author = {Arafat, Nouran and Maher, Engy A. and El-Mahdy, Ahmed and Dressler, Falko},
    title = {{Multi-User Fairness in Reconfigurable Intelligent Surface Assisted mmWave MIMO-NOMA System}},
    publisher = {IEEE},
    address = {Marrakesh, Morocco},
    booktitle = {IEEE International Conference on Ubiquitous Networking (UNet 2024)},
    month = {6},
    year = {2024},
   }
   
   

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.