The Research On Multicast/Broadcast Services Selection And Scheduling Algorithm For Broadband Wireless Multimedia System

The next generation wireless communication networks based on IP core network has become a consensus, which makes the intercommunication of the various networks in the core network possible. With the various wireless access technologies such as IEEE802.16e, IEEE802.20 emerging, the development trend of integration is promoted. Based on this background, the National Information Technology Standardization Committee proposed to draft the standard of broadband wireless multimedia (BWM). The standard of BWM is aimed to formulate a set of standards to support three nets amalgamation. Due to the property of supporting three nets amalgamation, the service category becomes much richer. More and more services will be selected to transmit in the form of multicast/broadcast. So the research on multicast/broadcast for the next generation communication system is very important. This thesis focuses on SFN multicast/broadcast services selection algorithm, multicast/broadcast services scheduling algorithm, as well as the integrated scheduling algorithm.First of all, we introduce multicast/ broadcast of BWM system and study the SFN multicast/broadcast services selection algorithm. SFN multicast/broadcast is an efficient method to provide multicast/broadcast services in cellular networks, therefore we analyze the important characteristics of multicast/broadcast under single frequency network. According to the bandwidth and the total reception rate, we define the problem of SFN multicast/broadcast services selection as a KNAPSACK problem and present a greedy algorithm to solve it. Then S-BSM, SD-BSM and D-BSM are designed to reselect the SFN multicast/broadcast services to meet the needs of different systems.Secondly, we analyze the development trend of multicast/broadcast, and the energy consumption of MS. PPMS algorithm based on popularity and SPMS algorithm based on similarity are proposed for multicast/broadcast services scheduling in the scenario that each MS can receive more than one multicast/broadcast service simultaneously. Both the two algorithms can reduce the energy consumption compared with the round robin algorithm. Subsequently, we analyze application scenarios for each algorithm, based on the computational complexity and the channel occupation rate.Thirdly, we analyze the problem of the SSBIS algorithm under the scenario that each MS can receive several multicast/broadcast services simultaneously. Using the PPMS algorithm we proposed, we design a new integrated scheduling algorithm for this scenario. The simulation results show that the new algorithm is more efficient than SSBIS when MS number reaches a certain value.At last, the conclusion is made and future work is proposed.