Near-Optimal Auto-Configuration of PCID in LTE Cellular Systems

Navrati SAXENA  Abhishek ROY  Jeong Jae WON  

IEICE TRANSACTIONS on Communications   Vol.E92-B   No.10   pp.3252-3255
Publication Date: 2009/10/01
Online ISSN: 1745-1345
DOI: 10.1587/transcom.E92.B.3252
Print ISSN: 0916-8516
Type of Manuscript: LETTER
Category: Network
LTE,  SON,  vertex coloring,  NP-complete,  permutation,  randomized algorithms,  

Full Text: PDF(341.4KB)>>
Buy this Article

In this letter we show that the dynamic optimal PCID allocation problem in LTE systems is NP-complete. Subsequently we provide a near-optimal solution using SON which models the problem using new merge operations and explores the search space using a suitable randomized algorithmic approach. Two feasible options for dynamic auto-configuration of the system are also discussed. Simulation results point out that the approach provides near-optimal auto-configuration of PCIDs in computationally feasible time.