This article has been accepted for publication in a future issue of this journal, but has not been
fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Cooperative NOMA Broadcasting/Multicasting for
Low-Latency and High-Reliability 5G Cellular V2X
Communications
Gang Liu, Member, IEEE, Zhiqing Wang, Jiewen Hu,
Zhiguo Ding, Senior Member, IEEE and Pingzhi Fan, Fellow, IEEE
Abstract—To achieve low-latency and high-reliability (LLHR)
for the vehicle-to-everything (V2X) services, the Long Term Evo-
lution (LTE)-based solution has been considered as a promising
technology. Since the existing LTE networks are based on the
orthogonal multiple access (OMA), the limited spectrum resources
have not been fully and efficiently utilized, so that severe data
congestion and low access efficiency can not be avoided in dense
networks. Non-orthogonal multiple access (NOMA) provides a new
solution for 5G V2X services to mitigate traffic congestion and
reduce latency. Different from existing works, we propose two relay-
assisted NOMA transmission schemes for 5G V2X communica-
tions, i.e., half-duplex relay-assisted NOMA (HDR-NOMA) broad-
casting/multicasting and full-duplex relay-assisted NOMA (FDR-
NOMA) broadcasting/multicasting, and investigate the optimal
power allocation problems for them. To improve the quality of
service (QoS) for the users with the poor channel conditions and
to guarantee the fairness, the power allocation problems are formu-
lated to maximize the minimum achievable rate for all users. Even
though both of the formulated problems are neither concave nor
convex, it is shown that the considered problems are quasi-concave.
Hence, a bisection-based power allocation algorithm is proposed to
obtain the optimal solutions to the problems. Numerical results
demonstrate that the proposed schemes outperform the scheme
with fixed power allocation obviously and achieve a significant
performance improvement with respect to a suboptimal fractional
transmit power allocation (FTPA) method and the optimized time
division multiple access (TDMA) scheme. Besides, compared with
HDR-NOMA, better performance can be achieved by FDR-NOMA
scheme when the self-interference is sufficiently suppressed.
Index Terms—5G, V2X, low-latency and
FDR/HDR-NOMA, Broadcast/Multicast.
This paper was presented in part at the 2018 IEEE/CIC International Con-
ference on Communications in China, Beijing, China. The work of G. Liu
was jointly supported by the National Natural Science Foundation of China
(No. 61601377), Sichuan Science and Technology Program (No. 2019YJ0248),
the International Cooperation Project of Sichuan (No. 2017HH0002) and the
open research fund of National Mobile Communications Research Laboratory,
Southeast University(No. 2019D05). The work of Z. Ding was supported by the
UK EPSRC under grant number EP/L025272/2 and by H2020-MSCA-RISE-
2015 under grant number 690750. The work of P. Fan was jointly supported by
the National Natural Science Foundation of China (No. 61731017) and the 111
Project (No.111-2-14). (Corresponding author: Gang Liu.)
G. Liu is with SWJTU, and also with National Mobile Communications
Research Laboratory, Southeast University. (e-mail:gangliu@bupt.edu.cn)
Z. Wang, J. Hu and P. Fan are with the Key Lab of Information Coding
and Transmission, Southwest Jiaotong University, Chengdu, 610031, China. (e-
mail:zqwang0211@163.com; jevon@my.swjtu.edu.cn; pzfan@swjtu.edu.cn).
Z. Ding is with School of Electrical and Electronic Engineering,
The University of Manchester, Manchester, Lancashire, U.K. (e-
mail:zhiguo.ding@manchester.ac.uk).
Copyright (c) 2019 IEEE. Personal use of this material is permitted. However,
permission to use this material for any other purposes must be obtained from
the IEEE by sending a request to pubs-permissions@ieee.org.
2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
Things Journal 1
I. I NTRODUCTION AND M OTIVATIONS
As one of the emerging and promising technologies of Internet
of Things (IoT), vehicle-to-everything (V2X) communications
enable various applications related to vehicles, vehicle traffic,
drivers, passengers and pedestrians, which will provide a safer
and more efficient driving experience for our future daily life.
Among various applications, safety critical services play a vital
role in future life, supported by the V2X communications,
which need to achieve low-latency and high-reliability [1]. For
example, some of delay-sensitive services will demand an end-
to-end latency of a few milliseconds [2]. Recently, the 3rd
generation patnership project (3GPP) has been working on Long
Term Evolution (LTE)-based cellular V2X solutions by ex-
tending the 3GPP LTE device-to-device (D2D) communications
originally developed for public safety. Different from the LTE
D2D communications, V2X applications require stringently low-
latency, high-reliability (LLHR) and large number of connected
devices which brings new challenges to the LTE-based vehicle
networks, particularly in a dense environment causing severe da-
ta congestion [3]–[5]. Since the existing LTE networks are based
on the orthogonal multiple access (OMA), the limited spectrum
resources have not been fully and efficiently utilized, severe
data congestion and low access efficiency can not be avoided
in dense networks [6]. Therefore, a more efficient radio access
high-reliability, technology is required. Through power domain multiplexing [7]
at transmitter and successive interference cancellation (SIC) [8]
at the receivers, non-orthogonal multiple access (NOMA), as a
potential solution for 5G wireless networks, has the capability to
fully utilize its capacity area, hence achieving higher transmis-
sion rates, lower system delays, higher reliability and lower-cost
service requirements compared with the OMA scheme [9], [10].
Capable of achieving high overloading transmission over
limited resources, NOMA provides a new dimension for 5G
V2X services to mitigate resource collision, thereby improving
the spectrum efficiency and reducing the latency [11]. Such
challenges and opportunities in vehicular networking have at-
tracted the attention of many academic bodies. In order to
enhance the performance and achieve the LLHR requirements
of the vehicular networks, many researchers are attempting to
integrate NOMA into various scenarios. In [12], [13], the authors
proposed a new NOMA-based mixed centralized/distributed
scheme for the V2X broadcasting system which combines the
centralized SPS at the base station (BS) and the distributed
power control of the vehicles. It is proved that the access
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Things Journal
latency can be reduced and the reliability can be improved
by NOMA in a dense network. A new gragh-based practical
encoding and joint belief propagation decoding techniques for
two-vehicle communicating simultaneously with another vehicle
or a roadside unit has been proposed, which can achieve any
rate pair close to the capacity region without using time sharing
[14]. A novel NOMA-based scheme is proposed to handle
the technical hurdles in designing high spectrum efficiency
scheduling and resource allocation schemes in the ultra dense
topology [11]. Inspired by the robustness of spatial modulation
(SM) against channel correlation, NOMA-SM has been proposed
to deal with the harmful effects of wireless V2V environments
and to support improved bandwidth efficiency [15].
Besides, cooperative communications have been another
promising way for V2X applications to improve the system per-
formance. Hence, combining cooperative communication tech-
nique with NOMA may further enhance the performance of
5G V2X communications which has already been a research
topic that has attracted more and more attention recently. A
cooperative NOMA scheme is proposed in [16], where users
that are close to the BS with better channel conditions play
as decode-and-forward relay (DFR) to deliver the information
for the distant users. In [17], a cooperative relaying system
using NOMA to improve the spectral efficiency has been pro-
posed, and the authors analyzed the achievable data rate of
NOMA systems for DFR over Rayleigh fading channels. A
new cooperative simultaneous wireless information and power
transfer (SWIPT) NOMA protocol has been proposed in [18],
in which near NOMA users that are close to the source act
as energy harvesting relays to help far NOMA users. Besides,
the fixed gain amplify-and-forward (AF) relaying scheme with
NOMA is investigated over Nakagami-m fading channels in
[19]. However, above existing literatures on cooperative NOMA
mainly focus on the unicast scenarios, which have not considered
the inherent broadcasting/multicasting nature of V2X messages
in vehicular networks. Therefore, one target of this work is
to propose a half-duplex relay-assisted NOMA-based (HDR-
NOMA) broadcasting/multicasting scheme for 5G cellular V2X
communications [20].
Furthermore, although suffering from the self-interference due
to the signal leakage from its own output to its input [21],
the feasibility of full-duplex relay (FDR) has been proved by
utilizing self-interference cancellation technologies [22], [23] to
mitigate the self-interference effectively, which have attracted
more and more attention. In [22], authors provided a brief survey
for in-band FDR, and discussed the related research issues and
challenges. Additionally, hybrid techniques that switch oppor-
tunistically between full-duplex and half-duplex relaying modes
have been developed in [24]. With capability to transmit and
receive at the same frequency simultaneously, full-duplex relay
has the potential to further improve the spectrum efficiency
and reduce the transmission delay of HDR-NOMA broadcast-
ing/multicasting schemes. To this end, the second target of
this work is to extend the proposed HDR-NOMA schemes
to full-duplex relay-assisted NOMA (FDR-NOMA) broadcast-
ing/multicasting schemes for 5G V2X communications to further
improve the system performance.
2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
2
Moreover, the power allocation algorithm in NOMA-based
systems will greatly affect the overall performance due to the
multi-user power reuse. Therefore, power allocation is another
problem that needs to be solved. Most of the existing works on
NOMA focus on fixed power allocation schemes [25]. The best
performance of NOMA can be achieved by full search power
allocation (FSPA) [26]. To further reduce the computational
complexity, a fractional power allocation (FTPA) similar to the
transmission power control is proposed in [27]. A novel power
allocation strategy that can optimize the system ergodic sum
capacity while minimizing the mutual interference between the
paired users has been proposed in [28]. The cross-layer power
allocation problem in NOMA systems has been investigated for
the purpose of statistical quality of service (QoS) provisioning
[29]. A novel dynamic power allocation scheme is proposed for
downlink and uplink NOMA scenarios with two users for more
flexibly meeting various quality of service requirements in [30].
The power allocation problems for half-duplex cooperative NO-
MA (HD-CNOMA) and full-duplex cooperative NOMA (FD-
CNOMA) systems are investigated in [31]. Although several
existing works have been done on resource allocation in NOMA
systems, the power allocation problem for relay-assisted NOMA
broadcasting/multicasting communications in 5G V2X scenarios
has not been well investigated.
Inspired by the above observations, we apply NOMA
into half-duplex and full-duplex relay-assisted broadcast-
ing/multicasting 5G V2X communications and investigate the
power allocation problem for both broadcasting and multicas-
ting cases. Different from [13], we consider the relay-assisted
NOMA-based broadcasting/multicasting schemes for the links
from BS to vehicles. The proposed resource management algo-
rithms is centralized and need to be implemented at the BS.
Besides, we have added FDR-NOMA scheme to our previous
work [20] and compared it with HDR-NOMA. The proposed
transmission schemes can be adopted in the communications
from infrastructure node to vehicles. With the integration of
NOMA and relay-assisted broadcasting/multicasting communi-
cations, it is possible to achieve improved spectrum efficiency,
large number of connections, lower latency and higher reliability.
The main contributions of this paper are listed below:
• We consider both HDR-NOMA and FDR-NOMA systems
with N groups of vehicles. In order to share the sur-
rounding information more efficiently, the communication
mode of V2X will mainly be multicasting and broadcasting,
rather than the traditional unicast. Besides, for the sake
of expanding the network coverage, we use roadside units
(RSU) to assist vehicles to communicate with BS, instead
of letting vehicles communicate with BS directly. Thus,
two relay-assisted scenarios have been considered, namely
broadcasting and multicasting. In the broadcasting scenario,
the BS delivers different information to the RSUs which are
viewed as relays via NOMA, while each RSU broadcasting
the same information to the vehicles in its group. Different
from the broadcasting scenario, RSU serves multiple users
using NOMA in the multicasting scenario, since vehicles in
the same group need to receive different information from
the BS. Also, the achievable rates for all users of both
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Things Journal 3

