ABSTRACT:
In the emerging world of mobile technology with 3G mobile computing systems, it is of evident importance for a cellular network to link, locate, update and generate query result for mobile clients in reduced time and cost. Earlier, two-tier architecture design is used and adopted for locating such clients. With the limitation of non-scalability of two-tier architecture, a hierarchical database tree like structure is proposed to organize information in location databases of cellular mobile computing system. Furthermore, the leaf nodes are designated as disjoint sets of the whole location database having information related to the client residing in each cell. A cell can be allocated to a mobile client with the help of their HLR (Home Location Register). At each instance of a client crossing its cell boundary needs to link, locate, and updating their VLR (Visitor Location Register) location database. Producing query results for such mobile clients involves heavy overheads with the increased burden on the total database management cost especially in a hierarchical distributed database with the increased mobility factor of a client. The first part of the research paper discusses about the problem faced by such static and non-scalable architecture of cellular mobile computing systems. The second part of the paper focuses upon a heuristic algorithm based on set covering problem, used with the objective of calculating the optimal distance threshold between two-clustered cells. Thus, the mobility pattern of a client is generated over a time, which helps in reducing the time and cost factor.