Skip to Main Content
The present work addresses probabilistic solution of two fundamental issues of cellular mobile environment maintaining a common set of information. One of the issues is to predict the location of a mobile user whereas the other is to predict the traffic load of each area and accordingly distribute channels among different areas. For location management the entire area covered by cellular architecture is considered as a hierarchy of location areas considering mobile switching centre as the root of the hierarchy and thus a new tree like data structure is introduced. When a call arrives, mobile switching centre computes the location probability of the called mobile unit at all the cells under it with the help of a database and tree-like data structure is kept in mobile switching centre itself. Finally mobile switching centre performs the appropriate searching to find the best probable cell(s) where the desired mobile unit may be traced. The scheme is made more realistic later exploiting the fact that most of the users confine their movement within a group of cells. It is done by making leaf level of the hierarchy dynamic by switching the membership of a cell from one group to the other depending upon the change of probability of finding a user at a cell. For predicting traffic load in each cell, mobile switching centre scans the same database used for predicting the location of a mobile user and finds out frequency of locating the user in each cell. With the help of this information and a heuristic function the cell wise channel requirement is computed. Finally experiments are carried out to see the variation of system cost and delay with time considering call arrival pattern as Poisson distribution and movement pattern by Gaussian distribution.