A Game Theorem-Based Approach to Avoid Malicious Nodes in Mobile Ad hoc Networks

摘要

In ubiquitous context of mobile ad hoc networks, all network functions must be performed by the nodes themselves. Whereas the bandwidth allocated per node decreases with the number of nodes increase, some nodes may be interested in higher bandwidth, in this case, they may intend not to relay packets for other nodes. If most nodes find it benefit for themselves, their sequacious actions may break down the whole network. We address this as malicious nodes problem. In this paper, our approach is based on game theory with noncooperation, i.e., there are conflicts for which the rules of a game do not specify any agreement or cooperation. We establish a simple malicious node game that models the bandwidth payoffs for the network and the nodes, define contribution rate (CR) and attack rate (AR) for the two strategies of each node, and then we show Nash equilibria exist in all-node strategy set Finally we propose an algorithm that converges to a Nash equilibrium.