Research On Selfish Behavior Of Nodes In Mobile Ad Hoc Networks

The self-organization of the wireless Ad Hoc network is a big change in the mobile network, and its self-organization also brings a series of security problems, among which selfish node attack is the main one. In order to solve the selfish attack behavior of the node, we mainly uses the reputation mechanism. At present, the reputation mechanism in the application aspect exists the following two questions: (1) Due to the influence of link stability, data packets may collide or be lost, resulting in misjudgment of node reputation value. (2) There is also a "collusion"phenomenon in ad hoc networks. Two selfish nodes raise the reputation value to cheat other nodes and make other nodes misjudge them as normal nodes.In order to solve the problem of selfish behavior of mobile ad hoc network nodes and make up for the defect of reputation mechanism, this paper proposes a high accuracy reputation mechanism based on the reputation ranking of nodes. First of all, the paper introduces the characteristics of mobile ad hoc network and the implementation principle of AODV routing protocol. Then, the condition of the link between the nodes in the dynamic network and the condition of reliable transmission of the packet on the link are modeled and analyzed. Based on the above analysis, the key parameters to guarantee the link validity are proposed: link duration, congestion probability factor. Then, a reputation evaluation mechanism (Pro-NR) is proposed to solve the collusion of nodes with node ranking. And the stability and reliability of the reputation mechanism are improved by combining the duration of link and the possibility of node congestion in dynamic network. Finally, the reputation mechanism is programmed by using NS2 network simulation platform. The data of the network are simulated and compared with the CONFIDANT mechanism. The simulation results show that the proposed mechanism can accurately evaluate the reputation of nodes.