{'fraction_non_alphanumeric': 0.024154589371980676, 'fraction_numerical': 0.014492753623188406, 'mean_word_length': 5.140740740740741, '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}}
A proposal of an improved Handoff decision algorithm

A number of variants of traditional Handoff (HO) algorithms have been shown in the literature. In this paper a modified version of HO decision algorithm is proposed. This algorithm has less computational complexity comparing to the traditional HO decision algorithm. This new algorithm measures the distances of adjacent seven cells including the serving cell, instead of scanning the neighboring 16 cells signal strength, so it naturally reduces the searching complexity for handoff by (11/16)%=32%. As a result HO time will be reduced in every case by 32% compared with the traditional handoff algorithm. It also reduces channel usage by not considering more than 50% cells during search, which subsequently increases channel capacity, QoS and reduces delay and call drop.