Covert Communication in Wireless Networks: A Feasibility-Checking Approach

The article discusses the feasibility-checking based DC algorithm for solving the wireless covert communication problem under various types of wiretap channels. The algorithm is designed to increase the covert rate by iteratively adjusting the transmit power, modulation, and coding schemes. The algorithm first initializes the transmit power and the leading eigenvector of the interferer’s matrix using a feasibility-checking problem, then repeats the following steps until convergence: solving a problem corresponding to different WCSI cases, updating the iteration parameters, and setting the next transmit power. The algorithm is shown to significantly increase the covert rate compared to the maximum transmit power, but may suffer from degradation when the total transmit power is too large. The article also compares the algorithm’s performance under bounded and Gaussian WCSI channels and provides insights into the trade-off between the covert rate and the maximum transmit power.