Duke Selfish MAC Layer Misbehavior in Wireless Networks Author: Pradeep Kyasanur and Nitin H. Vaidya Some slides are borrowed from the author and others.

Slides:



Advertisements
Similar presentations
Nick Feamster CS 4251 Computer Networking II Spring 2008
Advertisements

IEEE CSMA/CA DCF CSE 6590 Fall /7/20141.
Detecting MAC Layer Back-off Timer Violations in Mobile Ad Hoc Networks Venkata Nishanth Lolla, Lap Kong Law, Srikanth V. Krishnamurthy, Chinya Ravishankar,
MAC Layer Misbehavior in Wireless Networks Pradeep Kyasanur Nitin H. Vaidya University of Illinois at Urbana-Champaign.
Medium Access Issues David Holmer
Contents IEEE MAC layer operation Basic CSMA/CA operation
How Effective is the IEEE RTS/CTS Handshake in Ad Hoc Networks Kaixin Xu,Mario Gerla, Sang Bae IEEE Globecom 2002.
SELECT: Self-Learning Collision Avoidance for Wireless Networks Chun-Cheng Chen, Eunsoo, Seo, Hwangnam Kim, and Haiyun Luo Department of Computer Science,
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
1 A Novel Topology-blind Fair Medium Access Control for Wireless LAN and Ad Hoc Networks Z. Y. Fang and B. Bensaou Computer Science Department Hong Kong.
CSMA/CA in IEEE Physical carrier sense, and Virtual carrier sense using Network Allocation Vector (NAV) NAV is updated based on overheard RTS/CTS/DATA/ACK.
Contention Window Optimization for IEEE DCF Access Control D. J. Deng, C. H. Ke, H. H. Chen, and Y. M. Huang IEEE Transaction on Wireless Communication.
Module C- Part 1 WLAN Performance Aspects
MAC Layer (Mis)behaviors Christophe Augier - CSE Summer 2003.
Dynamic Tuning of the IEEE Protocol to Achieve a Theoretical Throughput Limit Frederico Calì, Marco Conti, and Enrico Gregori IEEE/ACM TRANSACTIONS.
Re-routing Instability in IEEE Multi-hop Ad-hoc Networks Ping Chung Ng and Soung Chang Liew The 4th IEEE International Workshop on Wireless Local.
Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Distributed Priority Scheduling and Medium Access in Ad Hoc Networks Vikram Kanodia.
Does the IEEE MAC Protocol Work Well in Multihop Wireless Ad Hoc Networks? Shugong Xu Tark Saadawi June, 2001 IEEE Communications Magazine (Adapted.
Distributed Fair Scheduling in a Wireless LAN Gautam Kulkarni EE206A (Spring 2001) Nitin Vaidya, Paramvir Bahl and Seema Gupta (appeared in Mobicom 2000.
The Impact of Multihop Wireless Channel on TCP Throughput and Loss Presented by Scott McLaren Zhenghua Fu, Petros Zerfos, Haiyun Luo, Songwu Lu, Lixia.
Enhancing TCP Fairness in Ad Hoc Wireless Networks Using Neighborhood RED Prenseted by Ronak Bhuta Date : October 9, 2007 Kaixin Xu Mario Gerla Lantao.
1 QoS Schemes for IEEE Wireless LAN – An Evaluation by Anders Lindgren, Andreas Almquist and Olov Schelen Presented by Tony Sung, 10 th Feburary.
Semester EEE449 Computer Networks The Data Link Layer Part 2: Media Access Control En. Mohd Nazri Mahmud MPhil (Cambridge, UK) BEng (Essex,
Sep 12, 2002Wireless Networking Seminar1 Does IEEE Work Well in Multi-hop Wireless Network? Author: Shugong Xu, Tarek Saadawi City University of.
Selfish MAC Layer Misbehavior in Wireless Networks Pradeep Kyasanur and Nitin H. Vaidya 2005 IEEE Reviewed by Dean Chiang.
Medium Access Control Protocols Using Directional Antennas in Ad Hoc Networks CIS 888 Prof. Anish Arora The Ohio State University.
Wireless LAN Simulation - IEEE MAC Protocol
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray, Jeffrey B. Carruthers, and David Starobinski Department of Electrical and Computer Engineering.
A Multichain Backoff Mechanism for IEEE WLANs Alkesh Patel & Hemant Patel ECE 695 – Leading Discussion By : Shiang- Rung Ye and Yu-Chee Tseng.
Opersating Mode DCF: distributed coordination function
A Virtual Collision Mechanism for IEEE DCF
2014 YU-ANTL Lab Seminar Performance Analysis of the IEEE Distributed Coordination Function Giuseppe Bianchi April 12, 2014 Yashashree.
MAC Protocols and Security in Ad hoc and Sensor Networks
Wireless Medium Access. Multi-transmitter Interference Problem  Similar to multi-path or noise  Two transmitting stations will constructively/destructively.
1 Dynamic Adaption of DCF and PCF mode of IEEE WLAN Abhishek Goliya Guided By: Prof. Sridhar Iyer Dr. Leena-Chandran Wadia MTech Dissertation.
Ethernet. Problem In an Ethernet, suppose there are three stations very close to each other, A, B and C. Suppose at time 0, all of them have a frame to.
LECTURE9 NET301. DYNAMIC MAC PROTOCOL: CONTENTION PROTOCOL Carrier Sense Multiple Access (CSMA): A protocol in which a node verifies the absence of other.
ECE 256, Spring 2008 Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver Jungmin So & Nitin Vaidya.
Enhancing TCP Fairness in Ad Hoc Wireless Networks using Neighborhood RED Kaixin Xu, Mario Gerla UCLA Computer Science Department
1 Core-PC: A Class of Correlative Power Control Algorithms for Single Channel Mobile Ad Hoc Networks Jun Zhang and Brahim Bensaou The Hong Kong University.
On Optimizing the Backoff Interval for Random Access Scheme Zygmunt J. Hass and Jing Deng IEEE Transactions on Communications, Dec 2003.
Reliable MAC Layer Multicast in IEEE Wireless Networks Min-Te Sun, Lifei Huang, Anish Arora, Ten-Hwang Lai Department of Computer and Information.
Chapter 6 Multiple Radio Access
Performance Analysis of IEEE Distributed Coordination Function (DCF) Author : Giuseppe Bianchi Presented by: 李政修 December 23, 2003.
IEEE WLAN.
Introduction to Wireless Networks Dina Katabi & Sam Madden MIT – – Spring 2014.
Recitation 8 Wireless Networks.
Priority Scheduling in Wireless Ad Hoc Networks Xue Yang and NitinVaidya University of Illinois at Urbana-Champaign.
Tackling Exposed Node Problem in IEEE Mac Deepanshu Shukla ( ) Guide: Dr. Sridhar Iyer.
Planning and Analyzing Wireless LAN
An Energy Efficient MAC Protocol for Wireless LANs, E.-S. Jung and N.H. Vaidya, INFOCOM 2002, June 2002 吳豐州.
Wi-Fi. Basic structure: – Stations plus an access point – Stations talk to the access point, then to outside – Access point talks to stations – Stations.
Rami Melhem Sameh Gobriel & Daniel Mosse Modeling an Energy-Efficient MAC Layer Protocol.
Explicit and Implicit Pipelining in Wireless MAC Nitin Vaidya University of Illinois at Urbana-Champaign Joint work with Xue Yang, UIUC.
ECE 256, Spring 2009 __________ Multi-Channel MAC for Ad Hoc Networks: Handling Multi-Channel Hidden Terminals Using A Single Transceiver __________________.
Multi-Channel MAC Protocol for Multi-Hop Wireless Networks: Handling Multi-Channel Hidden Node Problem Using Snooping Myunghwan Seo, Yonggyu Kim, and Joongsoo.
Mitigating starvation in Wireless Ad hoc Networks: Multi-channel MAC and Power Control Adviser : Frank, Yeong-Sung Lin Presented by Shin-Yao Chen.
Medium Access Control in Wireless networks
CSMA/CA Simulation  Course Name: Networking Level(UG/PG): UG  Author(s) : Amitendu Panja, Veedhi Desai  Mentor: Aruna Adil *The contents in this ppt.
Distributed-Queue Access for Wireless Ad Hoc Networks Authors: V. Baiamonte, C. Casetti, C.-F. Chiasserini Dipartimento di Elettronica, Politecnico di.
RTS/CTS-Induced Congestion in Ad Hoc Wireless LANs Saikat Ray,Jeffrey B. Carruthers and David Starobinski WCNC 2003.
1 A Power Control MAC Protocol for Ad Hoc Networks EUN-SUN JUNG, NITIN H. VAIDYA, Wireless Networks 11, 55–66, Speaker: Han-Tien Chang.
Selfish MAC Layer Misbehavior in Wireless Networks ECE 299, Karthik Balasubramanian February 8, 2007 Nitin Vaidya and Pradeep Kyasanur.
Network System Lab. Sungkyunkwan Univ. Differentiated Access Mechanism in Cognitive Radio Networks with Energy-Harvesting Nodes Network System Lab. Yunmin.
MAC Protocols for Sensor Networks
Lab 7 – CSMA/CD (Data Link Layer Layer)
Topics in Distributed Wireless Medium Access Control
Self Organized Networks
The Impact of Multihop Wireless Channel on TCP Performance
of the IEEE Distributed Coordination Function
Presentation transcript:

Duke Selfish MAC Layer Misbehavior in Wireless Networks Author: Pradeep Kyasanur and Nitin H. Vaidya Some slides are borrowed from the author and others Reviewed by Xuan Bao

Duke Company Logo Index Problem Definition 1 Proposed Methods 2 Modification 3 Simulation Result 4

Duke Company Logo Review of Details about DCF

Duke Company Logo Calculation of Contention Window (CW)  A host with data to transmit selects a random backoff counter from range [0, CW]  The backoff counter will decrease by one when the channel is idle for one time slot.  A host may access the channel when the counter reaches 0.  If a transmission is successful, CW is reset to the minimum value. Otherwise, CW is doubled, subject to the maximum value.

Duke Company Logo Opportunities of Misbehavior Using analogy, the contention process is like throwing a dice and the competitor with the least points gets channel access. Fairness is achieved because the loser in earlier contention will decrease their backoff counter and therefore has better chance to win the contention later.

Duke Company Logo Opportunities of Misbehavior A selfish host can choose a small backoff counter by: 1 Choosing the backoff counter from a smaller region than [0, CW] 2 Do not increase CW after collision Selfish Host Backoff = rand[1,1] Normal Host Backoff = rand[0,CW]

Duke Company Logo The Reason Behind Misbehavior Opportunities  Senders, while participating in contention, maintain the CW value by themselves. Therefore, they are in fact both the regulator and participator in this game.

Duke Company Logo Conclusion on Definition of Misbehavior in This Paper  In this paper, selfish misbehavior only consider the sender’s behavior intending to obtain unfair share of channel access.  Does not consider high layer solutions.  Does not consider malicious attacks.

Duke Company Logo Index Problem Definition 1 Proposed Methods 2 Methods 3 Simulation Results 4

Duke Company Logo Basic Frame  The receiver calculates and assign backoff counter to senders.  The receiver monitors the time interval between ACK and the next RTS. It identifies misbehavior based on the deviation between this interval and the assigned backoff counter.

Duke Company Logo Illustration Graph DATA Sender S Receiver R CTS ACK(B) RTS R provides backoff B to S in ACK S uses B for backoff NewBackoff = f(backoff, ID, attempt)*CW RTS B

Duke Company Logo Penalty Scheme  Penalty is introduced in two time scale: per transmission and for the last w transmissions.

Duke Company Logo Penalty Scheme  For each transmission, a penalty proportional to the deviation D is added to the next backoff counter.  D = max (a*B exp – B act, 0) (misdiagnose)  For nodes keeps deviating more than a threshold T for the last W transmissions.  Further punishment such as refusal of accepting further packets.

Duke Company Logo Tradeoff Here  Choice of parameters as factor a, threshold T.  Misdiagnose may lead to unwanted performance degrading especially when refuse accepting further transmission or drop packets.

Duke Company Logo Index Problem Definition 1 Proposed Methods 2 Modifications 3 Simulation Result 4

Duke Company Logo Problems and Consequence  Problem:  Receiver may sense the channel under a different status than the sender.  Consequence:  Unjustified penalty to well behaved nodes.

Duke Company Logo Scenario  Classic Hidden Terminal Scenario D Y S M K X S reduces its backoff counter now, which will be considere d as misbehavi or later.

Duke Company Logo Solution  The receiver only classifies a slot to be busy when an overheard RTS/CTS has reserved the slot or a packet is being received.  Assumptions behind this: Deep carrier sensing. Carrier sensing range = 2 * Communication range

Duke Company Logo Index Problem Definition 1 Proposed Methods 2 Modifications 3 Simulation Results 4

Duke Throughput – no misbehavior Proposed Scheme Number of sender nodes Throughput (Kbps \ node)

Duke Persistent Misbehavior -Diagnosis Accuracy Correct Diagnosis Misdiagnosis Percentage of Misbehavior (of misbehaving node) Percentage

Duke Persistent Misbehavior- throughput Proposed Scheme Percentage of Misbehavior Throughput (Kbps) Avg. with proposed scheme Avg. with

Duke Click to edit company slogan.