{'fraction_non_alphanumeric': 0.02037617554858934, 'fraction_numerical': 0.006269592476489028, 'mean_word_length': 5.39, '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}}
On local approximation of minimum-latency broadcast scheduling in 3D MANETs

Minimum-latency broadcast scheduling problem has been a long-studied problem on the basis of conflict avoidance. However, no algorithms with theoretical performance guarantees have been proposed for this problem in 3D mobile ad hoc networks (MANETs), due to the significant hardness brought by various node mobilities in 3D space. As the first attempt in the literature to study this problem in 3D MANETs, we provide a localized approximation algorithm (LBS) with both theoretical and experimental guarantees with respect to time latency and message complexity.