Congestion Control And Ant Colony QoS Routing Algorithm In Regional Communication Network

Future warfare will pay more attention to Information Technology. Regional Communication Network (RCN), an important part of the Information Warfare, is gradually becoming the focus of armies. This thesis mainly discusses two topics on RCN: The security of congestion control mechanism & QoS Routing Algorithm.In Chapter 2, the security of congestion control mechanism is investigated through game theory. First, by analyzing the disadvantages existing in present game theory models used in congestion control, a step-to-step game theory model which contains malicious players is developed. The model can well describe the counter relationship between us and the enemy. Then, give the iterative numerical methodology and the analytical methodology to solve it, and get the solution under the Nash on FIFO, GPS and DWS scheduling techniques. At last, the security of all scheduling techniques is analysed.In Chapter 3, by considering the characteristics of RCN, the paper develops a BDACRA (Bidirectional Distribution Ant Colony Routing Algorithm) to solve QoS routing problem in RCN, and also discuss the convergence of it. To reduce the communication costs of BDACRA, both "Tree-style Diffusing" and "Bidirectional Detecting" are adopted in the algorithm. At last, the paper compares time complexes, space complexes and communication costs between BDACRA and DACRA by analytical method and Matlab simulation. All results show that BDACRA has a better performance than DACRA.The last chapter of the paper gives a conclusion of the article and presents the unsolved problems in the paper as well as the future investigations.