Mes essag age e in M Mes essag age M e Mec echa hanism sm - - PowerPoint PPT Presentation

mes essag age e in m mes essag age m e mec echa hanism sm
SMART_READER_LITE
LIVE PREVIEW

Mes essag age e in M Mes essag age M e Mec echa hanism sm - - PowerPoint PPT Presentation

Potential al Pitf tfalls ls o of f the he Mes essag age e in M Mes essag age M e Mec echa hanism sm in M Mode odern 8 n 802.11 Ne Networks Wei Wang, Wa Wai Kay L y Leon eong, and Ben Leong School of Computing, National


slide-1
SLIDE 1

Potential al Pitf tfalls ls o

  • f

f the he

Mes essag age e in M Mes essag age M e Mec echa hanism sm

in M Mode

  • dern 8

n 802.11 Ne Networks

Wei Wang, Wa Wai Kay L y Leon eong, and Ben Leong

School of Computing, National University of Singapore

slide-2
SLIDE 2 School of Computing

Wi-Fi is Ubiquitous

2

slide-3
SLIDE 3 School of Computing

The Problem

Message in Message Mechanism (MiM)

MAC protocol ACK Interference Power Control

3

slide-4
SLIDE 4 School of Computing

What is MiM?

MESSAGE IN MESSAGE MECHANISM

slide-5
SLIDE 5 School of Computing

Conventional Receiver w/o MiM

Frame A

Time RSSI

Frame B

Higher RSSI

5

slide-6
SLIDE 6 School of Computing

Reception of Conventional Receiver

Both frames are lost Frame A

Time RSSI

Frame B

corrupted CRC check fails

Treated as noise

6

slide-7
SLIDE 7 School of Computing

Frame B

Frame A knocked out

Message in Message (MiM)

Higher signal dominates weaker signal

Time RSSI

Frame A

Successfully Received

7

slide-8
SLIDE 8 School of Computing

Frame A knocked out

Frame B

Interfering Frame Desired Frame

MiM is helpful

  • 1. Salvaged otherwise lost frame

Time RSSI

8

Discarded

Successfully Received

slide-9
SLIDE 9 School of Computing

Desired Frame Interfering Frame

MiM is helpful

  • 1. Salvaged otherwise lost frame
  • 2. Desired frame is lost

Time RSSI Successfully Received

 

Discarded

9

slide-10
SLIDE 10 School of Computing

Desired Frame Interfering Frame

MiM is helpful, at least no harm

  • 1. Salvaged otherwise lost frame
  • 2. Desired frame is lost

Time RSSI Successfully Received

 

Discarded

10

slide-11
SLIDE 11 School of Computing

Consider Aggregate MPDUs

However…

A-MPDU MAC Frames

11

slide-12
SLIDE 12 School of Computing

However… Consider A-MPDU

Time RSSI A-MPDU Interfering frame

12

slide-13
SLIDE 13 School of Computing

However… Consider A-MPDU

Without MiM RX: 3 Fail: 3

Time RSSI A-MPDU Interfering frame

     

13

slide-14
SLIDE 14 School of Computing

Interfering frame

However… Consider A-MPDU

Without MiM With MiM RX: 3 Fail: 3 RX: 1 Fail: 5 Worse: No Block ACK

Time RSSI A-MPDU

     

A-MPDU gets knocked out

Key Insight: MiM can be harmful

14

slide-15
SLIDE 15 School of Computing

Why Use A-MPDU?

  • A-MPDU reduces TX overhead
  • Maximum A-MPDU size
  • 64 KB for 11n (equivalent to 40+ frames)
  • 1 MB for 11ac (600+ frames)
  • A tiny interfering frame (e.g. ACK) can destroy

the whole A-MPDU

15

slide-16
SLIDE 16 School of Computing

How Bad is it?

SOMETIMES GOOD, SOMETIMES BAD

slide-17
SLIDE 17 School of Computing

What Can We Do?

HOW TO EFFECTIVELY USE MIM

slide-18
SLIDE 18 School of Computing

Our Contributions

  • 1. How bad is it?

A: Study the impact of MiM on A-MPDUs

  • 2. What can we do?

A: Adaptive algorithm to enable/disable MiM

18

slide-19
SLIDE 19 School of Computing

