Enforce Collaboration in Mobile Ad Hoc Network Ning Jiang School of EECS University of Central Florida

Slides:



Advertisements
Similar presentations
1 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks By Lei Chen.
Advertisements

Security in Mobile Ad Hoc Networks
Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
DSR The Dynamic Source Routing Protocol Students: Mirko Gilioli Mohammed El Allali.
Mitigating Routing Misbehavior in Mobile Ad Hoc Networks By Sergio Marti, T.J. Giuli, Kevin Lai, & Mary Baker Department of Computer Science Stanford University.
Improving TCP Performance over Mobile Ad Hoc Networks by Exploiting Cross- Layer Information Awareness Xin Yu Department Of Computer Science New York University,
Packet Leashes: Defense Against Wormhole Attacks Authors: Yih-Chun Hu (CMU), Adrian Perrig (CMU), David Johnson (Rice)
Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.
CSE University of Washington Multipath Routing Protocols in AdHoc Networks.
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.
Jorge Hortelano, Juan Carlos Ruiz, Pietro Manzoni
Secure communication in cellular and ad hoc environments Bharat Bhargava Department of Computer Sciences, Purdue University This is supported.
An Authentication Service Based on Trust and Clustering in Wireless Ad Hoc Networks: Description and Security Evaluation Edith C.H. Ngai and Michael R.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
Mitigating routing misbehavior in ad hoc networks Mary Baker Departments of Computer Science and.
Trust Level Based Self-Organized Routing Protocol for Secure Ad Hoc Networks Li Xiaoqi, GiGi 12/3/2002.
An Architecture for Dynamic Trust Monitoring in Mobile Networks Onolaja Olufunmilola, Rami Bahsoon, Georgios Theodoropoulos School of Computer Science.
Motivating Corporation in Mobile Ad Hoc Networks: A Step Forward
Security of wireless ad-hoc networks. Outline Properties of Ad-Hoc network Security Challenges MANET vs. Traditional Routing Why traditional routing protocols.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Mobile Ad-hoc Networks -- Overview and a case study Yinzhe Yu Oct. 8, 2003.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Ad Hoc Wireless Routing COS 461: Computer Networks
Trust Management in Mobile Ad Hoc Networks Using a Scalable Maturity-Based Model Authors: Pedro B. Velloso, Rafael P. Laufer, Daniel de O. Cunha, Otto.
Nodes Bearing Grudges: Towards Routing Security, Fairness, and Robustness in Mobile Ad Hoc Networks Sonja Buchegger Jean-Yves Le Boudec.
Itrat Rasool Quadri ST ID COE-543 Wireless and Mobile Networks
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
1 Trust Mechanisms in Ad Hoc Networks Azar Rahimi Dehaghani Lei Hu Trust and Security Case Study 2.
VIRTUAL ROUTER Kien A. Hua Data Systems Lab School of EECS University of Central Florida.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
GZ06 : Mobile and Adaptive Systems A Secure On-Demand Routing Protocol for Ad Hoc Networks Allan HUNT Wandao PUNYAPORN Yong CHENG Tingting OUYANG.
A Security-Aware Routing Protocol for Wireless Ad Hoc Networks
Routing Protocols of On- Demand Dynamic Source Routing (DSR) Ad-Hoc On-Demand Distance Vector (AODV)
Dynamic Source Routing in ad hoc wireless networks Alexander Stojanovic IST Lisabon 1.
Cache Management of Dynamic Source Routing for Fault Tolerance in Mobile Ad Hoc Networks.
1 Objective and Secure Reputation-Based Incentive Scheme for Ad-Hoc Networks Dapeng Oliver Wu Electrical and Computer Engineering University of Florida.
Dynamic Source Routing (DSR) Sandeep Gupta M.Tech - WCC.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Security in Ad Hoc Networks. What is an Ad hoc network? “…a collection of wireless mobile hosts forming a temporary network without the aid of any established.
WIRELESS AD-HOC NETWORKS Dr. Razi Iqbal Lecture 6.
DSR: Introduction Reference: D. B. Johnson, D. A. Maltz, Y.-C. Hu, and J. G. Jetcheva, “The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks,”
BLACK HOLE ATTACK AND ITS COUNTER MEASURES IN AODV ROUTING PROTOCOL Varsha Patidar, Rakesh Verma Mengfei Peng.
Ad Hoc Network.
Mitigating Routing Misbehavior in Mobile Ad Hoc Networks Sergio Marti, T.J. Giuli, Kevin.
Maximizing Lifetime per Unit Cost in Wireless Sensor Networks
Security and Cooperation in Ad Hoc Networks Gaia Maselli IIT - CNR
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
A new Cooperative Strategy for Deafness Prevention in Directional Ad Hoc Networks Andrea Munari, Francesco Rossetto, and Michele Zorzi University of Padova,
Data Transmission Mechanism for Multiple Gateway System Xuan He, Yuanchen Ma and Mika Mizutani, 6th International Conference on New Trends in Information.
SHORT: Self-Healing and Optimizing Routing Techniques for Mobile Ad Hoc Networks Presenter: Sheng-Shih Wang October 30, 2003 Chao Gui and Prasant Mohapatra.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
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)
Advisor: Prof. Han-Chieh Chao Student: Joe Chen Date: 2011/06/07.
Introduction Wireless devices offering IP connectivity
Recommendation Based Trust Model with an Effective Defense Scheme for ManetS Adeela Huma 02/02/2017.
Packet Leashes: Defense Against Wormhole Attacks
Mobicom ‘99 Per Johansson, Tony Larsson, Nicklas Hedman
A comparison of Ad-Hoc Routing Protocols
ODMRP Enhancement.
CSE 4340/5349 Mobile Systems Engineering
Net 435: Wireless sensor network (WSN)
Mobile and Wireless Networking
by Saltanat Mashirova & Afshin Mahini
Wenjia Li Anupam Joshi Tim Finin May 18th, 2010
Authors: Ing-Ray Chen; Yating Wang Present by: Kaiqun Fu
ITIS 6010/8010 Wireless Network Security
Authors: Chun-Ta Li and Min-Shiang Hwang Reporter: Chun-Ta Li (李俊達)
Performance Analysis of the CONFIDANT Protocol
Efficient flooding with Passive clustering (PC) in Ad Hoc Networks
Presentation transcript:

