Modeling Security and Cooperation in Wireless Networks Using Game Theory

Authors

Charles A. K. Kamhoua, Florida International UniversityFollow

Document Type

Dissertation

Major/Program

Electrical Engineering

First Advisor's Name

Niki Pissinou

First Advisor's Committee Title

Co-Committee Chair

Second Advisor's Name

Kia Makki

Second Advisor's Committee Title

Co-Committee Chair

Third Advisor's Name

Norman D. H. Munroe

Fourth Advisor's Name

Kang K. Yen

Fifth Advisor's Name

Deng Pan

Keywords

Wireless network, Ad hoc network, Wireless sensor network, Telecommunication, Cooperation, Game theory, Evolutionary game theory, Network security, Trust, Prisoner's dilemma game

Date of Defense

5-27-2011

Abstract

This research involves the design, development, and theoretical demonstration of models resulting in integrated misbehavior resolution protocols for ad hoc networked devices. Game theory was used to analyze strategic interaction among independent devices with conflicting interests. Packet forwarding at the routing layer of autonomous ad hoc networks was investigated. Unlike existing reputation based or payment schemes, this model is based on repeated interactions. To enforce cooperation, a community enforcement mechanism was used, whereby selfish nodes that drop packets were punished not only by the victim, but also by all nodes in the network. Then, a stochastic packet forwarding game strategy was introduced. Our solution relaxed the uniform traffic demand that was pervasive in other works. To address the concerns of imperfect private monitoring in resource aware ad hoc networks, a belief-free equilibrium scheme was developed that reduces the impact of noise in cooperation. This scheme also eliminated the need to infer the private history of other nodes. Moreover, it simplified the computation of an optimal strategy. The belief-free approach reduced the node overhead and was easily tractable. Hence it made the system operation feasible. Motivated by the versatile nature of evolutionary game theory, the assumption of a rational node is relaxed, leading to the development of a framework for mitigating routing selfishness and misbehavior in Multi hop networks. This is accomplished by setting nodes to play a fixed strategy rather than independently choosing a rational strategy. A range of simulations was carried out that showed improved cooperation between selfish nodes when compared to older results. Cooperation among ad hoc nodes can also protect a network from malicious attacks. In the absence of a central trusted entity, many security mechanisms and privacy protections require cooperation among ad hoc nodes to protect a network from malicious attacks. Therefore, using game theory and evolutionary game theory, a mathematical framework has been developed that explores trust mechanisms to achieve security in the network. This framework is one of the first steps towards the synthesis of an integrated solution that demonstrates that security solely depends on the initial trust level that nodes have for each other.

Identifier

FI11072602

Recommended Citation

Kamhoua, Charles A. K., "Modeling Security and Cooperation in Wireless Networks Using Game Theory" (2011). FIU Electronic Theses and Dissertations. 436.
https://digitalcommons.fiu.edu/etd/436