{'fraction_non_alphanumeric': 0.018452803406671398, 'fraction_numerical': 0.0, 'mean_word_length': 4.708502024291498, '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}}
Neighbors and relative location identification using RSSI in a dense wireless sensor network

Wireless Sensor Networks (WSNs) are made of a large amount of small devices that are able to sense changes in the environment, and communicate these changes throughout the network. An example of such network is a photo voltaic (PV) power plant, where there is a sensor connected to each solar panel. Because such a network covers a large area, the number of sensors can be very large. The task of each sensor is to sense the output of the panel which is then sent to a central node for processing. As the network grows, it becomes impractical and even impossible to configure all these nodes manually. And so, the use of self-organization and auto-configuration algorithms becomes essential. In this paper, two algorithms are proposed that can be used to allow each node in the network to automatically identify its closest neighbors as well as its relative location in the network using the value of the Received Signal Strength indicator (RSSI) of the messages sent back and forth during the setup phase. Results show that the error in neighbor identification decreases as we increase the number of RSSI values used for decision making. Additionally, the number of nodes in the network affects the setup error greatly. However, the value of the error is still acceptable even for high number of simulated columns.