Countering Selfish Misbehavior in Multi-channel MAC protocols Yan Zhang and Loukas Lazos Dept. of Electrical and Computer Engineering University of Arizona INFOCOM 2013

Channel Access in Multi-channel Wireless Networks 2 A - D B - E C - F 4/18/2013 Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona A B D E F C F - D A - B E - C C - A B - F D - E F - C B - A E - D f1f1 f2f2 f3f3 collision domain Multiple Tx - Rx pairs within same collision domain share access to a common set of frequency bands -Schedule-based -Contention-based

Prior-Art on Multi-Channel MAC (MMAC) Protocols 34/18/2013 Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona Design goals Allow transmitters to discover the residing frequency of receivers Maximize throughput (aggregate, individual) Ensure fairness Dedicated control channel designs Nodes equipped with multiple radios one of which is always tuned to the control channel Frequency hopping rendezvous designs Nodes rendezvous at different channels via hopping - no contention Split-phase designs Single half-duplex transceiver is assumed

Problem Statement 4 MMAC protocols effectively coordinate access if contenders are benign and protocol-compliant Misbehavior in MMAC Protocols - What if nodes behave selfishly to gain an unfair share of the available channels? - What are the possible misbehaviors and optimal misbehavior strategies? - What is the misbehavior impact on throughput and fairness? - How can this misbehavior be mitigated? - Can misbehaving nodes be identified? 4/18/2013 Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona A-D B-E C-F A-D C-B E-F A-D B-F C-E A-D B-C E-F f1f1 f2f2 f3f3 A-D

Our Contributions 54/18/2013 Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona We study possible misbehaviors in split-phase MMAC designs Backoff Manipulation Attack (BMA) Multi-Reservation Attack (MRA) Combination of both attacks We derive adaptive misbehavior strategies for isolating a desired subset of channels We develop misbehavior mitigation methods that provide fair channel access opportunities We develop misbehavior detection methods that identify the misbehaving nodes

f1f1 RES PCL B f1f1 MED f2f2 f3f3 PCL B f1f1 LOW(1) f2f2 MED f3f3 PCL B f1f1 LOW(1) f2f2 f3f3 MED PCL B f1f1 LOW(1) f2f2 f3f3 HIGH reservation request acknowledgment response Reservations are placed based on a three-way handshake Channel selection criteria: balance traffic load - Preferable Channel List (PCL) REQ ACK RES C- F F(f1)F(f1) A B C C(f1)C(f1)D(f2)D(f2)E(f3)E(f3) A(f2)A(f2) B(f3)B(f3) Control Phase Data Phase A B D E F C MAC for Multi-channel Networks ( MMAC) Split-Phase MMAC Design REQ ACK f2f2 f3f3 A-D B-E f1f1 f2f2 f3f3 4/18/20136 Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona

Node A systematically selects small backoff values to capture the control channel (similar to misbehavior in single-channel MAC protocols) Solutions from the single-channel domain cannot be directly ported Backoff monitors may disperse to multiple channels Sender-monitor pair may collude (e.g., if monitor is a receiver) Backoff Manipulation Attack (BMA) 4/18/20137 Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona REQ ACK RES C-F A C D(f2)D(f2) F(f1)F(f1) A(f2)A(f2) C(f1)C(f1) Control Phase Data Phase A B D E F C A-D f1f1 f2f2 f3f3

Reservations with fictitious nodes I 1, I 2, and I 3 are presumed to be hidden terminals to nodes B to F Multi-reservation Attack (MRA) 4/18/20138 Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona REQ ACK RES F(f 1 ) A C C(f 1 ) D(f 2 ) A(f 2 ) Control Phase A B D E F C C - F f1f1 f2f2 I1I1 I2I2 I3I3 ACK(f 2 ) ACK A(f 2 ) fake reservations REQ ACK RES B E(f 1 ) B(f 1 ) Data Phase f1f1 f2f2 B - E C - F B - E PCL B f1f1 MED f2f2 PCL B f1f1 MED f2f2 LOW(1) PCL B f1f1 MED f2f2 LOW(4) PCL B f1f1 LOW(1) f2f2 LOW(4) PCL B f1f1 HIGH f2f2 LOW(4) A - D

MRA – Incomplete Negotiations 4/18/20139 Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona C D BA REQ(PCL A ) ACK(f 1 ) REQ(PCL A ) ACK(f 1 ) PCL D f1f1 MED f2f2 PCL D f1f1 LOW(1) f2f2 MED

