A non-linear binary integer programming model for location area partitioning in cellular radio networks

Sensitivity study of location management area partitioning in cellular communication systems

“…The location management model used in the paper can be found in [12] and only the necessary information is produced in this paper. Let the service area be made up of n cells and n LA LAs.…”

“…Constraint (12) states that there must be at least one LA in the entire service area and that there cannot be more LAs than there are cells. The final constraint (13) ensures that a cell does not belong to more than one LA.…”

“…The antagonistic nature of the dual processes of paging and location update is both well-known and well-documented [1][2][3][4][5][6][7][8][9][10][11][12]. Partitioning the service area of a network to suit one form of signaling traffic normally leads to unfavorable conditions for the other.…”

“…The problem of finding the LA partitioning that minimizes the total signaling cost has attracted research interests as it thus maximizes the bandwidth available for revenue-generating services [1][2][3][4][5][6][7][8][9][10][11][12]. However, all these work is looking into the optimal LA partitioning under a given set of parameter values.…”

“…It is with this aim in mind, the paper attempts at giving a mathematically rigorous account of sensitivity study of the location management design of a cellular communication system, of which is modeled as a non-linear programming model [12]. The paper continues in Section 2 with a brief outline of the concept of location management in Global Systems for Mobile Communications (GSM) and the various influencing parameters.…”