{'fraction_non_alphanumeric': 0.021321961620469083, 'fraction_numerical': 0.0, 'mean_word_length': 5.302013422818792, '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}}
Density-aware hop-count localization (DHL) in wireless sensor networks with variable density

Localization schemes using hop-counts to reference nodes of known positions have been proposed to localize nodes in a sensor network. However, these schemes usually work well only when the networks have uniform and dense node distribution. A novel density-aware hop-count localization (DHL) algorithm is described to improve the accuracy of location estimation when the node distribution is non-uniform. When the density is low, each hop traversed is not necessarily equivalent to the maximum range distance. A range ratio is used to adjust the accumulated hop-count and this effectively reduces distance overestimation. Simulations show that our algorithm improves the localization accuracy compared to the algorithms without density considerations. The overhead incurred by DHL is found to be lower than that incurred by conventional schemes.