You can view the full text of this article for free using the link below.

Title: A new way of achieving multi-path routing in wireless networks

Authors: Abdeldjalil Temar; Mustapha Geuzouri; Nader Mbarek

Addresses: Laboratory of Pure and Applied Mathematics, Faculty of Exact Sciences and Computer Science, University of Mostaganem, Mostaganem, Algeria ' Signal Image Laboratory, University of Oran1-Ahmed Benbella, Oran, Algeria ' LIB: Laboratoire d'Informatique de Bourgogne, University of Burgundy, Dijon, Bourgogne, France

Abstract: In the 21st century, the wireless technology is still developing rapidly and trying to be 'Faster, Higher, and Stronger': faster data rate, higher bandwidth and stronger connectivity. Wireless Mesh Networks (WMN) have been envisioned as an important solution to the next generation wireless networking which can be used in wireless community networks, wireless enterprise networks, transportation systems, home networking and last-mile wireless internet access. They also provide a cheap, quick and effective way for building wireless data networks. Considering the nature of these networks, routing is a key process for operating the WMN. This paper proposes a new way of creating multi-path routing protocols based on a fusion between multicast and unicast routing protocols to get different routes (node-disjoint or link-disjoint) from the source to its destination. The simulation results using Network Simulator 2 (NS-2) show that our new Multi-path Routing Protocol (Fusion) outperforms Ad hoc On-Demand Distance Vector (AODV) and Ad hoc On-demand Multi-path Distance Vector (AOMDV) routing protocols in terms of average network throughput, end-to-end delay, and number of flows.

Keywords: wireless mesh networks; routing; multi-path routing protocols; multicast and unicast routing protocols; throughput; end-to-end delay.

DOI: 10.1504/IJWMC.2020.104772

International Journal of Wireless and Mobile Computing, 2020 Vol.18 No.1, pp.101 - 109

Accepted: 20 Jul 2019
Published online: 28 Jan 2020 *

Full-text access for editors Access for subscribers Free access Comment on this article