computer & information sciences temple university · finding optimal distribution 12 the...

22
Reliable Broadcast with Joint Forward Error Correction and Erasure Codes in Wireless Communication Networks Pouya Ostovari and Jie Wu Computer & Information Sciences Temple University Center for Networked Computing http://www.cnc.temple.edu

Upload: others

Post on 26-Mar-2020

2 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Reliable Broadcast with Joint Forward

Error Correction and Erasure Codes in

Wireless Communication Networks

Pouya Ostovari and Jie Wu

Computer & Information Sciences

Temple University

Center for Networked Computing

http://www.cnc.temple.edu

Page 2: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Agenda

Introduction

◦ Motivation

Cross-layer protection

◦ Formulation

◦ Proposed method

Evaluations

Conclusions

2

Page 3: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Introduction

Advances in technology of mobile devices

◦ Smartphones and tablets

Wireless connections

◦ Are widely used

◦ Internet is accessible everywhere

Reliable transmission

◦ ARQ

◦ Erasure codes

◦ Hybrid-ARQ

◦ Fountain codes (rateless codes)

3

Page 4: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Transmission Errors

Noise

◦ Forward error correcting

codes (FEC)

◦ Adding redundant bits to find

and correct bit errors

◦ Physical layer

4

Interference

◦ Packet erasure codes (EC)

◦ Transmitting redundant packets

◦ Application and network layers

Page 5: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Network Coding

Random linear network coding

◦ Linear combinations of the packets

◦ Gaussian elimination

Applications of network coding

◦ Reliable transmissions

◦ Throughput/capacity enhancement

Distributed storage systems/ Content distribution/ Layered

multicast5

𝑞1 = 𝛼1,1𝑝1 + 𝛼1,2𝑝2 + 𝛼1,3𝑝3

𝑞2 = 𝛼2,1𝑝1 + 𝛼2,2𝑝2 + 𝛼2,3𝑝3

𝑞n = 𝛼𝑛,1𝑝1 + 𝛼𝑛,2𝑝2 + 𝛼𝑛,3𝑝3

Page 6: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Cross-Layer Reliable Transmission

6

Joint FEC and EC

◦ Deciding about the amount of redundancy to be

added for FEC and EC

Previous work

◦ Theoretic result for the case of single destination

◦ Muriel Medard: implementation on sensor network

Shows that joint FEC-NC is effective

Depending on noise and interference level, more NC or

FEC redundancy enhances the reliability

No method for redundancy distribution

Page 7: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Setting

Single source

◦ Transmits a set of m packets

◦ Size of each packet: n bits

◦ Source can transmit X bits

Two sources of errors

◦ Noise and interference

◦ Different noise and interference probabilities

7

Page 8: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Setting

Provide protection for

the packets

◦ Joint FEC and NC

Objective

◦ Finding the optimal

transmission scheme that

maximizes the probability

of receiving the m packets

by the destinations

8

Page 9: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Joint Coding Scheme

9

1. Segmentation

2. Applying network coding

3. Adding FEC to each network coded packet

NC

FEC

Page 10: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Problem Formulation

10

Erasure due to noise

◦ When bit errors cannot be corrected

Erasure due to noise and interference

Successful transmission of the m packets

Page 11: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Problem Formulation

11

Page 12: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Finding Optimal Distribution

12

The probability equation cannot be simplified

into a closed-form

Two-phases algorithm

◦ Offline phase: creating a reference table which

shows the success delivery of the packets for each

possible FEC and NC redundancy levels

◦ Online phase: performing a search on reference

table to find the optimal FEC and NC levels

Depending on the noise and interference probabilities of

the users

Page 13: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Reference Table Creation

13

Page 14: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Search for Optimal Coding Scheme

14

1

Page 15: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Evaluations

15

Simulator in Matlab environment

1000 topologies with random bit error rate and

interference probability

Bit error rate and interference probability of the

destinations are independent

Comparing with only FEC and only NC methods

Page 16: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Evaluations

16

100 sets of packets

◦ Each set contains 10 packets

Page 17: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Evaluations

17

100 sets of packets

◦ Each set contains 10 packets

Page 18: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Evaluations

18

100 sets of packets

◦ Each set contains 10 packets

Page 19: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Evaluations

19

100 sets of packets

◦ Each set contains 10 packets

Page 20: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Simulation Summary

20

For low noise probability FEC provides a better

protection

As noise or interference probability increases,

more redundancy is needed for NC (EC)

◦ FEC performs poorly

FEC or NC?

◦ For a given noise and interference probability, that

depends on X

Page 21: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Conclusion

21

Cross-layer protection of transmitted packets

Joint FEC and NC to enhance reliability

Fixed redundancy

Finding the optimal transmission scheme

◦ FEC redundancy

◦ NC redundancy (erasure code)

Two-phases algorithm

◦ Offline and online phases

Page 22: Computer & Information Sciences Temple University · Finding Optimal Distribution 12 The probability equation cannot be simplified into a closed-form Two-phases algorithm Offline

Thank you

22