{'fraction_non_alphanumeric': 0.020939086294416244, 'fraction_numerical': 0.0025380710659898475, 'mean_word_length': 5.16015625, '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 performance evaluation of distributed dynamic channel allocation protocols for mobile networks

Technological advances coupled with the proliferation of wireless devices among mobile users require efficient resource management and reuse of the scare radio spectrum allocated to wireless and mobile communication systems. Several channel allocation protocols based on a mutual exclusion paradigm have been developed. However, very little data have been reported to compare these protocols. In this paper, we review four of the best known distributed dynamic channel and resource allocation algorithms based on the mutual exclusion paradigm. While the first three channel alloctaion protocols (Cao et al., Choy et al. and Prakash et al.) are based on the co-channel interference, the fourth protocol, which is known as DDRA, adopts the co-group interference approach. We present an extensive set of simulation experiments to evaluate and compare the performance of these four protocols using realistic scenarios. Our results indicate clearly that DDRA algorithm has shown the shortest response time and highest blocking rate among all of the four channel allocation protocols. Cao et al. algorithm exhibits a better blocking rate when compared to the three other schemes. This is due to the fact that it reuses communication channels optimally. Last, but not least, we discuss the basic fault tolerant machanisms that can be used to enhance further these protocols while dealing with the base stations, mobile hosts, or links' failure. Copyright © 2006 John Wiley & Sons, Ltd.