interference link interference link

information link information link

h1 hN hR hR
1 h1 hN N

Base Station Base Station

hN ,1
RSU1 RSUN RSU1 RSUN
e1,1 e1,M e N ,1 e N ,M e1,1 e1,M e N ,1 e N ,M
s 1, N
1 s 1, N
s N ,1 s N ,1 s 1, N s N ,1
1
s 1, N
1
M M s N ,1
1
M M

V1,1 V1,M VN,1 VN,M V1,1 V1,M VN,1 VN,M

(a) HDR-NOMA scheme. (b) FDR-NOMA scheme.

Fig. 1. The system model of HDR-NOMA and FDR-NOMA broadcasting/multicasting schemes.

broadcasting and multicasting systems are analyzed. FDR-NOMA, both of which consist of one single-antenna BS,
•To guarantee the QoS of the vehicles with poor channel N RSUs denoted by RSU1 , RSU2 , · · · , RSUN and N groups of
conditions and to improve fairness, the power allocation vehicles. Each RSU serves one group of vehicles. The vehicle
problem for each scenario is formulated to maximize the m in group i is denoted by Vi,m . Each group has M vehicles1 .
minimum achievable rate of vehicles. Since the formulated The BS serves multiple RSUs using the power-domain NOMA
problems are neither convex nor concave, it is difficult to technology [7], [8], while RSUs viewed as relays transmitting
solve them directly. However, it is shown that the con- information to the vehicles within its coverage in either the
sidered problems are quasi-concave. Hence, we transform decode-and-forward half-duplex relaying mode or full-duplex
them into a sequence of convex feasibility problems and relaying mode. Two scenarios have been considered, namely
the optimal power allocation for N RSUs with M vehicles broadcasting and multicasting. In the broadcasting scenario, each
broadcasting and multicasting systems are obtained by a RSU broadcasts the same information (e.g., speed limitation in-
bisection algorithm. formation) to the vehicles in its group. Different from the broad-
• Simulation results show that the proposed scheme can casting scenario, RSU serves multiple users using NOMA in the
achieve a significant performance improvement compared multicasting scenario, since vehicles in the same group need
with the optimized TDMA, fixed NOMA and FTPA to receive different information (e.g., vehicle-specific control
schemes [27]. When the self-interference is sufficiently information) from the BS. It is worth noting that the proposed
suppressed, better max-min achievable rate can be achieved transmission schemes can be adopted in the communications
by FDR-NOMA schemes as compared to HDR-NOMA from infrastructure node to vehicles. We assume that all the
schemes. It is also shown that the proposed schemes are RSUs and the BS share the same frequency resource. Besides,
able to achieve a better transmission rate for users with we further assume that the direct link between BS and each
the poor channel conditions while slightly degrading the vehicle is weak and ignored due to large path loss.
transmission rate of users with better transmission condi- The considered half-duplex relay-assisted downlink NOMA
tions, which may enhance the overall latency and reliability broadcasting/multicasting scheme is shown in Fig. 1(a). Three
performance. types of wireless links are involved in HDR-NOMA model,
The rest of the paper is organized as follows. The relay- namely BS→RSUi , RSUi →Vi,m and RSUj →Vi,m , the channel
assisted NOMA-based broadcasting and multicasting model are coefficients of which are represented by hi , εi,m , σj,im , respec-
presented in Section II. The power allocation problems for HDR- tively, i, j ∈ {1, 2, · · · , N }, m ∈ {1, 2, · · · , M }. We assume
NOMA and FDR-NOMA are addressed in Section III and IV that all channels follow the independent Rayleigh distribution.
respectively. Simulations are discussed in Section V. Finally, we Moreover, the amount of data contained in the instantaneous
conclude this study in Section VI. channel state information (CSI) is small, so the transmission
time of the CSI is negligible compared to one time slot, so that
II. S YSTEM M ODEL it can be basically assumed that there is no delay. Hence, we
In this section, we present the basic assumptions, followed assume that the instantaneous CSI, denoted by γi , ηi,m , ϕj,im
by the HDR-NOMA and FDR-NOMA broadcasting/multicasting respectively, is estimated at the related receivers and fed back to
schemes. the corresponding transmitter reliably without delay [32], where
2 2 2
the channel gains γi = |hi | , ηi,m = |εi,m | , ϕj,im = |σj,im |
follow the exponential distribution with parameter λi , λi,m and
A. Basic Assumptions
As depicted in Fig. 1(a) and (b), we consider two relay- 1 The proposed scheme can also be applied to the case where different groups
assisted downlink NOMA systems, namely HDR-NOMA and have different number of users.

2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Things Journal 4

λj,im respectively. in the first phase, i ∈ {1, 2, · · · , N }, can be written as follows

Furthermore, the considered full-duplex relay-assisted down- 
γi PB,i

