{'fraction_non_alphanumeric': 0.018506278916060808, 'fraction_numerical': 0.0, 'mean_word_length': 5.881818181818182, '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}}
Performance Improvement of Topology-Transparent Broadcast Scheduling in Mobile Ad Hoc Networks

Broadcasting is a key function in mobile ad hoc networks. Topology-dependent scheduling algorithms depend on the detailed network connectivity information and cannot adapt to dynamic topological changes in mobile networks. To overcome this limitation, topology-transparent broadcast scheduling algorithms have been proposed. Due to the large overhead of implementing the acknowledgement mechanism in broadcast communications and to guarantee that there is at least one collision-free transmission in each frame, most existing topology-transparent broadcast scheduling algorithms require a node to transmit the same packet repeatedly at multiple slots during one frame. This is very inefficient. In this paper, we propose an efficient topology-transparent broadcast scheduling algorithm. First, instead of transmitting the same packet repeatedly during one frame, each node collects transmission codes of its two-hop neighbors and transmits several different packets during one frame. Second, noting that many unassigned slots are not utilized, we propose several methods to utilize the unassigned slots efficiently in a collision-free and traffic-adaptive manner. Thus, our algorithm provides a guaranteed throughput and achieves a much better average throughput. The analytical and simulation results show that our proposed algorithm outperforms other existing topology-transparent broadcast algorithms dramatically.