Fairness-Aware Throughput Maximization Over Cognitive Heterogeneous NOMA Networks for Industrial Cognitive IoT
In this work, an uplink secondary Internet of Things (IoT) device scheduling and power allocation problem based on imperfect channel state information (CSI) and imperfect spectrum sensing is investigated for industrial cognitive IoT over cognitive heterogeneous non-orthogonal multiple access (NOMA)...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on communications 2020-08, Vol.68 (8), p.4723-4733 |
---|---|
Hauptverfasser: | , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this work, an uplink secondary Internet of Things (IoT) device scheduling and power allocation problem based on imperfect channel state information (CSI) and imperfect spectrum sensing is investigated for industrial cognitive IoT over cognitive heterogeneous non-orthogonal multiple access (NOMA) networks. The joint secondary IoT device scheduling and power allocation problem maximizes the network throughput subject to total power constraint at each secondary IoT device, proportional fairness transmission rate among different secondary IoT devices, maximum number of accessed secondary IoT devices for each subchannel, and interference power threshold constraint at each primary base station (BS). Firstly, successive convex approximation method is adopted to transform the original resource allocation problem into a bi-convex programming problem. Then, we employ the dual decomposition method to analyze the secondary IoT device scheduling criterion and obtain the power allocation close-form expression. Finally, a joint power allocation and secondary IoT device scheduling algorithm with the proportional fairness criterion is proposed. Numerical simulation results demonstrate that the throughput and fairness for the proposed algorithm are better than that of other resource allocation algorithm significantly. |
---|---|
ISSN: | 0090-6778 1558-0857 |
DOI: | 10.1109/TCOMM.2020.2992720 |