{'fraction_non_alphanumeric': 0.01964512040557668, 'fraction_numerical': 0.0, 'mean_word_length': 5.392712550607287, '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}}
Novel dynamic source routing protocol (DSR) based on genetic algorithm‐bacterial foraging optimization (GA‐BFO)

The goal of mobile ad hoc network (MANET) routing protocol is to establish a correct and effective route with minimal control overhead and bandwidth consumption. Dynamic source routing protocol (DSR) is a simple on‐demand routing protocol designed specifically for MANETs. The choice of routing path only adopts the simplest minimum hop count algorithm, while it did not take the node energy into account. In order to improve the control overhead of the network, we comprehensively consider the node energy information when searching the routes to the destination nodes. We propose a genetic algorithm (GA)‐bacterial foraging optimization algorithm to perform the selection of the optimal routing. After searching out multiple routes to the destination node, the paths are initialized then the GA algorithm is started. This algorithm quickly finds the positions of the maximum probability optimal paths, which are the initial positions of bacteria for the bacteria foraging optimization (BFO) algorithm. Through using the BFO algorithm, it is easy to search out the extreme value and the optimal path in order to compensate for the poor accuracy of GA algorithm. Our proposed optimized strategy improves the routing selection algorithm without change the complexity of DSR and proves the convergence of the algorithm to the global optimal solution. The simulation shows that the proposed algorithm is feasible and applicable and also has better experimental result.