Абстрактный

Real Time Routing Algorithm Based On NSGA-II in Wireless Mesh Networks

Seidfarbod Seidali Routeh

With the growing demand for real time services in Wireless Networks, quality of service (QoS) based routing has emerged as an interesting research topic. But offering some QoS guarantee in wireless networks raises significant challenges. This paper presents a real time routing algorithm based on NSGA-II. This algorithm has been widely used in optimization problems. NSGA-II is a non-dominated sorting genetic algorithm which consists of multi objective functions. NSGA-II algorithm starts with a random population. Each individual in population is considered as a chromosome. Two objective functions were considered in this paper: (i) End to end delay, (ii) path reliability. Final solutions were sorted by Pareto front method. The wireless mesh network was modeled as an undirected graph, in which the sets of nodes N and links L represent computer sites and communication cables. Experimental results proved that the proposed NSGA-II routing algorithm can achieve better performance in compare of other well-known methods like Ad Hoc on Demand Distance Vector (AODV).