1. Utility-Based Resource Allocation for Layer-Encoded IPTV Multicast Service in Wireless Relay Networks Shi-Sheng Sun, Yi-Chun Chen, Wanjiun Liao Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan Graduate Institute of Communication Engineering, National Taiwan University, Taipei, Taiwan IEEE ICC 2011

2. Introduction System model Problem formulation Algorithm Simulations Conclusions 2

3. IPTV multicasting is an important service for residential users in WiMAX. 3 MS 1 MS 2 MS 3 BS

4. According to the audiovisual spec., the original video can be converted into different files with different resolution. 4 Data Resolution Req. Base Layer Enhancement Layer 1 Base Layer Enhancement Layers 1 Base Layer Enhancement Layers 2 Enhancement Layers 3

5. The deployment of relay stations is considered as a cost-effective solution to improve the network throughput extend cell coverage 5 BS MS 1 RS MS 2 RS MS 2

6. 6 RS MS 1 MS 2 BS A: 5 ts E: 16 ts D: 10 ts C: 9 ts B: 7 ts multicast service is more complicated than unicast services. forwarding strategy should be considered when allocating resources for multicast services. Unicast : Multicast : MS 1 : E (16) MS 2 : D (10) > 26 D(10)+ B(7) : 17 E(16) : 16 A(5) + C(9) : 14

7. Assume the system operates under OFDMA transmission scheme. the system components in a cell include one base station (BS) multiple fixed relay stations (RSs) N mobile stations (MSs) BS 7 MS 2 RS MS 1  Relay link : BS-RS / RS-RS  Access link : BS-MS / RS-MS  Relay link : BS-RS / RS-RS  Access link : BS-MS / RS-MS

8. Assume the system operates under OFDMA transmission scheme. the system components in a cell include one base station (BS) multiple fixed relay stations (RSs) N mobile stations (MSs) 8  Spatial reuse (i)RSs are divided into R non-interfering groups. (ii)Each non-interfering group consists of RSs that do not interfere with each other. BS RS MS

9. N users R non-interfering groups of RSs in the single cell system P : the number of video programs L : the number of layers in a program T : the total resource in terms of timeslots in a frame burst profile (bp) : B kinds of burst profiles (i.e.,modulation), bp1 > bp2 >……> bp B 9

10. u p,l : the amount of utility gained when a user receives the l-th layer of program p E = [l, p, r] : the utility gained for receiving layer l of program p using non-interfering group r U E : total utility 10 LayerUtility (Program I)Utility (Program II) 10.800.55 20.150.30 30.050.15 u 1,l u 1,2 u 1,3 u 2,l u 2,2 u 2,3 E = [l, p, r] = [2,1,r] = 0.80 + 0.15 = 0.95 U E = 0.95 * 13 users = 12.35

11. : the number of timeslots allocated to transmit the l-th layer of program p from non-interfering group r in relay link. : the number of timeslots allocated to transmit the l-th layer of program p from non-interfering group r in access link. : the number of timeslots required to transmit the l-th layer of program p from RS s- 1 to RS s in relay link. : the number of timeslots required to transmit the l-th layer of program p from RS s to user n in access link. 11

12. 12

13. Find the allocation of timeslots to different transmitting entities such that the total utility over all users is maximized. 13 Subject to s s- 1 …

14. MURM S Maximum Utility resource allocation for Relayed Multicast Services (MU-RMS) 14 Step1 Find E max Step1 Find E max Step2 Allocate the additional timeslots Step2 Allocate the additional timeslots Step3 Removes & updates Step3 Removes & updates

15. 15 Step1 Find E max Step1 Find E max BS RS MS 3 MS 2 MS 4 bp1 bp2 bp3 RS MS 1 E = [l, p, r] E 1 = [1, p, r] { MS 1, MS 2, MS 3, MS 4 } E 2 = [2, p, r] { MS 1, MS 2, MS 3 } E 3 = [3, p, r] { MS 1, MS 3 }

16. 16 Step1 Find E max Step1 Find E max Layer Utility (Program) 10.80 20.15 30.05 bpLayer 1Layer 2Layer 3 MS 1 bp1 1073 bp2 15106 bp3 251510 MS 2 bp1 --- bp2 --- bp3 2515- MS 3 bp1 --- bp2 15106 bp3 251510 MS 4 bp1 --- bp2 15-- bp3 25-- (timeslots)

17. T = 35 (total timeslots in a frame) 17 Step1 Find E max Step1 Find E max Layer 1 Layer 1+2 Layer 1+2+3 X > 35

18. E max = E 1,2 = 0.16 18 Step2 Allocate the additional timeslots Step2 Allocate the additional timeslots Allocate 15 timeslots ( Layer 1 : MS 1, MS 3, MS 4 )

19. 19 Step3 Removes & updates Step3 Removes & updates E = [l, p, r] E 1 = [1, p, r] { MS 1, MS 2, MS 3, MS 4 } E 2 = [2, p, r] { MS 1, MS 2, MS 3 } E 3 = [3, p, r] { MS 1, MS 3 } E = [l, p, r] E 1 = [1, p, r] { MS 2 } E 2 = [2, p, r] { MS 1, MS 2, MS 3 } E 3 = [3, p, r] { MS 1, MS 3 }

20. T = 35-15 = 20 (total timeslots in a frame) 20 Step1 Find E max Step1 Find E max Layer 1 Layer 2 Layer 2+3 X > 20... E = [l, p, r]

21. 21

22. 22

23. 23

24. 24

25. Propose a scheme that can allocate the limited resources effectively for layer-encoded IPTV such that the total utility over all users is maximized. The simulation results show that our scheme can achieve high total utility. 25

26. Thanks for your attention !!!