A Wireless Ad Hoc Network Congestion Control Algorithm Based on Game Theory

Network congestion has a severe impact on the throughput, routing and lifespan, etc. of a network. This paper, starting from the traffic flow of a wireless Ad Hoc network, put forwards the congestion control model after considering from the perspective game theory the communication of nodes and the neighboring links. Based on this model, it also raises congestion and the optimization algorithm CCAD. CCAD, with the end-to-end traffic flow as its study object and adopting rate-based end-to-end congestion control strategy, tried to avoid congestion in links and network. A congestion control mechanism is adopted at the nodes in this course and the routing congestion control is also completed there. To adapt to the wireless Ad Hoc network parameter and the uncertain and time-varying topology structure, self-adapting optimization strategy is used. The simulated experiment result shows that the proposed congestion control model and algorithm fit in with the properties of mobile Ad Hoc network and can rapidly respond to the network congestion changes so that it can stabilize the flow rate and make the congestion avoided.