Cooperative Multicast Scheduling with Random Network Coding in WiMAX - - PowerPoint PPT Presentation

▶
cooperative multicast scheduling with random network
SMART_READER_LITE
LIVE PREVIEW

Cooperative Multicast Scheduling with Random Network Coding in WiMAX - - PowerPoint PPT Presentation

Dec 28, 2022 317 likes •859 views

Cooperative Multicast Scheduling with Random Network Coding in WiMAX Jin Jin, Baochun Li, Department of Electrical Computer Engineering University of Toronto WiMAX MBS IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in

slide-1
SLIDE 1

Cooperative Multicast Scheduling with Random Network Coding in WiMAX

Jin Jin, Baochun Li, Department of Electrical Computer Engineering University of Toronto

slide-2
SLIDE 2

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

WiMAX MBS

slide-3
SLIDE 3

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

WiMAX MBS

WiMAX MBS

slide-4
SLIDE 4

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

WiMAX MBS

WiMAX MBS

next generation infrastructure to broadcast data

slide-5
SLIDE 5

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

WiMAX MBS

WiMAX MBS

next generation infrastructure to broadcast data IEEE 802.11j/802.11m

slide-6
SLIDE 6

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

WiMAX MBS

WiMAX MBS

next generation infrastructure to broadcast data IEEE 802.11j/802.11m

Problem with current multicast scheduling

slide-7
SLIDE 7

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

WiMAX MBS

WiMAX MBS

next generation infrastructure to broadcast data IEEE 802.11j/802.11m

Problem with current multicast scheduling

no ARQ & HARQ

slide-8
SLIDE 8

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

WiMAX MBS

WiMAX MBS

next generation infrastructure to broadcast data IEEE 802.11j/802.11m

Problem with current multicast scheduling

no ARQ & HARQ single channel, single path

slide-9
SLIDE 9

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

WiMAX MBS

WiMAX MBS

next generation infrastructure to broadcast data IEEE 802.11j/802.11m

Problem with current multicast scheduling

no ARQ & HARQ single channel, single path under-utilize spectrum due to user/channel diversity

slide-10
SLIDE 10

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

WiMAX MBS

WiMAX MBS

next generation infrastructure to broadcast data IEEE 802.11j/802.11m

Problem with current multicast scheduling

no ARQ & HARQ single channel, single path under-utilize spectrum due to user/channel diversity

How to properly select a multicast rate?

slide-11
SLIDE 11

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Observation

slide-12
SLIDE 12

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Observation

Users can help each other (cooperation)

aim to exploit diversity and cooperative gain cooperative communication is not well studies in MBS

slide-13
SLIDE 13

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Observation

Users can help each other (cooperation)

aim to exploit diversity and cooperative gain cooperative communication is not well studies in MBS

Adoption of OFDMA in WiMAX concurrent transmissions without interference

channel diversity gain multi-path, multi-hop transmission

slide-14
SLIDE 14

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Observation

Users can help each other (cooperation)

aim to exploit diversity and cooperative gain cooperative communication is not well studies in MBS

Adoption of OFDMA in WiMAX concurrent transmissions without interference

channel diversity gain multi-path, multi-hop transmission

Can we take advantage of all potential benefits and design a multicast scheduling protocol to tightly integate to WiMAX MBS?

slide-15
SLIDE 15

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Multicast Scheduling

Study from a new perspective

Multiple hops, multiple paths, multiple channels Network Coding to mitigate the overhead

MS1 MS2 MS3 MS5 MS6 MS7 BS MS4

0.8 0.5 1 0.9 1 1 0.7 1

MS1 MS2 MS5 MS6 MS7 MS4 MS3 BS

1 1

Conventional Multicast Scheme Cooperative Multicast Scheme

slide-16
SLIDE 16

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Any Challenges?

slide-17
SLIDE 17

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Any Challenges?

How to dynamically assign relays?

slide-18
SLIDE 18

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Any Challenges?

How to dynamically assign relays? How to apply random network coding?

slide-19
SLIDE 19

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Any Challenges?

How to dynamically assign relays? How to apply random network coding? How to allocate channels?

slide-20
SLIDE 20

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Any Challenges?

How to dynamically assign relays? How to apply random network coding? How to allocate channels? How to allocate power?

slide-21
SLIDE 21

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Any Challenges?

How to dynamically assign relays? How to apply random network coding? How to allocate channels? How to allocate power? How to tightly integrate with WiMAX protocol?

slide-22
SLIDE 22

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Cooperative Multicast Scheduling with Random Network Coding

Our Contribution :

slide-23
SLIDE 23

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Optimization

Greedy Optimization Frame Work

time-slotted WiMAX MBS

  • ptimal multicast rate

efficient cooperative communication schedule proportional fairness criteria

max

