Location-area partition in a cellular radio network
Location-area partition in a cellular radio network
复制标题
DOI：
10.1057/palgrave.jors.2600448
复制
发表时间：
1997-12
影响因子：
3.6
通讯作者：
D. Tcha;T. Choi;Young-Soo Myung
中科院分区：
文献类型：
--
作者：
D. Tcha;T. Choi;Young-Soo Myung
随着移动用户数量的不断增加，用于控制用户移动性的信令业务量迅速增加。用户移动是通过基于所谓的位置区域的位置注册来控制的，位置区域是寻呼的基本区域单位，由许多小区组成。在两种信令流量之间存在一种权衡：分页和位置更新。随着位置区域包含更多的单元，用于分页的流量增加，而用于位置更新的流量减少。不仅考虑到呼叫到达的模式，而且考虑到用户的移动性，我们的问题是通过最佳地将整个区域划分为位置区域来最小化总信令流量。我们证明了这个问题可以转化为所谓的团划分问题（CPP）。此外，我们还演示了实现算法的过程，以解决在首尔蜂窝网络上定义的实际问题的CPP。
With an increasing population of mobile subscribers, the signalling traffic to control the subscriber mobility expands rapidly. Subscriber mobility is controlled through location registration based on the so-called location area, the basic area unit for paging which consists of a number of cells. There is a tradeoff between the two kinds of signalling 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 call arrivals but also that for subscriber mobility, our problem is to minimise the total signalling traffic by optimally partitioning the whole area into location areas. We show that this problem can be transformed to the so-called clique partitioning problem (CPP). Also we demonstrate the process of implementing the algorithm for solving the CPP for real-world problems defined on the cellular network in Seoul.