Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Maryam Moghimi

dblp:275/9643 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2022
—ORCID · unresolved

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Physical-layer communications · 56% Cellular and mobile networks · 28% Edge and fog computing · 8%

Topics — the 5 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Physical-layer communications › multiple access
non-orthogonal multiple access
0.612022
Joint Radio Resource Allocation and Cooperative Caching in PD-NOMA-Based HetNets · IEEE Trans. Mob. Comput. 2022
Physical-layer communications › multiple access › non-orthogonal multiple access
power-domain NOMA
0.612022
Joint Radio Resource Allocation and Cooperative Caching in PD-NOMA-Based HetNets · IEEE Trans. Mob. Comput. 2022
Cellular and mobile networks › radio resource management
radio resource allocation
0.612022
Joint Radio Resource Allocation and Cooperative Caching in PD-NOMA-Based HetNets · IEEE Trans. Mob. Comput. 2022
Content delivery and video streaming › caching › distributed caching
cooperative caching
0.212022
Joint Radio Resource Allocation and Cooperative Caching in PD-NOMA-Based HetNets · IEEE Trans. Mob. Comput. 2022
Edge and fog computing
edge caching
0.212022
Joint Radio Resource Allocation and Cooperative Caching in PD-NOMA-Based HetNets · IEEE Trans. Mob. Comput. 2022

Methods — techniques the papers use, named apart from their topics

successive convex approximation · 0.6hungarian algorithm · 0.6alternating search method · 0.6
YearPublicationVenuePosition
2022 Joint Radio Resource Allocation and Cooperative Caching in PD-NOMA-Based HetNets
abstract
In this paper, we propose a novel joint resource allocation and cooperative caching scheme for power-domain non-orthogonal multiple access (PD-NOMA)-based heterogeneous networks (HetNets). In our scheme, the requested content is fetched directly from the edge if it is cached in the storage of one of the base stations (BSs), and otherwise is fetched via the backhaul. Our scheme consists of two phases: 1) Caching phase where the contents are saved in the storage of the BSs; and 2) Delivery phase where the requested contents are delivered to users. We formulate a novel optimization problem over radio resources and content placement variables. We aim to minimize the network cost subject to quality-of-service (QoS), caching, subcarrier assignment, and power allocation constraints. By exploiting advanced optimization methods, such as alternative search method (ASM), Hungarian algorithm, successive convex approximation (SCA), we obtain an efficient sub-optimal solution of the optimization problem. Numerical results illustrate that our ergodic caching policy via the proposed resource management algorithm can achieve a considerable reduction on the total cost on average compared to the most popular caching and random caching policy. Moreover, our cooperative NOMA scheme outperforms orthogonal multiple access (OMA) in terms of the delivery cost in general with an acceptable complexity increase.
Maryam Moghimi, Abulfazl Zakeri, Mohammad Reza Javan, Nader Mokari, Derrick Wing Kwan Ng
IEEE Trans. Mob. Comput.1