60-GHz网络并行传输中基于顶点多着色的时隙分配算法

Time Slot Allocation Algorithm Based on Vertex Multi-Coloring in Concurrent Transmission of 60-GHz Networks

针对60-GHz网络中现有并行传输算法的不足,首先分析了数据并行传输的充分条件,然后基于冲突矩阵来对网络中的顶点进行多着色,进而提出了一种基于顶点多着色的时隙分配算法.此外,考虑到两种类型的传输:组内传输(单跳)和组间传输(多跳),还提出一种基于距离的中继选择算法作为发射机和接收机之间进行直接通信还是中继通信的决策指标.在单跳和多跳场景下评估所提算法的性能,仿真结果表明,所提算法可显著提升网络吞吐量和单位时隙期间的数据流平均数量,相比于传统的Greedy算法和TDMA算法,性能提升幅度分别达到19%和12%.

Aiming at the shortcomings of the existing parallel transmission algorithms in 60-GHz networks, the suffi- cient conditions for the data parallel transmission are analyzed in this paper {irstly, and then the Vertexes of network are multi- color based on the conflict matrix, and further a time slot allocation algorithm based on vertex multi-coloring is proposed. In addition, we take into account two types of transmission： intra group transmission （single hop） and inter group transmission （multi hop）, arid a relay selection a[gorithm based on distance is proposed as a dee/sion index for direct communication or relay communication between transmitter and receiver. We evaluate the proposed algorithm in single-hop and multi-hop scenarios, the^simulation results show the proposed algorithm can significantly improve the network throughput and the average number of data flow during the period of time slot. Compared with the traditional Greedy algorithm and the TDMA algorithm, the per- formance improvement is achieved by 19 % and 12% respectively.