ZigZag Decoding: Combating Hidden Terminals in Wireless Networks - PowerPoint PPT Presentation

1 / 21
About This Presentation
Title:

ZigZag Decoding: Combating Hidden Terminals in Wireless Networks

Description:

... ZigZag ... Patterns that ZigZag Applicable. Both backward and forward decoding ... ZigZag improves fairness & throughput. Further research. Combination of ... – PowerPoint PPT presentation

Number of Views:93
Avg rating:3.0/5.0
Slides: 22
Provided by: rzh1
Category:

less

Transcript and Presenter's Notes

Title: ZigZag Decoding: Combating Hidden Terminals in Wireless Networks


1
ZigZag Decoding Combating Hidden Terminals in
WirelessNetworks
  • Shyamnath Gollakota and Dina Katabi
  • MIT CSAIL
  • SIGCOMM 2009

2
Hidden Terminal Problem
Alice
Bob
AP
X
  • Leads to low utilization of bandwidth and
    unfairness in channel access
  • RTS/CTS induced too much overhead
  • Collided packets may still be decodable!

3
Basic idea of ZigZag Decoding
  • Chunk 1 from user A from 1st copy of collided
    packet can be decoded successfully
  • Subtract from 2nd copy to decoded the Chunk 1 of
    user B
  • Subtract from 1st copy of collided packet to
    decode Chunk 2 from user A
  • Subtract from 2nd copy of collided packet to
    decode Chunk 2 from user B

4
Wait! What about Shannon Capacity?
R1
  • Requires retransmissions if collision occurs
  • No overhead if no collision

TDMA
R2
5
Other alternatives
  • CDMA
  • Incompatible with WLAN
  • Low efficiency in high SNR
  • Successive interference cancellation (SIC)
  • Chunk packet
  • Decode the strong signal first, subtract from the
    sum and then decode the weak signal
  • No need for retransmissions
  • Both transmitters need to transmit at a lower rate

6
Patterns that ZigZag Applicable
  • Both backward and forward decoding can be used

Sudoku? ?
7
Technical Barriers
  • How do I know packets collide
  • Matching collision happened? (P1, P2) and (P1,
    P2)
  • Frequency offset between transmitter and receiver
  • Sampling offset
  • Inter-symbol interference
  • What if errors occur in chunks
  • Acknowledgement?

subtraction is non-trivial
8
Preliminary on communication
  • BPSK 0 -gt -1 1 -gt 1
  • http//en.wikipedia.org/wiki/QPSK

9
Collision Detection
  • Preamble
  • Pseudo random number
  • Correlation with moving window
  • thresholding

10
Matching collision
  • Given (P1 P2(?)) and (P1, P2(?)), how to
    determine that P1 P and P2 P2
  • Determine offset first
  • Correlation of P2(?) and P2(?)

11
Decode matching collision
  • Decode iteratively
  • Re-encoding
  • Computing channel parameters
  • Channel gain estimated from
  • Frequency offset and sampling error 1) coarse
    estimation from previously successful reception
    2) iterative estimation
  • Inter-symbol interference take the inverse of
    linear filter (for removal of ISI)

12
Decode matching collision (contd)
  • Re-encoding
  • Account for sampling error

13
What about errors?
  • Will errors in decoding have a cascading effect?
  • Error propagation dies out exponentially
  • Error correction capability of modulation
  • Forward and backward decoding

14
Acknowledgement
  • Use as much synchronous acknowledgement as
    possible for backward compatibility

15
Evaluation
  • 14-node GNURadio testbed
  • USRP with RFX2400 radio (2.4 GHz)
  • BPSK
  • Bit rate 500kbs
  • 32-bit preamble
  • 1500-byte payload, 32-bit CRC
  • Deficiency in GNURadio
  • Cannot coordinate transmission and reception very
    closely
  • CSMA, ACK

Software
Transmitter
Receiver
16
Micro-benchmark
17
Alice Bob
  • Bobs location is fixed, Alice moves closer to
    the base-station

18
Impact of SNR on BER
  • Alice Bob at fixed and equal location
  • Vary transmission power level

19
Testbed Results
  • Pick two senders randomly
  • 10 hidden terminals, 10 partial, 80 perfect

20
Three hidden terminals
21
Conclusion
  • ZigZag improves fairness throughput
  • Further research
  • Combination of analog network coding
Write a Comment
User Comments (0)
About PowerShow.com