Abstract： In this paper, we propose a mecha- nism for multicast data transmission in IEEE 802.16 mesh networks aimed at increasing the throughput by incorporating mini-slot spatial reuse. The proposed mechanism inclu...Abstract： In this paper, we propose a mecha- nism for multicast data transmission in IEEE 802.16 mesh networks aimed at increasing the throughput by incorporating mini-slot spatial reuse. The proposed mechanism includes two novel algorithms： a source-based multicast tree topology construction algorithm followed by an interference-aware multieast scheduling algorithm. The proposed multicast interfer- ence-aware scheduling algorithm can be ap- plied to both source-based and rendez- vous-based multicast tree topologies. Results of our simulation study show that in compari- son to the mechanism used for the IEEE 802.16＇s standard, the proposed multicast tree generation algorithm reduces the number of consumed mini-slots by 64% on average. Moreover, using the proposed interfer- ence-aware scheduling algorithm decreases the number of required mini-slots by a further 22% on average. Therefore, the proposed mul- ticast scheduling mechanism shows a higher throughput than the previous approaches and it is more scalable with respect to increasing the number of multicast groups as well as in- creasing the number of members inside each multicast group.展开更多
文摘Abstract： In this paper, we propose a mecha- nism for multicast data transmission in IEEE 802.16 mesh networks aimed at increasing the throughput by incorporating mini-slot spatial reuse. The proposed mechanism includes two novel algorithms： a source-based multicast tree topology construction algorithm followed by an interference-aware multieast scheduling algorithm. The proposed multicast interfer- ence-aware scheduling algorithm can be ap- plied to both source-based and rendez- vous-based multicast tree topologies. Results of our simulation study show that in compari- son to the mechanism used for the IEEE 802.16＇s standard, the proposed multicast tree generation algorithm reduces the number of consumed mini-slots by 64% on average. Moreover, using the proposed interfer- ence-aware scheduling algorithm decreases the number of required mini-slots by a further 22% on average. Therefore, the proposed mul- ticast scheduling mechanism shows a higher throughput than the previous approaches and it is more scalable with respect to increasing the number of multicast groups as well as in- creasing the number of members inside each multicast group.
