{'fraction_non_alphanumeric': 0.022613065326633167, 'fraction_numerical': 0.0041876046901172526, 'mean_word_length': 5.494565217391305, '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}}
Particle positioning system for ad-hoc wireless networks

Geometric routing, data collection, node deployment and node tracking in wireless ad-hoc networks often require a form of position-awareness by the nodes. There exist several location sensing algorithms that use network topology (connectivity) to infer spatial information. Most of these rely on either centralised computation method, several well known anchor nodes/points or expensive message exchange between the nodes. We propose a particle positioning system (PPS) that uses node connectivity information collected by routing protocol to map node positions and hence avoid some of the aforementioned restrictions. PPS mainly uses a combination of particle and spring physics to simulate a system that calculates increasingly accurate relative positions with increased topology knowledge. If combined with angle of arrival information (AoA) or anchor nodes, PPS can map its relative coordinates to the real world positions. In this paper we show that PPS generates positions accurate to between 6-33% of the node's transmission range, while competitive location estimate techniques manage a 20% accuracy only in best-case scenarios.