Toward an Extremal Network Theory—Robust GDoF Gain of Transmitter Cooperation Over TIN

摘要: Significant progress has been made recently in Generalized Degrees of Freedom (GDoF) characterizations wireless interference channels (IC) and broadcast (BC) under the assumption finite precision channel state information at transmitters (CSIT), especially for smaller or highly symmetric network settings. A critical barrier extending these results to larger asymmetric networks is inherent combinatorial complexity such networks. Motivated by other fields as extremal combinatorics graph theory, we explore possibility an i.e., a study within particular regimes interest. As our test application, GDoF benefits transmitter cooperation K user IC over simple scheme power control treating Gaussian noise (TIN) three interest – TIN regime identified Geng et al. where was shown be optimal channel, CTIN Yi Caire region achievable c onvex without time-sharing, SLS Davoodi Jafar layered superposition (SLS) MISO BC, albeit only $ {K}\leq 3$ . The includes regime, regime. first result, show that CSIT, throughout Furthermore, appealing theory obtain following results. In well gain from bounded regardless number users. fact, exactly factor 3/2 $2-1/{K}$ arbitrary users ${K}>1$ However, $\Theta (\log _{2}({K}))$ , it scales logarithmically with