Throughput Maximization for Instantly Decodable Network Coded NOMA in Downlink Broadcast Communication Systems

Non-orthogonal multiple access (NOMA) employed at the physical layer and network coding employed at the network layer are two promising transmission technologies to improve the spectral efficiency. In this paper, we develop a cross-layer approach by employing power-domain NOMA at the physical layer and instantly decodable network coding (IDNC) at the network layer in downlink broadcast communication systems. Following this approach, two IDNC packets are broadcasted during each transmission by employing superposition coding, one for all receivers and the other only for the strong receivers which employ successive interference cancellation (SIC). IDNC packets selection, transmission rates adaption, and NOMA power allocation are jointly considered to improve the throughput. Given the intractability of the problem, we decouple it into two separate subproblems, i.e., IDNC schedule and NOMA power allocation. IDNC schedule can be formulated as the maximum weight clique (MWC) problem, and two heuristic algorithms named as maximum weight vertex (MWV) search and maximum weight path based maximum weight vertex (MWP-MWV) search are developed to solve the first subproblem. An iterative function evaluation (IFE) approach is proposed to solve the second subproblem. Simulation results demonstrate the throughput gains of the proposed approach over the existing schemes.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Communications
Published
2024-10-09
DOI
https://doi.org/10.1109/tcomm.2024.3477327
Citations
1
Primary Topic
Advanced Wireless Communication Technologies
Type
article
Field-Weighted Citation Impact
0.21
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Throughput Maximization for Instantly Decodable Network Coded NOMA in Downlink Broadcast Communication Systems

Zhonghui Mei
1 citations
IEEE Transactions on Communications
Advanced Wireless Communication Technologies
0.21
article

Throughput Maximization for Instantly Decodable Network Coded NOMA in Downlink Broadcast Communication Systems

Zhonghui Mei
article en
1 citations

Abstract

Non-orthogonal multiple access (NOMA) employed at the physical layer and network coding employed at the network layer are two promising transmission technologies to improve the spectral efficiency. In this paper, we develop a cross-layer approach by employing power-domain NOMA at the physical layer and instantly decodable network coding (IDNC) at the network layer in downlink broadcast communication systems. Following this approach, two IDNC packets are broadcasted during each transmission by employing superposition coding, one for all receivers and the other only for the strong receivers which employ successive interference cancellation (SIC). IDNC packets selection, transmission rates adaption, and NOMA power allocation are jointly considered to improve the throughput. Given the intractability of the problem, we decouple it into two separate subproblems, i.e., IDNC schedule and NOMA power allocation. IDNC schedule can be formulated as the maximum weight clique (MWC) problem, and two heuristic algorithms named as maximum weight vertex (MWV) search and maximum weight path based maximum weight vertex (MWP-MWV) search are developed to solve the first subproblem. An iterative function evaluation (IFE) approach is proposed to solve the second subproblem. Simulation results demonstrate the throughput gains of the proposed approach over the existing schemes.

IEEE Transactions on CommunicationsVol. 73(4)
Nanjing University of Posts and Telecommunications (CN)
Openalex Percentile: Top 47%
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.