Link to the University of Pittsburgh Homepage
Link to the University Library System Homepage Link to the Contact Us Form

On Detection Mechanisms and Their Performance for Packet Dropping Attack in Ad Hoc Networks

Anusas-amornkul, Tanapat (2008) On Detection Mechanisms and Their Performance for Packet Dropping Attack in Ad Hoc Networks. Doctoral Dissertation, University of Pittsburgh. (Unpublished)

[img]
Preview
PDF
Primary Text

Download (1MB) | Preview

Abstract

Ad hoc networking has received considerable attention in the research community for seamless communications without an existing infrastructure network. However, such networks are not designed with security protection in mind and they are prone to several security attacks. One such simple attack is the packet dropping attack, where a malicious node drops all data packets, while participating normally in routing information exchange. This attack is easy to deploy and can significantly reduce the throughput in ad hoc networks.In this dissertation, we study this problem through analysis and simulation. The packet dropping attack can be a result of the behavior of a selfish node or pernicious nodes that launch blackhole or a wormhole attacks. We are only interested in detecting this attack but not the causes of the attack. In this dissertation, for simple static ad hoc networks, analysis of the throughput drop due to this attack along with its improvement when mitigated are presented. A watchdog and a newly proposed "cop" detection mechanisms are studied for mitigating the throughput degradation after detection of the attack. The watchdog mechanism is a detection mechanism that has to be typically implemented in every node in the network. The cop detection mechanism is similar to the watchdog mechanism but only a few nodes opportunistically detect malicious nodes instead of all nodes performing this function. For multiple flows in static and mobile ad hoc networks, simulations are used to study and compare both mechanisms. The study shows that the cop mechanism can improve the throughput of the network while reducing the detection load and complexity for other nodes.


Share

Citation/Export:
Social Networking:
Share |

Details

Item Type: University of Pittsburgh ETD
Status: Unpublished
Creators/Authors:
CreatorsEmailPitt UsernameORCID
Anusas-amornkul, Tanapattanapat@mail.sis.pitt.edu
ETD Committee:
TitleMemberEmail AddressPitt UsernameORCID
Committee ChairKrishnamurthy, Prashantprashant@mail.sis.pitt.eduPRASHK
Committee MemberMosse, Danielmosse@cs.pitt.eduMOSSE
Committee MemberTipper, Davidtipper@tele.pitt.eduDTIPPER
Committee MemberJoshi, Jamesjjoshi@mail.sis.pitt.eduJJOSHI
Committee MemberThompson, Richardrat@tele.pitt.eduRTHOMPSO
Date: 11 September 2008
Date Type: Completion
Defense Date: 24 July 2008
Approval Date: 11 September 2008
Submission Date: 28 August 2008
Access Restriction: No restriction; Release the ETD for access worldwide immediately.
Institution: University of Pittsburgh
Schools and Programs: School of Information Sciences > Information Science
Degree: PhD - Doctor of Philosophy
Thesis Type: Doctoral Dissertation
Refereed: Yes
Uncontrolled Keywords: ad hoc network; Cooperative; packet dropping attack
Other ID: http://etd.library.pitt.edu/ETD/available/etd-08282008-130308/, etd-08282008-130308
Date Deposited: 10 Nov 2011 20:01
Last Modified: 15 Nov 2016 13:49
URI: http://d-scholarship.pitt.edu/id/eprint/9285

Metrics

Monthly Views for the past 3 years

Plum Analytics


Actions (login required)

View Item View Item