Studying the Impact of MiM

Experimental set-up

  • Sender & Interferer out-of-range
  • Receiver closer to Interferer

Sender Receiver Interferer

19

slide-20
SLIDE 20 School of Computing

Studying the Impact of MiM

Experimental set-up

  • Sender & Interferer out-of-range
  • Receiver closer to Interferer
  • Sender sends an A-MPDU (w/o MAC retry)
  • Interferer broadcast an Interfering Frame

Sender Receiver Interferer Interfering Frame

20

slide-21
SLIDE 21 School of Computing

Studying the Impact of MiM

Experimental set-up

  • Sender & Interferer out-of-range
  • Receiver closer to Interferer
  • Sender sends an A-MPDU (w/o MAC retry)
  • Interferer broadcast an Interfering Frame
  • Measure FDR

Sender Receiver Interferer Interfering Frame

21

slide-22
SLIDE 22 School of Computing

Ensure collision

Time Interferer Receiver Sender Poll

t

t is uniformly distributed Immediately Tx A-MPDU Interfering Frame

22

slide-23
SLIDE 23 School of Computing

Duration of A-MPDU

Max duration limited by ath9k driver

Time

≈ 3.8 ms

A-MPDU

Max. 4 ms

23

slide-24
SLIDE 24 School of Computing

A-MPDU

