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.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Navrati SAXENA, Abhishek ROY, Jeong Jae WON, "Near-Optimal Auto-Configuration of PCID in LTE Cellular Systems" in IEICE TRANSACTIONS on Communications,
vol. E92-B, no. 10, pp. 3252-3255, October 2009, doi: 10.1587/transcom.E92.B.3252.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E92.B.3252/_p
Copy
@ARTICLE{e92-b_10_3252,
author={Navrati SAXENA, Abhishek ROY, Jeong Jae WON, },
journal={IEICE TRANSACTIONS on Communications},
title={Near-Optimal Auto-Configuration of PCID in LTE Cellular Systems},
year={2009},
volume={E92-B},
number={10},
pages={3252-3255},
abstract={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.},
keywords={},
doi={10.1587/transcom.E92.B.3252},
ISSN={1745-1345},
month={October},}
Copy
TY - JOUR
TI - Near-Optimal Auto-Configuration of PCID in LTE Cellular Systems
T2 - IEICE TRANSACTIONS on Communications
SP - 3252
EP - 3255
AU - Navrati SAXENA
AU - Abhishek ROY
AU - Jeong Jae WON
PY - 2009
DO - 10.1587/transcom.E92.B.3252
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E92-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2009
AB - 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.
ER -