A Cooperative Multicast Scheduling Scheme for Multicast Services in IEEE Networks Fen Hou, Pin-Han Ho, and Lin X Cai Dept. of Electrical and Computer Engineering, Waterloo University IEEE Transactions on Wireless Communications, Vol. 8, No 3, March, 2009
2 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Agenda Introduction Cooperative Multicast Scheduling Scheme Performance Analysis Simulation Results Conclusions
3 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Introduction Multicast communication An efficient mechanism for one-to-many transmissions over wireless channel Users’ requests are the same Multicast group (MGroup) Applications Emergency alert Internet Protocol Television (IPTV) Mobile TV
4 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Introduction -Motivation MGroups Lag !!
5 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Introduction -Motivation Scheduling mechanism Fairness consideration Round-robin for each Mgroup Ex. CDMA xEx-Do networks : kbps Robust consideration Minimal supported rate of all Mgroup members Group member with the worst channel condition becomes bottleneck Inefficient to most users in good channel conditions
6 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Introduction -Goal Cooperative multicast communications Achieve high throughput for all group members Maintain good fairness performance
7 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Cooperative Multicast Scheduling Scheme Multicast group selection Decide which groups should be served at each frame Cooperative multicast transmission Decide how to multicast data to the selected group members
8 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Multicast group selection Random MGroup Selection BS randomly selects an MGroup for service with a pre- defined probability The same probability for each MGroup Service differentiation
9 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Multicast group selection Channel-aware MGroup Selection Normalized relative channel condition X i for MGroups Normalized relative channel condition of MGroup i Total number of group members in MGroup i Instantaneous SNR of the j-th group members in MGroup i Avg. SNR of the j-th group members in MGroup i The set of all group members in MGroup i
10 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Cooperative Multicast Transmission Dilemma 64-QAM 16-QAM QPSK 64-QAM 16-QAM QPSK 64-QAMQPSK Too fast !! Oh ! Cool! Too Slow !! Oh ! Cool!
11 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Cooperative Multicast Transmission Two-phase transmission scheme Downlink Burst # i Phase 1 ( ) 64-QAM 16-QAM
12 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Cooperative Multicast Transmission Advantages Higher throughput than conservative rate Group members with good channel conditions Group members with bad channel conditions Extensions m-phase transmissions Larger m, lager computation and control overhead
13 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Performance Analysis Service probability of each MGroup Throughput of each user Throughput of each MGroup Throughput of the whole networks
14 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Service Probability of Each MGroup Definition The probability than an MGroup is selected for service in a MAC frame when the system is stable
15 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Throughput of each MGroup Given and, the probability that a group member in MGroup i, SS i,j can receive the data in Phase 1 (Shannon Capacity) The avg. received power for SS i,j from BS
16 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Throughput of each MGroup Given and, the probability that a group member in MGroup i, the set of all possible for SSi,j Example: Suppose MGroup i contains SS i,1, SS i,2, SS i,3, SS i,4. The possible group members that can be transmitter in phase 2 are SS i,2, SS i,3, SS i,4.The number of possible are SS i,2 SS i,3 SS i,4 SS i,2 SS i,3 SS i,2 SS i,4 SS i,3 SS i,4 SS i,2 SS i,3 SS i,4
17 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Throughput of each MGroup Given and, the probability that a group member in MGroup i, SS i,j cannot receive the data in Phase 1, but can receive the data in Phase 2
18 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Throughput for SS i,j Throughput of each MGroup Throughput of each MGroup Phase 1 Successful Phase 1 Failure, Phase 2 Successful
19 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Simulation Results
20 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Simulation Results
21 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Simulation Results
22 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Simulation Results
23 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Simulation Results
24 Speaker : Chi-Tao Chiang ( 蔣季陶 ) Meeting 報告簡報 Conclusion Cooperative multicast scheduling scheme for multimedia services in IEEE networks Simulation results shows that Analysis and the proposed scheme are similar in terms of Throughput Service probability Higher throughput