R(t)

  • i∈ζ

Ui(t) ri(t)

Subject to:

Ui(t) = Sm,i(t)Rm(t) +

  • g∈ζ

Rgi(t) 0 ≤ Rgi(t) ≤ Cgi(t) Rgi(t) ≤ max{0, Bg(t) − Bi(t) T }

  • g∈ζ

Rgi(t) ≤

t−1

  • h=1

R(h) − Bi(t) T + (1 − Sm,i(t))Rm(t)

slide-24
SLIDE 24

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Protocol Design

slide-25
SLIDE 25

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Protocol Design

BS: encode, broadcast ratelessly, use optimal rate

slide-26
SLIDE 26

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Protocol Design

BS: encode, broadcast ratelessly, use optimal rate RS: recode in the middle, random push

slide-27
SLIDE 27

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Protocol Design

BS: encode, broadcast ratelessly, use optimal rate RS: recode in the middle, random push Receiver: collect coded blocks, decode

slide-28
SLIDE 28

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Protocol Design

BS: encode, broadcast ratelessly, use optimal rate RS: recode in the middle, random push Receiver: collect coded blocks, decode

Is it helpful?

slide-29
SLIDE 29

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Protocol Design

BS: encode, broadcast ratelessly, use optimal rate RS: recode in the middle, random push Receiver: collect coded blocks, decode

Is it helpful?

10 20 30 40 50 150 200 250 300 350 Number of MSs Average Throughputs (Kbps) COOP-NC COOP OPT-M OPT

slide-30
SLIDE 30

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Protocol Design

BS: encode, broadcast ratelessly, use optimal rate RS: recode in the middle, random push Receiver: collect coded blocks, decode

Is it helpful?

10 20 30 40 50 150 200 250 300 350 Number of MSs Average Throughputs (Kbps) COOP-NC COOP OPT-M OPT

Throughput vs. Number of MSs

slide-31
SLIDE 31

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Protocol Design

BS: encode, broadcast ratelessly, use optimal rate RS: recode in the middle, random push Receiver: collect coded blocks, decode

Is it helpful?

10 20 30 40 50 150 200 250 300 350 Number of MSs Average Throughputs (Kbps) COOP-NC COOP OPT-M OPT 10 20 30 40 50 200 250 300 350 400 Number of MSs Multicast Rate (Kbps) COOP-NC OPT-M OPT

Throughput vs. Number of MSs

slide-32
SLIDE 32

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Protocol Design

BS: encode, broadcast ratelessly, use optimal rate RS: recode in the middle, random push Receiver: collect coded blocks, decode

Is it helpful?

10 20 30 40 50 150 200 250 300 350 Number of MSs Average Throughputs (Kbps) COOP-NC COOP OPT-M OPT 10 20 30 40 50 200 250 300 350 400 Number of MSs Multicast Rate (Kbps) COOP-NC OPT-M OPT

Throughput vs. Number of MSs Multicast Rate vs. Number of MSs

slide-33
SLIDE 33

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Limited Bandwidth Resources

slide-34
SLIDE 34

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Limited Bandwidth Resources

  • g∈ζ
  • i∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ

slide-35
SLIDE 35

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Limited Bandwidth Resources

  • g∈ζ
  • i∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ

Ui = Sm,iRm +

  • g∈ζ
  • n∈χ

K(n)

gi R(n) gi

slide-36
SLIDE 36

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Limited Bandwidth Resources

  • g∈ζ
  • i∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ

Ui = Sm,iRm +

  • g∈ζ
  • n∈χ

K(n)

gi R(n) gi

Solve it by maximum weighted bipartite matching

slide-37
SLIDE 37

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Limited Bandwidth Resources

  • g∈ζ
  • i∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ

Ui = Sm,iRm +

  • g∈ζ
  • n∈χ

K(n)

gi R(n) gi

Exploit spectrum reuse Solve it by maximum weighted bipartite matching

slide-38
SLIDE 38

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Limited Bandwidth Resources

  • g∈ζ
  • i∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ

Ui = Sm,iRm +

  • g∈ζ
  • n∈χ

K(n)

gi R(n) gi

Exploit spectrum reuse

Iki = 1 If node i is in interference zone of node k Otherwise

Solve it by maximum weighted bipartite matching

slide-39
SLIDE 39

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Limited Bandwidth Resources

  • g∈ζ
  • i∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ

Ui = Sm,iRm +

  • g∈ζ
  • n∈χ

K(n)

gi R(n) gi

Exploit spectrum reuse

Iki = 1 If node i is in interference zone of node k Otherwise

  • i∈ζ,i=k

Iki

  • g∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ, ∀k ∈ ζ

Solve it by maximum weighted bipartite matching

slide-40
SLIDE 40

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Limited Bandwidth Resources

  • g∈ζ
  • i∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ

