This paper introduces the problem of Primary Scrambling Code (PSC) selection in small cell networks and proposes a novel optimisation technique. Small cells introduce challenges not present in conventional macrocell scrambling code allocation, including the need for dynamic allocation, scalable distributed allocation algorithms, and support for unplanned and organic deployments. To the best of our knowledge this is the first study addressing the issue of distributed scrambling code selection for small cell networks. We propose a decentralized learning algorithm which does not require any collaboration between the neighbouring base-stations and which finds a feasible allocation whenever one exists. The performance of the algorithm is compared against two variations of a greedy algorithm which is the current 3GPP recommendation and is shown to offer significant performance benefits.
Self-configuration of scrambling codes for WCDMA small cell networks / Checco, Alessandro; Razavi, Rouzbeh; Leith, Douglas J.; Claussen, Holger. - (2012), pp. -154. (Intervento presentato al convegno 2012 IEEE 23rd International Symposium on Personal Indoor and Mobile Radio Communications (PIMRC) tenutosi a Sydney, Australia) [10.1109/PIMRC.2012.6362585].
Self-configuration of scrambling codes for WCDMA small cell networks
Checco, Alessandro;
2012
Abstract
This paper introduces the problem of Primary Scrambling Code (PSC) selection in small cell networks and proposes a novel optimisation technique. Small cells introduce challenges not present in conventional macrocell scrambling code allocation, including the need for dynamic allocation, scalable distributed allocation algorithms, and support for unplanned and organic deployments. To the best of our knowledge this is the first study addressing the issue of distributed scrambling code selection for small cell networks. We propose a decentralized learning algorithm which does not require any collaboration between the neighbouring base-stations and which finds a feasible allocation whenever one exists. The performance of the algorithm is compared against two variations of a greedy algorithm which is the current 3GPP recommendation and is shown to offer significant performance benefits.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.