The advent of the Internet of Things has led to the development of distributed systems that require efficient and resilient runtime monitoring since they are often deployed in critical environments. Among the various monitoring techniques, runtime verification is a lightweight verification method that assesses the correctness of a running system concerning a formal specification. This paper investigates the optimization of aggregate monitors for properties expressed in Spatial Logic of Closure Spaces (SLCS), a formal logic designed to reason about spatial relationships between entities in a distributed system. We propose three different algorithms for the implementation of the somewhere operator, a key construct in SLCS, and evaluate their performance through a series of simulations, comparing their convergence time and computational load.