Abstract: We consider the joint admission and power control problem in a dense small cell network, which contains multiple interference links. The goal is to mainly maximize the number of the admitted links, and at the same time minimize the transmit power. We formulate the admission control and power control problem as a joint optimization problem, which is however NP-hard. Such NP-hard problem can be relaxed to a p-norm problem (0<p<1) by using the correntropy induced metric. The correntropy is a novel nonlinear similarity measure, which has been successfully used in the robust and spares signal processing, especially when the data contain large outliers. Thus, in this work we propose a new correntropy induced joint power and admission control algorithm (CJPA). To achieve a faster convergence speed, we also propose an adaptive kernel size method, in which the kernel size is determined by the error so that the convergence speed is the fastest during the iterations. Simulation results show that the proposed approach can achieve much better results than the existing works.
A joint admission and power control scheme was proposed by Luan et al. REF for DSCN, which aims for maximizing the number of the connections admitted, while minimizing the transmission power.
Correntropy induced joint power and admission control algorithm for dense small cell network
IET Communications
IET Communications
Computer Science Mathematics