A Novel Coalitional Game Model for Security Issues in Wireless Networks

—In this paper, we propose a novel coalitional game model for security issues in wireless networks. The model can be applied to not only mobile ad hoc networks but also wireless sensor networks. We define a new throughput characteristic function, on the basis of which nodes are enforced to cooperate and form coalitions. This function implies the maximal throughput and the most reliable traffic that a coalition can achieve. The fair payoff share inside the coalition is given by Shapley Value after proving the feasibility of this method. Then a set of game rules is presented to establish a threatening mechanism to all players. We then describe the coalition formation procedure and explain how to integrate this game theoretic model with available wireless routing protocols. Finally, theoretical analysis is conducted to illustrate the convergence situation and justify the correctness of the formulation.

• Type: Conference
• Year: 2008
• Where: GLOBECOM
• Authors: Xiaoqi Li, Michael R. Lyu
• Keywords: GLOBECOM 2008, Mobile Ad Hoc Networks, Telecommunications , Throughput Characteristic Function, Wireless Sensor Networks