Literature Database Entry

rezaei2021robust


Atefeh Rezaei, Paeiz Azmi, Nader Mokari Yamchi, Mohammad Reza Javan and Halim Yanikomeroglu, "Robust Resource Allocation for Cooperative MISO-NOMA-Based Heterogeneous Networks," IEEE Transactions on Communications, vol. 69 (6), pp. 3864–3878, June 2021.


Abstract

In this paper, we consider a cooperative multiple-input single-output (MISO) heterogeneous communication network based on the power domain non-orthogonal multiple access (PD-NOMA). We aim to investigate a resource allocation problem regarding the uncertainty of the channel state information at the transmitter (CSIT) and the imperfect SIC case. Since there is an essential need for low-complexity algorithms with reasonably good performance for the extremely complex access architectures, we propose two novel methods based on matching game with externalities and successive convex approximation (SCA) to realize the hybrid scheme where the number of the cooperative nodes is variable. Moreover, we propose a new matching utility function to manage the interference caused by cooperative networks and PD-NOMA. We also devise two robust beamforming techniques to cope with the channel uncertainty based on the worst-case and stochastic-case scenarios. Simulation results evaluate the performance and the sensibility of the proposed methods and demonstrate that although the performance of the proposed distributed matching algorithm is slightly inferior to that of the SCA type, the complexity of the matching theory approach is substantially lower than that of the latter one.

Quick access

Original Version DOI (at publishers web site)
BibTeX BibTeX

Contact

Atefeh Rezaei
Paeiz Azmi
Nader Mokari Yamchi
Mohammad Reza Javan
Halim Yanikomeroglu

BibTeX reference

@article{rezaei2021robust,
    author = {Rezaei, Atefeh and Azmi, Paeiz and Mokari Yamchi, Nader and Javan, Mohammad Reza and Yanikomeroglu, Halim},
    doi = {10.1109/tcomm.2021.3063347},
    title = {{Robust Resource Allocation for Cooperative MISO-NOMA-Based Heterogeneous Networks}},
    pages = {3864--3878},
    journal = {IEEE Transactions on Communications},
    issn = {1558-0857},
    publisher = {IEEE},
    month = {6},
    number = {6},
    volume = {69},
    year = {2021},
   }
   
   

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-06-24