{'fraction_non_alphanumeric': 0.016867469879518072, 'fraction_numerical': 0.0, 'mean_word_length': 5.2481203007518795, '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}}
Analysis of random radar networks

We introduce the notion of random radar networks to analyze the effect of geometry in distributed radar systems. We first analyze unistatic systems with a single receiver selected at random from the available group. We approximate the distribution of the individual signal-to-interference-plus-noise (SINR) at the sensors and find the corresponding mean and variance. We then analyze multistatic systems and provide an upper bound on performance. We show that in order to exploit the spatial diversity available to the system, the sensors should be large enough to effectively cancel interfering sources. We underline a design tradeoff between spatial diversity and interference cancellation for multistatic radar networks. We finally provide the results of simulations to validate our analysis.