期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2014
卷号：68
期号：1
出版社：Journal of Theoretical and Applied
摘要：The number of services obtainable by wireless network has been improved for recent years. It motivates to the improvement of new wireless technologies. New technologies are required to satisfy the requirements or necessitated of the users regarding wireless services. The newly developed wireless technology with mesh topology is known as wireless mesh networks (WMN). Routing is one of the most significant problems handled by every WMN technologies during data transmission .In Wireless Mesh Networks (WMN), the Multi-path routing is one of the mainly significant problems occurred throughout data transmission process based on their ability of the link for multiple paths. To overcome the problem of the multipath routing earlier work presents a Dijkstra�s Algorithm (DA) for route setup and ant colony based optimization (ACO) algorithm for route examination. But the algorithm used for route examination have lower meeting time in ACO and worst-case running time in DA for route setup .In order to solve the above mentioned issues in this work presents an Filter-Kruskal algorithm for first route setup from source to destination path . The multiple routes path are examined and maintained based on the hybrid artificial bee colony (HABC) algorithm. The routes explored for data transmission are chosen based on their expected honey bee values. If any failure occurs in this HBAC route examination step it is forwarded to route maintenance system. Proposed FKAWMNet efficiently solves multipath routing problem in wireless mesh networks (WMN). The simulation results of the proposed FKAWMNet show that proposed work achieves a higher packet delivery ratio, lesser end to end delay and lesser routing overhead than the existing routing protocols such as DAWMNet and AntHocNet. So the proposed FKAWMNet achieves highly reliable communication, assurance of load balancing and easily applicable to topological changes without node failure.
