Scheduling for maximum capacity in SDMA/TDMA networks

This paper presents a general information-theoretic framework for the problem of spatial and temporal packet scheduling in SDMA/TDMA systems. The said problem is described as a partition of a given set of users and SDMA and TDMA are applied within each subset and among difference subsets, respectively. The capacity of SDMA/TDMA systems is derived as a function of the partition scheme. Optimization of the packet scheduling can then be performed by maximizing the capacity. The paper also presents a graph-theoretical model for the optimization problem. It shows that that the optimization is to find a proper independent dominating set in an associated graph.