{'fraction_non_alphanumeric': 0.01714898177920686, 'fraction_numerical': 0.0010718113612004287, 'mean_word_length': 5.268456375838926, '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}}
MRC implementation of super MDS for efficient 2D localization

We address the problem of localization using distance and angle information heterogeneously with the aim to create a robust algorithm with high accuracy and reduced complexity. In this paper, we propose a new localization algorithm, namely Maximum Ration Combining SMDS (MRC-SMDS) based on the fundamentals of two state of the art algorithms, namely Super MDS (SMDS) and Cholesky MDS (CMDS). The complex representation of the coordinates enables us to formulate the localization problem into a linear system of equations with a low complexity least square solution. The new algorithm shows to outperform the two state of the art in terms of localization accuracy and computation speed both under theoretical and practical scenarios. Therefore MRC-SMDS is shown to be a reliable candidate for localization specially for power constraint large networks with high mobility.