DocumentCode :
1972923
Title :
A graph-based dynamic coordinated clustering scheme for base station cooperation
Author :
Geng Su ; Cuthbert, L. ; Tiankui Zhang
Author_Institution :
Sch. of Electron. Eng. & Comput. Sci., Queen Mary Univ. of London, London, UK
fYear :
2011
fDate :
14-16 Oct. 2011
Firstpage :
201
Lastpage :
206
Abstract :
In this paper, a graph-based dynamic coordinated clustering scheme is proposed for base station cooperation (BSC) wireless systems. An interference weighted graph is constructed to assist dynamic coordinated clustering for inter-cell interference mitigating and improving the cell-user performance. The assist graph is constructed with weighted interference value among users, considering the overhead exchange constraint, only 2 bits (1 bit for diversity set judgment, 1 bit for user status) signalling exchange between base stations are needed during the graph constructing. Based on the interference weighted graph, a modified Hungarian algorithm is used for the coordinated clustering. Simulation results show that the proposed scheme can improve the performance of cell-edge users.
Keywords :
cellular radio; cooperative communication; graph theory; interference suppression; radiofrequency interference; telecommunication exchanges; telecommunication signalling; BSC wireless system; base station cooperation wireless system; cell-edge user performance; graph-based dynamic coordinated clustering scheme; intercell interference mitigation; interference weighted graph; modified Hungarian algorithm; overhead signalling exchange constraint; word length 2 bit; Base station cooperation; graph theory; interference mitigation;
fLanguage :
English
Publisher :
iet
Conference_Titel :
Communication Technology and Application (ICCTA 2011), IET International Conference on
Conference_Location :
Beijing
Type :
conf
DOI :
10.1049/cp.2011.0659
Filename :
6192855
Link To Document :
بازگشت