基于关联矩阵的CSMA调度复杂性分析
Complexity Analysis of CSMA Scheduling via Dependencies Matrix
摘要:
CSMA算法的复杂性已被转化为依赖矩阵的范数性质。最大吞吐量优化是重新制定的配方中包括依赖矩阵。已经表明,对于具有最小顶点覆盖大小$\mathcal{C}(\mathcal{G})=\log n$的干扰图$\mathcal{G}$,其中$n$是链路的数量,链路的最优策略是以概率1发送,即服务速率不可知的方法。几个数值分析已经进行,以说明干扰图,传输策略和到达率的依赖矩阵的效果。
英文摘要:
The complexity of a CSMA algorithm has been translated to the norm properties of a dependencies matrix. The maximum throughput optimization is reformulated by including the dependencies matrix in the formulations. It has been shown that for the interference graphs $\mathcal{G}$ that have minimum vertex cover size $\mathcal{C}(\mathcal{G})=\log n$ where $n$ is the number of the links, the optimal strategy of the links is to transmit with the probability 1, i.e a service-rate agnostic approach. Several numerical analyses have been conducted in order to illustrate the effect of the interference graph, transmission strategy and arrival rate on the dependencies matrix.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。