{'fraction_non_alphanumeric': 0.011349306431273645, 'fraction_numerical': 0.0, 'mean_word_length': 5.203125, '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}}
On the Scalability of Internet Gateway Discovery Algorithms for Ad hoc Networks

The aim of this work is to evaluate the scalability of methods applied to interconnect ad hoc networks to the Internet. We describe some of the solutions proposed for Internet connectivity in ad hoc networks. We define scalability space, absolute, relative and weak relative scalability terms. The scalability comparison of these mechanisms is presented by means of analytical modelling with respect to different parameters such as number of mobile nodes, rate of link changes and rate of traffic sessions per each mobile node. To optimise the total amount of overhead generated by the discovery protocols, we propose a feedback control algorithm to adapt period and transmission range of gateway advertisements.