Smoothed Lp-Minimization for Green Cloud-RAN with User Admission Control
The cloud radio access network (Cloud-RAN) has recently been proposed as one cost-effective and energy-efficient technique for 5G wireless networks. By moving the signal processing functionality to a single baseband unit (BBU) pool, centralized signal processing and resource allocation are enabled i...
Gespeichert in:
| Hauptverfasser: | , , , , , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Shi, Yuanming Cheng, Jinkun Zhang, Jun Bai, Bo Chen, Wei Letaief, Khaled B |
| description | The cloud radio access network (Cloud-RAN) has recently been proposed as one
cost-effective and energy-efficient technique for 5G wireless networks. By
moving the signal processing functionality to a single baseband unit (BBU)
pool, centralized signal processing and resource allocation are enabled in
Cloud-RAN, thereby providing the promise of improving the energy efficiency via
effective network adaptation and interference management. In this paper, we
propose a holistic sparse optimization framework to design green Cloud-RAN by
taking into consideration the power consumption of the fronthaul links,
multicast services, as well as user admission control. Specifically, we first
identify the sparsity structures in the solutions of both the network power
minimization and user admission control problems. However, finding the optimal
sparsity structures turns out to be NP-hard, with the coupled challenges of the
l0-norm based objective functions and the nonconvex quadratic QoS constraints
due to multicast beamforming. In contrast to the previous works on convex but
non-smooth sparsity inducing approaches, e.g., the group sparse beamforming
algorithm based on the mixed l1/l2-norm relaxation [1], we adopt the nonconvex
but smoothed lp-minimization (0 < p |
| doi_str_mv | 10.48550/arxiv.1512.04784 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1512_04784</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1512_04784</sourcerecordid><originalsourceid>FETCH-LOGICAL-a674-996ddd3aba80b83c19425eb9060e1f3cf33d9c801f44f3f464efd741f15914563</originalsourceid><addsrcrecordid>eNotz71OwzAYhWEvDKhwAUz4Bhzs-rNjj1EELVIoEpQ5cmJ_qqUkrpzwe_Woheksr470EHIjeAFGKX7n8lf8KIQS64JDaeCSbF_HlJZD8LQ5sqc4xTH-uCWmiWLKdJNDmGg9pHfPXqod_YzLgb7NIdPKj3GeT12dpiWn4YpcoBvmcP2_K7J_uN_XW9Y8bx7rqmFOl8Cs1d576TpneGdkLyysVegs1zwIlD1K6W1vuEAAlAgaAvoSBAplBSgtV-T27_ZMaY85ji5_tydSeybJX0U2RfE</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Smoothed Lp-Minimization for Green Cloud-RAN with User Admission Control</title><source>arXiv.org</source><creator>Shi, Yuanming ; Cheng, Jinkun ; Zhang, Jun ; Bai, Bo ; Chen, Wei ; Letaief, Khaled B</creator><creatorcontrib>Shi, Yuanming ; Cheng, Jinkun ; Zhang, Jun ; Bai, Bo ; Chen, Wei ; Letaief, Khaled B</creatorcontrib><description>The cloud radio access network (Cloud-RAN) has recently been proposed as one
cost-effective and energy-efficient technique for 5G wireless networks. By
moving the signal processing functionality to a single baseband unit (BBU)
pool, centralized signal processing and resource allocation are enabled in
Cloud-RAN, thereby providing the promise of improving the energy efficiency via
effective network adaptation and interference management. In this paper, we
propose a holistic sparse optimization framework to design green Cloud-RAN by
taking into consideration the power consumption of the fronthaul links,
multicast services, as well as user admission control. Specifically, we first
identify the sparsity structures in the solutions of both the network power
minimization and user admission control problems. However, finding the optimal
sparsity structures turns out to be NP-hard, with the coupled challenges of the
l0-norm based objective functions and the nonconvex quadratic QoS constraints
due to multicast beamforming. In contrast to the previous works on convex but
non-smooth sparsity inducing approaches, e.g., the group sparse beamforming
algorithm based on the mixed l1/l2-norm relaxation [1], we adopt the nonconvex
but smoothed lp-minimization (0 < p <= 1) approach to promote sparsity in the
multicast setting, thereby enabling efficient algorithm design based on the
principle of the majorization-minimization (MM) algorithm and the semidefinite
relaxation (SDR) technique. In particular, an iterative reweighted-l2 algorithm
is developed, which will converge to a Karush-Kuhn-Tucker (KKT) point of the
relaxed smoothed lp-minimization problem from the SDR technique. We illustrate
the effectiveness of the proposed algorithms with extensive simulations for
network power minimization and user admission control in multicast Cloud-RAN.</description><identifier>DOI: 10.48550/arxiv.1512.04784</identifier><language>eng</language><subject>Computer Science - Information Theory ; Mathematics - Information Theory</subject><creationdate>2015-12</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,885</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1512.04784$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1512.04784$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Shi, Yuanming</creatorcontrib><creatorcontrib>Cheng, Jinkun</creatorcontrib><creatorcontrib>Zhang, Jun</creatorcontrib><creatorcontrib>Bai, Bo</creatorcontrib><creatorcontrib>Chen, Wei</creatorcontrib><creatorcontrib>Letaief, Khaled B</creatorcontrib><title>Smoothed Lp-Minimization for Green Cloud-RAN with User Admission Control</title><description>The cloud radio access network (Cloud-RAN) has recently been proposed as one
cost-effective and energy-efficient technique for 5G wireless networks. By
moving the signal processing functionality to a single baseband unit (BBU)
pool, centralized signal processing and resource allocation are enabled in
Cloud-RAN, thereby providing the promise of improving the energy efficiency via
effective network adaptation and interference management. In this paper, we
propose a holistic sparse optimization framework to design green Cloud-RAN by
taking into consideration the power consumption of the fronthaul links,
multicast services, as well as user admission control. Specifically, we first
identify the sparsity structures in the solutions of both the network power
minimization and user admission control problems. However, finding the optimal
sparsity structures turns out to be NP-hard, with the coupled challenges of the
l0-norm based objective functions and the nonconvex quadratic QoS constraints
due to multicast beamforming. In contrast to the previous works on convex but
non-smooth sparsity inducing approaches, e.g., the group sparse beamforming
algorithm based on the mixed l1/l2-norm relaxation [1], we adopt the nonconvex
but smoothed lp-minimization (0 < p <= 1) approach to promote sparsity in the
multicast setting, thereby enabling efficient algorithm design based on the
principle of the majorization-minimization (MM) algorithm and the semidefinite
relaxation (SDR) technique. In particular, an iterative reweighted-l2 algorithm
is developed, which will converge to a Karush-Kuhn-Tucker (KKT) point of the
relaxed smoothed lp-minimization problem from the SDR technique. We illustrate
the effectiveness of the proposed algorithms with extensive simulations for
network power minimization and user admission control in multicast Cloud-RAN.</description><subject>Computer Science - Information Theory</subject><subject>Mathematics - Information Theory</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2015</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotz71OwzAYhWEvDKhwAUz4Bhzs-rNjj1EELVIoEpQ5cmJ_qqUkrpzwe_Woheksr470EHIjeAFGKX7n8lf8KIQS64JDaeCSbF_HlJZD8LQ5sqc4xTH-uCWmiWLKdJNDmGg9pHfPXqod_YzLgb7NIdPKj3GeT12dpiWn4YpcoBvmcP2_K7J_uN_XW9Y8bx7rqmFOl8Cs1d576TpneGdkLyysVegs1zwIlD1K6W1vuEAAlAgaAvoSBAplBSgtV-T27_ZMaY85ji5_tydSeybJX0U2RfE</recordid><startdate>20151215</startdate><enddate>20151215</enddate><creator>Shi, Yuanming</creator><creator>Cheng, Jinkun</creator><creator>Zhang, Jun</creator><creator>Bai, Bo</creator><creator>Chen, Wei</creator><creator>Letaief, Khaled B</creator><scope>AKY</scope><scope>AKZ</scope><scope>GOX</scope></search><sort><creationdate>20151215</creationdate><title>Smoothed Lp-Minimization for Green Cloud-RAN with User Admission Control</title><author>Shi, Yuanming ; Cheng, Jinkun ; Zhang, Jun ; Bai, Bo ; Chen, Wei ; Letaief, Khaled B</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a674-996ddd3aba80b83c19425eb9060e1f3cf33d9c801f44f3f464efd741f15914563</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2015</creationdate><topic>Computer Science - Information Theory</topic><topic>Mathematics - Information Theory</topic><toplevel>online_resources</toplevel><creatorcontrib>Shi, Yuanming</creatorcontrib><creatorcontrib>Cheng, Jinkun</creatorcontrib><creatorcontrib>Zhang, Jun</creatorcontrib><creatorcontrib>Bai, Bo</creatorcontrib><creatorcontrib>Chen, Wei</creatorcontrib><creatorcontrib>Letaief, Khaled B</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv Mathematics</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Shi, Yuanming</au><au>Cheng, Jinkun</au><au>Zhang, Jun</au><au>Bai, Bo</au><au>Chen, Wei</au><au>Letaief, Khaled B</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Smoothed Lp-Minimization for Green Cloud-RAN with User Admission Control</atitle><date>2015-12-15</date><risdate>2015</risdate><abstract>The cloud radio access network (Cloud-RAN) has recently been proposed as one
cost-effective and energy-efficient technique for 5G wireless networks. By
moving the signal processing functionality to a single baseband unit (BBU)
pool, centralized signal processing and resource allocation are enabled in
Cloud-RAN, thereby providing the promise of improving the energy efficiency via
effective network adaptation and interference management. In this paper, we
propose a holistic sparse optimization framework to design green Cloud-RAN by
taking into consideration the power consumption of the fronthaul links,
multicast services, as well as user admission control. Specifically, we first
identify the sparsity structures in the solutions of both the network power
minimization and user admission control problems. However, finding the optimal
sparsity structures turns out to be NP-hard, with the coupled challenges of the
l0-norm based objective functions and the nonconvex quadratic QoS constraints
due to multicast beamforming. In contrast to the previous works on convex but
non-smooth sparsity inducing approaches, e.g., the group sparse beamforming
algorithm based on the mixed l1/l2-norm relaxation [1], we adopt the nonconvex
but smoothed lp-minimization (0 < p <= 1) approach to promote sparsity in the
multicast setting, thereby enabling efficient algorithm design based on the
principle of the majorization-minimization (MM) algorithm and the semidefinite
relaxation (SDR) technique. In particular, an iterative reweighted-l2 algorithm
is developed, which will converge to a Karush-Kuhn-Tucker (KKT) point of the
relaxed smoothed lp-minimization problem from the SDR technique. We illustrate
the effectiveness of the proposed algorithms with extensive simulations for
network power minimization and user admission control in multicast Cloud-RAN.</abstract><doi>10.48550/arxiv.1512.04784</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1512.04784 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1512_04784 |
| source | arXiv.org |
| subjects | Computer Science - Information Theory Mathematics - Information Theory |
| title | Smoothed Lp-Minimization for Green Cloud-RAN with User Admission Control |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-04T00%3A49%3A31IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Smoothed%20Lp-Minimization%20for%20Green%20Cloud-RAN%20with%20User%20Admission%20Control&rft.au=Shi,%20Yuanming&rft.date=2015-12-15&rft_id=info:doi/10.48550/arxiv.1512.04784&rft_dat=%3Carxiv_GOX%3E1512_04784%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |