论文部分内容阅读
文章基于SINR(Signal to Interference and Noise Ratio)干扰模型设计了最短链路调度算法L3S(Low Latency Link Scheduling),理论证明了L3S的正确性并给出了L3S的近似比。将网络区域划分为六边形的网格,如果通信链路位于相距较远的六边形中,他们可能会同时通信。为了简化SINR计算,L3S不考虑环境噪声。可以证明,当考虑环境噪声时,算法L3S得到的结果仍然是正确的,只需要提高链路的发送功率及SINR阈值β。
In this paper, based on SINR (Signal to Interference and Noise Ratio) interference model, the design of the shortest link scheduling algorithm L3S (Low Latency Link Scheduling) is theoretically proved that the L3S is correct and the approximate ratio of L3S is given. Dividing the network area into a hexagonal grid may allow simultaneous communication if the communication links are located in a distant hexagon. To simplify SINR calculations, L3S does not consider environmental noise. It can be proved that when considering the environmental noise, the result obtained by the algorithm L3S is still correct, only the transmission power of the link and the SINR threshold β need to be increased.