BROADCASTING IN WIRELESS NETWORKS WITH NETWORK CODING Pouya - - PowerPoint PPT Presentation

▶
broadcasting in
SMART_READER_LITE
LIVE PREVIEW

BROADCASTING IN WIRELESS NETWORKS WITH NETWORK CODING Pouya - - PowerPoint PPT Presentation

Dec 13, 2023 304 likes •1.01k views

DEADLINE-AWARE BROADCASTING IN WIRELESS NETWORKS WITH NETWORK CODING Pouya Ostovari, Jie Wu, and Abdallah Khreishah Computer & Information Sciences Department, Temple University, USA Center for Networked Computing Agenda

slide-1
SLIDE 1

DEADLINE-AWARE BROADCASTING IN WIRELESS NETWORKS WITH NETWORK CODING

Pouya Ostovari, Jie Wu, and Abdallah Khreishah Computer & Information Sciences Department, Temple University, USA

Center for Networked Computing

slide-2
SLIDE 2

Agenda

 Introduction  Motivation  Three phases algorithm

 Broadcasting tree  Partitioning  Coding

 Simulation  Conclusion

slide-3
SLIDE 3

Alice and Bob (No coding)

Alice R Bob

slide-4
SLIDE 4

Alice and Bob (No coding)

Alice R Bob X

slide-5
SLIDE 5

Alice and Bob (No coding)

Alice R Bob Y

slide-6
SLIDE 6

Alice and Bob (No coding)

Alice R Bob Y

slide-7
SLIDE 7

Alice and Bob (No coding)

Alice R Bob X

slide-8
SLIDE 8

Alice and Bob (No coding)

Alice R Bob X

4 transmissions

slide-9
SLIDE 9

Alice and Bob (Coding)

Alice R Bob

slide-10
SLIDE 10

Alice and Bob (Coding)

Alice R Bob X

slide-11
SLIDE 11

Alice and Bob (Coding)

Alice R Bob Y

slide-12
SLIDE 12

Alice and Bob (Coding)

Alice R Bob X+Y

slide-13
SLIDE 13

Alice and Bob (Coding)

Alice R Bob X+Y

3 transmissions

slide-14
SLIDE 14

Deadline-Aware Broadcasting

1 2 3 4 5

slide-15
SLIDE 15

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X

1 2 3 4 5

slide-16
SLIDE 16

 Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

slide-17
SLIDE 17

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

Z

slide-18
SLIDE 18

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

  • No coding
slide-19
SLIDE 19

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X

1 2 3 4 5

Time slot 1

  • No coding
slide-20
SLIDE 20

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X

1 2 3 4 5

X X

Time slot 2

X

  • No coding
slide-21
SLIDE 21

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X

1 2 3 4 5

X X

Time slot 2

X

  • No coding
slide-22
SLIDE 22

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X

1 2 3 4 5

X X

Time slot 3

X X

  • No coding
slide-23
SLIDE 23

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

Y

1 2 3 4 5

Time slot 3

  • No coding
slide-24
SLIDE 24

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

Y

1 2 3 4 5

Y Y

Time slot 4

  • No coding
slide-25
SLIDE 25

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

Y

1 2 3 4 5

Y Y

Time slot 4

  • No coding
slide-26
SLIDE 26

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

Y

1 2 3 4 5

Y Y

Time slot 5

Y Y

  • No coding
slide-27
SLIDE 27

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

Time slot 5

Z

  • No coding
slide-28
SLIDE 28

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

Time slot 6

Z Z Z Z

  • No coding
slide-29
SLIDE 29

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

Time slot 6

Z Z Z Z

  • No coding
slide-30
SLIDE 30

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

Z Z Z Z Z

Time slot 7

  • No coding
slide-31
SLIDE 31

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

Z Z Z Z Z

Time slot 7

  • 3 transmissions by

the relay node

  • No deadline misses
  • No coding
slide-32
SLIDE 32

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

  • Coding all the packets
slide-33
SLIDE 33

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X

1 2 3 4 5

Time slot 1

  • Coding all the packets
slide-34
SLIDE 34

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X

1 2 3 4 5

X X

Time slot 2

X

  • Coding all the packets
slide-35
SLIDE 35

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

X X

Time slot 3

X

  • Coding all the packets
slide-36
SLIDE 36

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

X X Y Y

Time slot 4

X

  • Coding all the packets
slide-37
SLIDE 37

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

X X Y Y

Time slot 5

Z X

  • Coding all the packets
slide-38
SLIDE 38

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

X X Y Y

Time slot 6

Z Z Z Z X

  • Coding all the packets
slide-39
SLIDE 39

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

X X Y Y

Time slot 6

Z Z Z Z X

  • Coding all the packets
slide-40
SLIDE 40

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

X X Y Y X+Y+Z Z Z Z Z X+Y+Z

Time slot 7

X

  • Coding all the packets
slide-41
SLIDE 41

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

X X Y Y X+Y+Z Z Z Z Z X+Y+Z

Time slot 7

X

  • 1 transmissions by

the relay node

  • Deadline misses
  • Coding all the packets
