论文部分内容阅读
提出干扰优化与覆盖优先的组播路由机制IOCFMR.组播路由问题实质为组播树的构建问题,IOCFMR首先在构建组播树的过程中每一步选择干扰最小的最短路径加入树中,建立干扰优化的组播树;然后,针对接收端覆盖用户数量的不同,定义接收端信道分配优先级,提出了覆盖优先的信道分配算法,该算法根据组播树中节点优先级,选取对组播树干扰最小的信道作为节点发送信道,干扰度量考虑了隐节点问题以及干扰影响的用户数量.在形成信道分配的初始方案后,该算法对其进行再一次优化以消除在逐步分配信道过程中未能发现的干扰问题.仿真实验表明本文提出的组播路由机制在性能上好于M4和MCM算法.为评估覆盖优先的意义,定义了用户满意度指标用来描述接收端覆盖的用户数量与性能的关系,实验表明,与M4和MCM算法相比,用户满意度分别提高29.8%和42.7%,本文算法在用户覆盖优先方面达到了较好的效果.
IOCFMR, which is the multicast routing mechanism of interference optimization and coverage priority, is put forward.Modern multicast routing problem is essentially the construction of multicast tree.IOCFMR first chooses the shortest path with the least interference at each step in the process of constructing multicast tree, Then, aiming at the difference of the number of users covered by receiver, the channel assignment priority of receiver is defined and the channel assignment algorithm with overlay priority is proposed. According to the priority of nodes in multicast tree, The channel with the least interference is the node that sends the channel, and the interference metric takes into account the hidden node problem and the number of users affected by the interference. After forming the initial scheme of channel allocation, the algorithm optimizes it once again to eliminate the failure to allocate channels gradually The simulation results show that the multicast routing mechanism proposed in this paper is better than the M4 and MCM algorithms in performance.For the purpose of assessing the priority of coverage, the definition of user satisfaction index is used to describe the number and performance of users covered by the receiver The results show that user satisfaction is improved by 29.8% and 42.7% respectively compared with that of M4 and MCM algorithm. In this paper, Priority areas to achieve good results.