Capacity-Maximizing Dynamic User Association in Double RIS-Aided Broadcast Networks

TL;DR

This paper presents an information-theoretic framework for dynamic user association in double RIS-aided broadcast networks, significantly improving capacity through an adaptive protocol and establishing new capacity bounds.

Contribution

It introduces a novel dynamic RIS-user association scheme with an opportunistic protocol, enhancing network capacity beyond static methods and deriving new capacity bounds.

Findings

Dynamic RIS-user association outperforms static schemes.

New outer-bounds on network capacity are established.

Achievability of the bounds is demonstrated.

Abstract

We introduce an information-theoretic framework to dynamically pair up different reconfigurable intelligent surfaces (RISs) with wireless users with goal of maximizing the fundamental network capacity. We focus on a double RIS-aided broadcast packet network with two users. We show using a dynamic RIS-user association and an opportunistic protocol, the network capacity could be significantly enhanced and superior to other benchmarks with static associations. The results include new outer-bounds on network capacity and their achievability. We discuss the optimal RIS-user association.