QoS Routing with Improved Ant Colony Algorithm in Wireless Mesh Network

Today, wireless mesh networks have been accepted because of their extended coverage, self-healing and self-configuring functionality, easy maintenance and low cost. These networks can combine to various networks, access to long distance broadband and provide a minimum of the required infrastructure. Guaranteed quality of service is a basic requirement for each network. An attractive idea to guarantee the quality of service is QoS routing. In this paper, we introduce a strategy for routing with multiple quality of service constraints using an Ant Colony Optimization algorithm. The proposed algorithm depends on a heuristic guidelines and pheromone Information, an ideal route with the most noteworthy quality of service gains. Its first emphases can accomplish most the shortest route from source to destination and the more reiterations, the briefest routes that have found a superior QoS than other comparative routes. The simulation results demonstrated that the proposed algorithm has earned more success rates than a simple ant colony optimization algorithm and could well be met the different quality of service requirements in quality of service routing and successfully enhance system quality of service routing efficiency.

Keywords:

Quality of Service , Routing , Wireless Mesh Network , Ant Colony Optimization