{'fraction_non_alphanumeric': 0.015557476231633534, 'fraction_numerical': 0.005185825410544511, 'mean_word_length': 5.69364161849711, '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}}
Interference-aware cooperative routing in wireless networks

We study interference-aware, many-to-many cooperative routing algorithms in wireless networks. Network performance is measured in terms of effective rate achieved when multiple frames are transmitted sequentially over a single cooperative path. Motivated by the overall network performance when multiple concurrent sessions are taken into consideration, we develop heuristic algorithms that reduce the interference caused by a session to a small geographic neighborhood. This allows the following frames and possibly the rest of the network to operate efficiently. We introduce an interference-aware performance metric based on the effective rate and evaluate the performance of several cooperative routing algorithms. Our heuristic algorithms show an improvement of 10 – 20% in the effective rate over traditional cooperative routing algorithms and an improvement of 10% over simple routing without cooperative transmission. We show that cooperation has little if any performance gain over simple relaying in terms of effective rate when inter-frame interference is not taken into consideration.