TY - JOUR
T1 - Hierarchical Multiple Access (HiMA) for Fog-RAN
T2 - Protocol Design and Resource Allocation
AU - Papanikolaou, Vasilis K.
AU - Mitsiou, Nikos A.
AU - Diamantoulakis, Panagiotis D.
AU - Ding, Zhiguo
AU - Karagiannidis, George K.
N1 - Funding Information:
The work of Vasilis K. Papanikolaou and George K. Karagiannidis was supported by the European Union and Greek National funds through the Competitiveness, Entrepreneurship and Innovation Operational Program (EPAnEK) by the Special Actions Aquaculture—Industrial Materials—Open Innovation in Culture under Project T6YBP-00134. The work of Nikos A. Mitsiou and Panagiotis D. Diamantoulakis was supported by the European Union’s Horizon 2020 Research and Innovation Program under Agreement 957406. The work of Zhiguo Ding was supported in part by U.K. EPSRC under Grant EP/P009719/2 and in part by H2020-MSCA-RISE under Grant 10100641.
Publisher Copyright:
© 2002-2012 IEEE.
PY - 2022/2/1
Y1 - 2022/2/1
N2 - We introduce a set of multiple access protocols, called hierarchical multiple access (HiMA), which are based on non-orthogonal multiple access (NOMA) and time-division multiple access (TDMA), optimized for the hierarchical network scenario. The proposed protocols can be efficiently utilized in various network configurations with an hierarchical form, such as relay networks, cloud-radio access networks (C-RANs), and fog-radio access networks (F-RANs). In particular, C-RANs and, more recently, F-RANs are regarded as promising paradigms to fully utilize the edge of the networks. Therefore, the implementation of novel multiple access protocols to properly exploit these configurations is critical for the fifth generation and beyond of wireless access. Furthermore, the resource allocation problem is formulated for each protocol with respect to the timeslot duration and power. As a result two fairness metrics are optimized, namely max-min rate fairness and proportional fairness. Finally, numerical results reveal the effectiveness of the joint design in the hierarchical network and an interesting trade-off is identified between fairness and achievable rate. Interestingly, despite NOMA being a very promising alternative to conventional multiple access schemes, the protocol that is solely based on NOMA does not always outperform the rest.
AB - We introduce a set of multiple access protocols, called hierarchical multiple access (HiMA), which are based on non-orthogonal multiple access (NOMA) and time-division multiple access (TDMA), optimized for the hierarchical network scenario. The proposed protocols can be efficiently utilized in various network configurations with an hierarchical form, such as relay networks, cloud-radio access networks (C-RANs), and fog-radio access networks (F-RANs). In particular, C-RANs and, more recently, F-RANs are regarded as promising paradigms to fully utilize the edge of the networks. Therefore, the implementation of novel multiple access protocols to properly exploit these configurations is critical for the fifth generation and beyond of wireless access. Furthermore, the resource allocation problem is formulated for each protocol with respect to the timeslot duration and power. As a result two fairness metrics are optimized, namely max-min rate fairness and proportional fairness. Finally, numerical results reveal the effectiveness of the joint design in the hierarchical network and an interesting trade-off is identified between fairness and achievable rate. Interestingly, despite NOMA being a very promising alternative to conventional multiple access schemes, the protocol that is solely based on NOMA does not always outperform the rest.
KW - asynchronous TDMA
KW - convex optimization
KW - hierarchical NOMA
KW - Non-orthogonal multiple access (NOMA)
KW - resource allocation
UR - https://www.scopus.com/pages/publications/85112596623
U2 - 10.1109/TWC.2021.3100538
DO - 10.1109/TWC.2021.3100538
M3 - Article
AN - SCOPUS:85112596623
SN - 1536-1276
VL - 21
SP - 960
EP - 975
JO - IEEE Transactions on Wireless Communications
JF - IEEE Transactions on Wireless Communications
IS - 2
ER -