User Assignment with Distributed Large Intelligent Surface (LIS) Systems
In this paper, we consider a wireless communication system where a large intelligent surface (LIS) is deployed comprising a number of small and distributed LIS-Units. Each LIS-Unit has a separate signal process unit (SPU) and is connected to a central process unit (CPU) that coordinates the behavior...
Gespeichert in:
Hauptverfasser: | , , , |
---|---|
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | In this paper, we consider a wireless communication system where a large
intelligent surface (LIS) is deployed comprising a number of small and
distributed LIS-Units. Each LIS-Unit has a separate signal process unit (SPU)
and is connected to a central process unit (CPU) that coordinates the behaviors
of all the LIS-Units. With such a LIS system, we consider the user assignments
both for sum-rate and minimal user-rate maximizations. That is, assuming $M$
LIS-Units deployed in the LIS system, the objective is to select $K$
($K\!\leq\!M$) best LIS-Units to serve $K$ autonomous users simultaneously.
Based on the nice property of effective inter-user interference suppression of
the LIS-Units, the optimal user assignments can be effectively found through
classical linear assignment problems (LAPs) defined on a bipartite graph. To be
specific, the optimal user assignment for sum-rate and user-rate maximizations
can be solved by linear sum assignment problem (LSAP) and linear bottleneck
assignment problem (LBAP), respectively. The elements of the cost matrix are
constructed based on the received signal strength (RSS) measured at each of the
$M$ LIS-Units for all the $K$ users. Numerical results show that, the proposed
user assignments are close to optimal user assignments both under line-of-sight
(LoS) and scattering environments. |
---|---|
DOI: | 10.48550/arxiv.1709.01696 |