{'fraction_non_alphanumeric': 0.016799292661361626, 'fraction_numerical': 0.0, 'mean_word_length': 4.895833333333333, '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}}
Scalable routing with adaptive route table updating in the large ad hoc networks

In this paper, we address the scalable route problem of the large ad hoc network. The routing problem of ad hoc network is particularly challenging, especially for the large ad hoc networks, because the large number of mobile node and the high mobility of the mobile node. FSR (Fisheye state routing) scheme is proposed to resolve the routing problem in large ad hoc networks, but the this protocol use fixed route table update interval, so routing overhead of FSR is relative large while the mobility of node is high. This paper proposed DTUI (dynamic route table update interval) scheme to keep the routing overhead increasing linearly with the increasing number of the mobile hosts in the ad hoc networks. In our adaptive scheme, each node adaptive adjust own route table update interval according to the mobility of the mobile nodes. We study two types of execution: range-based DTUI adaptation and continuous function DTUI adaptation. The simulations prove that our scheme can reduce the routing overhead while guarantee certain route accuracy.