/
Full_code_JHTPA.py
208 lines (160 loc) · 8.64 KB
/
Full_code_JHTPA.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
from cvxpy import *
import scipy as sp
import ecos
import matplotlib.pyplot as plt
import time
# ############################################################
# This code is loaded from Full_code_TH
# ############################################################
# Starting main code for EEmax UAV networks
# ############################################################
bandwidth = 1 # MHz
height = 100 # m
eta = 0.5 # EH efficiency
power_UAV = 5000
power_cir_UAV = 4000
atg_a = 11.95
atg_b = 0.136
noise_variance = sp.multiply(sp.multiply(sp.power(10, sp.divide(-130, 10)), bandwidth), 1e6)
d2d_max = 50
max_chan_realizaion = 200
max_num_d2d_pairs = 10
chan_model = sp.load('chan_model.npz')
max_uav_to_d2d_gains = chan_model['uav']
max_d2d_to_d2d_gains = chan_model['d2d']
# ############################################################
# This loop for a range of num_d2d_pairs
# ############################################################
range_num_d2d_pairs = [2, 3, 4, 5, 6, 7, 8, 9, 10]
time_sol_vec_Mon = []
EE_sol_vec_Mon = []
tau_sol_vec_Mon = []
avg = {}
num_infeasible = sp.zeros(len(range_num_d2d_pairs))
for prin in range_num_d2d_pairs:
num_d2d_pairs = prin
# rmin = sp.multiply(0.2, sp.log(2))
time_sol_vec = []
EE_sol_vec = []
tau_sol_vec = []
for Mon in xrange(max_chan_realizaion):
try:
max_d2d_to_d2d_gains_diff = sp.copy(max_d2d_to_d2d_gains[:, :, Mon])
sp.fill_diagonal(max_d2d_to_d2d_gains_diff, 0)
max_d2d_to_d2d_gains_diag = sp.subtract(max_d2d_to_d2d_gains[:, :, Mon], max_d2d_to_d2d_gains_diff)
uav_to_d2d_gains = max_uav_to_d2d_gains[:num_d2d_pairs, Mon]
d2d_to_d2d_gains = max_d2d_to_d2d_gains[:num_d2d_pairs, :num_d2d_pairs, Mon]
d2d_to_d2d_gains_diff = max_d2d_to_d2d_gains_diff[:num_d2d_pairs, :num_d2d_pairs]
d2d_to_d2d_gains_diag = sp.subtract(d2d_to_d2d_gains, d2d_to_d2d_gains_diff)
# ############################################################
# This code is used to find the initial point for EEmax algorithm
# ############################################################
theta_ini = Parameter(value=1/(1-0.5))
phi_n_ini = sp.multiply((theta_ini.value - 1) * eta * sp.divide(power_UAV, num_d2d_pairs), uav_to_d2d_gains)
x_rate = sp.matmul(d2d_to_d2d_gains_diag, phi_n_ini)
term_rate = sp.matmul(sp.transpose(d2d_to_d2d_gains_diff), phi_n_ini) + 1
rate_sol_ue = sp.divide(sp.log(sp.add(1, sp.divide(x_rate, term_rate))), theta_ini.value)
# print rate_sol_ue
rmin_ref = min(rate_sol_ue)
if rmin_ref <= 0.2 * sp.log(2):
rmin = rmin_ref
else:
rmin = 0.2 * sp.log(2)
pow_ = NonNegative(num_d2d_pairs)
objective = Minimize(sum_entries(pow_)/theta_ini)
constraints = []
c1 = d2d_to_d2d_gains_diag * pow_ >= (exp(rmin * theta_ini) - 1) * (d2d_to_d2d_gains_diff * pow_ + 1)
c2 = 1 / theta_ini * pow_ <= (1 - 1 / theta_ini) * eta * power_UAV * uav_to_d2d_gains
constraints.append(c1)
constraints.append(c2)
t0 = time.time()
prob = Problem(objective, constraints)
prob.solve(solver=ECOS_BB)
term_rate = sp.add(sp.matmul(d2d_to_d2d_gains_diff, pow_.value), 1)
x_rate = sp.matmul(d2d_to_d2d_gains_diag, pow_.value)
rate_ini_ue = sp.divide(sp.log(sp.add(1, sp.divide(x_rate, term_rate))), theta_ini.value)
sum_pow_ini = sp.sum(sp.divide(pow_.value, theta_ini.value))
t_ini = sp.add(sum_pow_ini, power_cir_UAV)
term_phi_ini = sp.divide(sp.sum(rate_ini_ue), t_ini)
# ############################################################
# This code is used to solve the EE-max problem
# ############################################################
iter = 0
epsilon = 1
theta_sol, phi_n_sol, varphi_sol = 0, 0, 0
iter_phi = []
while epsilon >= 1e-2 and iter <= 20:
iter += 1
if iter == 1:
theta_ref = theta_ini.value
phi_n_ref = sp.divide(1, pow_.value)
varphi_ref = term_phi_ini
else:
theta_ref = theta_sol
phi_n_ref = phi_n_sol
varphi_ref = varphi_sol
term_x = sp.matmul(sp.divide(1, d2d_to_d2d_gains_diag, where=d2d_to_d2d_gains_diag != 0), phi_n_ref)
term_y = sp.add(sp.matmul(sp.transpose(d2d_to_d2d_gains_diff), sp.divide(1, phi_n_ref)), 1)
a_1 = sp.add(sp.divide(sp.multiply(2, sp.log(sp.add(1, sp.divide(1, sp.multiply(term_x, term_y))))), theta_ref),
sp.divide(2, sp.multiply(theta_ref, sp.add(sp.multiply(term_x, term_y), 1))))
b_1 = sp.divide(1, sp.multiply(theta_ref, sp.multiply(term_x, sp.add(sp.multiply(term_x, term_y), 1))))
c_1 = sp.divide(1, sp.multiply(theta_ref, sp.multiply(term_y, sp.add(sp.multiply(term_x, term_y), 1))))
d_1 = sp.divide(sp.log(sp.add(1, sp.divide(1, sp.multiply(term_x, term_y)))), sp.square(theta_ref))
vars = NonNegative(num_d2d_pairs + 1)
phi_n = vars[:-1]
theta = vars[-1]
obj_1 = a_1
obj_2 = mul_elemwise(sp.reciprocal(d2d_to_d2d_gains_diag, where=d2d_to_d2d_gains_diag!=0) * b_1, phi_n)
obj_3 = mul_elemwise(c_1, (sp.transpose(d2d_to_d2d_gains_diff) * inv_pos(phi_n) + 1))
obj_4 = d_1 * theta
obj_pow = 0
for i in xrange(num_d2d_pairs):
obj_pow += square(inv_pos(geo_mean(vars[[i, num_d2d_pairs]])))
obj_pow += (1 - sp.divide(2, theta_ref) + theta/sp.square(theta_ref))*eta*power_UAV
obj = sum_entries(obj_1 - obj_2 - obj_3 - obj_4) - varphi_ref * (obj_pow + power_cir_UAV)
obj_opt = Maximize(obj)
constraints = [theta >= 1]
constraints.append(inv_pos(phi_n) <= (theta-1) * eta * power_UAV * uav_to_d2d_gains)
constraints.append(a_1 - mul_elemwise(sp.reciprocal(d2d_to_d2d_gains_diag, where=d2d_to_d2d_gains_diag!=0) * b_1, phi_n) -
mul_elemwise(c_1, (sp.transpose(d2d_to_d2d_gains_diff) * inv_pos(phi_n) + 1)) - d_1 * theta >= rmin)
t1 = time.time()
prob = Problem(obj_opt, constraints)
prob.solve(solver=ECOS_BB)
# print 'Iteration:', iter, '; Time:', time.time() - t1
phi_n_sol = phi_n.value
theta_sol = theta.value
x_rate = sp.matmul(d2d_to_d2d_gains_diag, sp.divide(1, phi_n_sol))
term_rate = sp.matmul(sp.transpose(d2d_to_d2d_gains_diff), sp.divide(1, phi_n_sol)) + 1
rate_sol_ue = sp.divide(sp.log(sp.add(1, sp.divide(x_rate, term_rate))), theta_sol)
# print rate_sol_ue
term_pow_iter = sp.sum(sp.multiply(sp.divide(1, phi_n_sol), theta_sol)) + sp.subtract(1, sp.divide(1, theta_sol))*eta*power_UAV
varphi_sol = sum(rate_sol_ue) / (term_pow_iter + power_cir_UAV)
iter_phi.append(sp.multiply(1e3, sp.divide(varphi_sol, sp.log(2))))
if iter >= 2:
epsilon = sp.divide(sp.absolute(sp.subtract(iter_phi[iter - 1], iter_phi[iter - 2])),
sp.absolute(iter_phi[iter - 2]))
EE_sol_vec.append(sp.multiply(1e3, sp.divide(varphi_sol, sp.log(2))))
time_sol = (time.time() - t0)
time_sol_vec.append(time_sol)
tau_sol_vec.append(1-1/theta_sol)
except (SolverError, TypeError):
# pass
num_infeasible[prin - 2] += 1
v1 = sp.array(EE_sol_vec)
EE_sol_vec_Mon.append(sp.mean(v1))
v2 = sp.array(time_sol_vec)
time_sol_vec_Mon.append(sp.mean(v2))
v3 = sp.array(tau_sol_vec)
tau_sol_vec_Mon.append(sp.mean(v3))
print EE_sol_vec_Mon
print time_sol_vec_Mon
print tau_sol_vec_Mon
print num_infeasible
sp.savez('result_JHTPA', EE_JTHPA=EE_sol_vec_Mon, time_JTHPA=time_sol_vec_Mon, tau_JTHPA=tau_sol_vec_Mon)
# plt.figure(figsize=(8, 6))
# plt.clf()
# plt.plot(range_num_d2d_pairs, time_sol_vec_Mon)
# plt.figure(figsize=(8, 6))
# plt.clf()
# plt.plot(range_num_d2d_pairs, EE_sol_vec_Mon)
# plt.show()