English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

In an interference limited network, joint power and admission control (JPAC)aims at supporting a maximum number of links at their specified signal tointerference plus noise ratio (SINR) targets while using a minimum totaltransmission power. Various convex approximation deflation approaches have beendeveloped for the JPAC problem. In this paper, we propose an effectivepolynomial time non-convex approximation deflation approach for solving theproblem. The approach is based on the non-convex $\ell_q$-minimizationapproximation of an equivalent sparse $\ell_0$-minimization reformulation ofthe JPAC problem where $q\in(0,1).$ We show that, for any instance of the JPACproblem, there exists a $\bar q\in(0,1)$ such that it can be exactly solved bysolving its $\ell_q$-minimization approximation problem with any $q\in(0, \barq]$. We also show that finding the global solution of the $\ell_q$approximation problem is NP-hard. Then, we propose a potential reductioninterior-point algorithm, which can return an $\epsilon$-KKT solution of theNP-hard $\ell_q$-minimization approximation problem in polynomial time. Thereturned solution can be used to check the simultaneous supportability of alllinks in the network and to guide an iterative link removal procedure,resulting in the polynomial time non-convex approximation deflation approachfor the JPAC problem. Numerical simulations show that the proposed approachoutperforms the existing convex approximation approaches in terms of the numberof supported links and the total transmission power, particularly exhibiting aquite good performance in selecting which subset of links to support.

Joint Power and Admission Control: Non-Convex $L_q$ Approximation and An Effective Polynomial Time Deflation Approach