Show simple item record

dc.contributor.advisorThomas, Johnson
dc.contributor.authorHarrington, Patrick D.
dc.date.accessioned2013-11-26T08:21:41Z
dc.date.available2013-11-26T08:21:41Z
dc.date.issued2010-07
dc.identifier.urihttps://hdl.handle.net/11244/6490
dc.description.abstractScope and Method of Study:
dc.description.abstractOur work puts forth a game theoretic global security mechanism to optimize security in a large heterogeneous network consisting of autonomous devices. Our work is applicable to a network that includes various computing devices such as PCs, cell phones, sensors, and control systems. Constraint satisfaction is used to fulfill the requirements of the differing computers in the network. Security metrics are used to quantify network security in a meaningful way. Attack tree analysis of the quantified security measurements is performed for decision making to maximize security by altering links that form the network. Coalitions of the computers forming the network are used to improve efficiency, as well as give a broader and greater overall security than would be possible in their absence. Side payments are used to induce a computer to move beyond its selfish motivations to benefit another computer. In keeping with noncooperative game rules, costs to form links are imposed only on the initiator of the link.
dc.description.abstractFindings and Conclusions:
dc.description.abstractOur solution is presented as a noncooperative weighted potential game using pure or mixed strategies. Findings showed that our game theory model of optimization improved overall security for heterogeneous networks, and demonstrated the viability of quantitative security analysis using metrics. Our game theory model of side payments and coalitions increased security by 10% in our experiments. Side payments more than doubled convergence time to optimal network security; however, side payments that were twice as effective in terms of security improvement reduced convergence time by 50%. Our game theory model of mixed strategies showed longer convergence time but overall improved security versus our pure strategy model. Findings also demonstrated that our game theory model of optimization improved security for networks of varying size. Through these solutions, our work presents a novel optimization technique that improves overall security for a heterogeneous network.
dc.formatapplication/pdf
dc.languageen_US
dc.rightsCopyright is held by the author who has granted the Oklahoma State University Library the non-exclusive right to share this material in its institutional repository. Contact Digital Library Services at lib-dls@okstate.edu or 405-744-9161 for the permission policy on the use, reproduction or distribution of this material.
dc.titleUsing noncooperative potential games to improve network security
dc.contributor.committeeMemberHedrick, George
dc.contributor.committeeMemberPark, Nohpill
dc.contributor.committeeMemberKletke, Marilyn
osu.filenameHarrington_okstate_0664D_11045.pdf
osu.accesstypeOpen Access
dc.type.genreDissertation
dc.type.materialText
dc.subject.keywordsgame theory
dc.subject.keywordsnetwork security
dc.subject.keywordspotential games
dc.subject.keywordssecurity metrics
thesis.degree.disciplineComputer Science
thesis.degree.grantorOklahoma State University


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record