论文部分内容阅读
针对MIMO链路ad hoc网络中已有传输调度算法未充分利用MIMO空间复用能力的问题,提出了一种新的传输调度算法.该算法通过考虑MIMO的多流接收能力而有效地减小了调度帧长,通过合理安排节点分配顺序使得节点分配的数据流比较平均,同时,该算法通过允许节点发送多个数据流而高效利用了MIMO的空间复用能力.推导分析了传输调度算法的通过量和时延性能,结果表明,与已有算法相比,采用文中算法可以提高网络的通过量,减小网络的平均时延和最大时延.
Aiming at the problem that transmission scheduling algorithms in MIMO link ad hoc networks do not make full use of MIMO spatial multiplexing capability, a new transmission scheduling algorithm is proposed, which reduces the MIMO receiving capacity effectively Scheduling the frame length and making the data flow distributed by nodes more reasonable by reasonably arranging the node allocation order.At the same time, this algorithm makes efficient use of spatial multiplexing ability of MIMO by allowing nodes to send multiple data streams.The derivation and analysis of the transmission scheduling algorithm The results show that compared with the existing algorithms, the proposed algorithm can improve the throughput of the network and reduce the average delay and the maximum delay of the network.