link NOMA broadcasting/multicasting system is shown in Fig. RB,i = Bw · log2 1 + N
, (1)
1(b). In this scenario, RSU is subject to self-interference due
P
1 + γi PB,j
to the signal leakage from its own output to its input as well j=i+1
as the interferences from other RSUs. Therefore, two additional where Bw denotes the system bandwidth.
types of wireless links are also involved in this model, namely
RSUj →RSUi and RSUi →RSUi , whose channel coefficients are
represented by hj,i and hRi respectively. Thus, five types of wire- During the second phase, Vi,m will receive the superimposed
less links in total are involved in this model. Being consistent signals from all RSUs since all the RSUs operate in the same
with [23] and [33], we assume that the residual self-interference frequency. So, the received signal at Vi,m is expressed as yi,m =
√ N
channel2 hRi is free of fading, while the channels RSUj →RSUi
P p
εi,m · Pi · xi + σj,im · Pj · xj + ni,m , where ni,m denotes
follow the independent Rayleigh distribution. Moreover, the j6=i
instantaneous CSI, denoted by δRi , δj,i respectively, is also additive noise at Vi,m , Pi is the transmit power at RSUi , and
perfectly estimated at the related receivers and fed back to xi is the message broadcasted by RSUi . Different from the first
the corresponding transmitter reliably without delay, where the phase, vehicles in the same group receive the same message.
2
channel gains δj,i = |hj,i | follow the exponential distribution Hence, there is no intra-group interference within one group, and
with parameter λj,i , and the residual self-interference channel the interference signals only come from other RSUs. Therefore,
2
gain δRi = |hRi | is set as a constant [33]. the achievable transmission rate for Vi,m in the second phase
Without loss of generality, we assume that the channel gains can be given by
 
of RSUs are ordered as γ1 ≤ γ2 ≤ · · · ≤ γN . In addition, B ηi,m Pi
Ri,m = Bw · log2 1 + . (2)
additive white Gaussian noise with zero mean and unit variance N
P
is assumed at the receiver of each RSU and vehicle. Being 1+ ϕj,im Pj
j6=i
consistent with [16], [34], we also assume that the transmission
rate of each vehicle is not greater than the corresponding
achievable rate, which guarantees the successful decoding and 2) HDR-NOMA Multicasting Scheme: For multicasting
successive interference cancellation at RSUs and vehicles. scheme, the transmission also consists of two phases. The
transmission scheme and the achievable rate for each RSU of
first phase is the same as those of the broadcasting scheme. In
B. HDR-NOMA Broadcasting/Multicasting Scheme
this scenario, vehicles in the same group need to receive different
According to [16], information transmission in HDR-NOMA information from the BS, so we apply NOMA in the second
can be successively completed in two phases as shown in phase to transmit message in multicasting form. In the second
Fig. 1(a). For HDR-NOMA scheme, two scenarios have been phase, each vehicle receives the superposition signals from all
considered, namely broadcasting and multicasting. RSUs simultaneously based on the NOMA principle. Therefore,
1) HDR-NOMA Broadcasting Scheme: For broadcasting the received signal at Vi,m in the second phase is expressed 
scheme, the BS transmits different information to each RSU PM p N
P M p
P
as yi,m = εi,m Pi,m Si,m + σj,im Pj,s Sj,s +
by using the power-domain NOMA technology [7], [8] in the m=1 j6=i s=1
first phase. As for the second phase, each RSU delivers the ni,m , where Si,m is the information for vehicle m in group i.
same decoded information to the vehicles in its group via Different from the broadcasting scheme, the vehicle will not only
broadcasting. According to the NOMA scheme, BS will send receive the inter-group interferences from other RSUs, but also
N p
P receive intra-group interferences when the corresponding RSU
the superimposed signals PB,i Si to RSUs simultaneously,
i=1 sends information to other vehicles in the same group. Similar to
where Si is the message for RSUi , and PB,i are the allocated the first phase, since the SIC technology is performed at Vi,m ,
power for RSUi at the BS in the first phase. Therefore, the the achievable transmission rate for Vi,m in the second phase
received  i in the first phase is expressed as yB,i =
 N signal at RSU can be written as follow
Pp M
hi PB,i · Si + ni , where ni ∼ CN (0,1) denotes the Ri,m =
i=1  
additive white Gaussian noise at RSUi . When the transmission ηi,m Pi,m
Bw ·log2 1+ N M M
. (3)
rate for RSU is not larger than the corresponding achievable P P P
1+ ϕj,im Pj,s +ηi,m Pi,k
rate, SIC can be successfully carried out at the end of the first j6=i s=1 k=m+1
phase. Since SIC is applied at RSUi , when decoding the signal
for RSUi , the RSUi will detect the RSUj ’s message, i > j, and where the second part in the denominator is the inter-group
then remove the message from its received signal, in a successive interferences received from other RSUs, and the third part is
manner. The message for RSUj , j > i, will be treated as noise the intra-group interferences from the RSUi to Vi,k , k > m, for
at RSUi . As a result, the achievable transmission rate for RSUi the reason that only the intra-group interferences from vehicle
k (k < m) can be cancelled in the SIC procedure. When SIC
2 We assume that different self-interference cancellation technologies [22] are is performed at Vi,m , the inter-group interferences are treated as
adopted at each RSU. Hence, we only consider the residual self-interference. noise directly.

2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Things Journal 5

C. FDR-NOMA Broadcasting/Multicasting Scheme conditions. In addition, a bisection algorithm will be developed

As described in [33], with the help of full-duplex operation, to obtain the optimal power allocation policy.
the RSU can receive data from the BS and forward the data
to the vehicles in its group over the same carrier frequency A. Optimal Power Allocation for HDR-NOMA Broadcasting
simultaneously. The proposed FDR-NOMA system model is
In order to guarantee the QoS of the vehicles with the poor
shown in Fig. 1(b).
channel conditions and improve the fairness, we aim at maximiz-
1) FDR-NOMA Broadcasting Scheme: For full-duplex relay-
ing the minimum achievable rate of all vehicles. In this case, the
assisted broadcasting scheme, in addition to the interference in
power allocation problem for HDR-NOMA broadcasting scheme
the half-duplex mode, RSU also suffers from self-interference
with max-min fairness, denoted by P 1, can be formulated as
due to the signal leakage from its own output to its input as well
follows
as the interference from other RSUs even after a combination
B

of different self-interference cancellation technologies applied at P1 : max min RB,i · t1 , Ri,m · t2 ,
Pb
the receiver. Therefore, the received signal at RSUi is expressed
N N
√ √
N  N
Pp P X X
as yB,i = hi PB,i · Si + hRi · Pi · xi + hj,i Pi · s.t. C0 : PB,i + Pi ≤ Pmax ,
i=1 j6=i i=1 i=1
xj + ni , where the second term and the third term at the right
C1 : P b  0,
side of the equation are the residual self-interference at RSUi
and the inter-RSU interferences from other RSUs. Since the SIC where t1 and t2 are the time sharing factors in the two
technology is performed at RSUi , the achievable transmission phases, respectively. Besides, t1 and t2 satisfy t1 + t2 = 1
rate for RSUi can be written as follow and they are treated as constant in this paper. In addition,
B
RB,i = P b , {PB,1 , · · · , PB,N , P1 , · · · , PN } is the transmit power
  vector, and Pmax is the maximum total transmission power of
γi PB,i
Bw ·log2 1+ . (4) the BS and RSUs3 .
N N
1+δRi Pi +
P
δj,i · Pj +γi
P
PB,j The formulated problem above is neither convex nor concave
j6=i j=i+1 on account of the non-convexity of the objective function so
In addition, the transmission scheme and achievable rate of that the optimal solution cannot be obtained directly from it.
the link from RSU to vehicles are the same as that of the second However, it will be shown that this considered problem is quasi-
phase in HDR-NOMA broadcasting scheme. concave. Hence, we can transform it into a sequence of convex
feasibility problems and eventually obtain its optimum via a
2) FDR-NOMA Multicasting Scheme: For multicasting
bisection-based algorithm. After carefully studying the property
scheme, RSUi forwards xi,m to Vi,m with transmit power
of problem P 1 ,we have the following proposition.
Pi,m based on NOMA principle. Therefore,  Nthe received sig-
Pp Proposition 1: Problem P 1 is quasi-concave.
nal at RSUi is expressed as yB,i = hi PB,i · Si + Proof: According to [35], in order to prove the quasi-
i=1
M p
P N
P M p
P concave of a maximization optimization problem is equivalent
hRi Pi,m · xi,m + hj,i ( Pj,s · xj,s ) + ni . Since to prove that its objective function is quasi-concave and the
m=1 j6=i s=1
constraints are convex. Clearly, the constraints of problem P 1
the SIC technology is performed at RSUi , the achievable trans-
are convex since C0 and C1 are linear. The quasi-concavity of
mission rate for RSUi is given by
objective function can be demonstrated if all its sublevel
sets
M
 B

