For location updating of mobile users, two compression algorithms, namely, LZ78 and proposed compression algorithm (modified LZ78) are introduced in this paper to be used in PCS networks. Some problems related to using these algorithm are the usage of memory of dictionary in mobile users and HLR data base as well as the ambiguity about the last location of mobile users due to delay in location updating caused by the compression algorithm. The advantage of these algorithms is reduction at the number of location updating for a mobile user. With some modifications in the LZ78 algorithm, its problems in implementation are reduced and its usage for PCS networks is enhanced. These changes result from combining this algorithm with distance based location updating algorithm and sending symbols corresponding to some limited neighborhoods identity instead of cell number by compression algorithm
For comparison between LZ78 and proposed modified algorithm, we use simulation technique. The simulation program has two structures for PCS network, namely, square cells and hexagon cell networks. For mobile users, we considered two movement patterns: one is directional and the other is omnidirectional movement pattern. The outputs of the simulation program are the number of location updating, the maximum ambiguity of user location and size of dictionary for compression algorithms. Comparing the two algorithms by simulation, we observe that in the modified LZ78 algorithm the parameters of location updating number, maximum user ambiguity and size of dictionary are lower than those in the LZ78 algorithm.
At the end of the article, cost of location management of mobile user versus call to mobility ratio (the average number of call toward user to the average number of its movement) is calculated. By comparing location management for LZ78 algorithm, modified LZ78 and distance based location updating algorithm, we observe that the cost of location management is reduced for modified LZ78 compression algorithm.