Game theoretic approach in multipath routing for tradeoff between routing security and performance

This paper minimizes the routing security risk while limiting the delivery ratio under an ideal value by 1) finding multiple paths between source and destination node; 2) employing the game theory to obtain the most reliability paths and further optimize shares allocation on these paths; 3) integrating secret sharing scheme, and achieving tradeoff between security risk and delivery ratio according to the tradeoff coefficient. Besides improving fault tolerance, it also improves security. In particular, it makes the eavesdropping attacks maximally difficult as the attackers would have to eavesdrop on all possible paths. Simulation evaluations validate our theoretical results and demonstrate how the routing protocol performs in terms of both security risk and performance.