“…From (B.3) and (B.4), we can observe that the feasible solutions of (22) are also suitable for (16). According to (19), we also obtain f 2 (P n+1 p,i ,P n+1 s,i ,P n+1 z,i ) ≤ f 2 (P n p,i ,P n s,i ,P n z,i ) Then, following the iterative procedure in (22), we arrive at I i=1 f 1 (P n+1 p,i ,P n+1 s,i ,P n+1 z,i ) − f 2 (P n p,i ,P n s,i ,P n z,i ) − b i (P n+1 p,i −P n p,i ) (b iP n p,i + σ 2 c,i )ln2 From (B.7), we can observe that the proposed iterative procedure is monotonically non-decreasing with the increasing of iterative numbers. In addition, by employing the transmit power constraints of PBS and CBS, i.e., I i=1 P p,i ≤ P total PBS and I i=1 (P s,i + P z,i ) ≤ P total CBS , the upper bound of the objective function can be given by…”