Misbehavior Throughput Advantage in BMA+MRA 20ms control phase (about 8 negotiations/phase ) 30ms control phase (about 12 negotiations/phase ) 4/18/ Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona Simulation setup (OPNET) - Single-hop network, 10 well-behaved pairs, 1 misbehaving pair - 3 orthogonal channels of 2Mbps, data phase: 80ms - Poisson distributed traffic with parameter λ

Adaptive Misbehavior Strategy To isolate n m out of n channels: Step 1: Place n m reservations on n m channels of choice Step 2: Allow for (n - n m ) reservations from other pairs Step 3: Repeat Steps 1 and 2 E.g., n = 3, n m = 1 4/18/ Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona reservations from misbehaving node RSV W RSV M RSV W …… reservations from well-behaved nodes RSV M RSV W PCL X f1f1 MED f2f2 f3f3 PCL X f1f1 LOW(1) f2f2 MED f3f3 PCL X f1f1 LOW(1) f2f2 f3f3 PCL X f1f1 LOW(2) f2f2 LOW(1) f3f3 PCL X f1f1 LOW(2) f2f2 f3f3

Evaluation of Adaptive Misbehavior Adaptive strategy requires significantly less reservations than placing a fixed # of reservations a priori collisions 4/18/ Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona d: fixed # of reservations for guaranteeing isolation of one channel

Detection of BMA – Backoff Generation Module number of retransmissions 4/18/ Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona G s i seed G(q i, s i ) in [0,1] Node i publishes a random seed s i used to compute its random backoff times q i : packet # Backoff for the q i th packet from i

Detection of BMA – Backoff Monitoring Module 4/18/ Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona Control PhaseData Phase f1f1 f2f2 f3f3 REQ (1,0) ACK RES (1,0) RES (1,0) RTS (2,0) RTS (2,0) CTS DATA ACK Monitored backoff < b I (1,0) ? Monitored backoff < b i (2,0)? Transmitting node includes (q i, r i ) with every control packet transmitted during the control and data phases Monitoring nodes keep track of (q i, r i ) and identify misbehaving nodes based on b i (q i, r i )

Manipulation of (q i, r i ) 4/18/ Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona Scenario A: Misbehaving node i avoids incrementation of (q i, r i ) if its REQ collides Collisions are receiver-dependent – another neighbor may have successfully received REQ(q i, r i ) A B F C D REQ(q A, r A ) Scenario B: Misbehaving node i takes advantage of other collisions to advance q i by k (k > 1), with G(q i + k, s i ) << G(q i,+1 s i ) With the advancement of q by k, r must also advance by k. Delay for k collisions/backoffs must be added to backoff delay

Mitigation of MRA – Modified PCL Rules 4/18/ Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona ACK RES F(f 1 ) A C C(f 1 ) D(f 2 ) A(f 2 ) Control Phase A B D E F C f1f1 f2f2 I1I1 I2I2 I3I3 ACK(f 2 ) ACK A(f 2 ) fake reservations ACK RES B E(f 2 ) B(f 2 ) PCL B f1f1 MED f2f2 PCL B f1f1 MED f2f2 LOW(1) PCL B f1f1 LOW(1) f2f2 PCL B f1f1 LOW(1) f2f2 HIGH A source can change the priority of a channel at most once per control phase Misbehaving node A does not isolate f 2 ATIM

Mitigation of MRA – Secure Neighbor Discovery Discover 2-hop topology and record hidden terminals F is hidden terminal to all but M  M is suspected of misbehavior Execute challenge-response between A and F 4/18/ Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona Detecting fictitious sources F M A B D C Topological information n: direct neighbor, h: non-direct neighbor

Effect of Mitigation Techniques 4/18/ Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona

Conclusions and Future Work Studied the impact of misbehavior on split-phase MMAC protocols Derived adaptive misbehavior strategies which are able to monopolize a desired subset of channels 4/18/ Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona Future work Investigate misbehavior strategies for dedicated control channel and frequency hopping MMAC designs Couple misbehavior detection with a reputation system Proposed detection/mitigation schemes that identify misbehaving nodes and further provide fair channel access opportunities

Thank you! 4/18/2013 Yan Zhang and Loukas Lazos, INFOCOM 2013, Univ. of Arizona 20