{'fraction_non_alphanumeric': 0.01644736842105263, 'fraction_numerical': 0.0008223684210526315, 'mean_word_length': 5.305699481865285, '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}}
Distributed Algorithm for Improving Performance through Swap Link in Wireless Networks

In the distributed scheduling algorithms to achieve the maximal throughput is a challenging problem because of the complex interference constraints among different links. This can be done by with scheduling and without scheduling. We calculate the delay, Travel time and we trace the path of the packets sent from source to destination nodes. In addition, simulation results indicate that the delay performance of these algorithms can be quite good in with Scheduling. In this paper we apply an Adaptive carrier sense multiple access (CSMA) scheduling algorithm [2] that can achieve the maximal throughput distributively. Some of the major disadvantages of the algorithm are that it does not consider the packet loss and frequency range of the nodes. Furthermore, the algorithm is combined with congestion control to achieve the optimal utility and fairness of competing flows. So what we show that while reducing the packet loss and increasing the frequency range of the nodes applied with the above algorithm greatly improves the performance of transmission. Keywords—Adaptive CSMA, node range, travel time, delay, packet loss