(An) algorithm for the location area planning problem in mobile communication system

Abstract

The increased demand for wireless mobile communications is confronted by the limitation posed by finite available bandwidth such as signaling traffic in mobile system. So, many researches have been done in order to solve bandwidth limitation of large-scale mobile communication systems by mobility management. Generally, mobility management problems are summarized into two grand categories, one is radio mobility problem which is related with handover process and the other is network mobility problem well known as a cell clustering problem. Location area problem is to divide the coverage area into many location areas (LAs) which are sets of adjacent cells. So, in many cases, location area problem can be considered as a node clustering problem that arises in designing network communication system. Various constraints such as connectivity requirement for physical structures of mobile system on the LA problem need to be considered. The primary issue in this problem is how to construct the cost-effective system by grouping the cells into the location areas. In this thesis, we show the formal definition and solve the problem by using the 0-1 integer programming formulation by decomposing the entire problem into a master problem and a column generation problem. The master problem is solved by a column generation technique and column generation problem is solved by a branch and cut algorithm. And then we will show an optimized LA clustering solution.