Skip to main content
SpringerLink
Log in

Identification of missing neighbor cells in GERAN

  • Published:
Wireless Networks Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

Notes

  1. W can be exponentially large to n, e.g., 2n.

Abbreviations

BAL:

BCCH Allocation list

BCCH:

Broadcast Control CHannel

EDGE:

Enhanced Data Rates for Global Evolution

GERAN:

GSM/EDGE Radio Access Network

GPRS:

General Packet Radio Service

GSM:

Global System for Mobile Communications

IM:

Interference Matrix

KP:

Knapsack Problem

HO:

HandOver

MS:

Mobile Station

NMS:

Network Management System

RP:

Relative Position

UTRAN:

UMTS Radio Access Network

UR:

Utilization Ratio

References

  1. Halonen, T., Romero, J., & Melero, J. (2003). GSM, GPRS and EDGE Performance (2nd ed., pp. 484–490). John Wiley & Sons.

  2. Mishra, A. (2004). Fundamental of cellular network planning and optimization. West Sussex: Wiley.

    Book  Google Scholar 

  3. Lempiäinen, J., & Manninen, M. (2001). Radio interface system planning for GSM/GPRS/UMTS. Kluwer Academic Publishers.

  4. Laiho, J., Wacker, A., & Novosad, T. (2002). Radio network planning and optimization for UMTS (pp. 424–425). John Wiley & Sons.

  5. 3GPP TS 04.08 version 7.21.0 Release 1998, ETSI TS 100 940 V7.21.0 (2003–12).

  6. Mouly, M., & Pautet, M. B. (1992). The GSM system for mobile communications. France: Palaiseau.

    Google Scholar 

  7. Okumura, T., Ohmori, E., & Fukuda, K. (1968). Field strength and its variability in VHF and UHF land mobile services. Review of the Electrical Communications Laboratory, 16(9–10), 825–873.

    Google Scholar 

  8. Walfish, J., & Bertoni, H. L. (1988). A theoretical model of UHF propagation in urban environments. IEEE Transactions on Antenna Propagation, AP-36, 1788–1796.

    Article  Google Scholar 

  9. Berg, J. E. (1995). A recursive method for street microcell path loss calculations. In Proceedings of 6th IEEE international symposium on personal, indoor and mobile communications PIMRC’95 (Vol. 1, pp. 140–143).

  10. Brown, P. G., & Constantinou, C. C. (1995). Prediction of radiowave propagation in urban microcell environments using ray tracing methods. In ICAP’95, IEE conference publication, No. 407 (pp. 373–376).

  11. Daniele, P., Frullone, M., Heiska, K., Riva, G., & Carciofi, C. (1996). Investigation of adaptive 3D microcellular prediction tools starting from real measurements. In Proceedings of the 5th IEEE international conference on universal personal communications (pp. 468–472).

  12. Timmer, Y., & Bergenlid, M. (1999). Estimating the inter-cell dependency matrix in a GSM network. In Proceedings of the 50th IEEE vehicular technology conference (Vol. 5, pp. 3024–3028).

  13. Barco, R., Cañete, F. J., Díez, L., Ferrer, R., & Wille, V. (2001). Analysis of mobile-measurement-based interference matrices in GSM networks. In Proceedings of the 54th IEEE vehicular technology conference (Vol. 3, pp. 1412–1416).

  14. Kuurne, A. M. J. (2002). On GSM mobile measurement based interference matrix generation. In Proceedings of the 55th IEEE vehicular technology conference (Vol. 4, pp. 1965–1969).

  15. Wolsey, L.A., & Nemhauser, G.L. (1999). Integer and combinatorial optimization. John Wiley & Sons.

  16. Martello, S., & Toth, P. (1990). Knapsack problems: Algorithms and computer implementations. New York: John Wiley & Sons.

    MATH  Google Scholar 

  17. Kellerer, H., Pferschy, U., & Pisinger, D. (2003). Knapsack problems. Springer Verlag.

  18. Olofsson, H., Magnusson, S., & Almgren, M. (1996). A concept for dynamic neighbor cell list planning in a cellular system. In Proceedings of the 7th IEEE international symposium on personal, indoor and mobile radio communications (Vol. 1, pp. 138–142).

  19. Olofsson, H., & Magnusson, S. (1997). Dynamic neighbor cell list planning in a microcellular network. In Proceedings of the 6th IEEE international conference universal personal communications record (Vol. 1, pp. 223–227).

  20. Martello, S., & Toth, P. (1987). Algorithms for knapsack problems. In S. Martello (Ed.), Surveys in combinatorial optimization, volume 31 of annals of discrete mathematics (pp. 213–258). North-Holland.

  21. Carpaneto, G., Martello, S., & Toth, P. (1988). Algorithms and codes for the assignment problem. In B. Simeone, P. Toth, G. Gallo, F. Maffioli, & S. Pallottino (Eds.), FORTRAN Codes for Network Optimization, Annals of Operations Research 13.

  22. Martello, S., Pisinger, D., & Toth, P. (2000). New trends in exact algorithms for the 0–1 knapsack problem. European Journal of Operational Research, 123, 325–332.

    Article  MATH  MathSciNet  Google Scholar 

  23. Dantzig, G. B. (1957). Discrete variable extremum problems. Operations Research, 5, 266–277.

    Article  MathSciNet  Google Scholar 

  24. Martello, S., & Toth, P. (1997). An upper bound for the zero-one knapsack problem and a branch and bound algorithm. European Journal of Operational Research, 1, 169–175.

    Article  MathSciNet  Google Scholar 

  25. Pisinger, D. (1985). A minimal algorithm for the 0–1 knapsack problem. Methods of Operations Research, 49, 277–293.

    Google Scholar 

Download references

Acknowledgements

The authors wish to thank K. Rasmussen, N. Vig, G. Davies and A. Brimer of Nokia for their help, support and advice on this method.

Author information

Authors and Affiliations

  1. E.T.S.I. Telecomunicación, Campus Teatinos, Málaga, 29071, Spain

    M. Toril & R. Barco

  2. Nokia Siemens Networks, Consulting & Systems Integration, Ermine Business Park, Huntingdon, Cambridgeshire, PE29 6YJ, UK

    V. Wille

Authors
  1. M. Toril
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. V. Wille
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. R. Barco
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to R. Barco.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Toril, M., Wille, V. & Barco, R. Identification of missing neighbor cells in GERAN . Wireless Netw 15, 887–899 (2009). https://doi.org/10.1007/s11276-007-0082-1

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11276-007-0082-1

Keywords

Search

Navigation