Los puntos clave no están disponibles para este artículo en este momento.
We consider wireless networks with a special type of spectral allocation, where the only constraint is that a node cannot transmit to more than one receiver at a time and cannot receive more than one transmission at a time. We introduce a scheduling algorithm called regulated maximal matching which is fully distributed and guarantees a throughput that is at least half of the throughput achievable by a centralized algorithm.
Wu et al. (Wed,) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: