Please use this identifier to cite or link to this item: https://idr.l1.nitk.ac.in/jspui/handle/123456789/8128
Full metadata record
DC FieldValueLanguage
dc.contributor.authorDoshi, C.K.
dc.contributor.authorSankaranarayanan, S.
dc.contributor.authorLakshman, V.B.
dc.contributor.authorChandrasekaran, K.
dc.date.accessioned2020-03-30T10:18:06Z-
dc.date.available2020-03-30T10:18:06Z-
dc.date.issued2017
dc.identifier.citationLecture Notes in Electrical Engineering, 2017, Vol.395, , pp.217-226en_US
dc.identifier.urihttp://idr.nitk.ac.in/jspui/handle/123456789/8128-
dc.description.abstractWireless ad hoc networks rely on the cooperation of participating nodes to undertake activities such as routing. Malicious nodes participating in the network may refuse to forward packets and instead discard them to mount a denial-of-service attack called a packet drop or blackhole attack. Blackhole attacks can however be easily detected using common networking tools like trace route as all packets passing through the malicious node is dropped. A gray hole attack on the other hand accomplishes denial of service by selectively dropping packets thus escaping detection. In this paper, a novel two player incomplete information extensive form game is used to model the defender and the attacker both of whom are considered rational agents in an effort to determine their optimal (equilibrium) strategies under different values for the parameters true detection rate, false alarm rate, packet value, packets forwarded per unit time, probability of the node being a gray hole, cost of exposure of the attacker and cost of not using a node for the defender. The respective equilibrium strategies if followed guarantee maximum possible protection for the defender and maximal possible damage potential for the attacker. � Springer India 2017.en_US
dc.titleGame theoretic modeling of gray hole attacks in wireless ad hoc networksen_US
dc.typeBook chapteren_US
Appears in Collections:2. Conference Papers

Files in This Item:
There are no files associated with this item.


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.