Open AccessCorrentropy induced joint power and admission control algorithm for dense small cell network
Author(s) -
Luan Zhirong,
Qu Hua,
Zhao Jihong,
Chen Badong,
Principe Jose C.
Publication year - 2016
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2016.0156
Subject(s) - computer science , outlier , algorithm , convergence (economics) , admission control , joint (building) , kernel (algebra) , mathematical optimization , power control , power (physics) , computational complexity theory , similarity (geometry) , mathematics , artificial intelligence , telecommunications , architectural engineering , physics , quantum mechanics , engineering , quality of service , combinatorics , economics , image (mathematics) , economic growth
The authors consider the joint admission and power control problem in a dense small cell network, which contains multiple interference links. The goal is to mainly maximise the number of the admitted links, and at the same time minimise the transmit power. The authors formulate the admission control and power control problem as a joint optimisation problem, which is however non‐deterministic polynomial hard (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 non‐linear 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 the authors propose a new correntropy induced joint power and admission control algorithm. To achieve a faster convergence speed, the authors 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.