slide-42
SLIDE 42

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

  • Waiting time=2
slide-43
SLIDE 43

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X

1 2 3 4 5

Time slot 1

  • Waiting time=2
slide-44
SLIDE 44

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X

1 2 3 4 5

X X

Time slot 2

X

  • Waiting time=2
slide-45
SLIDE 45

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

X X

Time slot 3

X

  • Waiting time=2
slide-46
SLIDE 46

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

X X Y Y

Time slot 4

X

  • Waiting time=2
slide-47
SLIDE 47

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

X X Y Y

Time slot 4

X

  • Waiting time=2
slide-48
SLIDE 48

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

X Y

1 2 3 4 5

X X Y Y

Time slot 5

X+Y X+Y X+Y X+Y X

  • Waiting time=2
slide-49
SLIDE 49

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

Time slot 5

Z

  • Waiting time=2
slide-50
SLIDE 50

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

Time slot 6

Z Z Z Z

  • Waiting time=2
slide-51
SLIDE 51

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

Time slot 6

Z Z Z Z

  • Waiting time=2
slide-52
SLIDE 52

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

Z Z Z Z Z

Time slot 7

  • Waiting time=2
slide-53
SLIDE 53

 Z:  Generation: slot 5  Deadline: 7  Y:  Generation: slot 3  Deadline: 6

Deadline-Aware Broadcasting

 X:  Generation : slot 1  Deadline: 6

1 2 3 4 5

Z Z Z Z Z

Time slot 7

  • 2 transmissions by

the relay node

  • No deadline misses
  • Waiting time=2
slide-54
SLIDE 54

Setting and Problem

 Multi-hop network  Multiple broadcast sessions  Perfect links  Multi-channel multi-radio capability  Objective: minimizing the number of transmissions  Constraint: Each packet has a deadline to be

received by all of the nodes

slide-55
SLIDE 55

NP-completeness

 The problem of energy-efficient broadcasting,

subject to the deadline constraints, is NP-complete

 Polynomial time reduction from a well known NP-

complete problem

 Vector packing problem

slide-56
SLIDE 56

High-Level Solution

 Constructing broadcasting trees

 Ensures the decodability of the coded packets  It is done once in the initializing phase

 Partitioning the set of packets

 Guarantees meeting all the deadlines  It is done once in the initializing phase

 Performing coding

 The relay nodes do the actual coding  This phase is repeated periodically

slide-57
SLIDE 57

Broadcasting Tree

 Spanning tree

slide-58
SLIDE 58

Broadcasting Tree

 Spanning tree

slide-59
SLIDE 59

Constructing Broadcasting Trees

 Iterative construction

 Starts from the sources in increasing order of their

packet’s deadlines

 Uses BFS to traverce the network

 Rules

 Rule1: Node selects the parent

that has the maximum number of effective neighbors

 Rule2: Node selects the parent

where selecting that node does not increase .

slide-60
SLIDE 60

Partitioning the Set of Packets

 Sorts the list of the packets in increasing order of

their deadlines.

 Places the first packet in a partition.  What if we place the next packet in the current

partition?

 Calculates the receiving time  Receiving time < deadlines: puts to the partition  Receiving time > deadlines: makes a new partition

slide-61
SLIDE 61

Simulations

  • NDANC: Non Deadline-Aware NC
  • DANC: Deadline-Aware NC
  • PFNC: Probabilistic Forwarding NC
  • NONCT: Non Coding Tree
slide-62
SLIDE 62

Simulations

  • NDANC: Non Deadline-Aware NC
  • DANC: Deadline-Aware NC
  • PFNC: Probabilistic Forwarding NC
  • NONCT: Non Coding Tree
slide-63
SLIDE 63

Simulations

  • Performance over PFNC FF=0.4
  • NDANC: Non Deadline-Aware NC
  • DANC: Deadline-Aware NC
  • PFNC: Probabilistic Forwarding NC
slide-64
SLIDE 64

Simulations

  • Performance over PFNC FF=0.4
  • NDANC: Non Deadline-Aware NC
  • DANC: Deadline-Aware NC
  • PFNC: Probabilistic Forwarding NC

3%

slide-65
SLIDE 65

Simulations

  • Performance over PFNC FF=0.4
  • NDANC: Non Deadline-Aware NC
  • DANC: Deadline-Aware NC
  • PFNC: Probabilistic Forwarding NC

3% 45%

slide-66
SLIDE 66

Simulations

  • Performance over PFNC FF=0.4
  • NDANC: Non Deadline-Aware NC
  • DANC: Deadline-Aware NC
  • PFNC: Probabilistic Forwarding NC

3% 45% 10%

slide-67
SLIDE 67

Summary

 The problem of energy-efficient broadcasting,

subject to the deadline constraints, is NP-complete

 Three phases heuristic

 Constructing broadcasting trees  Partitioning the packets  Performing coding among the same partition

 Future work

 Scheduling in the case of single channel  Non reliable links

slide-68
SLIDE 68

Questions

slide-69
SLIDE 69

Cycle