{'fraction_non_alphanumeric': 0.015961138098542677, 'fraction_numerical': 0.0013879250520471894, 'mean_word_length': 5.296943231441048, '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}}
ReNLoc: An anchor-free localization algorithm for indirect ranging

Localization has been an important research issue in ubiquitous computing and wireless sensor networks (WSNs). From location-based services to autonomous mobile devices, location is prevalent in a wide range of applications. Localization methods for a mobile node vary from using GPS to localizing with respect to beacons with known locations, or using sensors like accelerometers and compasses. All of these solutions either require additional sensors in a node that reduce its battery life or require some kind of infrastructure and access to a database of anchor locations. Additionally, most solutions are for networks where nodes can communicate indiscriminately with each other. In this paper we introduce ReNLoc, a minimalistic anchor-free multilateration algorithm for 2D space (extendable to 3D space) with a centralized and a distributed version made for networks where the mobile nodes can only get range measurements to nodes with an unknown but fixed position that we call base nodes. The main assumption is that there is a minimum of three base nodes. ReNLoc takes advantage of geometric constraints that arise from the range measurements and represents them as sets on which we perform minimization over known geometric properties. We show that ReNLoc outperforms the commonly used multidimensional scaling (MDS) algorithm in a purely indirect ranging setup.