{'fraction_non_alphanumeric': 0.013669821240799159, 'fraction_numerical': 0.023133543638275498, 'mean_word_length': 4.700598802395209, '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}}
Analysis of Greedy Perimeter Stateless Routing Protocol Network Simulation using Bird Flocking Algorithm

The purpose of this study is to simulate the GPSR protocol network on NS3 using the bird flocking algorithm and to analyze the comparison of performance measurements obtained from the simulation results. The Greedy Perimeter Stateless Routing network was simulated using NS-3 in this simulation. The simulation area is created in length, width. The distance between nodes is 50 meters and is simulated in an area of 1000m x 300m for 30 seconds and 802.11 MAC protocol is used. This simulation was successfully implemented in finding the location of the nearest node using the GPSR protocol with the PSO / BFA algorithm. The number of nodes used in the simulation is 150 nodes and 2 nodes, so it can be concluded that the performance of Quality of Service (QoS) is greatly affected by the number of nodes and the algorithm used in the simulation.