Title: Learning automata based multi-flow opportunistic routing algorithm in wireless mesh networks

Authors: Debasis Das; Amritesh Kumar

Addresses: Department of Computer Science and Information Systems, Birla Institute of Technology and Science (BITS) Pilani, K.K. Birla Goa Campus, NH 17B, Bypass Road, Zuarinagar, Sancoale, Goa 403726, India ' Department of Computer Science and Engineering, NIIT University, Neemrana, Alwar, Rajasthan 301705, India

Abstract: Multi-hop Wireless Mesh Networks (WMNs) is a promising new technique for communication with routing protocol designs being critical to the effective and efficient of these WMNs. A common approach for routing traffic in these networks is to select a minimal distance from the source to destination as in wireless networks. Opportunistic Routing (OR) makes use of the broadcasting ability of wireless network and is especially very helpful for WMN because all nodes are static. Our proposed scheme of Multicast Opportunistic Routing (MOR) in WMNs is based on the broadcast transmissions and Learning Automata (LA) to expand the potential candidate nodes that can aid in the process of retransmission of the data. The receivers are required to be in sync with one another in order to avoid duplicated broadcasting of data which is generally achieved by formulating the forwarding candidates according to some LA based metric. The most helpful aspect of this protocol is that it intelligently learns from the past experience and improves its performance. The results obtained via this approach of MOR show that the proposed scheme outperforms some existing schemes and is an improved and more effective version of opportunistic routing in a mesh network.

Keywords: wireless networks; opportunistic routing; routing metric; candidate selection algorithms; candidate coordination.

DOI: 10.1504/IJWMC.2017.088082

International Journal of Wireless and Mobile Computing, 2017 Vol.13 No.2, pp.106 - 113

Received: 17 Oct 2016
Accepted: 01 May 2017
Published online: 21 Nov 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article