{'fraction_non_alphanumeric': 0.014234875444839857, 'fraction_numerical': 0.0, 'mean_word_length': 4.926315789473684, '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}}
Modeling forwarding progress for one hop in wireless ad hoc networks

The forwarding progress in one hop plays an essential role for many tradeoff problems in ad hoc networks. In all previous analytical work, nodes are assumed to be Poisson distributed. However, this assumption has its limitation and cannot be applied to many scenarios. In this paper, a more general model is proposed and the forwarding progress in one hop with arbitrary nodal distribution and different forwarding strategies is computed. The accuracy of the model is verified by simulations.