We use numerical simulations to evaluate the performance of the proposed location-dependent scheme. We consider a bounded environment divided into \(S = 100\)  states, where the channel at state \(s \in \mathcal {S}\)  is modelled as \({\mathbf {h}}_{s} \sim \mathbb {CN}(\mathbf {0}, \sigma _s{\mathbf {I}})\) . For ease of investigation, we ignore pathloss and assume a transmitter with \(L=2\)  antennas provides uniform channel quality throughout the whole environment except for \(Q\)  states which are highly attenuated (e.g., located behind obstacles like walls, etc. see Fig. REF ). For a user \(k\)  located in state \(s\)  during the delivery phase, we assume \({\mathbf {h}}_k = {\mathbf {h}}(s)\) . We set \(\sigma _s=1\)  for non-attenuated states and \(\sigma _s=\xi \)  for attenuated ones. At each time-slot, users \(k=1,\ldots , K\)  are placed in any state \(s=1,\ldots , S\)  with uniform probability. For comparison, we use the symmetric rate, defined as \(\frac{K}{T_T}\)  where \(T_T\)  is the total required time to serve all the users averaged over channel realizations. In all simulations, we use optimized weighted max-min beamformers obtained by solving (REF ).
The proposed scheme is compared with three benchmark methods. Unicast uniform refers to uniform cache allocation followed by unicast delivery using spatial multiplexing gain only (i.e., serving \(L\)  users during each transmission), unicast non-uniform represents location-dependent cache placement followed by unicast delivery, and MN-uniform refers to uniform cache allocation and conventional CC delivery of [1]}.
