By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhang Li ; Coll. of Comput. Sci. & Technol., Henan Polytech. Univ., Jiaozuo, China ; Zou Jin

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.

Published in:

Future Computer Sciences and Application (ICFCSA), 2011 International Conference on

Date of Conference:

18-19 June 2011