RB,i = are concave, i.e., St = P b | min RB,i · t1 , Ri,m · t2 ≥ t ,
for t ∈ R, which denotes the set of P b for which the objective
!
γi PB,i
Bw ·log2 1+ N N M M
. (5) function
 is larger
 than t. Due to the min operator, it is true that

B
St = P b | RB,i ·t1 , Ri,m ·t2 ≥ t, ∀i ∈ [1, N ], ∀m ∈ [1, M ] .
P P P P
1+γi PB,j + δj,i Pj,s +δRi Pi,m
j=i+1 j6=i s=1 m=1 After simple calculations, the constraint in set St can be rewrit-
where the second part in the denominator is the message for ten as the following two sets of linear inequalities,
RSUj (j > i) which are treated as noise at RSUi for the reason t
N
X

that the interferences from RSUm (m < i) can be cancelled γi PB,i ≥ 2 t1 ·Bw − 1 1 + γi PB,j , ∀i ∈ [1, N ]
in the SIC procedure, the third part and the fourth part are j=i+1
the inter-RSU interferences from other RSUs and the residual N
t
self-interference at RSUi . Besides, the transmission scheme and
X

ηi,m Pi ≥ 2 t2 ·Bw −1)(1+ ϕj,im Pj , ∀i ∈ [1, N ], ∀m ∈ [1, M ]
achievable rate of the link from RSU to vehicles are the same as j6=i
that of the second phase in HDR-NOMA multicasting scheme.
Hence, all the sublevel sets are convex due to their linearity. That
is to say, the objective function is quasi-concave and Proposition
III. P OWER A LLOCATION FOR HDR-NOMA S CHEME 1 is proved.
In this section, the power optimization problem for HDR- 3 In practice, the RSUs and BS have separate transmission power constraint.
NOMA broadcasting/multicasting system will be formulated With the total transmission power constraint, the upper bound of the system
to guarantee the QoS of the vehicles with the poor channel performance can be obtained.

2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Things Journal 6

Fortunately, since problem P 1 is quasi-concave, we can Algorithm 1 Bisection Power Allocation For HDR-NOMA
obtain the numerical solution by solving a sequence of convex Broadcasting Scheme
feasibility problems via the following bisection-based method 1: Init. tLB = 0, tU B = Bw · log2 (1 + γN Pmax ) · t1 .
similar to [36]. In each iteration of the algorithm, we only need 2: While (tU B − tLB ) ≥ ε do
to solve a linear program (LP). 3: Set t = (tU B +t
2
LB )
; Solve LP(P 3) to obtain P LP
Let ξ ∗ denote the optimal objective function value to quasi- N
P PN
concave problem P 1. Since the max-min achievable rate is not 4: If ( PB,i + Pi ≤ Pmax ) then
i=1 i=1
smaller than zero, the initial lower bound tLB for the objective 5: Set tLB = t; P ∗ = P LP ; ξ ∗ = t.
function can be set to zero. In addition, the upper bound can be 6: else
set to Bw · log2 (1 + γN Pmax ) · t1 which is the largest achievable 7: Set tU B = t.
rate when all the power is allocated to the RSU with the largest
channel gain. In each iteration, we will compute t = (tU B +t 2
LB )
.
For a specific constant value t, if the feasibility problem N
X N X
X M

P2 : f ind P, s.t. C4 : PB,i + Pi,m ≤ Pmax ,

i=1 i=1 m=1
N N
X X C5 : P m  0,
s.t. C0 : PB,i + Pi ≤ Pmax ,
i=1 i=1 where P m , {PB,1 , · · · , PB,N , P1,1 , · · · , PN,M } is the trans-
C1 : P b  0, mit power vector, and αi,m is the rate splitting factor for vehicle
t
N
X
m in group i since the link from the BS to RSUi is shared by M
C2 : γi PB,i ≥ 2 t1 ·Bw − 1 1 + γi PB,j , vehicles. In general, the BS or network side will send the similar
j=i+1 road condition information to the vehicles, such as speed limit
N reminder, traffic condition reminder, etc., so we assume that the
t X

C3 : ηi,m Pi ≥ 2 t2 ·Bw − 1)(1 + ϕj,im Pj , proportion of the messages sent by the BS to each vehicle are
1
j6=i the same, and treat αi,m as a constant, i.e., αi,m = M .
∗ With the similar techniques in Section III-A, we can get the
is feasible, then we have ξ ≥ t, and we set tLB = t for the next
iteration. On the contrary, if it is infeasible, i.e., ξ ∗ < t, we set optimal numerical solutions through the similar bisection-based
tU B = t for the next iteration. The iteration ends until (tU B − algorithm. Therefore, instead of solving P 3 in each iteration in
tLB ) < ε, in which ε is a desirable accuracy. Equivalently, to Algorithm 1, we need to solve the following convex optimization
1
solve P 2, we can solve the following LP problem with the fixed t1 , t2 and αi,m = M in each iteration.
N N N M
N X
X X X X
P3 : min PB,i + Pi , P5 : min PB,i + Pi,m ,
Pb Pm
i=1 i=1 i=1 i=1 m=1
s.t. C1 : P b  0, s.t. C5 : P m  0,
N N
t
X
M ·t
X

C2 : γi PB,i ≥ 2 t1 ·Bw − 1 1 + γi PB,j , C6 : γi PB,i ≥ 2 t1 ·Bw − 1 1 + γi · PB,j ,
j=i+1 j=i+1
N M
t X
t X
C3 : ηi,m Pi ≥ 2 t2 ·Bw − 1)(1 + ϕj,im Pj , C7 : ηi,m Pi,m ≥ (2 t2 ·Bw −1)(1+ηi,m · Pi,k
j6=i k=m+1
N M
and check if the solution satisfies C0. If the optimal power X X
+ ϕj,im ·( Pj,s )).
allocation policy satisfies constraint C0, then the problem P 2
j6=i s=1
is feasible; otherwise, it it is infeasible. So, by appropriately
bounding t through the bisection-based algorithm above (Algo- After solving P 5, we need to check if the solution satisfies
rithm 1), within a desirable accuracy ε, the optimum of problem C4, and update the upper bound tU B and lower bound tLB
P 1 can be obtained by solving a sequence of LP problems P 3. accordingly. In addition, the intial upper bound of t for this case
Since the LP problem P 3 is convex, hence classical convex is BMw log2 (1+γN Pmax )·t1 . Similar to the broadcasting scheme,
optimization techniques or simplex algorithm can be used to one can also obtain the optimal numerical solutions through a
solve it efficiently [35]. bisection procedure.

B. Optimal Power Allocation for HDR-NOMA Multicasting IV. P OWER A LLOCATION FOR FDR-NOMA S CHEME

Similar to the broadcasting scheme, the power allocation In this section, the optimal power allocation scheme for FDR-
problem to guarantee the QoS of the vehicles with poor channel NOMA broadcasting/multicasting scheme will be formulated.
conditions, denoted by P 4, can be expressed as The optimal numerical solutions will be also obtained via
 M
a bisection method similar to the one used in HDR-NOMA
P4 : max min αi,m · RB,i · t1 , Ri,m · t2 , system.
Pm

2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Things Journal 7

N
A. Optimal Power Allocation for FDR-NOMA Broadcasting M ·t
X
C10 : γi PB,i ≥ 2 Bw − 1 1+γi PB,j +
With the similar techniques in HDR-NOMA, the power j=i+1
allocation problem for FDR-NOMA broadcasting scheme to M
X N
X M
X
guarantee the QoS of vehicles with poor channel conditions, δRi Pi,m + δj,i · ( Pj,s )),
denoted by P 6 can be formulated as follows m=1 j6=i s=1
 B B
M
P6 : max min RB,i , Ri,m , t X
Pb C11 : ηi,m Pi,m ≥ (2 Bw − 1)(1 + ηi,m · Pi,k
N
X N
X k=m+1
s.t. C0 : PB,i + Pi ≤ Pmax , N
X XM
i=1 i=1 + ϕj,im · ( Pj,s )).
C1 : P b  0, j6=i s=1

