{'fraction_non_alphanumeric': 0.022540983606557378, 'fraction_numerical': 0.0, 'mean_word_length': 4.993865030674846, '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}}
Designing reduced beacon trajectory for sensor localization

Localization is one of the substantial issues in wireless sensor networks. The key problem for the mobile beacon localization is how to choose the appropriate beacon trajectory. However, little research has been done on it. In this paper, firstly, we deduce the number of positions for a beacon to send a packet according to the acreage of ROI (region of interest); and next we present a novel method based on virtual force to arrange the positions in arbitrary ROI; then we apply TSP (travelling salesman problem) algorithm to the positions sequence to obtain the optimal touring path, i.e. the reduced beacon trajectory. When a mobile beacon moves along the touring path, sending RF signals at every position, the sensors in ROI can work out their position with trilateration. Experimental results demonstrate that the localization method, based on the beacon reduced path, is efficient and has flexible accuracy.