Name
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-con figuration of the system are also discussed. Simulation results point out that the approach provides near-optimal auto-configuration of PCIDs in computationally feasible time. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1587/transcom.E92.B.3252 | IEICE TRANSACTIONS ON COMMUNICATIONS |
Keywords | Field | DocType |
LTE, SON, vertex coloring, NP-complete, permutation, randomized algorithms | Randomized algorithm,NP-complete,Computer science,Parallel computing,Permutation,Algorithm,Merge (version control),Auto-configuration,Distributed computing | Journal |
Volume | Issue | ISSN |
E92B | 10 | 0916-8516 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Navrati Saxena | 1 | 577 | 44.48 |
| Abhishek Roy | 2 | 451 | 32.21 |
| Jeong-Jae Won | 3 | 55 | 6.65 |