in which the time sharing factors are set to one, since the RSU After solving P 9, we need to check if the solution satisfies
receives data from the BS and forwards the data to the vehicles C4. In addition, the upper bound of t is BMw ·log2 (1+γN Pmax ).
in its group over the same carrier frequency simultaneously. Similar to the HDR-NOMA, one can also obtain the optimal
It is obvious that the P 6 is not convex. However, we can numerical solutions through a bisection procedure.
also demonstrate the considered problem are quasi-concave.
With the similar techniques in Section III, we can get the V. S IMULATION R ESULTS AND D ISCUSSION
optimal numerical solutions through the similar bisection-based The performance of the proposed optimized HDR-NOMA
algorithm. Therefore, instead of solving P 3 in each iteration in and FDR-NOMA broadcasting/multicasting schemes will be
Algorithm 1, we need to solve the following problems, evaluated by simulations, where a optimized TDMA approach,
N N
a fixed NOMA scheme and a sub-optimal fractional power
X allocation (FTPA) scheme [27] are used for comparison.
X
P7 : min PB,i + Pi ,
Pb
i=1 i=1
s.t. C1 : P b  0, A. Simulation Parameters
C8 : γi PB,i ≥ 2
t
Bw


−1 1 + δRi Pi The number of RSUs and the vehicles within the coverage of
N N
each RSU are set to two for convenience, i.e., N = 2, M = 2.
X X
When initializing the bisection-based algorithm, the lower bound
+ δj,i · Pj + γi PB,j ,
j=i+1
tLB is set to zero since the max-min achievable rate can
j6=i
N
not smaller than zero. We also set the system bandwidth as
C9 : ηi,m Pi ≥ 2
t
Bw − 1)(1 +
X

ϕj,im Pj . Bw = 20M Hz. The upper bound tU B is set to the largest
j6=i
achievable rate when all the power at the BS is allocated to
the RSU with the largest channel gain. Hence, it is set to
After solving P 7, we also need to check if the solution satisfies Bw ·log2 (1+γN Pmax )·t1 and BMw log2 (1+γN Pmax )·t1 for the
C0, and update the upper bound tU B and lower bound tLB proposed optimized HDR-NOMA broadcasting and multicasting
accordingly. The initial upper bound of t can be Bw · log2 (1 + scheme, respectively. In the case of the proposed optimized
γN Pmax ) in this case. FDR-NOMA broadcasting and multicasting scheme, it is set to
Bw · log2 (1 + γN Pmax ) and BMw log2 (1 + γN Pmax ) respectively.
B. Optimal Power Allocation for FDR-NOMA Multicasting The desirable accuracy ε is set to 10−5 . In addition to our
proposed schemes, the following benchmark approaches are used
Similar to the HDR-NOMA scheme, the power allocation for comparison: 1) Fixed NOMA scheme, in which we set
problem for FDR-NOMA multicasting scheme to guarantee the PB,1 = 52 Pmax and PB,2 = 15 Pmax for the links from BS to
QoS of vehicles with poor channel conditions, denoted by P 8, RSUs, and set P1 = P2 = 51 Pmax and P1,2 = P2,2 = 15 1
Pmax ,
can be expressed as 2
P2,1 = P1,1 = 15 Pmax for broadcasting and multicasting
P8 :
 M
max min αi,m · RB,i M
, Ri,m

, scheme respectively for the links from the RSUs to the vehicles.
P 2) Optimized TDMA scheme, in which four time slots are
N N X
M
X X required for multicasting scenario and three for broadcasting
s.t. C4 : PB,i + Pi,m ≤ Pmax , scenario. Specifically, it takes two time slots for BS to transmit
i=1 i=1 m=1
information to the two RSUs, and one or two time slots for the
C5 : P m  0, RSU to deliver the message to the two vehicles in broadcasting
Instead of solving P 3 in each iteration in Algorithm 1, we need and multicasting scenario respectively. 3) FTPA for NOMA
to solve the following convex optimization problem, scheme [27], in which the parameter αf tpa is set to one.

N N X
M B. Simulation Results
X X
P9 : min PB,i + Pi,m , Fig. 2 plots the max-min achievable rate of different power
P
i=1 i=1 m=1 allocation schemes by varying the signal-to-noise ratio (SNR)
s.t. C5 : P m  0, under broadcasting and multicasting conditions respectively. The

2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Things Journal 8

×107 ×107
6 4.5

4
5 Max-Min Achievable Rate with Optimized Full-Duplex NOMA
Max-Min Achievable Rate with Optimized Full-Duplex NOMA
3.5 Max-Min Achievable Rate with Optimized Full-Duplex TDMA
Max-Min Achievable Rate(bit/s/Hz)

Max-Min Achievable Rate(bit/s/Hz)

Max-Min Achievable Rate with Optimized Full-Duplex TDMA
Max-Min Achievable Rate with FTPA for Full-Duplex NOMA Max-Min Achievable Rate with FTPA for Full-Duplex NOMA
Max-Min Achievable Rate with Optimized Half-Duplex NOMA Max-Min Achievable Rate with Optimized Half-Duplex NOMA
4 3 Max-Min Achievable Rate with FTPA for Half-Duplex NOMA
Max-Min Achievable Rate with Optimized Half-Duplex TDMA
Max-Min Achievable Rate with Fixed Full-Duplex NOMA Max-Min Achievable Rate with Optimized Half-Duplex TDMA
2.5 Max-Min Achievable Rate with Fixed Full-Duplex NOMA
Max-Min Achievable Rate with FTPA for Half-Duplex NOMA
Max-Min Achievable Rate with Fixed Half-Duplex NOMA Max-Min Achievable Rate with Fixed Half-Duplex NOMA
3
2

2 1.5

1
1
0.5

0 0
-10 -5 0 5 10 15 20 25 30 -10 -5 0 5 10 15 20 25 30
SNR(dB) SNR(dB)

(a) Max-min achievable rate of broadcasting schemes with different SNR. (b) Max-min achievable rate of multicasting schemes with different SNR.
Fig. 2. The performance comparison of different transmission schemes for varying SNR with δRi = 6dB and t1 = t2 = 0.5.

×107 ×107
6 4.5
Max-Min Achievable Rate with Optimized Full-Duplex NOMA
4 Max-Min Achievable Rate with Optimized Full-Duplex TDMA
Max-Min Achievable Rate with Optimized Full-Duplex NOMA
Max-Min Achievable Rate with FTPA for Full-Duplex NOMA
5 Max-Min Achievable Rate with FTPA for Full-Duplex NOMA
Max-Min Achievable Rate with Optimized Half-Duplex NOMA
Max-Min Achievable Rate with Optimized Full-Duplex TDMA 3.5
Max-Min Achievable Rate(bit/s/Hz)

Max-Min Achievable Rate(bit/s/Hz)

Max-Min Achievable Rate with Optimized Half-Duplex TDMA
Max-Min Achievable Rate with Fixed Full-Duplex NOMA
Max-Min Achievable Rate with FTPA for Half-Duplex NOMA
Max-Min Achievable Rate with Optimized Half-Duplex NOMA
Max-Min Achievable Rate with Fixed Full-Duplex NOMA
4 Max-Min Achievable Rate with Optimized Half-Duplex TDMA 3
Max-Min Achievable Rate with Fixed Half-Duplex NOMA
Max-Min Achievable Rate with FTPA for Half-Duplex NOMA
Max-Min Achievable Rate with Fixed Half-Duplex NOMA
2.5
3
2

2 1.5

1
1
0.5

0 0
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
The time sharing factor t of the first phase The time sharing factor t of the first phase
1 1

(a) Max-min achievable rate of broadcasting scheme with different time sharing (b) Max-min achievable rate of multicasting scheme with different time sharing
factor t1 . factor t1 .
Fig. 3. The performance comparison of different transmission schemes for varying time sharing factor t1 with δRi = 6dB and
SN R = 10dB.

SNR is defined as Pmax 2

