Differential Game Model with Coupling Constraint for Routing in Ad Hoc Networks

This paper establishes a differential game model with coupling constraint for routing in ad hoc networks. We propose two definitions: coupling constraint equilibrium set (CCESet) and coupling constraint equilibrium solution (CCES), and design an iterative algorithm. The simulation results show the effect on the payoff values for different coupling constraint, and the effect on strategies for different initial value under the same coupling constraint. In the end, we compute the corresponding CCESet and CCES according to the simulation results, which show that CCES is better than the feedback Nash equilibrium strategies without coupling constraint.