A QoS Routing Algorithm Based on Game Theory for Ad Hoc Networks Having Small-World Characteristics

With the development of network theory, the new science of complex networks has brought new ideas for the ad hoc network research. The small-world network has a high clustering coefficient and small average path length characteristics. This paper designs a multi-constraint QoS routing algorithm of ad hoc network having small-world characteristics. It is aimed at the dynamic environment of ad hoc network and link state information is uncertain, even ambiguous. Through Game analysis, this paper looks for the NP-complete problem of optimal or sub-optimal solution and enables users and network providers to meet the utility of Nash Equilibrium Pareto optimal. The simulation shows that the algorithm is feasible and effective.