δ 2 , in which the noise variance δ is set to rate of vehicles.
one in this paper. As can be observed, the proposed optimized
HDR-NOMA and FDR-NOMA schemes perform better than Fig. 3 shows the impact of time sharing factor on the
other contrast schemes in most cases. That is to say, with the achievable rate. As can be observed, with the time sharing
proposed HDR-NOMA and FDR-NOMA schemes, the vehicles factor t1 of the first phase increasing, the achievable rates
can achieve a larger minimum achievable rate than that of other of all half-duplex relay-based schemes increase first and then
schemes, which may improve the QoS (e.g., lower latency and decrease. This is because, when t1 is small, the rate that the
higher reliabiblity) for the vehicles with poor channel conditions. BS assigns to RSUs determines the rate that can be achieved by
In addition, it is clearly shown that the FDR-NOMA scheme vehicles. As t1 increases, we can get the maximum achievable
B
outperforms the HDR-NOMA scheme when δRi = 6dB. This rate when RB,i · t1 = Ri,m · t2 in broadcasting scheme and
1 M
is because, when the self-interference is sufficiently suppressed, M R B,i ·t 1 = Ri,m ·t2 in multicasting scheme. When t1 continues
better spectrum efficiency can be achieved by the proposed FDR- increasing, the transmission rate from the RSUs to vehicles
NOMA scheme. Besides, the achievable rate of all schemes first determines the achievable rate for vehicles. Different from the
increases with the increasing of SNR, and then tends to be stable. HDR-based schemes, regardless of the value of SNR, the max-
This is because, when the SNR is large enough, the transmission min achievable rate of FDR-based schemes will not be affected
power at each RSU is also very large, which makes the system by time sharing factor, since the full duplex relay can transmit
suffers severer interferences and hence restricts the achievable and receive on the same frequency simultaneously, and hence
the time sharing factor is always set to one.

2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Things Journal 9

×107 ×107
6 4
Max-Min Achievable Rate with Optimized Full-Duplex NOMA
Max-Min Achievable Rate with Optimized Full-Duplex NOMA Max-Min Achievable Rate with Optimized Full-Duplex TDMA
Max-Min Achievable Rate with FTPA for Full-Duplex NOMA
3.5
5 Max-Min Achievable Rate with FTPA for Full-Duplex NOMA
Max-Min Achievable Rate with Optimized Full-Duplex TDMA Max-Min Achievable Rate with Optimized Half-Duplex NOMA
Max-Min Achievable Rate with Fixed Full-Duplex NOMA Max-Min Achievable Rate with FTPA for Half-Duplex NOMA
3
Max-Min Achievable Rate(bit/s)

Max-Min Achievable Rate(bit/s)

Max-Min Achievable Rate with Optimized Half-Duplex NOMA Max-Min Achievable Rate with Optimized Half-Duplex TDMA
Max-Min Achievable Rate with Optimized Half-Duplex TDMA Max-Min Achievable Rate with Fixed Full-Duplex NOMA
4 Max-Min Achievable Rate with FTPA for Half-Duplex NOMA Max-Min Achievable Rate with Fixed Half-Duplex NOMA
Max-Min Achievable Rate with Fixed Half-Duplex NOMA 2.5

3 2

1.5
2

1
0.5

0 0
0 5 10 15 20 25 30 0 5 10 15 20 25 30
Residual Self-interference Channel Gain Residual Self-interference Channel Gain

(a) Max-min achievable rate of broadcasting scheme with different δRi . (b) Max-min achievable rate of multicasting scheme with different δRi .
Fig. 4. The performance comparison of different power allocation schemes for varying the residual self-interference channel gain
δRi with SN R = 10dB and t1 = t2 = 0.5.

In addition, as shown in Fig. 2(a) and Fig. 3(a), with t1 and scheme, which implies that FDR-NOMA can further guarantee
SN R increasing, the rate with optimized TDMA and the rate the LLHR requirements in V2X communications compared
with optimized NOMA tend to be consistent in broadcasting with HDR-NOMA. In addition, Fig. 5(c) and (d) depict the
scenarios. It is not difficult to understand that when t1 is small, cumulative distribution function of the achievable rate of all
the achievable rate is depend on the links from the BS to RSUs, vehicles in broadcasting and multicasting schemes respectively,
hence, the rate with optimized TDMA is not as good as the which shows the performance of the proposed schemes in large
rate with optimized NOMA. As t1 increases, we can get the rate region is worse than that of the comparison schemes. That
B
maximum achievable rate when RB,i · t1 = Ri,m · t2 . When is to say the probability to obtain a large transmission rate in
t1 continues increasing, the transmission rate from the RSUs to the proposed FDR-NOMA and HDR-NOMA schemes is lower
vehicles determines the achievable rate for vehicles. Hence their than that of the comparison schemes. However, we can also
rates tend to be consistent since they use the same manner to see that most vehicles can get a medium transmission rate with
transmit information for the links from RSUs to vehicles. Dif- our proposed schemes. It reveals that the vehicles with the
ferent from the broadcasting schemes, the multicasting scheme poor channel conditions get a better rate at the expense of the
with optimized TDMA takes two time slots in the second phase. transmission rate of users with good transmission conditions.
Hence, the superior efficiency of the proposed HDR-NOMA In this way, the QoS of vehicles with poor channel conditions
multicasting scheme can be inferred immediately from the fact can be improved while slightly degrading the performance of
that the number of required time slots has been reduced from vehicles with good channel conditions.
four to two which explains the result that the optimized HDR-
NOMA multicasting scheme outperforms the optimized TDMA VI. C ONCLUSIONS
scheme in Fig. 2(b) and Fig. 3(b). In this paper, two NOMA-based relay-assisted broadcasting
In Fig. 4, the achievable rates for different transmission and multicasting schemes have been proposed for 5G cellu-
schemes are shown by varying the residual self-interference lar V2X communications, and the power allocation problems
channel gain δRi with SN R = 10dB. As we can see, the of the proposed HDR-NOMA and FDR-NOMA broadcast-
max-min achievable rate of HDR schemes does not change ing/multicasting transmission schemes have been investigated
with δRi , since the HDR-based schemes inherently avoid the to maximize the minimum achievable rate of vehicles for the
self-interference. Besides, the proposed FDR-NOMA scheme purpose to guarantee the QoS of vehicles with poor channel
gives a significant performance improvement over the HDR- conditions. We show that the formulated problem is neither
NOMA scheme when δRi is relatively small. However, as δRi convex nor concave. Fortunately, it is shown the considered
increases, the performance of FDR-NOMA scheme decreases problems are quasi-concave. Hence, to solve it efficiently, we
and eventually even lower than HDR-NOMA scheme since the transform it into a sequence of convex feasibility problems
self-interference is so large that becomes the dominated factor. and obtain the solution by a bisection-based power allocation
On the top of the next page, Fig. 5(a) and (b) provide the algorithm. Simulation results demonstrate that the proposed
cumulative distribution function of max-min achievable rate in scheme outperforms the existing NOMA scheme with fixed
broadcasting scheme and multicasting scheme respectively. It power allocation and optimized TDMA scheme, and achieves a
reveals that the minimum rate of the proposed schemes are significant performance improvement with respect to the FTPA
better than comparison schemes. Besides, compared with HDR- method. Besides, the proposed FDR-NOMA scheme can further
NOMA scheme, better QoS can be achieved by FDR-NOMA achieve larger max-min achievable rate than that of the proposed

2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Things Journal 10

CDF CDF
1 1

0.9 0.9

0.8 0.8
CDF of Max-Min Achievable Rate

CDF of Max-Min Achievable Rate

0.7 0.7

0.6 0.6

0.5 0.5
Max-Min Achievable Rate with Fixed Half-Duplex NOMA
0.4 Max-Min Achievable Rate with Fixed Half-Duplex NOMA 0.4 Max-Min Achievable Rate with Fixed Full-Duplex NOMA
Max-Min Achievable Rate with Optimized Half-Duplex TDMA Max-Min Achievable Rate with Optimized Full-Duplex TDMA
Max-Min Achievable Rate with FTPA for Half-Duplex NOMA Max-Min Achievable Rate with FTPA for Half-Duplex NOMA
0.3 Max-Min Achievable Rate with Optimized Half-Duplex NOMA 0.3 Max-Min Achievable Rate with Optimized Half-Duplex TDMA
Max-Min Achievable Rate with Fixed Full-Duplex NOMA Max-Min Achievable Rate with FTPA for Full-Duplex NOMA
0.2 Max-Min Achievable Rate with Optimized Full-Duplex TDMA 0.2 Max-Min Achievable Rate with Optimized Half-Duplex NOMA
Max-Min Achievable Rate with FTPA for Full-Duplex NOMA Max-Min Achievable Rate with Optimized Full-Duplex NOMA
Max-Min Achievable Rate with Optimized Full-Duplex NOMA
0.1 0.1

