1 Sustaining Cooperation in Multi-Hop Wireless Networks Ratul Mahajan, Maya Rodrig, David Wetherall and John Zahorjan University of Washington Presented.

Slides:



Advertisements
Similar presentations
1 Routing Protocols I. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Advertisements

Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
Incentive-Compatible Opportunistic Routing for Wireless Networks Fan Wu, Tingting Chen, Sheng Zhong (SUNY Buffalo) Li Erran Li Li Erran Li (Bell Labs)
Queuing Network Models for Delay Analysis of Multihop Wireless Ad Hoc Networks Nabhendra Bisnik and Alhussein Abouzeid Rensselaer Polytechnic Institute.
Modelling and Analysing of Security Protocol: Lecture 10 Anonymity: Systems.
Delay bounded Routing in Vehicular Ad-hoc Networks Antonios Skordylis Niki Trigoni MobiHoc 2008 Slides by Alex Papadimitriou.
GrooveSim: A Topography- Accurate Simulator for Geographic Routing in Vehicular Networks 簡緯民 P
1 Routing Techniques in Wireless Sensor networks: A Survey.
Sustaining Cooperation in Multi-Hop Wireless Networks Ratul Mahajan, Maya Rodrig, David Wetherall, John Zahorjan University of Washington.
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
CSE University of Washington Multipath Routing Protocols in AdHoc Networks.
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
NGMAST- WMS workshop17/09/2008, Cardiff, Wales, UK A Simulation Analysis of Routing Misbehaviour in Mobile Ad hoc Networks 2 nd International Conference.
Secure Routing and Intrusion Detection For Mobile Ad Hoc Networks Secure Routing and Intrusion Detection For Mobile Ad Hoc Networks Anand Patwardhan Jim.
Can you fool me? Towards automatically checking protocol gullibility Milan StanojevićRatul Mahajan Todd MillsteinMadanlal Musuvathi UCLAMicrosoft Research.
More routing protocols Alec Woo June 18 th, 2002.
Impact of Radio Irregularity on Wireless Sensor Networks
Taming the Underlying Challenges of Reliable Multihop Routing in Sensor Networks.
Opportunistic Routing in Multi-hop Wireless Networks Sanjit Biswas and Robert Morris MIT CSAIL
Adaptive Self-Configuring Sensor Network Topologies ns-2 simulation & performance analysis Zhenghua Fu Ben Greenstein Petros Zerfos.
SybilCast: Broadcast on the Open Airwaves SETH GILBERT, CHAODONG ZHENG National University of Singapore.
ExOR: Opportunistic Multi-Hop Routing for Wireless Networks Sigcomm 2005 Sanjit Biswas and Robert Morris MIT Computer Science and Artificial Intelligence.
DHCP for Multi-hop Wireless Ad-Hoc Networks Presented by William List.
Effect of Intrusion Detection on Reliability Jin-Hee Cho, Member, IEEE, Ing-Ray Chen, Member, IEEE, and Phu-Gui Feng IEEE TRANSACTIONS ON RELIABILITY,
A Vehicular Ad Hoc Networks Intrusion Detection System Based on BUSNet.
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
IDRM: Inter-Domain Routing Protocol for Mobile Ad Hoc Networks C.-K. Chau, J. Crowcroft, K.-W. Lee, S. H.Y. Wong.
Using Directional Antennas to Prevent Wormhole Attacks Lingxuan HuDavid Evans Department of Computer Science University of Virginia.
A High-Throughput Path Metric for Multi-Hop Wireless Routing Presenter: Gregory Filpus Slides borrowed and modified from: Douglas S. J. De Couto MIT CSAIL.
Wireless Sensor Networks COE 499 Energy Aware Routing
MARCH : A Medium Access Control Protocol For Multihop Wireless Ad Hoc Networks 성 백 동
A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S. J. De Couto MIT CSAIL (LCS) Daniel Aguayo, John Bicket, and Robert Morris
Link Estimation, CTP and MultiHopLQI. Learning Objectives Understand the motivation of link estimation protocols – the time varying nature of a wireless.
1 Objective and Secure Reputation-Based Incentive Scheme for Ad-Hoc Networks Dapeng Oliver Wu Electrical and Computer Engineering University of Florida.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
Encouraging Cooperation in Multi-Hop Wireless Networks Ratul Mahajan, Maya Rodrig, David Wetherall and John Zahorjan University of Washington, June 2004.
A High-Throughput Path Metric for Multi- Hop Wireless Routing Douglas S. J. De Couto, Daniel Aguayo, John Bicket, Robert Morris MIT Computer Science and.
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
BLACK HOLE ATTACK AND ITS COUNTER MEASURES IN AODV ROUTING PROTOCOL Varsha Patidar, Rakesh Verma Mengfei Peng.
A High-Throughput Path Metric for Multi-Hop Wireless Routing Douglas S. J. De Couto, Daniel Aguayo, John Bicket, Robert Morris MIT CSAIL Presented by Valentin.
MANET: Introduction Reference: “Mobile Ad hoc Networking (MANET): Routing Protocol Performance Issues and Evaluation Considerations”; S. Corson and J.
Multi-channel Wireless Sensor Network MAC protocol based on dynamic route.
Mitigating Routing Misbehavior in Mobile Ad Hoc Networks Sergio Marti, T.J. Giuli, Kevin.
KAIS T SIGF : A Family of Configurable, Secure Routing Protocols for WSNs Sep. 20, 2007 Presented by Kim, Chano Brian Blum, Tian He, Sang Son, Jack Stankovic.
A new Cooperative Strategy for Deafness Prevention in Directional Ad Hoc Networks Andrea Munari, Francesco Rossetto, and Michele Zorzi University of Padova,
Computer Science Using Directional Antennas to Prevent Wormhole Attacks Stephen Thomas Acknowledgement: Portions of this presentation have been donated.
NDSS 2004Hu and Evans, UVa1 Using Directional Antennas to Prevent Wormhole Attacks Lingxuan Hu and David Evans [lingxuan, Department.
2/14/2016  A. Orda, A. Segall, 1 Queueing Networks M nodes external arrival rate (Poisson) service rate in each node (exponential) upon service completion.
1 An Interleaved Hop-by-Hop Authentication Scheme for Filtering of Injected False Data in Sensor Networks Sencun Zhu, Sanjeev Setia, Sushil Jajodia, Peng.
1 Routing security against Threat models CSCI 5931 Wireless & Sensor Networks CSCI 5931 Wireless & Sensor Networks Darshan Chipade.
DRAND: Distributed Randomized TDMA Scheduling for Wireless Ad-Hoc Networks Injong Rhee (with Ajit Warrier, Jeongki Min, Lisong Xu) Department of Computer.
A Key Management Scheme for Distributed Sensor Networks Laurent Eschaenauer and Virgil D. Gligor.
Performance Improvement in Ad hoc Wireless Networks with Consideration to Packet Duplication Takayuki Yamamoto Department of Informatics and Mathematical.
Trading Structure for Randomness in Wireless Opportunistic Routing Szymon Chachulski, Michael Jennings, Sachin Katti and Dina Katabi MIT CSAIL SIGCOMM.
Vehicle Traffic Simulator and Intersection Collision Warning System Wireless repeater Rebroadcast received packets (once) Packet transmission behavior.
On Mobile Sink Node for Target Tracking in Wireless Sensor Networks Thanh Hai Trinh and Hee Yong Youn Pervasive Computing and Communications Workshops(PerComW'07)
KAIS T Location-Aided Flooding: An Energy-Efficient Data Dissemination Protocol for Wireless Sensor Networks Harshavardhan Sabbineni and Krishnendu Chakrabarty.
Frame counter: Achieving Accurate and Real-Time Link Estimation in Low Power Wireless Sensor Networks Daibo Liu, Zhichao Cao, Mengshu Hou and Yi Zhang.
Enforce Collaboration in Mobile Ad Hoc Network Ning Jiang School of EECS University of Central Florida
Routing Metrics for Wireless Mesh Networks
Routing Metrics for Wireless Mesh Networks
Controlling the Cost of Reliability in Peer-to-Peer Overlays
Wireless Mesh Networks
Distributed Energy Efficient Clustering (DEEC) Routing Protocol
Networks and Communication Systems Department
Routing Metrics for Wireless Mesh Networks
A High-Throughput Path Metric for Multi-Hop Wireless Routing
ITIS 6010/8010 Wireless Network Security
Presentation transcript:

1 Sustaining Cooperation in Multi-Hop Wireless Networks Ratul Mahajan, Maya Rodrig, David Wetherall and John Zahorjan University of Washington Presented by: Prasad (Slides in courtesy of: Bin Ni, University of South Carolina)

2 Key words Wireless network - characteristic of broadcasting Multi-Hop - a packet may be forwarded by multi nodes Free-rider and Cooperation - less contribution to the group - consume more than their fair share of a resource

3 Topics Problem Definition The power of Anonymity The Catch Protocol Experimental Evaluation Simulation and Analysis

4 Problem Definition B can avoid these forwarding loads in two distinct ways: - forwarding level : drop packets for forwarding from A - routing level : refuse to send routing messages that acknowledge connectivity with A

5 Assumptions Most nodes are cooperative in that they run the protocol defined; Omni-directional radio transmitters and antennas; Nodes have unforgeable ID.

6 Power of Anonymity The goal is to use cooperative nodes to monitor for the presence of free-riders and to isolate them. Two problems - distinguish them - signal all of the free-rider’s neighbor

7 Anonymous Challenges and Watchdogs A watchdog is used; Anonymous challenge message (ACM) sub-protocol is defined; Gateway regularly but unpredictably sends an anonymous challenge to the testee to rebroadcast.

8 Anonymous Neighbor Verification Once free-rider is detected, other testers must also be informed; Challenge: the only path must be via the testee; Anonymous neighbor verification (ANV) sub-protocol is defined;

9 Anonymous Neighbor Verification ANV open - all the testers become aware of each other via the testee; - each tester sends a cryptographic hash of a randomly generated token; - testee rebroadcasts, other testers take note; ANV close - each tester releases its token to the testee if it behaved well; - the testee broadcasts the token; - testers compare the received token;

10 Catch protocol Epoch-Start - testee broadcasts packet that includes its ID and epoch ID; - nodes that receives the packets participate as testers for this epoch; Packet Forwarding and Accounting - testers run a watchdog to count the number that are correctly relayed; - testers run the ACM protocol to estimate true connectivity; Anonymous Neighbor Verification Open - tester sends an anonymous packet containing a nonce and a hashed token to the testee for rebroadcast

11 Catch protocol Tester Information Exchange - tester compares the fraction of data packets and challenges; - one-bit sign:0 for challenges and 1 for data packets; - send the sign bit and ID to testee for rebroadcasting ; Epoch Evaluation and ANV close - each testers determine whether the testee behaviors correctly - this is done with a pair of statistical test - both tests pass, the tester releases its token; Isolation Decision

12 Protocol flow: packets exchange between a tester and a cooperative (left side) or free-riding (right side) testee.

13 Evaluation 15 PCs equipped with b Operating in the ad-hoc mode Diameter is between 3 and 5 hops Length of one epoch is set to one minute There are 15 anonymous ACM messages per epoch

14 Evaluation Three nodes: the second one acts as free-rider The number of epochs required to detect free- riders in the testbed versus the fraction of packets a free-rider dropped. Each point is the average of 10 experiments.

15 Evaluation Three nodes are free- riders that drop all the packets ; Nodes select only cooperative nodes as file servers; It shows that the cooperative nodes successfully shut up the free-riders;

16 Evaluation We ran two five hour experiments in which all nodes were cooperative. Each node repeatedly downloaded les from randomly chosen servers. We observed no false positives in the first experiment and a single false positive in the second.

17 Evaluation cheater that uses signal strength to differentiate among its neighbors. For example, when 20% (3) of the nodes cheat, that probability is lowered from about 60% to about 10% when using the highest quality links.

18 Simulation and Analysis the impact of high wireless loss rates on Catch is quite small. Catch seems to be robust, working well in both high and low density networks.

19 Future work Collusion of the free riders Taking specific steps in Catch to discourage signal strength based cheats

20 Thanks! Any question?