# Distributed Antenna Selection for Massive MIMO using Reversing Petri Nets

## TL;DR

This paper introduces a novel distributed antenna selection algorithm for Massive MIMO systems based on Reversing Petri Nets, offering reduced complexity, fault tolerance, and robustness with imperfect channel information.

## Contribution

It presents a new distributed antenna selection algorithm using Reversing Petri Nets, outperforming existing solutions in efficiency and fault tolerance.

## Key findings

- Performs well with imperfect channel state information
- Requires few simple computations per node
- Converges quickly to a steady state

## Abstract

Distributed antenna selection for Distributed Massive MIMO (Multiple Input Multiple Output) communication systems reduces computational complexity compared to centralised approaches, and provides high fault tolerance while retaining diversity and spatial multiplexity. We propose a novel distributed algorithm for antenna selection and show its advantage over existing centralised and distributed solutions. The proposed algorithm is shown to perform well with imperfect channel state information, and to execute a small number of simple computational operations per node, converging fast to a steady state. We base it on Reversing Petri Nets, a variant of Petri nets inspired by reversible computation, capable of both forward and backward execution while obeying conservation laws.