Balanced Performance Between Energy-Delay and Bit Error Rate in UAV Relay Networks
Balanced Performance Between Energy-Delay and Bit Error Rate in UAV Relay Networks
Abstract—This paper presents a new strategy for nano-satellite communication applications, which are expected
arXiv:2205.00797v2 [eess.SP] 15 May 2022
In the first hop, the relay receives signals from both S a and In order to manage P value, the power allocation strategy
S b as is used to allocate a specific power value to the relay and
q
q
−α both user nodes. All nodes have inclusive knowledge of
YR [n] = pa n χa h + pb n χb g db2 + nR, (3) information about channels and maximum transmission power
−α −α for each related node [33], so both S a and S b nodes achieve
where h da2 and g db2 are the fading channels model defined the allocation strategy by employing the reverse channels for
in [31], nR is the Gaussian noise of the relay with zero mean feedback allocated energy factors to the corresponding node.
After that, S a , S b and relay nodes adjust their transmit power Input: P, x(t), αa , αb , and αr
based on these feedback factors [34]. Initialization of parameters
It assumes that the energy allocation factors S a , R and S b , while t , 0 do
respectively, are set as da ← (1)
αa ⇒ {αa :∈ R, → 0 ≤ αa ≤ 1} , (11) db ← (2)
αr ⇒ {αr :∈ R, → 0 ≤ αr ≤ 1} , (12) γa ← EYa [n] ⊲ expectation value of (9)
αb ⇒ {αb :∈ R, → 0 ≤ αb ≤ 1} . (13) γa ← EYb [n] ⊲ expectation value of (10) pa = P αa
; pb = P αb ; pr = P αr
Once received, the corresponding nodes adjust their powers
γa ← (14)
as P αb , P αr and P αa . So, substituting these regulated powers
γb ← (15)
into (9) and (10) and considering high SNR domain, we get end
αr n γb αb n γa da−7 db−7 Output: SNR
γa [n] = P , (14)
γa (αr n + αa n )da−7 + αb n γb db−7 Algorithm 1: Procedure of SNR analysis
αr n γb αa n γa da−7 db−7
γb [n] = P , (15)
αa n γa da−7 + (αr n + αb n ) γb db−7
where γa and γb are the high SNRs domain for (9) and (10), allows total energy consumption and data transmission time
respectively (delay) to be minimised under a balanced approach.
Now, another metric is the channel capacity, which is given In Shannon’s theorem, prolonging the transmission
by 1 time reduces transmitting power. Thus, the total energy
C[n] = log2 (1 + φ[n]). bits/s, (16) consumption in UAV networks is minimised by maximising
2
transmission time. However, increasing transmission delay
where φ[n] = 1 + γa[n] + γb[n] + γa[n]γb [n].
in transmitting the information directly affects the user’s
To adapt reliably transmitted information rate (R), we have
service. Hence, transmission time (q) and power networks
R[n] = h C[n] (0 < h < 1) (17) must be designed with a trade-off scheme. q is the amount
At h = 1,the maximum data rate in (16) becomes of time required by a user to send out a single packet of
1 bits; it depends on the network’s bandwidth and length of
ℜi = ℜa + ℜb = log2 (1 + γa[n]) + log2 (1 + γb[n]) , (18) the packet, as q = (Data size/bandwidth) (sec). By using
2
where ℜi is the total data rate in two way [35]. low-latency algorithms or low-delay transmission protocols,
As mentioned earlier, the data rate R[n] is passed through data transmission amounts can be adjusted, and delays can
two hops, i.e., two cascade channels. The transmission rate be reduced. Such approaches allow the data transmission
through two channels is subjected to an Information Cascade amount to be managed according to the change in delay
(IC) analysis [36], which is defined as a propagation sequence performance due to a change in transmission amount. Each
of data bits transmitting over chaotic channels. Further, the data bit delivered at q can consume energy (E) as E = q P.
mutual-information flow along the cascade of channels cannot Then, the total energy model in UAV is defined from (14),
exceed each channel individually. Along the cascade channels, (15) and (17) as follows
the flow mutual information capacity cannot overpass each 2
Ea n = q[n] (αr n + αa n )H + αb n G 2 q[n] − 1 , (20)
channel capacity. Regarding UAV channels, the first channel
delivers a sequence of bits that transmitted by users nodes to 2
Eb n = q[n] αa n H + (αr n + αb n )G 2 q[n] − 1 , (21)
the R node during a time slot n = 1. The R node requires one-
slot processing to forward the received data to the S a and S b where G = γb db−7 , H = γa da−7 .
node during the second time slots, i.e. n= 2, 3, 4,...N [37]. Concurrent with the information exchanging between S a
Then, the information-causality constrain is obtained as: and S b , the overall energy consumption is typically generated
n n−1
X X by including (20) and (21), i.e., E n = Ea n + Eb n , as in
R[i] ≤ R[i] . (19)
[2]. The region E n can also be specified by the union of all
i=2 i=1
| {z } | {z } the possible sets of (Ea , Eb ) , as in [30]. Hence, if the region
Sa → R → Sb R → Sa E n is managed by varying αa , αb , αr ,then the union of the
Sb → R → Sa R → Sb two sets of energies in (20) and (21) are subject to definition
1.
S a → R → S b and S b → R → S a represent the transmitted a Definition 1. The regions of two sets Ea and Eb is
signal from S a to S b and from S b to S a , respectively, R → S a the collection of all objects that are in either set. Then,
and R → S b typify the amplified signal forwarded by R to S a the union of Ea and Eb is defined as:
S
Ei n = Ea ∪
and S b through one channel. Eb {αi : (αi ∈ Ea ) ∨ (αi ∈ Ea )} i ∈ {a, b, r}.
Now, the total energy consumption can be expressed in
IV. Energy Allocation regard to αi as the following
This section will concentrate on an energy allocation
Ei (αi ) n = Ea n + Eb n
i ∈ {a, b, r}. (22)
problem to manage energy consumption in the users and relay
nodes of UAV networks. Energy consumption is related to For each transmitted bit, the value of q can be defined as
transmission delay [38], so the proposed energy allocation q n = 1/R[n], so from (17) we have
∂(αa ,αb ,αr ,w) T
h ∂(α i
a ,αb ,αr ,w) ∂(αa ,αb ,αr ,w)
∂αa αb ∂αb αr ∂αr αa > 0. Thus, it is
−1
αr αb required to calculate the following equations
qa (αi )[n] = 2 log2 1 + GP G
, (23) 2
αr + αa + αb H ∂F(αa , αb , αr , w)
= q[n] H 2 q[n] − 1 (wa + wb )
∂αa
−1 !
αr αa αb H 2 αr GHαr (αb + αr )
qb (αi )[n] = 2 log2 1 + GP i ∈ {a, b, r} , −wr GP + . (31)
αa + (αr + αb ) G (αbG + Hαr + Hαa )2 (αbG + Gαr + Hαa )2
H 2
(24) ∂F(αa , αb , αr , w)
−1 = q[n] G 2 q[n] − 1 (wa + wb )
where (.) indicates reciprocal action. ∂αb
!
In two-way relay networks, the powers design of relay H 2 αr (αa + αr ) αaGHαr
and users nodes are defined as (pa [n] + pr [n] + pb[n]) ≤ P n]
+wr GP − , (32)
(αbG + Hαr + Hαa )2 (αbG + Gαr + Hαa )2
[32]. In this case, the proposed allocated power is expressed ∂F(αa , αb , αr , w) 2
considering (19) as = q[n] H 2 q[n] − 1 (H wa + G wb )
XN ∂r !
(pa [n] + pr [n] + pb[n]) ≤ P n . (25) αb H(αa H + αbG) αa H(αa H + αbG)
+wr GP + . (33)
n=2
| {z } (αbG + Hαr + Hαa )2 (αbG + Gαr + Hαa )2
the total transmit power of Also we have
∂(αa ,αb ,αr ,w)
two hops ∂α α
∂(αa ,αab ,αbr ,w)
The purpose of this paper is to optimize αi i.e., αa , αb and αr ∂αb αr =
∂(αa ,αb ,αr ,w)
in order to regulate the energy consumption of (20) and (21) ∂αr αa
and the transmission delay of (23) and (24) in a balanced way.
−H 2 r(αa H−Gαb +Hαr )GP GHr(αa H−G(αr +αb ))GP
Hence, the optimisation problem can be formulated as follows (αa H+Gαb +Hαr )3 (αa H+G(αr +αb )) 3
GPH 2 α2a H+αa bG+aHα r +2αb Gαr
−αa GH(αa H+αb G−Gαr )GP .
(34)
(H(αa +αr )+αb G)3 (αa H+αb G+Gαr )3
min Ea (αi )[n], (26) αb H 2 (αb G+H(αa −αr ))GP 2αa H 2 (αa H+αb G)GP
(αb G+H(αr +αa ))3 (αb G+Gαr +Hαa )3
min Eb (αi )[n], (27)
Equation (34) illustrates that the second partial derivative
min (qa (αi [n]+qb(αi )[n]), (28) h ∂(αa ,αb ,αr ,w) T
i
test ∂(αa∂α ,αb ,αr ,w)
a αb
∂(αa ,αb ,αr ,w)
∂αb αr ∂αr αa > 0. Thus, the
s.t ∀n αa [n] + αb[n] + αr [n] ≤ 1. (29) minimum local points of equations (31) to (33) are obtained
All objectives (26)-(28) must be minimized at once under after setting the first conditions, i.e., ∂F(αa∂α ,αb ,αr ,w)
a
= 0,
the constraint of (29); however, the issue is that both (26) ∂F(αa ,αb ,αr ,w) ∂F(αa ,αb ,αr ,w)
∂αb = 0 and ∂αr = 0.
and (27) are in contras to (28). Multi-objective optimisation
Before continuing with this analysis, another test should be
techniques, particularly the weight scalarization method [7],
applied to F[n (αa , αb , αr ). This test aims to find whether the F
are some of the most reliable methods for resolving such an
function is a convex function or not, as the weigh scalarization
issue. In the weight scalarization method, all of the objective
method is inefficient to find a solution with a non-convex
functions are consolidated into a single function that appears as
function [39]. To achieve such a test, the Bordered Hessian
a linear function. Many studies have adopted the scalarization
(Hb ) matrix is employed as follows:
approach to optimise different mathematical functions such h i
as quadratic and logarithmic functions. By employing the z T Hb z = z 1 z 2 z 3 z 4
scalarization approach to minimise (26)-(28) under constraint ∂F(αa ,αb ,αr ,w) ∂F(αa ,αb ,αr ,w)
0
(29), the following expression is obtained ∂F(αa ,αb ,αr ,w) ∂2 F(αa∂α,αab ,αr ,w) ∂F2 (αa∂α b
,αb ,αr ,w)2
N
X ∂αa ∂α2a ∂αa ∂αb
F(αa , αb , αr , w)[n] = (wa Ea (αi )[n] + wb Ea (αi )[n] ∂F(αa ,αb ,αr ,w) ∂2 F(αa ,αb ,αr ,w) ∂2 F(αa ,αb ,αr ,w)
∂αb ∂αa ∂αb ∂α2b
n=2
+wr (qa (αi )[n] + qb(αi )[n])) ∀n, (30) ∂F(αa ,αb ,αr ,w) ∂2 F(αa ,αb ,αr ,w) ∂2 F(αa ,αb ,αr ,w)
∂αr ∂αa ∂αr ∂αb ∂αr
where wa {wa : ∈ R, 0 < wa ≤ 1}, wb {wb : ∈ R, 0 < wb ≤ 1} ∂F(αa ,αb ,αr ,w)
∂αr
and wr {wr : ∈ R, 0 < wr ≤ 1} . ∂2 F(αa ,αb ,αr ,w) z1
z
The weight coefficients are limited to the following ∂αa ∂αr 2 . (35)
P ∂2 F(αa ,αb ,αr ,w)
constraint: m i wi ≤ 1,where m is the number of functions ∂αb ∂αr
z3
and i ∈ {a, b, r}. Equation (30) reveals that both qa (αi )[n] and ∂2 F(αa ,αb ,αr ,w) z4
qb (αi )[n] express as linear with a single weight coefficient; ∂α2r
this is because the proposed system model assumes that S a Substituting (31)-(34) into (35) leads to the following
and S b , are exchanging information simultaneously with each results: zT Hb z ≥ 0, i.e., Hb is non-negative. Therefore, the
other through R. Hessian matrix is positive semidefinite; hence F(αa , αb , αr , w)
The minimum solution of the objective function is a set of convex.
h iT
F(αa , αb , αr , w) is obtained by satisfying the conditions
h ∂(α ,α ,α ,w) ∂(α ,α ,α ,w) ∂(α ,α ,α ,w) iT Now, we evaluate ∂(αa ,α∂αba,αr ,w) ∂(αa ,α∂αbb,αr ,w) ∂(αa ,α∂αb r,αr ,w) =
a b r a b r a b r
∂αa ∂αb ∂αr = 0 and 0 from (31) to (33). This gives
q Input: γa , and γb
∗ 1
Initialization of parameters
αa (w j ) = ψb ± ψ2b + 2ψa ψc ∀n, (36)
ψa while t , 0 do
!
∗ 1 q H R ← (18)
αb (w j ) = ψb ± ψ2b + 2ψa ψc −1 +1 Ea (αa , αb , αr ) ← (20)
ψa G
v
u
t q[n]
u 2
Eb (αb , αb , αr ) ← (21)
q 2 − 1 [ H − G] qa (αa , αb , αr ) ← (23)
(1 − w3 ) ∀n, (37) qb (αa , αb , αr ) ← (24)
2HGP(w3 ) for wi = 0 : to 1 do
q
∗ 1
for w j = 0 : to 1 do
αr (w j ) = 1 − ψb ± ψ2b + 2ψa ψc
ψa F(αa , αb , αr , wi, j ) ← (30)
q ! ∗
1 2
H
αa (wi, j ) ← (36)
− ψb ± ψb + 2ψa ψc −1 +1 ∗
ψa G αb (wi, j ) ← (37)
v
u ∗
t q[n]
u 2
αr (wi, j ) ← (38)
q 2 − 1 [ H − G] ∗ ∗ ∗ ∗
(1 − w3 ) ∀n, (38) qi (αa , αb , αr ) ← (39)
∗ ∗ ∗ ∗
2HGP(w3 ) Ei (αa , αb αr ) ← (40)
where (w j ) : j ∈ {a ∨ b, r}, ∨ is ’or’ symbol, ψa = 2 (G − H) end
2
q 2 q[n] − 1 [H − G] (w2 ) end
1 end
1 − − (G − H),
2HGP(w3 ) (G − H) + H Output: Ea (αa , αb , αr );Eb (αb , αb , αr );
s ! qa (αb , αb , αr );qb (αb , αb , αr )
2
q 2 q[n] −1 [ H−G] Algorithm 2: Proposed energy-delay trade-off
H
ψb = G −1 G
2HP(w3 )
(1 − w3 )+2G and
s 2
!
q 2 q[n] −1 [ H−G]
ψc = G (1 − w3) − G. bit error metric defines the number of errors that occur during
2HP(w3 )
The solution of (36)-(38) depend on any variation of two- data transmission on the UAV network. It can be reformatted
weight coefficient, and this gives an expected result because for each transmitted bit (i.e. R = 1) as follows
the proposed system model has two sources, S a and S b ,
and both sources contribute to adjusting the energy allocation 1 1 1
∗
= + ,
∗ ∗ ∗ ∗
parameters. Based on several w j , (36)-(38) provide a trade- γ(w j )[n] αr (w j ) + 2αa (w j ) HP αr (w j ) + 2αb (w j ) PG
off between energy consumption and transmission time. This (41)
agrees with the analysis in [40], which demonstrated that ∗
where γ(w j ) the optimal SNR.
the weight scalarization method produce trade-off solution by
repeating the analysis process for several weight coefficients. Equation (41) reveals that the SNR is increasing function
∗ ∗ ∗
Thus, the solution (28) is obtained by using (36)-(38) as of optimal allocation factor (ϕi ), ϕi ∈ αa (w j ), αb (w j ), αr (w j ) .
follows: ∗ Further, according to [41], bit error rate decreases when the
q n (w ) = 2/ 1 + log 1 + Φ n .
i j 2 (39)
overall received SNR is maximised. Thus, increasing ϕi in (41)
By adding (26) and (27) together, the total energy allows bit error rate to be minimised as demonstrate in the
consumption solution is calculated in terms of (36)-(38) as following analysis.
follows: In the proposed UAV network, the transmitted signal from a
∗ 2
∗ ∗ ∗
Ei n (w j ) = qi n 2 q[n] − 1 αr (w j ) + 2αa (w j ) H Sa to the Sb node propagates through two cascaded channels,
as illustrated in (1). Each channel is a Rayleigh fading and, in
∗ ∗
+ αr (w j ) + 2αb (w j ) G j ∈ {a ∨ b, r} , (40) such a link, SNR follows a negative exponential distribution.
∗ ∗
! Then the total SNR obtained from two i.i.d channels follows a
αr (w j ) αb (w j )
where, Φ n = 1 + log2 1 + GP ∗ ∗ ∗ negative exponential distribution. To find the total probability
αr (w!j )+αa (w j )+αb (w j ) G
∗ ∗
H density function (pdf) of the Sa − R and R − Sb channels,
αr (w j )αb (w j )
+ log2 1 + GP ∗ ∗ ∗ G
distribution of the harmonic mean of two i.i.d. gamma random
αr (w j )+αa (w j )+!αb (w j ) H
∗ ∗ variables demonstrated in [42] is applied as follows: first define
αr (w j ) αa (w j )
1 + GP ∗ ∗ ∗ pdf of the Sa − R as
αa (w j )+(αr (w j )+αb (w j )) G H !
∗ ∗ η
αr (w j ) αa (w j ) −
+ log2 1 + GP ∗ ∗ ∗ . e γh p [n]
h
αa (w j )+(αr (w j )+αb (w j )) HG pd f = , (42)
γh p [n]
The (39) and (40) procedures are listed in Algorithm 2.
and pdf of the R − Sb link as
V. Bit error rate performance
∗ −
η
This section discusses the optimum bit error rate (áe ) e γg p [n]
g
behaviour of the UAV network based on Equation (40). The pd f = , (43)
γg p [n]
∗ ∗
∗ αr (w j ) αb (w j ) ∗
where γh p [n] = αr (w j ) HP, γg p [n] = ∗ ∗ GP, and η is Input: ϕi
αr (w j )+αa (w j )
the harmonic mean according to a gamma distribution defined Initialization of parameters
as η = µH (γh p [n], γg p [n]) [43]. while t , 0 do
To joint (42) and (43), the modified harmonic mean for wi = 0 : to 1 do
∗
demonstrated in [44] is applied as follows γ(wi )[n] ← (41)
2 2η pd f h ← (42)
pd f t (η) = k0 p
pd f g ← (43)
γh p [n] γg p [n] γh p [n] γg p [n]
γh p [n]+γg p [n]
F (η) ← (46)
γh p [n] + γg p [n] 2η −η ( γ p [n] γ p [n] ) end
k1 p 2η e
h g ,
γh p [n]γg p [n] 3/2 γh p [n] γg p [n] end
(44) Output: áe [n]
where pd f t (η) is the total pdf, k0 (.) and k1 (.) are the first Algorithm 3: Bit error rate performance
and the second order modified Bessel function of the second
kind.
Equation (44) is simplified by applying the modified Bessel scheme. The results of (20)-(24) are plotted under the name
function properties as k0 (η) → 0 and k1 ( η ) → 1/η. This Sub-optimal Network (SN).
η→0
! Fig. 2 illustrates optimal trade-off curves between energy
−η 1 1 ∗
γh p [n] + γg p [n] and delay corresponding to various values of αi (wj ). Each
gives pd f t (η) ≈ γ p1[n] + γ p1[n] e . By integrating
h g
t point on the curve corresponds to different energy delay
pd f (η) relative to η, the cumulative distribution function is ∗
levels, and it is calculated by adjusting αi (wj ) within the
obtained ! range between 0 and 1. Based on the trade-off relationship
−η γ p1 [n] + γ p1 [n]
F (η) = 1 − e h g
, (45) between energy and delay, we find that the energy decreases
∗
monotonically with delay. By increasing αi (wj ), the optimum
where F (η) is the cumulative distribution function for pd f t (η). ∗
delay decreases under the same energy, as the αi (wj ) for the
At high SNR domain, the first order expansion of F (η) is delay objective is decreased. In the same manner, increasing
given by ∗
αi (wj ) leads to reduce energy consumption due to the long
! delay in data delivery. As observed, any curve associated
1 1 ∗
F (η) = η + + o x1+ε , 0 < ε < 1 (46) with a specific αi (wj ), follows an exponential decay unit
γh p [n] γg p [n] approaches to a steady when the transmission delay leans
Now, the approximate bit error rate of the UAV at a high to infinity. In this case, the energy converges to a constant
SNR can be roughly estimated by using [45] as ∗
Z ∞ −η as delay approaches αi (wj ) constraint value. The energy, on
n p o 1 e ∗
Bit error rate = E Q 2γ = √ √ F (η) dη. (47) the other hand, approaches αi (wj ) constraint value when the
2 π 0 η delay tends to infinity. This result is consistent with earlier
Substituting (46) in (47) and evaluating the result lead to researchers results such as [46], which reveals that there is
obtaining the optimal bit error rate of the UAV as always a trade-off between energy and delay that enables the
performance of the transmission network to be enhanced. As
3 a continuation of these studies, our proposal in PA provides a
∗ Γ 2
á[n] = ∗ √ novel trade-off scheme, adopting an energy allocation strategy
αr (w j )P π to achieve the optimal energy distribution between relay
and user nodes, which, in turn, improves UAV transmission
1 1
+ , (48) network performance by reducing the transmission delay (i.e.,
∗ ∗ ∗ ∗ high data rate) or energy consumption (i.e., higher energy
αr (w j ) + 2αa (w j ) H αr (w j ) + 2αb (w j ) G
efficiency).
where Γ(.) is gamma function.
In Algorithm 3, the (48) procedure is demonstrated. Consider the following practical example to illustrate
how the framework proposed can be implemented for UAV
networks: transmitting signals, by Sa or Sb, over poor channel
VI. Simulation Results conditions consumes more energy than broadcasting over
In this section, numerical simulations are carried out to normal channel conditions. Under such a scenario, using the
assess transmission delay and energy savings for the proposed proposed method enables a user’s node to determine whether
UAV network. The analytical outcomes are validated by to send packets or leave the users idle based on the energy
utilizing Monte Carlo simulations that use 105 samples. The consumption. Then, the proposed approach ensures that energy
rest of the simulation specifications are set as: 100 ≤ d ≤ 700 consumption is conserved in UAV networks by creating a
meters and the maximum powers for users and relay nodes decision-making scheme. In order to clarify the characteristic
are specified by 2 watts. of this decision-making platform, Fig. 3 illustrates the energy
The simulation results, which are plotted simultaneously consumption curves versus total distance d, which represents
using equations (39)-(40) refer to the Proposed Algorithm (PA) the sum of da and db . It is clearly shown that d has
a significant impact on energy consumption output as it
6 decreases significantly with increasing d. This is because
=0.3 increasing da requires a higher transmit power by Sa node
=0.5 to suppress channel-fading growth, and, hence, higher energy
5 =0.8 consumption. This result agrees with what is observed in [47].
In addition, Fig. 3 shows that the proposed scheme allows
4 energy consumption to be decreased by about 15% more than
the SA scheme.
3 Fig. 4 depicts that with the rise in power, E initially
decreases and then reaches a constant. This is because R
only increases logarithmically with P while the transmission
2 power consumption increases linearly with the transmission
power [48]. Consequently, increasing power divides energy
1 consumption into two stages. In the first stage, the energy is
0 1 2 3 4 5 6 decreased; then, in the second stages, it approaches a constant
rate. This reveals that there is a transition point that allows
Fig. 2: Energy and Delay trade-off for the PA scheme for the improvement of energy consumption. Fig. 4, illustrates
that the domain of the transition point is between 13 and
17 dBm; and a further reduction of energy consumption is
shown by the proposed method of PA, which corresponds to
6.5 previous studies [48, 49]. Further validation is given by Fig.
= 0.8 5, which compares the average data rate and the maximum
Energy consumption (Joule)
i
*
(wj )=0.8 transmit power. It is clear that the average data rate in (39)
6.0 i
tends to become a constant at the high range of the transmit
power (range between 14 and 16 dBm). This is because the
4.5 power allocation strategy enables the transmit power to be
regulated [50]. By using the PA scheme, a higher average
i
= 0.5 system rate is achieved, as the PA minimises both E and
3 *
(wj )=0.5 q (i.e., increases R) simultaneously. Therefore, R increases
i
SN logarithmically, while the transmission power consumption
PA increases linearly with the transmission power [48]. In other
1.5 words, the transition point is improved significantly, and
such enhancement is expected to enhance other performance
0.1 0.2 0.3 0.4 0.5 0.6 parameters in UAV networks. For example, Fig. 6 illustrates
S-D Link distance (km) the relationship between distance and achievable data rate.
Fig. 3: Energy consumption vs link distance for the PA It shows that increasing distance between Sa and Sb nodes
and SN schemes gradually reduces achievable data rates due to high channel
gain degradation. However, the PA is always better than the
SN, which agrees with other results obtained by [29].
4.0 In the PA, the rate of distance change depends on flight
altitude, and this is required to explain the effect of the drone
Energy consumption (Joule)
i
= 0.5 altitude on data rate performance, as illustrated in Fig. 7. As
*
(wj )=0.5 depicted in the figure, when the drone takes off from the Sa
i
3.0
node level at 100 m, the data rate decreases slightly with the
distance travelled by the drone remains within a low path loss
range [51]. By increasing the altitude between Sa node and
2.0 drone, the path loss increases significantly and the data rate,
in turn, starts to decrease gradually. The results of the proposed
algorithm in the PA show a marked improvement because
= 0.8
*
i increasing the altitude extend da and, then, the arrival data
(wj )=0.8
1.0 i
rate at the relay is decreased. Hence, in addition to reducing
transmission delay, both user nodes allocation of a higher
5 10 15 power to each other in order to motivate information growth.
Total power (dBm) The data rate curve is enhanced compared with other studies
that depend on energy allocation only, as in [52]. To explain
Fig. 4: Energy consumption vs total power for the PA ∗
how the proposed αi (w j ) is allocated for the UAV network, Fig.
and SN schemes ∗
8 plots the relationship between αi (w j ) and both P and w j . It
15 90
Achievable data rate (Mbits/sec)
PA
∗
can be seen that increasing P allows αi (w j ) to be increased 12
while notably decreasing w j . The user nodes manage such a PA
high P based on many factors, such as channel conditions or Achievable data rate (Mbits/sec) SN
10
distance da and db . Thus, if da is higher than db , the path loss
of da is large and the rate at which data arrives at the relay 8
∗
is low. Therefore, the user nodes allocate higher αi (w j ) to *
i
(wj )=0.8
stimulate an increase in data transmission by each user when 6 = 0.8
i
there is an increase in delay time.
To evaluate UAV performance in (48), Fig. 9. shows results *
4 i
(wj )=0.5
of áe [n] versus ϕi , and for various SNRs values, where = 0.5
∗ ∗ ∗ ∗ i
γ(w j )[n3] > γ(w j )[n2] > γ(w j )[n1]. Each γ(w j )[n] is obtained
2
from a specific value of ϕi (0 < ϕi < 1). It is clearly seen
∗
that the highest SNR, at γ(w j )[n3 ], enhanced the bit error
rate result, and this result confirms the theoretical analysis, 0.1 0.2 0.3 0.4 0.5 0.6
as high SNR calculates from optimal power allocation. This
result agrees with previous studies [53], which indicate that
Fig. 7: Achievable data rate vs altitude flight for the PA
the power allocation ϕi is an effective metric for enhancing
and SN schemes
UAV performance.
Fig. 9. compares between the S N and PA system in
term of ϕi and bit error rate. Using energy allocation in
0.8
(40) rises SNR[n] which in turn increases data rate, and
the result enhancing bit error rate. Fig. 10. also shows that wj =0.1
the
highest SNR, i.e. SNR[n3 ] > SNR[n2 ] > SNR[n1 ] SNR[n] ∈ 0.7
∗
γ(w j )[n], γ(w j )[n] , gives the lower bit error rate. This wj =0.3
0.4
VII. Conclusion and Future Work
This paper offers a new method for drawing out the
most effective energy-delay curve for a UAV layout by 0 5 10 15 20 25 30 35
optimising the energy allotments for users and relay nodes. A Total power (dBm)
multi-objective technique for optimising the energy allocation
factors, weight scalarization optimisation, is appraised in Fig. 8: Achievable data rate vs total power for the PA
this paper. The signal transmission distance is taken into scheme
[2] F. Ono, H. Ochiai, and R. Miura, “A wireless relay network based on
0 unmanned aircraft system with rate optimization,” IEEE Transactions on
10
Wireless Communications, vol. 15, no. 11, pp. 7699–7708, Nov 2016.
[3] W. Zeng, J. Zhang, D. W. K. Ng, B. Ai, and Z. Zhong, “Two-way
hybrid terrestrial-satellite relaying systems: Performance analysis and
-1 relay selection,” IEEE Transactions on Vehicular Technology, vol. 68,
10
no. 7, pp. 7011–7023, 2019.
Bit error rate