0 0
0 1 2 3 4 5 6 7 0 0.5 1 1.5 2 2.5 3 3.5 4
7
Max-Min Achievable Rate(bit/s) ×10 Max-Min Achievable Rate(bit/s) ×107

(a) CDF for the max-min achievable rate in broadcasting scheme. (b) CDF for the max-min achievable rate in multicasting scheme.

CDF CDF
1 1

0.9 0.9
CDF of Achievable Rate of All Vehicles

CDF of Achievable Rate of All Vehicles

0.8 0.8

0.7 0.7

0.6 0.6

0.5 0.5

0.4 0.4 Achievable Rate with Fixed Half-Duplex NOMA

Achievable Rate with Fixed Half-Duplex NOMA
Achievable Rate with Optimized Half-Duplex TDMA
Achievable Rate with Optimized Half-Duplex TDMA
Achievable Rate with Fixed Full-Duplex NOMA
0.3 Achievable Rate with FTPA for Half-Duplex NOMA 0.3 Achievable Rate with FTPA for Half-Duplex NOMA
Achievable Rate with Optimized Half-Duplex NOMA
Achievable Rate with Optimized Full-Duplex TDMA
Achievable Rate with Fixed Full-Duplex NOMA
0.2 0.2 Achievable Rate with Optimized Half-Duplex NOMA
Achievable Rate with Optimized Full-Duplex TDMA
Achievable Rate with FTPA for Full-Duplex NOMA
Achievable Rate with FTPA for Full-Duplex NOMA
Achievable Rate with Optimized Full-Duplex NOMA
0.1 Achievable Rate with Optimized Full-Duplex NOMA 0.1

0 0
0 2 4 6 8 10 12 14 0 1 2 3 4 5 6 7
Achievable Rate(bit/s) 7 Achievable Rate(bit/s) 7
×10 ×10

(c) CDF for the achievable rate of all vehicles in broadcasting scheme. (d) CDF for the achievable rate of all vehicles in multicasting scheme.
Fig. 5. The cumulative distribution function of achievable rate for different transmission schemes with SN R = 5dB, δRi = 6dB
and t1 = t2 = 0.5.

HDR-NOMA scheme when the self-interference is sufficiently [3] S. Sun, J. Hu, Y. Peng, and X. Pan, “Support for vehicle-to-everything
suppressed. services based on LTE,” IEEE Wireless Commun., vol. 23, no. 3, pp. 4–8,
Jun. 2016.
In addition, the proposed schemes are designed to achieve a [4] S. Chen, J. Hu, Y. Shi, and L. Zhao, “Technologies, standards and
better rate for vehicles with the poor channel conditions at the applications of LTE-V2X for vehicular networks,” Telecommunications
expense of slightly degrading the transmission rate of vehicles Science, vol. 34, no. 4, pp. 1–11, Apr. 2018.
[5] T. Soni, A. R. Ali, K. Ganesan, and M. Schellmann, “Adaptive numerology
with better transmission conditions. Also, it is worth mentioning - A solution to address the demanding QoS in 5G-V2X,” in Proc.IEEE
that the schemes proposed in this paper can achieve a significant WCNC, Barcelona, Spain, Apr. 2018, pp. 1–6.
performance, but all of them are centralized schemes, so the [6] L. Song, Y. Li, Z. Ding, and H. V. Poor, “Resource management in non-
orthogonal multiple access networks for 5G and beyond,” IEEE Network,
resource management algorithms need to be implemented at vol. 31, no. 4, pp. 4–14, Aug. 2017.
the BS, and all users need to feedback CSI to the BS, which [7] Y. Saito, Y. Kishiyama, A. Benjebbour, T. Nakamura, A. Li, and
requires large signaling overhead. Distributed algorithms can be K. Higuchi, “Non-orthogonal multiple access (NOMA) for cellular future
radio access,” in Proc. IEEE VTC’13, Dresden, Germany, Jun. 2013, pp.
considered in the future. 1–5.
[8] Q. Sun, S. Han, I. Chin-Lin, and Z. Pan, “On the ergodic capacity of
MIMO NOMA systems,” IEEE Wireless Commun. Lett., vol. 4, no. 4, pp.
R EFERENCES 405–408, Aug. 2015.
[9] K. Zheng, Q. Zheng, P. Chatzimisios, W. Xiang, and Y. Zhou, “Hetero-
[1] G. Karagiannis, O. Altintas, E. Ekici, G. Heijenk, B. Jarupan, K. Lin, and geneous vehicular networking: A survey on architecture, challenges, and
T. Weil, “Vehicular networking: A survey and tutorial on requirements, solutions,” IEEE Commun. Surveys Tuts., vol. 17, no. 4, pp. 2377–2396,
architectures, challenges, standards and solutions,” IEEE Commun. Surveys Jun. 2015.
Tuts., vol. 13, no. 4, pp. 584–616, Sept. 2011. [10] L. Dai, B. Wang, Y. Yuan, S. Han, I. Chih-Lin, and Z. Wang, “Non-
[2] H. Yang, K. Zheng, L. Zhao, K. Zhang, P. Chatzimisios, and Y. Teng, orthogonal multiple access for 5G: solutions, challenges, opportunities, and
“High reliability and low latency for vehicular networks: Challenges and future research trends,” IEEE Commun. Mag., vol. 53, no. 9, pp. 74–81,
solutions,” arXiv:1712.00537, Dec. 2017. Sept. 2015.

