Game Theory Used for Reliable Routing Modeling in Wireless Sensor Networks

Abstract

Due to the wide application fields, many people research Wireless Sensor Networks(WSNs). Currently, more and more researchers focus on the existence of selfish nodes which do not cooperate in routing and forwarding. Traditional methods need too much resource or do not adapt to menace from inner of network. In this paper, we propose a reliable routing model against selfish nodes. Game theory is used in our model to find the balance between the reliability and resource limitation. In simulation, we introduce our model into DSR routing as DSR-G. The simulation result shows the selfish nodes has less infections in DSR-G than DSR.