{'fraction_non_alphanumeric': 0.020508613617719443, 'fraction_numerical': 0.0, 'mean_word_length': 5.7032967032967035, '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}}
Mobile Sensors Deployment Subject to Location Estimation Error

Voronoi-based mobile sensor deployment algorithms require the knowledge of sensors' locations to guarantee a simple reliable coverage detection, and they miss the mark if the location is inaccurate. However, in practice, it is often too expensive to include a Global Positioning System (GPS) receiver in each node, and location information is inaccurate as sensors estimate locations from the messages they receive. We study sensor deployment algorithms in the presence of location estimation error for sensors with nonidentical sensing ranges. We propose a set of Voronoi-based diagrams, which are called guaranteed Voronoi diagrams (VDs), that guarantee single-cell-based coverage hole detection algorithms, provided that upper bounds on localization errors are assumed. Although inaccuracy of location information would appear to deteriorate the total coverage, our simulation results demonstrate that the proposed algorithms can exploit this inaccuracy to improve network coverage. Hence, even if the location information is exactly known at each node, assuming some error margins improves the network coverage if guaranteed Voronoi diagrams are used.