{'fraction_non_alphanumeric': 0.01924839596700275, 'fraction_numerical': 0.0, 'mean_word_length': 5.066666666666666, '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}}
Ant-Based Stable Disjoint Path Routing Algorithm in Wireless Ad Hoc Networks

A mobile ad hoc network (MANET) is one consisting of a set of mobile hosts capable of communicating with each other without the assistance of base stations. Earlier research has proposed several unipath routing protocols specifically on MANET. However, the single path is easily broken and needs to perform a route discovery process again due to the dynamic topology of ad hoc networks. To alleviate these problems, a new routing algorithm called ant-based stable disjoint path routing algorithm (ABSDPRA) is proposed. ABSDPRA is based on swarm intelligence and especially on the ant colony based meta heuristic. The proposed algorithm can consider link stability. The introduced routing algorithm is highly adaptive, efficient and scalable. ABSDPRA exploits the concept of a routing protocol called GRID and discover multiple disjoint routing paths with a low routing overhead. Simulation results indicate that ABSDPRA has a higher packet delivery ratio, lower end- to-end delay and lower routing load than AODV.