{'fraction_non_alphanumeric': 0.015558698727015558, 'fraction_numerical': 0.0, 'mean_word_length': 5.2105263157894735, '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}}
A Voronoi Diagram Approach for Mobile Element Scheduling in Sparse Sensor Networks

Relaying data with the help of mobile elements seems an effective way to bridge the gaps in sparse sensor networks. In this paper, we propose the Voronoi-diagram-based mobile element scheduling (VDMES) algorithm to construct the shortest possible path for mobile elements. The mobile elements are scheduled to visit a small subset of Voronoi vertices rather than the sensor nodes, which is carefully constructed through iterative virtual site insertion, and exactly covers all sensor nodes in a given transmission radius. The path concatenating the Voronoi vertices is much shorter than that formed by regular sensor nodes.