Journal of Engineering and Applied Sciences
ISSN: Online 1818-7803ISSN: Print 1816-949x
Abstract
Wireless mesh networks are expected to be a key technology for the next decades. Their ability for self-organization considerably decreases the complexity of the network deployment and their capability of selfhealing reduces the network maintenance, therefore, claim minimal investment. In fact, connecting wireless mesh backbone networks to gateways are required and increase of more gateways improves the quality of service. However, due to the creation of wired links in gateways, adding redundant gateways increases the investment cost substantially. We therefore, designed a New gateway location algorithm based on graph theory by coupling the weighted recursive algorithm in order to deploy as less as possible number of gateways by assigning mesh routers having the highest degree as candidate gateways and eventually ensuring the quality of service in terms of throughput capacity, end-to-end delay and relay load constraint are at a reduced cost. It is demonstrated by MATLAB Simulator that the proposed algorithm after comparison outperformed other heuristic algorithms in terms of number of gateways and the quality of service. The proposed algorithm produces 30% less gateways and improves gateway throughput capacity by 10%, reduces end-to-end delay by 20% and improves relay load by 10%.
How to cite this article:
Giresse M. Komba and Okuthe P. Kogeda. Gateway Location Algorithm for Wireless Mesh Networks.
DOI: https://doi.org/10.36478/jeasci.2018.7288.7297
URL: https://www.makhillpublications.co/view-article/1816-949x/jeasci.2018.7288.7297