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

doi:10.1109/TSP.2015.2428224

CORC > 数学与系统科学研究院 > 中国科学院数学与系统科学研究院 > 计算数学与科学工程计算研究所

	Joint Power and Admission Control: Non-Convex L-q Approximation and An Effective Polynomial Time Deflation Approach
	Liu, Ya-Feng1 ; Dai, Yu-Hong1 ; Ma, Shiqian 2
刊名	IEEE TRANSACTIONS ON SIGNAL PROCESSING
	2015-07-15
卷号	63 期号:14 页码:3641-3656
关键词	Admission control complexity non-convex approximation potential reduction algorithm power control sparse optimization
ISSN号	1053-587X
DOI	10.1109/TSP.2015.2428224
英文摘要	In an interference limited network, joint power and admission control (JPAC) aims at supporting a maximum number of links at their specified signal-to-interference-plus-noise ratio (SINR) targets while using minimum total transmission power. Various convex approximation deflation approaches have been developed for the JPAC problem. In this paper, we propose an effective polynomial time non-convex approximation deflation approach for solving the problem. The approach is based on the non-convex l(q) (0 < q < 1) approximation of an equivalent sparse to reformulation of the JPAC problem. We show that, for any instance of the JPAC problem, there exists (q) over bar is an element of (0, 1) such that it can be exactly solved by solving its l(q) approximation problem with any q is an element of (0, (q) over bar]. We also show that finding the global solution of the l(q) approximation problem is NP-hard. Then, we propose a potential reduction interior-point algorithm, which can return an epsilon-KKT solution of the NP-hard tq approximation problem in polynomial time. The returned solution can be used to check the simultaneous supportability of all links in the network and to guide an iterative link removal procedure, resulting in the polynomial time non-convex approximation deflation approach for the JPAC problem. Numerical simulations show that the proposed approach outperforms the existing convex approximation approaches in terms of the number of supported links and the total transmission power, particularly exhibiting a quite good performance in selecting which subset of links to support.
资助项目	National Natural Science Foundation[11301516] ; National Natural Science Foundation[11331012] ; China National Funds for Distinguished Young Scientists[11125107] ; Key Project of Chinese National Programs for Fundamental Research and Development[2015CB856000] ; CAS Program for Cross & Cooperative Team of the Science & Technology Innovation ; Chinese University of Hong Kong[4055016] ; Hong Kong Research Grants Council General Research Fund Early Career Scheme[CUHK 439513]
WOS研究方向	Engineering
语种	英语
出版者	IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
WOS记录号	WOS:000356141600007
内容类型	期刊论文
源URL	[http://ir.amss.ac.cn/handle/2S8OKBNM/19975]
专题	计算数学与科学工程计算研究所
通讯作者	Liu, Ya-Feng
作者单位	1.Chinese Acad Sci, State Key Lab Sci & Engn Comp, Inst Computat Math & Sci Engn Comp, Acad Math & Syst Sci, Beijing 100190, Peoples R China 2.Chinese Univ Hong Kong, Dept Syst Engn & Engn Management, Shatin, Hong Kong, Peoples R China
推荐引用方式 GB/T 7714	Liu, Ya-Feng,Dai, Yu-Hong,Ma, Shiqian. Joint Power and Admission Control: Non-Convex L-q Approximation and An Effective Polynomial Time Deflation Approach[J]. IEEE TRANSACTIONS ON SIGNAL PROCESSING,2015,63(14):3641-3656.
APA	Liu, Ya-Feng,Dai, Yu-Hong,&Ma, Shiqian.(2015).Joint Power and Admission Control: Non-Convex L-q Approximation and An Effective Polynomial Time Deflation Approach.IEEE TRANSACTIONS ON SIGNAL PROCESSING,63(14),3641-3656.
MLA	Liu, Ya-Feng,et al."Joint Power and Admission Control: Non-Convex L-q Approximation and An Effective Polynomial Time Deflation Approach".IEEE TRANSACTIONS ON SIGNAL PROCESSING 63.14(2015):3641-3656.