Small-cell deployment over existing heterogeneous networks

被引:14
作者
E, N. [1 ]
Chu, X. [1 ]
Zhang, J. [1 ]
机构
[1] Univ Sheffield, Dept Elect & Elect Engn, Mappin St, Sheffield S1 3JD, S Yorkshire, England
关键词
Cells - Computational complexity - Cytology - Iterative methods;
D O I
10.1049/el.2015.2405
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
To meet the extra traffic demand of hot-spot (HS) users not expected in the original network planning, it is desirable to deploy new small cells on top of the existing heterogeneous network (HetNet) without replanning the overall network. It is proposed to maximise the minimum user throughput in a HetNet with unexpected recurring HSs by jointly optimising the number and locations of new small cells and user associations of all cells. A reduced-complexity iterative algorithm is devised to solve the joint optimisation problem. The simulation results show that the proposed iterative algorithm significantly outperforms the random deployment of new small cells and achieves performance very close to numerically solving the joint optimisation in terms of minimum user throughput and required number of new small cells, especially for a large number of unexpected HS users.
引用
收藏
页码:241 / 242
页数:2
相关论文
共 6 条
[1]  
*3GPP, 2012, 36921 3GPP TR
[2]  
3GPP, 2010, document TR 36
[3]  
[Anonymous], 2014, P 2014 IEEE S COMP C
[4]   Optimizing Small Cell Deployment in Arbitrary Wireless Networks with Minimum Service Rate Constraints [J].
Hsieh, Hung-Yun ;
Wei, Shih-En ;
Chien, Cheng-Pang .
IEEE TRANSACTIONS ON MOBILE COMPUTING, 2014, 13 (08) :1801-1815
[5]  
Lasdon L. S., 1978, ACM Transactions on Mathematical Software, V4, P34, DOI 10.1145/355769.355773
[6]  
Wu J., 2012, ICCC, P541