论文部分内容阅读
链路调度是无线网络研究中的一个根本问题。文章中,我们研究了无线网络中在SINR干扰模型下进行链路调度这一经典问题。我们主要关注单时隙调度问题,利用基于SINR的冲突图模型,来特征化网络中的链路和链路相互之间存在的干扰。基于SINR干扰模型下的冲突图,我们针对单时隙调度问题,利用构造图的极大独立集的方法,给出了基于冲突图的调度算法(CGS)并证明了它的可行性,优化了时间复杂度。实验结果表明,由算法CGS构造的调度集是可行的,且CGS实现了网络吞吐量的提高。
Link scheduling is a fundamental problem in wireless network research. In this paper, we study the classical problem of link scheduling in SINR interference model in wireless networks. We focus mainly on the single-slot scheduling problem, and use the SINR-based collision graph model to characterize the interference between the links and the links in the network. Based on the collision graph under the SINR interference model, we propose a collision graph-based scheduling algorithm (CGS) for the single-slot scheduling problem using the maximal independent set of construction graphs and prove its feasibility. time complexity. Experimental results show that the scheduling set constructed by algorithm CGS is feasible and CGS achieves the improvement of network throughput.