Size of A-MPDU (# frames)

Depends on data rate

6.5 Mbps 2 frames 26 Mbps 8 frames

Time

≈ 3.8 ms

MCS Index 1 2 3 4 5 6 7 Data Rate (Mbps) 6.5 13 19.5 26 39 52 58.5 65 Frames 2 4 6 8 12 16 18 20 Max. 4 ms

24

slide-25
SLIDE 25 School of Computing

The Detrimental Impact of MiM

  • 1. Size of A-MPDU
  • # Frames per A-MPDU
  • 2. Length of Interference Frame
  • Air-time duration
  • 3. Channel Bonding
  • Using adjacent channels

26

slide-26
SLIDE 26 School of Computing
  • 1. Size of A-MPDU?

NUMBER OF FRAMES IN AN A-MPDU

slide-27
SLIDE 27 School of Computing

Impact of A-MPDU size

A-MPDU of 2 frames

Time

≈ 3.8 ms Interfering Frame 60 μs

0.5

28

slide-28
SLIDE 28 School of Computing

Impact of A-MPDU size

A-MPDU of 4 frames

Time

≈ 3.8 ms Interfering Frame 60 μs

29

slide-29
SLIDE 29 School of Computing

Impact of A-MPDU size

A-MPDU of 4 frames

0.25

30

slide-30
SLIDE 30 School of Computing

Impact of A-MPDU size

A-MPDU of 20 frames

Time

≈ 3.8 ms Interfering Frame 60 μs

More details in the paper

31

slide-31
SLIDE 31 School of Computing

Frame Delivery Ratio

Time

≈ 3.8 ms Interfering Frame 60 μs

32

slide-32
SLIDE 32 School of Computing

Interfering Frame 60 μs

Frame Delivery Ratio

0.5 0.9

Time

≈ 3.8 ms Interfering Frame 600 μs

33

slide-33
SLIDE 33 School of Computing

Interfering Frame 600 μs

Frame Delivery Ratio

Time

≈ 3.8 ms

0.5

34

slide-34
SLIDE 34 School of Computing
  • 2. Length of

Interference Frame

THE AIR-TIME DURATION

slide-35
SLIDE 35 School of Computing

Air-time of Interfering Frames

Intuition: Without MiM, longer T  more frames loss With MiM, T has no effect

Time

≈ 3.8 ms

T

36

slide-36
SLIDE 36 School of Computing

How to set T

  • 1. Vary frame length (# of bytes)
  • 2. Vary data rate (bytes per sec)

Time

≈ 3.8 ms

T

37

slide-37
SLIDE 37 School of Computing

Increasing Frame Length

38

slide-38
SLIDE 38 School of Computing

Increasing Frame Length

39

slide-39
SLIDE 39 School of Computing

Increasing Frame Length

40

slide-40
SLIDE 40 School of Computing

Increasing Data Rate

Air-time duration is what matters

41

slide-41
SLIDE 41 School of Computing

Air-time Duration… in the Wild

42

slide-42
SLIDE 42 School of Computing

Air-time Duration… in the Wild

Median ≈ 30 μs MAC ACK

IPv6 Neighbor Discovery Protocol

20 μs 170 μs

43

slide-43
SLIDE 43 School of Computing

Putting it in Perspective

in the wild

Be careful what you choose Suffer a large penalty

44

slide-44
SLIDE 44 School of Computing
  • 3. Channel Bonding

USING ADJACENT CHANNELS

slide-45
SLIDE 45 School of Computing

Channel bonding

Sender Interferer Receiver Interferer

20 MHz 40 MHz

50

slide-46
SLIDE 46 School of Computing

Channel bonding: Case 1

Sender Receiver Interferer

51

slide-47
SLIDE 47 School of Computing

Channel bonding: Case 2

Sender Interferer Receiver

52

slide-48
SLIDE 48 School of Computing

Channel bonding: Case 3

Sender Interferer Receiver

53

slide-49
SLIDE 49 School of Computing

Channel bonding: Case 4

Sender Interferer Receiver

54

slide-50
SLIDE 50 School of Computing

Channel bonding: Case 5

Sender Interferer Receiver

55

slide-51
SLIDE 51 School of Computing

Sender Interferer Receiver

Channel bonding

Sender Interferer Receiver

Case 1

Sender Interferer Receiver

Case 2

Sender Interferer Receiver

Case 3

Sender Interferer Receiver

Case 4

Sender Interferer Receiver

Case 5

56

slide-52
SLIDE 52 School of Computing

Adjacent Channel Interference

Sender Interferer Receiver

58

slide-53
SLIDE 53 School of Computing

Adjacent Channel Interference

Sender Interferer Receiver

Lesser Interference More Interference 10 dB Threshold

59

slide-54
SLIDE 54 School of Computing

Adjacent Channel Interference

Sender Interferer Receiver

60

slide-55
SLIDE 55 School of Computing

Adjacent Channel Interference

Sender Interferer Receiver Receiver

61

slide-56
SLIDE 56 School of Computing

Adjacent Channel Interference

Sender Interferer Receiver

62

slide-57
SLIDE 57 School of Computing

Adaptive MiM

DECIDING WHEN TO ENABLE/DISABLE MIM

slide-58
SLIDE 58 School of Computing

Some Definitions

Good Knock-out Bad Knock-out

Frame A knocked out Time RSSI

Desired Frame

Successfully Received

Interfering Frame

Discarded

Desired Frame Interfering Frame

Time RSSI Discarded

Discarded

64

slide-59
SLIDE 59 School of Computing

Key Idea

Count Good KO and Bad KO Compare Good > Bad Enable MiM Yes Disable MiM* No *CATCH Cannot count with MiM disabled Periodically

65

slide-60
SLIDE 60 School of Computing

Evaluation

Experimental Set-up Position 1 Position 2 Position 3

Desired signal is stronger Equal signal strength Interference is stronger

Sender

Campus AP

Interferer

Campus AP

66

slide-61
SLIDE 61 School of Computing

Results w/o Adaptive MiM

Sender > Interferer MiM helpful Sender = Interferer MiM neutral Sender < Interferer MiM detrimental

67

slide-62
SLIDE 62 School of Computing

Results with Adaptive MiM

Sender > Interferer MiM helpful Sender = Interferer MiM neutral Sender < Interferer MiM detrimental

Adaptive MiM always useful

68

slide-63
SLIDE 63 School of Computing

In Conclusion

MiM not always helpful, can be harmful

  • 1. Studied harmful effect of MiM
  • n A-MPDUs
  • 10 dB threshold
  • Adjacent Channels
  • 2. Adaptive MiM Algorithm
  • Use MiM only when good
  • Near optimal results

69

slide-64
SLIDE 64 School of Computing

Future Work

  • 1. Update the 802.11 MAC/PHY implementation in

simulators like ns-3

  • 2. Analytically model the effect of MiM on A-

MPDU

  • 3. Develop algorithm to dynamically adjust A-

MPDU size

70

slide-65
SLIDE 65 School of Computing

Thank You

QUESTIONS?

{weiwang|waikay|benleong}@comp.nus.edu.sg