Enforce Collaboration in Mobile Ad Hoc Network Ning Jiang School of EECS University of Central Florida

Outline Mobile Ad Hoc Network Existing Techniques DSG Approach Conclusion

Mobile Ad Hoc Network A collection of devices equipped with wireless communications and networking capability Devices heterogeneity Palm, laptop, mobile phone, etc. Infrastructureless Self-organizing and adaptive Nodes relay data packets for each other Energy critical

Mobile Ad Hoc Network

Mobile Ad Hoc Network Applications In the office Traveling Wireless home network Location/context based services Battlefield

Collaboration in Mobile Ad Hoc Network Routing Dynamic Source Routing Routing Request Routing Reply Packet forwarding

Detecting Selfish Nodes Marti et al. ACM MOBICOM, 2001 Watchdog Each node in promiscuous mode Each node verifies whether its downstream node forwards packets Packet loss threshold Inform the source node of the misbehaving node Path Rater Nodes select paths without selfish nodes

Drawbacks of the Approach No punishment to selfish nodes Each packet should be monitored Slow propagation of warning information Selfish nodes have no chance to rejoin

Packet Purse Model Hubaux et al. IEEE/ACM Workshop on Mobile Ad Hoc Networking and Computing Reward the packet forwarding service The originator loads each packet with a number of “nuggets” Each forwarding node acquires one or more nuggets Packets with insufficient nuggets are discarded Selfish nodes are detected and fined Relies on a temper resistant security module Cryptographic techniques are applied to prevent abuse

Packet Purse Model Advantages Secure Nodes are motivated to collaborate Selfish nodes are punished Node enjoin enabled Disadvantages Still monitor each packet Generally, nodes have no knowledge of selfish nodes Cryptographic overhead

CONFIDANT Protocol Birds and Mobile Ad Hoc Network Sucker birds Cheating birds Grudger birds Interesting observation: starting with a majority of cheating birds, grudger birds finally win over Can Mobile Ad Hoc nodes also act like grudger birds? – Yes!!

CONFIDANT Protocol Sonja et al. MOBIHOC 2002 Monitor Neighbor watch Reputation System Evaluates selfish behaviors

CONFIDANT Protocol Trust Manager Sends alarms to “friend” nodes A friend list Checks the trustiness of incoming alarms Several levels of trustiness Maintains a trust table of nodes Path Manager Path ranking and management

CONFIDANT Protocol Drawbacks Only informs friends about the malicious nodes Control overhead Need to manage complex trust relationships Rejoin not addressed

DSG Approach Main idea Let the cheating bird inform others! Assumptions Omni-directional antenna Security Module (smart card) There are TCP traffics

DSG Approach Finite State Model Normal Detecting Penalized Rejoin States stored in the security module

DSG Approach – Detecting Mechanism Initially all nodes in Normal state Source monitors its TCP traffic No acknowledgement -> Detecting immediate downstream node Two possibilities: Neighboring node forwards packets -> detecting propagate Neighboring node discards packets -> Marked as penalized, does not forward source node!

DSG Approach – Selfish Node Avoidance Selfish nodes are recognized and their states switched to penalized Security Module marks DSR Routing packets Penalized bit Source node picks the best path

DSG Approach – Node Rejoin Selfish nodes switch to rejoin state after certain timeout A rejoining node broadcasts to inform its neighbors Each neighboring node monitors the target rejoining node The node is switched back to Normal state if it forwards enough packets

DSG Approach - Analysis On-demand selfish node detection Saves energy Instant selfish node avoidance Minimum control packets transmission No need to inform nodes about a selfish node Node rejoin supported

DSG Approach - FSM Penalize packet received Normal Rejoin Detecting Penalized Too many packets lost, or detecting packet received Enough packets forwarded, or timeout Penalize packet received timeout Random time, or selfish node detected

Experiment Preliminary experimental results illustrate a 60% increase in throughput under 30% malicious nodes configuration Most of the TCP sessions closed

Conclusion Collaboration is vital to the good performance of Mobile Ad Hoc network Existing techniques cannot solve the problem well enough DSG Approach incurs minimum overhead, requires minimum energy consumption