TY - GEN
T1 - Joint base station selection and distributed compression for cloud radio access networks
AU - Park, Seok Hwan
AU - Simeone, Osvaldo
AU - Sahin, Onur
AU - Shamai, Shlomo
PY - 2012
Y1 - 2012
N2 - This work studies joint base station (BS) selection and distributed compression for the uplink of a cloud radio access network. Multiple multi-antenna BSs are connected to a central unit, also referred to as cloud decoder, via capacity-constrained backhaul links. Since the signals received at different BSs are correlated, distributed source coding strategies for communication to the cloud decoder are potentially beneficial. Moreover, reducing the number of active BSs can improve the network energy efficiency, since BS energy consumption provides a major contribution to the overall energy expenditure for the network. An optimization problem is formulated in which compression and BS selection are performed jointly by introducing a sparsity-inducing term into the objective function. An iterative algorithm is proposed. From numerical results, it is observed that the proposed joint BS selection and compression algorithm performs close to the more complex exhaustive search solution.
AB - This work studies joint base station (BS) selection and distributed compression for the uplink of a cloud radio access network. Multiple multi-antenna BSs are connected to a central unit, also referred to as cloud decoder, via capacity-constrained backhaul links. Since the signals received at different BSs are correlated, distributed source coding strategies for communication to the cloud decoder are potentially beneficial. Moreover, reducing the number of active BSs can improve the network energy efficiency, since BS energy consumption provides a major contribution to the overall energy expenditure for the network. An optimization problem is formulated in which compression and BS selection are performed jointly by introducing a sparsity-inducing term into the objective function. An iterative algorithm is proposed. From numerical results, it is observed that the proposed joint BS selection and compression algorithm performs close to the more complex exhaustive search solution.
UR - http://www.scopus.com/inward/record.url?scp=84875673787&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84875673787&partnerID=8YFLogxK
U2 - 10.1109/GLOCOMW.2012.6477738
DO - 10.1109/GLOCOMW.2012.6477738
M3 - Conference contribution
AN - SCOPUS:84875673787
SN - 9781467349413
T3 - 2012 IEEE Globecom Workshops, GC Wkshps 2012
SP - 1134
EP - 1138
BT - 2012 IEEE Globecom Workshops, GC Wkshps 2012
T2 - 2012 IEEE Globecom Workshops, GC Wkshps 2012
Y2 - 3 December 2012 through 7 December 2012
ER -