{'fraction_non_alphanumeric': 0.01468048359240069, 'fraction_numerical': 0.0, 'mean_word_length': 5.548022598870056, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
LOCATION MANAGEMENT COST FOR DYNAMIC LOCATION UPDATE AND PAGING FOR PCS NETWORKS

The standard technique for cellular networks is to decrease radio cell size, thereby maintaining a supportable subscriber density. However, smaller cell sizes result in increased signaling for location management procedures, which reduces the bandwidth available for user traffic and increases the cost. A dynamic distance-based location update with sequential paging with no delay constraint algorithm has been considered and compared with other location algorithms in terms of location management cost. The developed MATLAB based mobility model outputs the cellular parameters and location update messages count during the movement of the mobile station. The results from this model were used to calculate the update ratio and the search costs for four algorithms. A comparison of the total cost for all the algorithms had been considered. Performance analysis and simulation results show that the dynamic algorithm gives the best cost compared the other used algorithms. Keyword: location management; dynamic location update; sequential paging; location cost, PCS networks.