Vehicular Communication Using NOMA with Antenna Partitioning

We solve a sum-rate maximization problem in a downlink vehicular nonorthogonal multiple access (NOMA) system by optimally constructing subarrays and mapping each to a per-vehicle NOMA stream, achieving higher sum-rate with reduced complexity.

Authors

Institutions

Publication Details

Published
2024-10-16
DOI
https://doi.org/10.1109/ictc62082.2024.10827602
Citations
1
Primary Topic
Advanced Wireless Communication Technologies
Type
article
Field-Weighted Citation Impact
0.21

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Vehicular Communication Using NOMA with Antenna Partitioning

Maurice Nduwayezu, Derek Kwaku Pobi Asiedu, Ji-Hoon Yun, Kofi A. Ofori-Amanfo
1 citations
Advanced Wireless Communication Technologies
0.21
article

Vehicular Communication Using NOMA with Antenna Partitioning

Maurice Nduwayezu, Derek Kwaku Pobi Asiedu, Ji-Hoon Yun, Kofi A. Ofori-Amanfo
article en
1 citations

Abstract

We solve a sum-rate maximization problem in a downlink vehicular nonorthogonal multiple access (NOMA) system by optimally constructing subarrays and mapping each to a per-vehicle NOMA stream, achieving higher sum-rate with reduced complexity.

Seoul National University of Science and Technology (KR), Université de Bretagne Occidentale (FR), Laboratoire des Sciences et Techniques de l’Information de la Communication et de la Connaissance (FR), IMT Atlantique (FR)
Ministry of Education, National Research Foundation of Korea
Openalex Percentile: Top 44%
Advanced Wireless Communication Technologies
0.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.