LOCATION-AREA PARTITION IN A CELLULAR RADIO NETWORK

With an increasing population of mobile subscribers, the signalling tr affic to control the subscriber mobility expands rapidly. Subscriber m obility is controlled through location registration based on the so-ca lled location area, the basic area unit for paging which consists of a number of cells. There is a tradeoff between the two kinds of signall ing traffic: paging and location updating. As location areas include a larger number of cells, the traffic volume for paging increases while that for location updating decreases. Given not only the pattern of c all arrivals but also that for subscriber mobility, our problem is to minimise the total signalling traffic by optimally partitioning the wh ole area into location areas. We show that this problem can be transfo rmed to the so-called clique partitioning problem (CPP). Also we demon strate the process of implementing the algorithm for solving the CPP f or real-world problems defined on the cellular network in Seoul.