Rate Maximization for Suspicious Multicast Communication Networks with Full-Duplex Proactive Monitoring

Algorithm 1

The proposed CCCP-based iterative algorithm for solving problem (16).

(1)	Input: N, λi, ρ1, µi, ρ2, P, Qmax, K
(2)	Initialization: set the iteration number n := 1 and a feasible point {τ^(0), Q^(0), t^(0), x^(0)};
(3)	Repeat:
	Obtain {τ^(n), Q^(n), t^(n), x^(n)} by solving the convex problem (18);
	Update n : = n + 1;
(4)	Until: convergence.