| Ad hoc networks is a wireless self-organize network with dynamic topology, and doesnot rely on infrastructure. Because it can deployed quickly and its flexible, Ad hocnetworks have broad aspects in the field of military and civilian communications. Ad hocuses distributed management, the resource for the nodes, like energy, memory, etc. arelimited. In order to save the resource, the autonomous terminal may behave selfishly.Non-cooperative behavior of a few nodes can seriously degrade the performance of thenetwork and threat the network security. Therefor, we need a mechanism to stimulate nodesto cooperation. In this paper, we discuss the problems of two aspects:(1) using statisticmethods to detect the selfish nodes and misbehaving nodes;(2) applying game theory tomodel the interactions between two Ad hoc nodes and design cooperation mechanism.The cooperation mechanism for Ad hoc networks can be divide into two categories:credit-based exchange system and reputation-based system. For the credit-basedmechanism, we design a Selfish Node Detection System(SNDS) based on CheatingDetection System(CDS). SNDS constructs session topology according to the reports whichnodes submitted to it. In order to overcome the limit of the routing protocol, SNDS dividesession topology into session lists set. SNDS uses credit to ensure the fairness of thenetwork, uses statistic methods to detection the selfish nodes and misbehaving nodes. Forthe reputation-based mechanism, this paper uses repeated game to model the interactionsof nodes in Ad hoc networks, use Bellman equations to construct Sequential Equilibriumstrategy. Compared with the Sequential Equilibrium, proposed by Zhu Ji, this strategy donot use trigger mechanism, improves the cooperation rate for the networks with imperfectinformation. Simulations compared the performance of the two Sequential Equilibrium. The results indicates that, the mechanism proposed by this paper not only improves theaverage payoff, but also has a good adaptability. |
PDF Full Text Request