Ui = Sm,iRm +

  • g∈ζ
  • n∈χ

K(n)

gi R(n) gi

Exploit spectrum reuse

Iki = 1 If node i is in interference zone of node k Otherwise

  • i∈ζ,i=k

Iki

  • g∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ, ∀k ∈ ζ

  • g∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ, ∀i ∈ ζ

Solve it by maximum weighted bipartite matching

slide-41
SLIDE 41

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Limited Bandwidth Resources

  • g∈ζ
  • i∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ

Ui = Sm,iRm +

  • g∈ζ
  • n∈χ

K(n)

gi R(n) gi

Exploit spectrum reuse

Iki = 1 If node i is in interference zone of node k Otherwise

  • i∈ζ,i=k

Iki

  • g∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ, ∀k ∈ ζ

  • g∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ, ∀i ∈ ζ

Solve it by maximum weighted bipartite matching

(1 − (1 − 1 G)G)

slide-42
SLIDE 42

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Limited Bandwidth Resources

  • g∈ζ
  • i∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ

Ui = Sm,iRm +

  • g∈ζ
  • n∈χ

K(n)

gi R(n) gi

Solve it by randomized rounding, approximation guarantee Exploit spectrum reuse

Iki = 1 If node i is in interference zone of node k Otherwise

  • i∈ζ,i=k

Iki

  • g∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ, ∀k ∈ ζ

  • g∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ, ∀i ∈ ζ

Solve it by maximum weighted bipartite matching

(1 − (1 − 1 G)G)

slide-43
SLIDE 43

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Limited Bandwidth Resources

  • g∈ζ
  • i∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ

Ui = Sm,iRm +

  • g∈ζ
  • n∈χ

K(n)

gi R(n) gi

Solve it by randomized rounding, approximation guarantee Exploit spectrum reuse

Iki = 1 If node i is in interference zone of node k Otherwise

  • i∈ζ,i=k

Iki

  • g∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ, ∀k ∈ ζ

  • g∈ζ

K(n)

gi

≤ 1 ∀n ∈ χ, ∀i ∈ ζ

Solve it by maximum weighted bipartite matching

(1 − (1 − 1 G)G)

slide-44
SLIDE 44

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

How Efficient are the channel allocated?

10 20 30 40 50 100 150 200 250 300 350 400 Number of MSs Average Throughputs (Kbps)

Reuse-optimal Reuse-rounding COOP-CA-NC COOP-CA OPT-M OPT

20 40 60 80 100 100 150 200 250 300 350 400 Number of Sub−channels Average Throughputs (Kbps)

Reuse-optimal Reuse-rounding COOP-CA-NC COOP-CA OPT-M OPT

Throughput vs. Number of MSs Throughput vs. Number of Sub- channels

slide-45
SLIDE 45

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Power Allocation

When power on relays are high constrained

  • n∈χ
  • i∈ζ

S(n)

gi

≤ Pg ∀g ∈ ζ 0 ≤ ω(n)

gi ≤ C(n) gi

= BW ri · log2(1 + S(n)

gi

σ(n)

gi

)

Solve the problem by solving the dual problem

5 10 15 20 25 150 200 250 300 350 Transmission Power (dBm) Average Throughputs (Kbps) COOP-CA-PA-NC COOP-CA-PA OPT-M OPT 2 4 6 8 10 160 180 200 220 240 260 280 Power Variance (dBm) Average Throughputs (Kbps) COOP-CA-PA-NC COOP-CA-PA OPT-M OPT

Throughput vs. Power

Throughput vs. Number of Sub- channels

slide-46
SLIDE 46

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Conclusion

slide-47
SLIDE 47

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Conclusion

Our framework offers salient improvement

slide-48
SLIDE 48

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Conclusion

Our framework offers salient improvement

✓

Cooperative Communication

slide-49
SLIDE 49

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Conclusion

Our framework offers salient improvement

✓

Cooperative Communication

✓

Diversity gain

slide-50
SLIDE 50

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Conclusion

Our framework offers salient improvement

✓

Cooperative Communication

✓

Diversity gain

✓

Rateless Properties

slide-51
SLIDE 51

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Conclusion

Our framework offers salient improvement

✓

Cooperative Communication

✓

Diversity gain

✓

Rateless Properties

✓

Tightly Integrate with WiMAX

slide-52
SLIDE 52

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Conclusion

Our framework offers salient improvement

✓

Cooperative Communication

✓

Diversity gain

✓

Rateless Properties

✓

Tightly Integrate with WiMAX

Lead to the future design in WiMAX

slide-53
SLIDE 53

IWQoS 2009: Cooperative Multicast Scheduling with Random Network Coding in WiMAX (J. Jin, B. Li – University of Toronto)

Thank you!

more information:

http://iqua.ece.toronto.edu/~jinjin