A multiple-path routing algorithm with congestion avoidance based upon ant colony algorithm in cognitive networks
A cognitive network can perceive the external environment, and then intelligently and automatically change its behavior to adapt to the environment. It is more appropriate to provide QoS guarantees. The time delay or the loss of data packets caused by the congestion of links will make the network lower down the security of QoS. The present link state routing algorithms don't possess the function of congestion avoidance mechanism. In order to effectively transmit data packets, this research focuses on congestion avoidance, and proposes a multiple-path routing algorithm on the basis of the referenced multiple-path routing algorithm. The double-way ant-exploration method is employed to speed up the exploration for the optimal routes. The new guide line proposed better satisfies the demands of QoS. Simulated contrast by means of OPNET show that the algorithm is valid and effective in controlling the packet loss ratio, time delay and the residual bandwidth.
Author's Name: Li, D., Zhang, R., Wang, R.
Volume: Volume 6
Issues: Issue 8
Keywords: Ant colony algorithm, Cognitive networks, Congestion avoidance, Multiple-path routing