2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Things Journal
[11] B. Di, L. Song, Y. Li, and Z. Han, “V2X meets NOMA: Non-orthogonal
multiple access for 5G-enabled vehicular networks,” IEEE Wireless Com-
mun., vol. 24, no. 6, pp. 14–21, 2018.
[12] B. Di, L. Song, Y. Li, and G. Y. Li, “Non-orthogonal multiple access for
high-reliable and low-latency V2X communications in 5G systems,” IEEE
J. Sel. Areas Commun., vol. 35, no. 10, pp. 2383–2397, Oct. 2017.
[13] ——, “NOMA-based low-latency and high-reliable broadcast communica-
tions for 5G V2X services,” in Proc. IEEE GLOBECOM’ 17, Singapore,
Dec. 2017, pp. 1–6.
[14] B. W. Khoueiry and M. R. Soleymani, “An efficient NOMA V2X commu-
nication scheme in the internet of vehicles,” in Proc.IEEE 85th Vehicular
Technology Conference (VTC Spring), Sydney, NSW, Australia, Jun. 2017,
pp. 1–7.
[15] Y. Chen, L. Wang, Y. Ai, B. Jiao, and L. Hanzo, “Performance analysis of
NOMA-SM in vehicle-to-vehicle massive MIMO channels,” IEEE J. Sel.
Areas Commun., vol. 35, pp. 2653–2666, Dec. 2017.
[16] Z. Ding, M. Peng, and H. V. Poor, “Cooperative non-orthogonal multiple
access in 5G systems,” IEEE Commun. Lett., vol. 19, no. 8, pp. 1462–1465,
Jun. 2015.
[17] J. B. Kim and I. H. Lee, “Capacity analysis of cooperative relaying systems
using non-orthogonal multiple access,” IEEE Commun. Lett., vol. 19,
no. 11, pp. 1949–1952, Nov. 2015.
[18] Y. Liu, Z. Ding, M. Elkashlan, and H. V. Poor, “Cooperative non-
orthogonal multiple access with simultaneous wireless information and
power transfer,” IEEE J. Sel. Areas Commun., vol. 34, no. 4, pp. 938–953,
Apr. 2016.
[19] X. Yue, Y. Liu, S. Kang, and A. Nallanathan, “Performance analysis of
NOMA with fixed gain relaying over nakagami-m fading channels,” IEEE
Access, vol. 5, pp. 5445–5454, Mar. 2017.
[20] Z. Wang, J. Hu, G. Liu, and Z. Ma, “Optimal power allocations for relay-
assisted NOMA-based 5G V2X broadcast/multicast communications,” in
Proc.IEEE/CIC ICCC, Beijing, China, Aug. 2018, pp. 591–596.
[21] T. Riihonen, S. Werner, and R. Wichman, “Mitigation of loopback self-
interference in full-duplex MIMO relays,” IEEE Trans. on Signal Process-
ing, vol. 59, no. 12, pp. 5983–5993, Dec. 2011.
[22] G. Liu, F. R. Yu, H. Ji, V. C. M. Leung, and X. Li, “In-band full-
duplex relaying: A survey, research issues and challenges,” IEEE Commun.
Surveys and Tutorials, vol. 17, no. 2, pp. 500–524, May 2015.
[23] A. Sabharwal, P. Schniter, D. Guo, and D. W. Bliss, “In-band full-duplex
wireless: Challenges and opportunities,” IEEE J. Sel. Areas Commun.,
vol. 32, no. 9, pp. 1637–1652, Sept. 2014.
[24] T. Riihonen, S. Werner, and R. Wichman, “Hybrid full-duplex/half-duplex
relaying with transmit power adaptation,” IEEE Trans. Wireless Commun.,
vol. 10, no. 9, pp. 3074–3085, Sept. 2011.
[25] Z. Ding, Z. Yang, P. Fan, and H. V. Poor, “On the performance of non-
orthogonal multiple access in 5G systems with randomly deployed users,”
IEEE Signal Process. Lett., vol. 21, no. 12, pp. 1501–1505, Dec. 2014.
[26] J. Tang and X. Zhang, “Cross-layer resource allocation over wireless relay
networks for quality of service provisioning,” IEEE J. Sel. Areas Commun.,
vol. 25, no. 4, pp. 645–656, May 2007.
[27] N. Otao, Y. Kishiyama, and K. Higuchi, “Performance of non-orthogonal
access with SIC in cellular downlink using proportional fair-based resource
allocation,” in Proc. IEEE Wireless Commun. Syst., Paris, France, Aug.
2012, pp. 476–480.
[28] M. B. Shahab, M. F. Kader, and S. Y. Shin, “On the power allocation of
non-orthogonal multiple access for 5G wireless networks,” in Proc. IEEE
ICOSST’16, Lahore, Pakistan, Dec. 2016, pp. 89–94.
[29] G. Liu, Z. Ma, X. Chen, Z. Ding, R. Yu, and P. Fan, “Cross-layer power
allocation in non-orthogonal multiple access systems for statistical QoS
provisioning,” IEEE Trans. Veh. Technol., vol. 66, no. 12, pp. 11 388–
11 393, Dec. 2017.
[30] Z. Yang, Z. Ding, P. Fan, and N. Al-Dhahir, “A general power allocation
scheme to guarantee quality of service in downlink and uplink NOMA
systems,” IEEE Trans. Wireless Commun., vol. 15, no. 11, pp. 7244–7257,
Aug. 2016.
[31] G. Liu, X. Chen, Z. Ding, Z. Ma, and F. R. Yu, “Hybrid half-duplex/full-
duplex cooperative non-orthogonal multiple access with transmit power
adaptation,” IEEE Trans. Wireless Commun., vol. 17, no. 1, pp. 506–519,
Jan. 2018.
[32] W. Cheng, X. Zhang, and H. Zhang, “Full/half duplex based resource
allocations for statistical quality of service provisioning in wireless relay
networks,” in Proc. IEEE INFOCOM, Orlando, FL, USA, May 2012, pp.
864–872.
[33] Z. Zhang, Z. Ma, M. Xiao, Z. Ding, and P. Fan, “Full-duplex device-
to-device-aided cooperative nonorthogonal multiple access,” IEEE Trans.
Vehicular Technology, vol. 66, no. 5, pp. 4467–4471, May 2017.
2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
11
[34] D. Tse and P. Viswanath, Fundamentals of wireless communication.
Cambridge University Press, 2005.
[35] S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Univer-
sity Press, 2013.
[36] S. Timotheou and I. Krikidis, “Fairness for non-orthogonal multiple access
in 5G systems,” IEEE Signal Process. Lett., vol. 22, no. 10, pp. 1647–1651,
Oct. 2015.
Gang Liu (M’15) is currently a lecturer at the School
of Information Science and Technology, Southwest
Jiaotong University (SWJTU), Chengdu, China. He
received the Ph.D. degree in Communication and In-
formation Systems from Beijing University of Posts
and Telecommunications (BUPT) in 2015, and the
B.S. degree in Electronics and Information Engineering
from Sichuan University (SCU) in 2010. He was also
with the University of British Columbia and Carleton
University as a visiting PhD student from Nov. 2013
to Nov. 2014.
His current research interests include 5G cellular networks, connected vehicle
networks, full-duplex wireless, network virtualization, resource management,
cross-layer design and protocol optimization. Dr. Liu has co-authored more than
30 technical papers in international journals and conference proceedings. He won
the Excellent Doctoral Dissertation Award of BUPT in 2015, the Best Paper
Award in IEEE ICC’2014, and the Second Prize in the National Undergraduate
Electronic Design Contest of China in 2009. He is now serving as the secretary
and treasurer for IEEE ComSoc, Chengdu Chapter. He has also served as
reviewers/TPC members for numerous journals and conferences, such as IEEE
Journal on Selected Areas in Communications, IEEE Transactions on Wireless
Communications, IEEE Transactions on Communications, IEEE Transactions
on Vehicular Technology, IEEE Transactions on Green Communications and
Networking, IEEE Communications Letters, IEEE Access, Digital Signal Pro-
cessing, Wireless Networks, International Journal of Communication Systems,
China Communications, KSII Transactions on Internet and Information Systems,
IEEE ICC2012, IEEE Globecom2013, IEEE WCNC2014, CloudCom2015,
5GiSC 2015, WOCC2016, VTC2016-Spring, ICC2017, Globecom2017 and so
on.
Zhiqing Wang received the B.Eng. degree from South-
west Jiaotong University in 2017. She is currently
pursuing the master degree with the Department of
Electronic and Communication Engineering, South-
west Jiaotong University.
Her research interests include vehicular networks
and non-orthogonal multiple access.
Jiewen Hu received the B.Eng. degree from Southwest
Jiaotong University in 2017. He is currently pursuing
the master degree with the Department of Electronic
and Communication Engineering, Southwest Jiaotong
University.
His research interests include vehicular networks and
non-orthogonal multiple access.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/JIOT.2019.2908415, IEEE Internet of
Things Journal 12

Zhiguo Ding (S’03-M’05-SM’15) received the B.Eng

degree in Electrical Engineering from the Beijing Uni-
versity of Posts and Telecommunications in 2000, and
the Ph.D degree in Electrical Engineering from Impe-
rial College London in 2005. From Jul. 2005 to Aug.
2014, he was working in Queen’s University Belfast,
Imperial College and Newcastle University. Since Sept.
2014, he has been with Lancaster University as a Chair
Professor. From Oct. 2012 to Sept. 2016, he has also
been an academic visitor in Princeton University.
Dr Ding’s research interests are 5G networks, game
theory, cooperative and energy harvesting networks and statistical signal process-
ing. He is serving as an Editor for IEEE Transactions on Communications, IEEE
Transactions on Vehicular Technology, IEEE Wireless Communication Letters,
IEEE Communication Letters, and Journal of Wireless Communications and
Mobile Computing. He received the best paper award in IET Comm. Conf. on
Wireless, Mobile and Computing, 2009, IEEE Communication Letter Exemplary
Reviewer 2012, and the EU Marie Curie Fellowship 2012-2014.

Pingzhi Fan (M’93-SM’99-F’15) received the M.Sc.

degree in computer science from the Southwest Jiao-
tong University, China, in 1987, and the Ph.D. degree
in electronic engineering from the University of Hull,
U.K., in 1994. He has been a Visiting Professor with
the University of Leeds, U.K., since 1997, and a Guest
Professor with Shanghai Jiao Tong University since
1999.
He is currently a Professor and the Director of
the Institute of Mobile Communications, Southwest
Jiaotong University. He has over 290 research papers
published in various international journals, and eight books (including edited),
and is the inventor of 22 granted patents. His research interests include vehicular
communications, wireless networks for big data, and signal design and coding.
He is a fellow of IET, CIE, and CIC. He was a recipient of the U.K. ORS
Award (1992), the NSFC Outstanding Young Scientist Award (1998), and the
IEEE VTS Jack Neubauer Memorial Award (2018). He served as the general
chair or TPC chair of a number of international conferences. He is the Founding
Chair of the IEEE VTS BJ Chapter and the IEEE ComSoc CD Chapter and the
Founding Chair of the IEEE Chengdu Section. He is a guest editor or an editorial
member of several international journals. He also served as a Board Member of
the IEEE Region 10, IET (IEE) Council, and IET Asia-Pacific Region. He is an
IEEE VTS Distinguished Lecturer from 2015 to 2019.

2327-4662 (c) 2018 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.