Title: Learning automata and lexical composition method for optimal and load balanced RPL routing in IoT

Authors: C.S. Anita; R. Sasikumar

Addresses: Department of Computer Science and Engineering, R.M.D. Engineering College, Tamil Nadu, India ' Department of Computer Science and Engineering, R.M.D. Engineering College, Tamil Nadu, India

Abstract: Low power and lossy network, internet of things (IoT) motivates energy-efficient and load-balanced routing in the network layer to extend network lifetime. IoT application scenarios exploit the routing protocol for low-power and lossy networks (RPL) due to the significant potentials. The core components of RPL are the trickle algorithm and objective functions (OF) for creating destination oriented directed acyclic graph (DODAG) and data forwarding. The RPL needs more attention to avoid hotspot problems and unnecessary energy depletion. Most of the existing routing protocols take a single either hop count or ETX, or multiple routing decision metrics. However, the RPL cannot select appropriate link metrics efficiently against the dynamic and lossy environment without considering the relationship between those metrics. Thus, the proposed methodology takes important routing metrics, such as hop count, expected transmission count, and traffic-related metric, and composites the metrics using learning automata and lexical composition method. The special attention on network energy balancing through expected transmission energy (ETT) avoids a hotspot issue and inefficient routing energy. The proposed work supports multiple metrics-based OF with considerable routing overhead by tuning the trickle parameter. Moreover, the proposed work is evaluated to show its advantages over the dynamic and lossy network, IoT.

Keywords: internet of things; IoT; energy efficient routing; hotspot problem; learning automata; lexical composition technique.

DOI: 10.1504/IJAHUC.2022.124560

International Journal of Ad Hoc and Ubiquitous Computing, 2022 Vol.40 No.4, pp.288 - 300

Received: 05 Jan 2021
Accepted: 07 Sep 2021
Published online: 28 Jul 2022 *

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