Joint power and admission control via linear programming deflation

Ya Feng Liu; Yu Hong Dai; Zhi Quan Luo

doi:10.1109/ICASSP.2012.6288517

Joint power and admission control via linear programming deflation

Ya Feng Liu, Yu Hong Dai, Zhi Quan Luo

Electrical and Computer Engineering

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

8 Scopus citations

Abstract

In an interference network, joint power and admission control aims to support a maximum number of links at their specified signal to interference plus noise ratio (SINR) targets while using a minimum total transmission power. Since this problem is NP-hard, convex approximation heuristics have been considered in the literature. In this work, we first reformulate the problem as a sparse ℓ ₀-minimization problem and then relax it to a linear program (LP). Then, we derive an easily-checkable necessary condition for all links in the network to be simultaneously supported at their target SINR levels, and use it to iteratively remove strong interfering links (deflation). Numerical simulations show the proposed heuristic compares favorably with the existing approaches in terms of both the number of supported links and speed.

Original language	English (US)
Title of host publication	2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings
Pages	2873-2876
Number of pages	4
DOIs	https://doi.org/10.1109/ICASSP.2012.6288517
State	Published - 2012
Event	2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Kyoto, Japan Duration: Mar 25 2012 → Mar 30 2012

Publication series

Name	ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
ISSN (Print)	1520-6149

Other

Other	2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012
Country/Territory	Japan
City	Kyoto
Period	3/25/12 → 3/30/12

Keywords

Admission control
convex approximation
power control
sparse optimization

Publisher link

10.1109/ICASSP.2012.6288517

Find It

Find It at U of M Libraries

Cite this

Liu, Y. F., Dai, Y. H., & Luo, Z. Q. (2012). Joint power and admission control via linear programming deflation. In 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings (pp. 2873-2876). Article 6288517 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings). https://doi.org/10.1109/ICASSP.2012.6288517

Joint power and admission control via linear programming deflation. / Liu, Ya Feng; Dai, Yu Hong; Luo, Zhi Quan.
2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings. 2012. p. 2873-2876 6288517 (ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Liu, YF, Dai, YH & Luo, ZQ 2012, Joint power and admission control via linear programming deflation. in 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings., 6288517, ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings, pp. 2873-2876, 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012, Kyoto, Japan, 3/25/12. https://doi.org/10.1109/ICASSP.2012.6288517

@inproceedings{f153a555914d4afb9c1f870c25901c15,

title = "Joint power and admission control via linear programming deflation",

abstract = "In an interference network, joint power and admission control aims to support a maximum number of links at their specified signal to interference plus noise ratio (SINR) targets while using a minimum total transmission power. Since this problem is NP-hard, convex approximation heuristics have been considered in the literature. In this work, we first reformulate the problem as a sparse ℓ 0-minimization problem and then relax it to a linear program (LP). Then, we derive an easily-checkable necessary condition for all links in the network to be simultaneously supported at their target SINR levels, and use it to iteratively remove strong interfering links (deflation). Numerical simulations show the proposed heuristic compares favorably with the existing approaches in terms of both the number of supported links and speed.",

keywords = "Admission control, convex approximation, power control, sparse optimization",

author = "Liu, {Ya Feng} and Dai, {Yu Hong} and Luo, {Zhi Quan}",

year = "2012",

doi = "10.1109/ICASSP.2012.6288517",

language = "English (US)",

isbn = "9781467300469",

series = "ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings",

pages = "2873--2876",

booktitle = "2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings",

note = "2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 ; Conference date: 25-03-2012 Through 30-03-2012",

}

TY - GEN

T1 - Joint power and admission control via linear programming deflation

AU - Liu, Ya Feng

AU - Dai, Yu Hong

AU - Luo, Zhi Quan

PY - 2012

Y1 - 2012

N2 - In an interference network, joint power and admission control aims to support a maximum number of links at their specified signal to interference plus noise ratio (SINR) targets while using a minimum total transmission power. Since this problem is NP-hard, convex approximation heuristics have been considered in the literature. In this work, we first reformulate the problem as a sparse ℓ 0-minimization problem and then relax it to a linear program (LP). Then, we derive an easily-checkable necessary condition for all links in the network to be simultaneously supported at their target SINR levels, and use it to iteratively remove strong interfering links (deflation). Numerical simulations show the proposed heuristic compares favorably with the existing approaches in terms of both the number of supported links and speed.

AB - In an interference network, joint power and admission control aims to support a maximum number of links at their specified signal to interference plus noise ratio (SINR) targets while using a minimum total transmission power. Since this problem is NP-hard, convex approximation heuristics have been considered in the literature. In this work, we first reformulate the problem as a sparse ℓ 0-minimization problem and then relax it to a linear program (LP). Then, we derive an easily-checkable necessary condition for all links in the network to be simultaneously supported at their target SINR levels, and use it to iteratively remove strong interfering links (deflation). Numerical simulations show the proposed heuristic compares favorably with the existing approaches in terms of both the number of supported links and speed.

KW - Admission control

KW - convex approximation

KW - power control

KW - sparse optimization

UR - http://www.scopus.com/inward/record.url?scp=84867617172&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867617172&partnerID=8YFLogxK

U2 - 10.1109/ICASSP.2012.6288517

DO - 10.1109/ICASSP.2012.6288517

M3 - Conference contribution

AN - SCOPUS:84867617172

SN - 9781467300469

T3 - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings

SP - 2873

EP - 2876

BT - 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012 - Proceedings

T2 - 2012 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2012

Y2 - 25 March 2012 through 30 March 2012

ER -

Joint power and admission control via linear programming deflation

Abstract

Publication series

Other

Keywords

Publisher link

Find It

Other files and links

Fingerprint

Cite this