Routing is the important research issue in the development of Wireless Networks. Multipath routing allows data communication through multiple paths. On the other hand, multi-path routing does not guarantee deterministic transmission. Since one route is available for transferring data from the source node to the destination node. A bigeneric multi-path routing algorithm is planned for significant wireless mesh networks to enhance reliability, also as in impact considering with link failures. The constituted algorithm adopts the modified Dijkstra’s algorithm for searching the shortest route from the gateway to each end node. A virtual trail distinct from the regular trail is introduced to realize trail diffusion and updating. The routes used for data point’s transmission are selected based on their regular trail values, alleviating the delivery of data points through better routes. Link failures are then treated using route maintenance mechanism. This can be accomplished by increase the accuracy through the already visible route measures collected by the routing protocol. Rate adaptation algorithm is designed to compute the best rate for each wireless link. This modified conclusion aims at providing better routing and rate alternatives. Simulation results show that the proposed algorithm outperforms conventional algorithms in terms of packet delivery ratio, end-to-end delay routing operating cost.Usmjeravanje je važan istraživački problem u razvoju bežičnih mreža. Višestazno usmjeravanje omogućuje podatkovnu komunikaciju kroz više puteva. S druge strane, višestruko usmjeravanje ne jamči deterministički prijenos, budući da je jedna ruta dostupna za prijenos podataka iz izvornog čvora do odredišnog čvora. Konstituirani algoritam primjenjuje modificirani algoritam Dijkstra za traženje najkraćeg puta od pristupnika do svakog krajnjeg čvora. Algoritam prilagodbe stope dizajniran je za izračunavanje najbolje brzine za svaku bežičnu vezu. Ovaj modificirani zaključak ima za cilj pružiti bolje usmjeravanje i ocjenjivati alternative. Rezultati simulacije pokazuju da predloženi algoritam nadmašuje konvencionalne algoritme
