针对现有协议组播树开销难以达到最低的不足,提出了一种新的基于自适应阈值参数的组播路由算法。在初始化阶段对目的节点进行最佳合并分区,初始化完成后则在当前源节点处计算对应各目的节点路径有效因子α的值,自适应地选择阈值参数P对α进行评估,根据评估结果选择当前源节点的下一跳转发节点,直到数据包发送到所有目的节点。仿真结果表明,该算法降低了构建组播树的通信开销,并具有较低的算法复杂度。
Considering the insufficiency of the multicast tree in the existing protocols whose communication overhead is relatively high, a new adaptive threshold parameter multicast routing algorithm is proposed. The destination nodes are merged and partitioned optimally in the initialization stage. After the initialization,the effective path factor a of the corresponding destination nodes is calculated on the current source nodes. An adaptive threshold parameter P is selected to evaluateda. The next transmitted one of the current source nodes is determined in virtue of the evaluating results until all the data packets were sent to the destinations. Simulation results show that the algorithm reduces the communication expenses of building multicast tree and has low computational complexity.