Integer and combinatorial optimization
Integer and combinatorial optimization
Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Radio Interface System Planning for GSM/Gprs/Umts
Radio Interface System Planning for GSM/Gprs/Umts
Radio Network Planning and Optimisation for Umts
Radio Network Planning and Optimisation for Umts
The GSM System for Mobile Communications
The GSM System for Mobile Communications
GSM, Gprs and Edge Performance
GSM, Gprs and Edge Performance
Fundamentals of Cellular Network Planning and Optimisation: 2G/2.5G/3G... Evolution to 4G
Fundamentals of Cellular Network Planning and Optimisation: 2G/2.5G/3G... Evolution to 4G
| Hi-index | 0.00 |
In GSM/EDGE Radio Access Networks (GERAN), the number of neighbor cells defined per cell for handover purposes is limited. Due to the large number of cells and, consequently, neighbor cells in the system, neighbor cell management proves a complex and time-consuming process during network operation. Hence, it is very likely that, on some cells, important neighbor cells are missing. This paper outlines a new approach for determining these missing neighbors, based only on information from the network management system. Thus, the need for propagation data from network planning tools is circumvented, which makes the method especially suitable for the operational stage of an existing network. Results from the application of the method in a live network show its capability to spot such missing neighbors. Although performance benefits from the method are rather limited for the entire network, significant benefits can be obtained on individual cells.